亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? c_matrix.h

?? 共上載5個源碼
?? H
?? 第 1 頁 / 共 2 頁
字號:
#ifndef _MATRIX_H
#define _MATRIX_H
#include<stdlib.h>
#include<stdio.h>
#include<malloc.h>
#include "time.h"
#define CLASS double
#define CLASS2 int
struct matrix{
	int row;
	int col;
	CLASS **p;
};
void initial( struct  matrix *MAT){
	int i;
	int row,col;
	row=MAT->row;
	col=MAT->col;
	if(row<0){
		printf("the row of matrix <0\n");
		MAT->row=0;
	}
	if(col<0){
		printf("the col of matrix <0\n");
		MAT->col=0;
	}
	
	MAT->p=(CLASS**)malloc(MAT->row*sizeof(CLASS));
	for(i=0;i<MAT->row;i++){
		MAT->p[i]=(CLASS*)malloc(MAT->col*sizeof(CLASS));
	}
}
int size(struct  matrix *MAT,int NUM){
	if(NUM==1){
    return(MAT->row);
  }
  else if(NUM==2){
  	return(MAT->col);
  }
  else{
  	printf("the second parameter must be 1or 2\n");
  	return(0);
  }
}
void free_matrix(struct  matrix *MAT){
     int row=size(MAT,1);
     int i;
     for(i=0;i<row;i++){
          free (MAT->p[i]);
     }
     MAT->row=0;MAT->col=0;
     MAT->p=(NULL);
}
int get_row(struct  matrix *MAT){
    return(MAT->row);
}
int get_col(struct  matrix *MAT){
    return(MAT->col);
}

void disp(  struct  matrix *MAT){
	int m,n;
	int i,j;
	m=get_row(MAT);
	n=get_col(MAT);
	if(m<=0||n<=0){
		printf("the matrix is no mean\n");
	}
	else{
		for(i=0;i<m;i++){
			for(j=0;j<n;j++){
				printf("%lf  ",MAT->p[i][j]);
			}
			printf("\n");
		}
		printf("\n");
	}
}
struct  matrix sum(	struct  matrix *MAT1,struct  matrix *MAT2){
	int row1,row2,col1,col2;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);row2=get_row(MAT2);
	col1=get_col(MAT1);col2=get_col(MAT2);
	if(row1==row2&&col1==col2&&row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				MAT3.p[i][j]=MAT1->p[i][j]+MAT2->p[i][j];
			}
		}
	}
	else{
		printf("the matrix1 is no equal to the matrix2,sum cannot finish\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix sub(	struct  matrix *MAT1,struct  matrix *MAT2){
	int row1,row2,col1,col2;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);row2=get_row(MAT2);
	col1=get_col(MAT1);col2=get_col(MAT2);
	if(row1==row2&&col1==col2&&row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				MAT3.p[i][j]=MAT1->p[i][j]-MAT2->p[i][j];
			}
		}
	}
	else{
		printf("the matrix1 is no equal to the matrix2,sub cannot finish\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix dot_multi(	struct  matrix *MAT1,struct  matrix *MAT2){
	int row1,row2,col1,col2;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);row2=get_row(MAT2);
	col1=get_col(MAT1);col2=get_col(MAT2);
	if(row1==row2&&col1==col2&&row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				MAT3.p[i][j]=MAT1->p[i][j]*MAT2->p[i][j];
			}
		}
	}
	else{
		printf("the matrix1 is no equal to the matrix2,dot_multi cannot finish\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix dot_div(	struct  matrix *MAT1,struct  matrix *MAT2){
	int row1,row2,col1,col2;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);row2=get_row(MAT2);
	col1=get_col(MAT1);col2=get_col(MAT2);
	if(row1==row2&&col1==col2&&row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				if(MAT2->p[i][j]!=0){
					MAT3.p[i][j]=MAT1->p[i][j]/MAT2->p[i][j];
				}
				else{
					MAT3.p[i][j]=RAND_MAX;
                }
			}
		}
	}
	else{
		printf("the matrix1 is no equal to the matrix2,dot_div cannot finish\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix multi(	struct  matrix *MAT1,struct  matrix *MAT2){
	int row1,row2,col1,col2;
	int i,j,k;
	struct  matrix MAT3;
	row1=get_row(MAT1);row2=get_row(MAT2);
	col1=get_col(MAT1);col2=get_col(MAT2);
	if(col1==row2&&row1>0&&col1>0&&col2>0){
		MAT3.row=row1;
		MAT3.col=col2;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col2;j++){
                MAT3.p[i][j]=0;                
				for(k=0;k<col1;k++){
					MAT3.p[i][j]=MAT3.p[i][j]+MAT1->p[i][k]*MAT2->p[k][j];
				}
			}
		}
	}
	else{
		printf("the matrixs cannot be multi\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}

struct  matrix sum_const(	struct  matrix *MAT1,CLASS2 NUM ){
	int row1,col1;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);
	col1=get_col(MAT1);
	if(row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				MAT3.p[i][j]=MAT1->p[i][j]+(CLASS)(NUM);
			}
		}
	}
	else{
		printf("the matrixs is no mean\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix sub_const(	struct  matrix *MAT1,CLASS2 NUM ){
	int row1,col1;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);
	col1=get_col(MAT1);
	if(row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				MAT3.p[i][j]=MAT1->p[i][j]-(CLASS)(NUM);
			}
		}
	}
	else{
		printf("the matrixs is no mean\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix muti_const(	struct  matrix *MAT1,CLASS2 NUM ){
	int row1,col1;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);
	col1=get_col(MAT1);
	if(row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				MAT3.p[i][j]=MAT1->p[i][j]*(CLASS)(NUM);
			}
		}
	}
	else{
		printf("the matrixs is no mean\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix div_const(	struct  matrix *MAT1,CLASS2 NUM ){
	int row1,col1;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);
	col1=get_col(MAT1);
	if(row1>0&&col1>0){
		MAT3.row=row1;
		MAT3.col=col1;
		initial(&MAT3);
		for(i=0;i<row1;i++){
			for(j=0;j<col1;j++){
				if(NUM==0){
					printf("the NUM is zero\n");
					MAT3.p[i][j]=RAND_MAX;
				}
				else{
					MAT3.p[i][j]=MAT1->p[i][j]/(CLASS)(NUM);
				}
			}
		}
	}
	else if(!(row1>0&&col1>0)){
		printf("the matrixs is no mean\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix transport(	struct  matrix *MAT1){
	int row1,col1;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);
	col1=get_col(MAT1);
	if(row1>0&&col1>0){
		MAT3.row=col1;
		MAT3.col=row1;
		initial(&MAT3);
		for(i=0;i<MAT3.row;i++){
			for(j=0;j<MAT3.col;j++){
				MAT3.p[i][j]=MAT1->p[j][i];
			}
		}
	}
	else{
		printf("the matrixs is no mean\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix delete_row(	struct  matrix *MAT1,int NUM ){
	int row1,col1;
	int i,j;
	struct  matrix MAT3;
	row1=get_row(MAT1);
	col1=get_col(MAT1);
	if(row1>0&&col1>0){
		if(NUM<row1&&NUM>=0){
			MAT3.row=row1-1;
			MAT3.col=col1;
			initial(&MAT3);
			for(i=0;i<MAT3.row;i++){
				for(j=0;j<MAT3.col;j++){
					if(i<NUM){
						MAT3.p[i][j]=MAT1->p[i][j];
					}
					else{
						MAT3.p[i][j]=MAT1->p[i+1][j];
					}
				}
			}
		}
		else{
			printf("the row you want to delete  is out\n");
			MAT3.row=0;
			MAT3.col=0;
		}
	}
	else{
		printf("the matrixs is no mean\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix delete_col(	struct  matrix *MAT1,int NUM ){
	struct  matrix MAT3=transport(MAT1);
	struct  matrix MAT4=delete_row(&MAT3,NUM);
	struct  matrix MAT5=transport(&MAT4);
	free_matrix(&MAT3);
	free_matrix(&MAT4);
	return(MAT5);
	
}

struct  matrix ones(	int row,int col ){
	struct  matrix MAT3;
	int i,j;
	if(row>0&&col>0){
		MAT3.row=row;
		MAT3.col=col;
		initial(&MAT3);
		for(i=0;i<row;i++){
			for(j=0;j<col;j++){
				MAT3.p[i][j]=1;
			}
		}
	}
	else{
		printf("the index of matrix is wrong ,can not initial ones matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix zeros(	int row,int col ){
	struct  matrix MAT3;
	int i,j;
	if(row>0&&col>0){
		MAT3.row=row;
		MAT3.col=col;
		initial(&MAT3);
		for(i=0;i<row;i++){
			for(j=0;j<col;j++){
				MAT3.p[i][j]=0;
			}
		}
	}
	else{
		printf("the index of matrix is wrong ,can not initial zeros matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix rands(int row,int col ){
	struct  matrix MAT3;
	int i,j;
	if(row>0&&col>0){
		MAT3.row=row;
		MAT3.col=col;
		initial(&MAT3);
		srand((unsigned)time(NULL));
		for(i=0;i<row;i++){
			for(j=0;j<col;j++){
				MAT3.p[i][j]=(CLASS)((rand()%100)/100.0);
			}
		}
	}
	else{
		printf("the index of matrix is wrong ,can not initial rands matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix eye(	int row,int col ){
	struct  matrix MAT3;
	int i,j;
	if(row>0&&col>0&&row==col){
		MAT3.row=row;
		MAT3.col=col;
		initial(&MAT3);
		for(i=0;i<row;i++){
			for(j=0;j<col;j++){
				if(i==j){MAT3.p[i][j]=1;}
				else    {MAT3.p[i][j]=0;}
			}
		}
	}
	else{
		printf("the index of matrix is wrong ,can not initial eye matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix copy(struct  matrix *MAT ){
	struct  matrix MAT3;
	int i,j;
	if(MAT->row>0&&MAT->col>0){
		MAT3.row=MAT->row;
		MAT3.col=MAT->col;
		initial(&MAT3);
		for(i=0;i<MAT3.row;i++){
			for(j=0;j<MAT3.col;j++){
				MAT3.p[i][j]=MAT->p[i][j];
			}
		}
	}
	else{
		printf("the index of matrix is wrong ,can not initial eye matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix repmat(struct  matrix *MAT,int m,int n ){
	struct  matrix MAT3;
	int i,j,itemp,jtemp;
	if(MAT->row>0&&MAT->col>0&&m>0&&n>0){
		MAT3.row=(MAT->row)*m;
		MAT3.col=(MAT->col)*n;
		initial(&MAT3);
		for(i=0;i<MAT3.row;i++){
			for(j=0;j<MAT3.col;j++){
				itemp=i%(MAT->row);jtemp=j%(MAT->col);
				MAT3.p[i][j]=MAT->p[itemp][jtemp];
			}
		}
	}
	else if(!(m>0&&n>0)){
		printf("the parameter shouble be a number >0\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	else{
		printf("the index of matrix is wrong ,can not initial eye matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix col_rep(struct  matrix *MAT, struct  matrix *MAT1){
	struct  matrix MAT3;
	int i,j;
	if(MAT->row==MAT1->row&&MAT->col>0&&MAT1->col>0){
		MAT3.row=(MAT->row);
		MAT3.col=(MAT->col)+(MAT1->col);
		initial(&MAT3);
		for(i=0;i<MAT3.row;i++){
			for(j=0;j<MAT3.col;j++){
				if(j<MAT->col){MAT3.p[i][j]=MAT->p[i][j];}
				else          {MAT3.p[i][j]=MAT1->p[i][j-MAT->col];}
			}
		}
	}
	else if(MAT->row!=MAT1->row){
		printf("the two matrix can not col_rep\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	else{
		printf("the index of matrix is wrong ,can not initial eye matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix row_rep(struct  matrix *MAT, struct  matrix *MAT1){
	struct  matrix MAT3;
	int i,j;
	if(MAT->col==MAT1->col&&MAT->row>0&&MAT1->row>0){
		MAT3.col=(MAT->col);
		MAT3.row=(MAT->row)+(MAT1->row);
		initial(&MAT3);
		for(i=0;i<MAT3.row;i++){
			for(j=0;j<MAT3.col;j++){
				if(i<MAT->row){MAT3.p[i][j]=MAT->p[i][j];}
				else          {MAT3.p[i][j]=MAT1->p[i-MAT->row][j];}
			}
		}
	}
	else if(MAT->col!=MAT1->col){
		printf("the two matrix can not row_rep\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	else{
		printf("the index of matrix is wrong ,can not initial eye matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}
struct  matrix suba(struct  matrix *MAT, int m1,int n1,int m2,int n2){
	struct  matrix MAT3;
	int i,j;
	if(MAT->col>0&&MAT->row>0&&m1>=0&&n1>=0&&m2>=m1&&n2>=n1&&n1<MAT->col&&n2<MAT->col&&m1<MAT->row&&m2<MAT->row){
		MAT3.row=m2-m1+1;
		MAT3.col=n2-n1+1;
		initial(&MAT3);
		for(i=0;i<MAT3.row;i++){
			for(j=0;j<MAT3.col;j++){
				MAT3.p[i][j]=MAT->p[m1+i][n1+j];
			}
		}
	}
	else if(!(m1>=0&&n1>=0&&m2>=m1&&n2>=n1)){
		printf("the parameters matrix is wrong to fetch\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	else{
		printf("the index of matrix is wrong ,can not initial eye matrix\n");
		MAT3.row=0;
		MAT3.col=0;
	}
	return(MAT3);
}	
struct matrix r_ch(struct  matrix *MAT){
  int i,j,k,h;
  int row=size(MAT,1),col=size(MAT,2);
  int min_row=row<col?row:col;
  CLASS s,index;
  struct  matrix result,array,array2,result_temp;
  if (row<=0||col<=0){
  	printf("the matrix's index is <0\n");
  	result_temp.row=0;
  	result_temp.col=0;
  	initial(&result_temp);
  	return(result_temp);
  }
  result=copy(MAT);
  for(i=0;i<min_row;i++){
  	if(result.p[i][i]!=0){
  		loop1: array=suba(&result,i,0,i,result.col-1);
  			for(j=0;j<col;j++){
  				array.p[0][j]=array.p[0][j]/result.p[i][i];
  			}
  			for( j=0;j<col;j++){
  				result.p[i][j]=array.p[0][j];
  			}
  			for(k=0;k<row;k++){
  				if (k==i){ continue;}
  				else{
  					array2=suba(&result,k,0,k,result.col-1);
  					s=array2.p[0][i]/array.p[0][i];
  					for(j=0;j<array2.col;j++){
  						array2.p[0][j]=array2.p[0][j]-array.p[0][j]*s;
  					}
  					for( j=0;j<col;j++){
  						result.p[k][j]=array2.p[0][j];
  					}
  				}
  			}
  	}
  	else if(i+1<row){
  		for(k=i+1;k<row;k++){
  			if(k!=row-1&&result.p[k][i]!=0){
  				for(j=0;j<col;j++){
  					index=result.p[i][j];
  					result.p[i][j]=result.p[k][j];
  					result.p[k][j]=index;
  				}
  				goto loop1;
  			}
  			else if(k==row-1){ continue;}
  		}
  	}
  }
  result_temp=copy(MAT);
  for(i=0;i<row;i++){
  	for(j=0;j<col;j++){
  		result_temp.p[i][j]=0;
  	}
  }
  for(k=0;k<row;k++){
  	for( j=0;j<col;j++){
  		for( i=0;i<row;i++){
  			if(result.p[i][j]!=0){
  				for( h=0;h<col;h++){
  					result_temp.p[k][h]=result.p[i][h];
  					result.p[i][h]=0;
  				}
  			goto loop2;
  		}
  	}
  }
 loop2:continue;
}
 return(result_temp);
}
struct matrix c_ch(struct  matrix *MAT1){
	struct  matrix shift_p=transport(MAT1);
	struct  matrix result_temp=r_ch(&shift_p);
	struct  matrix result=transport(&result_temp);
	return( result);
}
int rank(struct  matrix *MAT){
  int i,j,sum;
  int row=size(MAT,1),col=size(MAT,2);
  int rank=row>col?col:row;
  int rank1,rank2,tag1=0,tag2=0;
  struct  matrix row_shift;
  struct  matrix col_shift;
  if (rank>1){

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
成人免费黄色在线| 一个色综合av| 国产精品综合二区| 久久先锋资源网| 成人综合在线视频| 亚洲人成人一区二区在线观看| 91丨porny丨户外露出| 亚洲最快最全在线视频| 欧美影片第一页| 免费成人在线播放| 婷婷丁香久久五月婷婷| 在线综合视频播放| 国内精品在线播放| 亚洲欧美中日韩| 欧美三区免费完整视频在线观看| 日本伊人色综合网| 国产午夜亚洲精品午夜鲁丝片 | 国产精品一区二区视频| 欧美激情综合在线| 色猫猫国产区一区二在线视频| 亚洲国产视频直播| 精品美女在线观看| av在线综合网| 天天操天天色综合| 国产欧美精品一区二区色综合| 色综合网站在线| 美女视频黄 久久| 17c精品麻豆一区二区免费| 欧美三级欧美一级| 国产精品一级在线| 亚洲国产成人av| 国产欧美日韩久久| 欧美日本精品一区二区三区| 国产精品99久久久久久有的能看 | 一区二区三区四区不卡视频 | 欧美r级电影在线观看| 91网站最新地址| 日本不卡123| 自拍偷拍亚洲欧美日韩| 欧美一区二区人人喊爽| 成人app网站| 极品少妇一区二区三区精品视频| 亚洲色图20p| 久久久国际精品| 欧美日韩国产高清一区| eeuss鲁一区二区三区| 麻豆91精品91久久久的内涵| 亚洲精品日日夜夜| 国产女人水真多18毛片18精品视频 | 日本欧洲一区二区| 欧美在线免费观看视频| 国产麻豆视频精品| 精品成a人在线观看| 国产综合色产在线精品| 精品日韩欧美在线| 亚洲成av人片在线观看| 欧美日韩成人激情| 不卡一区二区在线| 大白屁股一区二区视频| 国产日韩精品一区| 91精品国产一区二区三区蜜臀| 亚洲免费观看高清完整版在线| 精品久久久久久久久久久院品网| 欧美三级三级三级爽爽爽| 91啪亚洲精品| 99亚偷拍自图区亚洲| 成人伦理片在线| 国产成人免费视频网站| 国内成人免费视频| 另类综合日韩欧美亚洲| 麻豆国产精品视频| 麻豆成人91精品二区三区| 免费人成网站在线观看欧美高清| 亚洲不卡在线观看| 午夜视频在线观看一区二区 | 日韩欧美电影一二三| 5月丁香婷婷综合| 欧美中文字幕一区| 欧美视频中文一区二区三区在线观看| 日本韩国精品在线| 在线亚洲人成电影网站色www| 色综合av在线| 欧美性做爰猛烈叫床潮| 欧美日韩一区国产| 3d成人动漫网站| 日韩亚洲欧美一区二区三区| 日韩一区二区三区视频在线观看| 日韩视频一区二区三区 | 欧美自拍丝袜亚洲| 欧美三日本三级三级在线播放| 欧美日韩免费电影| 日韩欧美亚洲一区二区| 精品sm捆绑视频| 中文字幕欧美区| 亚洲欧美日韩国产综合在线 | 五月婷婷激情综合| 日韩av网站在线观看| 久久99国产精品久久99果冻传媒| 狠狠色2019综合网| 成人久久18免费网站麻豆| 色综合天天综合网天天看片| 欧美视频日韩视频在线观看| 欧美精品tushy高清| 欧美精品一区二区在线观看| 国产精品女同互慰在线看| 亚洲免费观看在线观看| 日韩电影在线免费看| 国产最新精品精品你懂的| 成人av一区二区三区| 在线观看av一区二区| 日韩午夜在线影院| 国产精品欧美一级免费| 爽爽淫人综合网网站| 国产成人精品三级| 欧美在线视频你懂得| 久久伊99综合婷婷久久伊| 亚洲欧美日韩国产手机在线| 日本不卡一区二区| 成人黄色av网站在线| 这里只有精品电影| 亚洲欧洲精品一区二区精品久久久| 亚洲网友自拍偷拍| 国产福利一区二区三区视频在线| 91啦中文在线观看| 亚洲精品在线观看视频| 亚洲综合在线视频| 国产成人在线网站| 欧美一区二区福利在线| 亚洲欧美色综合| 久久福利资源站| 欧美日韩电影在线播放| 中文字幕av免费专区久久| 免费观看成人av| 欧美自拍偷拍一区| 国产精品高潮久久久久无| 久久成人麻豆午夜电影| 欧美中文字幕一区二区三区| 中文字幕欧美区| 国产老妇另类xxxxx| 欧美高清性hdvideosex| 亚洲色图第一区| 成人网男人的天堂| 精品国产一二三| 青青青伊人色综合久久| 欧美在线看片a免费观看| 国产精品久久夜| 国产精品自拍网站| 日韩一级黄色大片| 亚洲成人av一区二区三区| 一本高清dvd不卡在线观看| 国产无人区一区二区三区| 美女爽到高潮91| 91精品国产综合久久精品麻豆 | 欧美日韩免费观看一区三区| 国产精品无遮挡| 国产麻豆视频一区二区| 欧美大片一区二区| 蜜臀a∨国产成人精品| 欧美日本视频在线| 图片区日韩欧美亚洲| 欧美在线观看视频一区二区| 亚洲免费视频中文字幕| 91美女福利视频| 自拍偷拍亚洲激情| 91蜜桃在线观看| 亚洲免费视频中文字幕| 色综合天天综合网天天看片| 亚洲日韩欧美一区二区在线| 91蝌蚪国产九色| 亚洲永久精品国产| 在线观看视频一区二区欧美日韩 | 亚洲福利国产精品| 在线免费观看日韩欧美| 亚洲午夜在线电影| 欧美日本在线播放| 麻豆高清免费国产一区| 欧美tickling网站挠脚心| 久草热8精品视频在线观看| 欧美精品一区二区高清在线观看 | 成人av片在线观看| 亚洲视频一二三区| 欧美三区在线视频| 蜜桃一区二区三区在线| 久久久精品免费观看| 成人免费高清在线观看| 亚洲精品久久7777| 欧美精品电影在线播放| 蜜桃av一区二区在线观看 | 国产91富婆露脸刺激对白| 国产精品国产三级国产普通话99| 99久久精品国产观看| 亚洲小少妇裸体bbw| 日韩欧美中文字幕精品| 顶级嫩模精品视频在线看| 亚洲欧美日韩小说| 91精品国产一区二区三区蜜臀| 国产一区二区三区在线看麻豆| 自拍偷拍国产精品| 欧美精品久久久久久久多人混战 | 青青草97国产精品免费观看无弹窗版|