青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

The Fourth Dimension Space

枯葉北風寒，忽然年以殘，念往昔，語默心酸。二十光陰無一物，韶光賤，寐難安； 不畏形影單，道途阻且慢，哪曲折，如渡飛湍。斬浪劈波酬壯志，同把酒，共言歡！ -如夢令

數學建模之——商人過河問題 算法核心:搜索法

問題描述： 三個商人各帶一個隨從乘船過河，一只小船只能容納2人，由他們自己劃船。三個商人竊聽到隨從們密謀，在河的任意一岸上，只要隨從的人數比商人多，就殺掉商人。但是如何乘船渡河的決策權在商人手中，商人們如何安排渡河計劃確保自身安全？

數學建模課上，老師給我們出了這樣一個問題，要我們編程解決，呵呵，于是，就寫了下面這個程序，這個程序適用于商人數和隨從數都《=1000的情況，并且約定小船的容量為2，此程序可以輸出每一步的決策過程，還外包了界面以滿足上課演示的需要；不過限于老師的要求，就沒有寫成小船容量為任意值的情況，如果有時間的話我會繼續往下寫的（貌似也比較容易的樣子）~
如果程序中有BUG，歡迎反饋給我,QQ:64076241.

//本程序在商人數<=1000,隨從數<=1000時測試通過，其余數據不能保證其正確性.
#include<iostream>
#include <windows.h>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include<time.h>
#include<conio.h>
using namespace std;



#define NMAX 1001


struct node
{

    int x;
    int y;
}line[10000001];

struct node2
{
    int data1;
    int data2;
    int prex1;
    int prey1;
    int prex2;
    int prey2;
};

node2 a[NMAX][NMAX];

int main ()
{

    
        int N=15;
        while(N--)
        {
            system("cls");
            cout<<endl<<endl<<endl<<endl<<endl<<endl;
            cout<<"     ☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;
            cout<<"     ★                   歡迎來到商人過河模型演示程序                   ★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;    
            cout<<"     ★                       制    作：羅偉濤（abilitytao）             ★"<<endl;
            cout<<"     ☆                       指導老師：許春根（南京理工大學應用數學系） ☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆"<<endl;
            Sleep(100);
            system("cls");
            cout<<endl<<endl<<endl<<endl<<endl<<endl;
            cout<<"     ★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆                   歡迎來到商人過河模型演示程序                   ☆"<<endl;
            cout<<"     ★                                                                  ★"<<endl;
            cout<<"     ☆                       制    作：羅偉濤（abilitytao）             ☆"<<endl;
            cout<<"     ★                       指導老師：許春根（南京理工大學應用數學系） ★"<<endl;
            cout<<"     ☆                                                                  ☆"<<endl;
            cout<<"     ★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★☆★"<<endl;
            Sleep(100);
        }
        cout<<"\n\n\n\n                                                   請按任意鍵進入演示程序"<<endl;
        char any;
        getch();

    ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    int n;
    int m;
    int i,j;
    int flagnum1;
    int flagnum2;
    while(1)
    {    
        printf("請輸入商人數：");
        scanf("%d",&n);
        printf("請輸入隨從數：");
        scanf("%d",&m);


        if(n>1000)
        {
            printf("本程序僅在1000以內保證其正確性，請重新輸入\n");
            continue;
        }


    


        for(i=0;i<=n;i++)
        {

            for(j=0;j<=m;j++)
            {
                if(i==0||i==n)
                {
                    a[i][j].data1=1;
                    a[i][j].data2=1;
                    continue;
                }
                if(i>=j&&n-i>=m-j)
                {
                    a[i][j].data1=1;
                    a[i][j].data2=1;
                }
                    
            }
        }
        ////////////////////////////////////////////////////////////////////以上為初始化////////////////////////////////////////////////////////////////////////////////
        int flag;
        int front=1;
        int rear=1;
        line[rear].x=n;
        line[rear].y=m;
        flag=1;
        flagnum1=1;
        flagnum2=0;
        while(front<=rear)
        {
            if(line[front].x==0&&line[front].y==0)
                break;
            if(flag==1)
            {
                if(a[line[front].x][line[front].y].data1!=1)
                {
                    flagnum1--;
                    if(flagnum1==0)
                        flag=2;
                    front++;
                    continue;
                }
                
                a[line[front].x][line[front].y].data1=0;
                flagnum1--;
                if(flagnum1==0)
                    flag=2;
                if(line[front].x-1>=0&&a[line[front].x-1][line[front].y].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x-1;
                    line[rear].y=line[front].y;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                if(line[front].y-1>=0&&a[line[front].x][line[front].y-1].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x;
                    line[rear].y=line[front].y-1;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                if(line[front].x-1>=0&&line[front].y-1>=0&&a[line[front].x-1][line[front].y-1].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x-1;
                    line[rear].y=line[front].y-1;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                if(line[front].x-2>=0&&a[line[front].x-2][line[front].y].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x-2;
                    line[rear].y=line[front].y;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;

                }
                if(line[front].y-2>=0&&a[line[front].x][line[front].y-2].data2==1)
                {
                    rear++;
                    line[rear].x=line[front].x;
                    line[rear].y=line[front].y-2;
                    a[line[rear].x][line[rear].y].prex2=line[front].x;
                    a[line[rear].x][line[rear].y].prey2=line[front].y;
                    flagnum2++;
                }
                front++;
                continue;
            }
            else if(flag==2)
            {
                if(a[line[front].x][line[front].y].data2!=1)
                {
                    flagnum2--;
                    if(flagnum2==0)
                        flag=1;
                    front++;
                    continue;
                    
                }
                if(line[front].x==0&&line[front].y==0)
                    break;
                a[line[front].x][line[front].y].data2=0;
                flagnum2--;
                if(flagnum2==0)
                    flag=1;
                if(line[front].x+1<=n&&a[line[front].x+1][line[front].y].data1==1)
                {

                
                rear++;
                line[rear].x=line[front].x+1;
                line[rear].y=line[front].y;
                a[line[rear].x][line[rear].y].prex1=line[front].x;
                a[line[rear].x][line[rear].y].prey1=line[front].y;
                flagnum1++;
                }
                if (line[front].y+1<=m&&a[line[front].x][line[front].y+1].data1==1)
                {
                
                    rear++;
                    line[rear].x=line[front].x;
                    line[rear].y=line[front].y+1;
                    a[line[rear].x][line[rear].y].prex1=line[front].x;
                    a[line[rear].x][line[rear].y].prey1=line[front].y;
                    flagnum1++;
                }
                if(line[front].x+1<=n&&line[front].y+1<=m&&a[line[front].x+1][line[front].y+1].data1==1)
                {
                    rear++;
                    line[rear].x=line[front].x+1;
                    line[rear].y=line[front].y+1;
                    a[line[rear].x][line[rear].y].prex1=line[front].x;
                    a[line[rear].x][line[rear].y].prey1=line[front].y;
                    flagnum1++;
                }
                if(line[front].x+2<=n&&a[line[front].x+2][line[front].y].data1==1)
                {
                    rear++;
                    line[rear].x=line[front].x+2;
                    line[rear].y=line[front].y;
                    a[line[rear].x][line[rear].y].prex1=line[front].x;
                    a[line[rear].x][line[rear].y].prey1=line[front].y;
                    flagnum1++;
                }
                if(line[front].y+2<=m&&a[line[front].x][line[front].y+2].data1==1)
                {

                
                rear++;
                line[rear].x=line[front].x;
                line[rear].y=line[front].y+2;
                a[line[rear].x][line[rear].y].prex1=line[front].x;
                a[line[rear].x][line[rear].y].prey1=line[front].y;
                flagnum1++;
                
                }
                front++;
                continue;
            }
            front++;
        }
        if(front>rear)
        {
            cout<<"沒有可行的方案"<<endl;
            int choice;
            printf("如果您要繼續測試，請輸入1，退出請輸入2:");
            scanf("%d",&choice);
            if(choice==1)
                continue;
            else
                break;
        }
        int tempx=0;
        int tempy=0;
        int markx=0;
        int marky=0;
        printf("初始狀態下，河南岸有%d個商人，%d個隨從\n",n,m);
        //Sleep(5000);

        int flagforreturn=1;
        int step=1;

        while(1)
        {
            
            if (flagforreturn==1)
            {
                if(markx==n&&marky==m)
                    break;
                flagforreturn=2;
                tempx=a[markx][marky].prex2;
                tempy=a[markx][marky].prey2;
                printf("第%d步：河南岸有%d個商人，%d個隨從，此時，對岸有%d個商人，%d個隨從（此時船在北岸）\n\n",step,n-tempx,m-tempy,tempx,tempy);
                ///////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
            /*    if(tempx==0||tempx==n||(tempx>=tempy&&n-tempx>=m-tempy)&&(n-markx+m-marky>n-tempx+m-tempy))
                    cout<<"此步正確"<<endl;
                else
                    cout<<"此步錯誤"<<endl;*///
                ////////////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
                markx=tempx;
                marky=tempy;
                step++;
                //Sleep(5000);
            }
            else if(flagforreturn==2)
            {
                if(markx==n&&marky==m)
                    break;
                flagforreturn=1;
                tempx=a[markx][marky].prex1;
                tempy=a[markx][marky].prey1;

                printf("第%d步：河南岸有%d個商人,%d個隨從，此時，對岸有%d個商人，%d個隨從（此時船在南岸）\n\n",step,n-tempx,m-tempy,tempx,tempy);

                ////////////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
                /*    if(tempx==0||tempx==n||(tempx>=tempy&&n-tempx>=m-tempy)&&(n-markx+m-marky<n-tempx+m-tempy))
                    cout<<"此步正確"<<endl;
                else
                    cout<<"此步錯誤"<<endl;*/
                ////////////////////////////////////////////////////////////////////////////////////////正確性檢測/////////////////////////////////////////////////////////////////////////////////////
                markx=tempx;
                marky=tempy;
                step++;
                //Sleep(5000);
            }
        }
        int choice;
        printf("如果您要繼續測試，請輸入1，退出請輸入2:");
        scanf("%d",&choice);
        if(choice==1)
            continue;
        else
            break;


    }
     N=20;
    while(N--)
    {
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                            ·                                                 "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                      ·                       "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                            │                                                 "<<endl;
        cout<<"                         ＼    ／                                              "<<endl;
        cout<<"                       ─        ─                   │                       "<<endl;
        cout<<"                         ／    ＼                  ＼    ／                    "<<endl;
        cout<<"                            │                   ─        ─                  "<<endl;
        cout<<"                                                   ／    ＼                    "<<endl;
        cout<<"                                                      │                       "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;         
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                            │                                                 "<<endl;
        cout<<"                       ＼        ／                                            "<<endl;
        cout<<"                                                      │                       "<<endl;
        cout<<"                     ─            ─            ＼        ／                  "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                       ／        ＼            ─            ─                "<<endl;
        cout<<"                            │                                                 "<<endl;
        cout<<"                                                 ／        ＼                  "<<endl;
        cout<<"                                                      │                       "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
        system("cls");
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                              謝謝您的使用！再見！                             "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        cout<<"                                                                               "<<endl;
        Sleep(10);
    }

system("pause");
    return 0;
}

posted on 2009-02-26 11:07 abilitytao 閱讀(9268) 評論(15)  編輯 收藏 引用

評論

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-26 11:59 陳梓瀚(vczh)

這里可以用最短路經法。  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-26 12:21 abilitytao

@陳梓瀚(vczh)
恩 開始我也想過的 可是貌似有兩種狀態吧
一種是船在南岸，一種是船在北岸，如果用dij，貌似在這里就卡住了
不知道要怎么改進才能識別這兩種狀態呢？

  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-26 15:32 winsty

邊權相等的最短路啊
BFS就可以了  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法[未登錄] 2009-02-26 17:10 abilitytao

@winsty
難道我用的不是BFS?

  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-02-27 13:41 yindf

片尾很帥！  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-04 13:06 馬文旭

有沒有C版的呢？
我怎么運行不了呢？  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-04 22:25 abilitytao

@馬文旭
VC6.0肯定能運行的  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-07 20:58 愛你

四個人的是不是可定能過去啊 ？  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-08 01:31 abilitytao

@愛你
如果船的容量是2人的話 無解 ，3個人以上應該是可以的:-)  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-05-22 16:41 shizhanwei

3以上怎么不行？  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法[未登錄] 2009-05-22 17:25 abilitytao

@shizhanwei
因為無解  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2009-10-28 20:06 俠客西風

這個貌似和傳教士過河一樣,我學人工智能的時候,也做過這個搜索算法...  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法[未登錄] 2010-02-09 14:02 abilitytao

現在在一看這個搜索代碼　寫得真是差勁。。。。  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2011-06-10 10:33 hyzdou

什么是搜索發，求指教。  回復  更多評論   

# re: 數學建模之——商人過河問題 算法核心:搜索法 2012-10-07 20:12 abilitytao

@hyzdou
這個代碼寫的很差 請無視吧。。  回復  更多評論   

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

    • <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>

    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>

            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            
欧美激情视频给我|
欧美精品 日韩|
欧美麻豆久久久久久中文|
亚洲人午夜精品免费|
欧美激情2020午夜免费观看|
嫩模写真一区二区三区三州|
99综合视频|
免费亚洲一区二区|
欧美韩日一区二区三区|
亚洲欧美日韩一区|
欧美激情视频在线播放|
久久蜜桃精品|
亚洲无毛电影|
欧美国产激情|
亚洲欧洲一区二区三区在线观看
|
日韩午夜在线播放|
精品福利电影|
亚洲美女在线观看|
亚洲制服av|
久久夜色精品亚洲噜噜国产mv|
裸体歌舞表演一区二区|
一区免费在线|
欧美日韩精品是欧美日韩精品|
在线一区欧美|
亚洲精品中文字|
久久久国产精品一区二区中文
|
久久久久久久久久久久久久一区|
国内自拍亚洲|
一区二区三区国产在线观看|
亚洲影音一区|
欧美精品1区2区|
国产精品欧美在线|
国色天香一区二区|
91久久线看在观草草青青|
一区二区三区**美女毛片|
香蕉久久夜色精品国产使用方法|
亚洲国产欧美国产综合一区|
亚洲成色777777在线观看影院|
免费观看久久久4p|
亚洲精品视频在线播放|
美女主播一区|
亚洲精品三级|
欧美中在线观看|
原创国产精品91|
亚洲一区二区三区在线看|
欧美日韩中文精品|
亚洲视频免费看|
亚洲精品一区二区在线观看|
亚洲国产欧美一区二区三区久久|
国产精品99久久99久久久二8|
亚洲一区二区三区中文字幕在线
|
欧美成人午夜剧场免费观看|
欧美国产免费|
亚洲第一福利社区|
久久久青草婷婷精品综合日韩|
久久精品日韩欧美|
国产一区二区三区黄视频|
欧美综合国产|
欧美一区二区视频97|
欧美亚洲一级|
国产欧美在线视频|
久久国产精品久久国产精品|
亚洲成人自拍视频|
久久视频这里只有精品|
欧美日韩mv|
一本久久a久久免费精品不卡|
亚洲精品国产精品国自产在线
|
久久久久久有精品国产|
国产视频在线观看一区二区三区|
欧美wwwwww|
久久久精品网|
亚洲美女色禁图|
欧美成人免费在线观看|
亚洲欧美在线视频观看|
99在线热播精品免费|
欧美在线国产精品|
久久久久国产一区二区三区四区
|
亚洲激情电影中文字幕|
欧美性开放视频|
欧美国产日本|
国产精品高清网站|
欧美好骚综合网|
国产真实久久|
日韩亚洲综合在线|
99国产精品99久久久久久粉嫩|
一本大道久久精品懂色aⅴ|
一区二区欧美精品|
老巨人导航500精品|
欧美激情网友自拍|
午夜亚洲福利在线老司机|
欧美伦理在线观看|
欧美激情精品久久久久久黑人|
亚洲国产精品毛片|
亚洲一区二区3|
久久这里有精品视频|
亚洲欧美三级伦理|
久久都是精品|
先锋影音一区二区三区|
一区二区三区www|
你懂的国产精品永久在线|
亚洲成在人线av|
香蕉免费一区二区三区在线观看|
亚洲二区三区四区|
亚洲欧美国产精品桃花|
国产亚洲va综合人人澡精品|
欧美少妇一区|
亚洲电影视频在线|
1024成人|
亚洲女人av|
亚洲欧美一区二区三区久久
|
欧美日韩一区在线|
欧美偷拍一区二区|
国产日韩欧美制服另类|
国产情人节一区|
国模大胆一区二区三区|
国产在线不卡精品|
久久久久国产一区二区三区四区
|
午夜激情综合网|
久久久久久夜精品精品免费|
久久久91精品国产一区二区三区|
国产色综合网|
亚洲国产欧美日韩|
老司机免费视频一区二区三区|
亚洲国产精品久久|
91久久精品日日躁夜夜躁欧美|
欧美日韩国产色综合一二三四|
亚洲夜晚福利在线观看|
亚洲乱码一区二区|
91久久久亚洲精品|
免费在线观看精品|
欧美一区二区三区在线观看视频
|
久久美女艺术照精彩视频福利播放|
一区二区三区视频免费在线观看|
亚洲毛片在线观看|
亚洲欧美在线看|
欧美mv日韩mv国产网站|
欧美激情91|
老司机67194精品线观看|
欧美成年网站|
欧美极品一区二区三区|
女人色偷偷aa久久天堂|
久色婷婷小香蕉久久|
麻豆精品传媒视频|
欧美xx69|
欧美制服第一页|
亚洲欧美一区在线|
欧美激情综合五月色丁香小说|
亚洲国产成人91精品
|
欧美日韩免费观看一区=区三区|
欧美成人三级在线|
国产精品v欧美精品v日本精品动漫|
国产欧美日韩综合|
亚洲国产精彩中文乱码av在线播放|
欧美成人福利视频|
欧美激情久久久久|
亚洲小说欧美另类婷婷|
亚洲欧美日韩综合aⅴ视频|
一区二区三区四区五区在线
|
日韩系列欧美系列|
牛牛精品成人免费视频|
国产一区在线免费观看|
亚洲综合色自拍一区|
免费欧美在线|
久久国产视频网|
欧美日韩精品免费看|
亚洲视频精选|
亚洲欧洲日本国产|
久久狠狠亚洲综合|
巨胸喷奶水www久久久免费动漫|
国产在线视频欧美|
亚洲私人影院|
日韩小视频在线观看专区|
久久免费视频一区|
一区二区三区国产精华|
国产手机视频精品|
欧美伦理91|
久久精品卡一|
亚洲作爱视频|
欧美一区二区三区另类|
影视先锋久久|
国产精品爽爽ⅴa在线观看|
中文一区二区|
久久精品国产亚洲高清剧情介绍|
亚洲午夜久久久久久久久电影院|
尤妮丝一区二区裸体视频|
久久精品91久久久久久再现|
亚洲欧洲日韩综合二区|
亚洲精品久久久久久下一站|
99视频在线精品国自产拍免费观看
|
欧美人成网站|
午夜精品福利一区二区三区av|
欧美日韩视频|
欧美一区二区免费|
亚洲激情av在线|
欧美一区二区高清|
亚洲网站视频|
亚洲毛片av|
亚洲级视频在线观看免费1级|
国产精品女主播在线观看|
欧美va天堂在线|