武漢大學(xué)遙感信息工程學(xué)院復(fù)試機(jī)試

武漢大學(xué)遙感信息工程學(xué)院復(fù)試機(jī)試武漢大學(xué)遙感信息工程學(xué)院復(fù)試機(jī)試武漢大學(xué)遙感信息工程學(xué)院復(fù)試機(jī)試xxx公司武漢大學(xué)遙感信息工程學(xué)院復(fù)試機(jī)試文件編號(hào)：文件日期：修訂次數(shù)：第1.0次更改批準(zhǔn)審核制定方案設(shè)計(jì)，管理制度2004：#include<iostream>#include<fstream>#include<vector>n"; return1; } vector<int>vec_int; intnumeric(0); for(i=0;i<10000;i++) { infile>>numeric; (numeric); } ofstreamoutfile(""); if(!outfile) { cout<<"openfailed.\n"; return1; } outfile<<"卷積一次后的矩陣：\n"; vecInt=ConvolutionFun1(vec_int,M,N); for(i=0;i<M;i++) { for(j=0;j<N;j++) { outfile<<vecInt[i][j]<<""; } outfile<<'\n'; } outfile<<'\n'; vecInt=ConvolutionFun2(vec_int,R,S); outfile<<"第二次卷積后的矩陣：\n"; for(i=0;i<R;i++) { for(j=0;j<S;j++) { outfile<<vecInt[i][j]<<""; } outfile<<'\n'; } outfile<<'\n'; (); (); return0;}n"; return1; } n"; return1; } n"; return1; } n"; return1; } ofstreamoutfile(""); if(!outfile) { cerr<<"openfailed.\n"; return1; } infile>>nBand>>nPiexl; vector<vector<double>>vec_double(nBand,vector<double>(nPiexl)); for(i=0;i<nBand;i++) { for(j=0;j<nPiexl;j++) { infile>>vec_double[i][j]; } } vector<double>vec_average_double(nBand); for(i=0;i<nBand;i++) { vec_average_double[i]=AverageVector(vec_double[i]); } outfile<<"均值向量為:\n"; copy(),(),ostream_iterator<double>(outfile,"")); outfile<<'\n'; VecDoublevec_covariation_double(nBand,vector<double>(nPiexl)); vec_covariation_double=CovariationMatrix(vec_double,vec_average_double,nBand,nPiexl); outfile<<"協(xié)方差矩陣:\n"; for(i=0;i<nBand;i++) { for(j=0;j<nBand;j++) { outfile<<vec_covariation_double[i][j]<<""; } outfile<<'\n'; } return0;}n"; return1; } intnum; infile>>num; vector<POINT>vec_double; inti=0; while(i<num) { doublex; doubley; infile>>x>>y; POINTpoint; =x; =y; (point); i++; } doublexMin,yMin,xMax,yMax; xMin=vec_double[0].x; yMin=vec_double[0].y; xMax=vec_double[0].x; yMax=vec_double[0].y; for(i=1;i<num;i++) { if(vec_double[i].x<xMin) { xMin=vec_double[i].x; } if(vec_double[i].y<yMin) { yMin=vec_double[i].y; } if(vec_double[i].x>xMax) { xMax=vec_double[i].x; } if(vec_double[i].y>yMax) { yMax=vec_double[i].y; } } ofstreamoutfile(""); if(!outfile) { cerr<<"openfailed.\n"; return1; } outfile<<"外包矩形的坐標(biāo)為:\n"; outfile<<xMin<<"\t"<<yMin<<'\n'; outfile<<xMin<<"\t"<<yMax<<'\n'; outfile<<xMax<<"\t"<<yMin<<'\n'; outfile<<xMax<<"\t"<<yMax<<'\n'; ifstreaminpointfile(""); if(!inpointfile) { cerr<<"openfailed.\n"; return1; } vector<POINT>vec_point; while(!()) { intnum; doublex; doubley; inpointfile>>num>>x>>y; POINTpoint; =num; =x; =y; (point); } intsize=(); for(i=0;i<size;i++) { if(vec_point[i].x>xMin&&vec_point[i].x<xMax&&vec_point[i].y>yMin&&vec_point[i].y<yMax) { outfile<<"坐標(biāo)點(diǎn)"<<vec_point[i].point_num<<"落在矩形外包內(nèi)部，坐標(biāo)為：\n"; outfile<<vec_point[i].x<<"\t"<<vec_point[i].y<<'\n'; } } return0;}20071：#include<iostream>#include<fstream>#include<vector>usingnamespacestd;structPOINT{ n"; return1; } intnum; infile>>num; vector<POINT>vec_double; inti=0; while(i<num) { doublex; doubley; infile>>x>>y; POINTpoint; =x; =y; (point); i++; } doublexMin,yMin,xMax,yMax; xMin=vec_double[0].x; yMin=vec_double[0].y; xMax=vec_double[0].x; yMax=vec_double[0].y; for(i=1;i<num;i++) { if(vec_double[i].x<xMin) { xMin=vec_double[i].x; } if(vec_double[i].y<yMin) { yMin=vec_double[i].y; } if(vec_double[i].x>xMax) { xMax=vec_double[i].x; } if(vec_double[i].y>yMax) { yMax=vec_double[i].y; } } ofstreamoutfile(""); if(!outfile) { cerr<<"openfailed.\n"; return1; } outfile<<"外包矩形的坐標(biāo)為:\n"; outfile<<xMin<<"\t"<<yMin<<'\n'; outfile<<xMin<<"\t"<<yMax<<'\n'; outfile<<xMax<<"\t"<<yMin<<'\n'; outfile<<xMax<<"\t"<<yMax<<'\n'; ifstreaminpointfile(""); if(!inpointfile) { cerr<<"openfailed.\n"; return1; } vector<POINT>vec_point; while(!()) { intnum; doublex; doubley; inpointfile>>num>>x>>y; POINTpoint; =num; =x; =y; (point); } intsize=(); for(i=0;i<size;i++) { if(vec_point[i].x>xMin&&vec_point[i].x<xMax&&vec_point[i].y>yMin&&vec_point[i].y<yMax) { outfile<<"坐標(biāo)點(diǎn)"<<vec_point[i].point_num<<"落在矩形外包內(nèi)部，坐標(biāo)為：\n"; outfile<<vec_point[i].x<<"\t"<<vec_point[i].y<<'\n'; } } return0;}20072：#include<iostream>#include<fstream>#include<vector>usingnamespacestd;typedefvector<vector<int>>VecInt;constintR=256;constintL=256;structTable{ intx; doubley; Table() { x=0; y=; }};intmain(){ inti,j; doublea,b; ifstreaminfile("",ios::in|ios::binary); if(!infile) { cerr<<"openfailed.\n"; return1; } n"; return1; } for(i=0;i<R;i++) { for(j=0;j<L;j++) { for(intk=0;k<255;k++) { if(vec_int[i][j]==vecTable[k].x) { unsignedcharc; c=vecTable[k].y; ((char*)&c,sizeof(char)); outfile<<""; } } outfile<<'\n'; } } return0;}2008：#include<iostream>#include<fstream>#include<vector>#include<algorithm>#include<numeric>usingnamespacestd;intmain(){ ifstreaminfile(""); ofstreamoutfile(""); if(!infile) { cout<<"openfailed"<<endl; } if(!outfile) { cout<<"openfailed"<<endl; } inttotal=0; infile>>total; vector<double>vec_double; vector<double>vec_square; doublenumeric=; inti=0; while(i<total) { infile>>numeric; (numeric); (numeric*numeric); i++; } sort(),()); doubleaverage=accumulate(),(),/total; doublesum_square=; for(i=0;i<total;i++) { sum_square+=(vec_double[i]-average)*(vec_double[i]-average); } doublevariance=sum_square/total; outfile<<"themaxscoreis:"<<vec_double[total-1]<<endl; outfile<<"theminscoreis:"<<vec_double[0]<<endl; outfile<<"theaveragescoreis:"<<average<<endl; outfile<<"thevarianceis:"<<variance<<endl; (); (); return0;}2009：

#include<iostream>#include<fstream>#include<string>#include<algorithm>usingnamespacestd;intmain(){ strings; ifstreaminfile(""); ofstreamoutfile(""); if(!infile) { cout<<"openfailed"<<endl; return1; } if(!outfile) { cout<<"openfailed"<<endl; return1; } n"; return1; } ofstreamoutfile(""); if(!outfile) { cerr<<"openfailed.\n"; return1; } (3); intnum; infile>>num; inti; intj; VecPointvecpoint(num); doublenumeric1(0); doublenumeric2(0); charc1(0); charc2(0); for(i=0;i<num;i++) { for(j=0;;j++) { infile>>numeric1>>c1>>numeric2; POINTpoint; =numeric1; =numeric2; vecpoint[i].push_back(point); if(j!=0&&vecpoint[i][j].x==vecpoint[i][0].x&&vecpoint[i][j].y==vecpoint[i][0].y) { break; } infile>>c2; } } vector<double>vec_area; vector<double>vec_grith; for(i=0;i<num;i++) { doublearea=polygonarea(vecpoint[i]); (area); doublegrith=polygongirth(vecpoint[i]); (grith); } doubleminArea=vec_area[0]; intminAreaID; doublemaxArea=vec_area[0]; intmaxAreaID; doubleminGrith=vec_grith[0]; intminGrithID; doublemaxGrith=vec_grith[0]; intmaxGrithID; for(i=0;i<num;i++) { if(vec_area[i]<minArea) { minArea=vec_area[i]; minAreaID=i; } if(vec_area[i]>maxArea) { maxArea=vec_area[i]; maxAreaID=i; } if(vec_grith[i]<minGrith) { minGrith=vec_grith[i]; minGrithID=i; } if(vec_grith[i]>maxGrith) { maxGrith=vec_grith[i]; maxGrithID=i; } } outfile<<"第"<<maxAreaID<<"多變形面積最大"<<fixed<<maxArea<<'\n'; outfile<<"第"<<minAreaID<<"多變形面積最小"<<fixed<<minArea<<'\n'; outfile<<"第"<<maxGrithID<<"多變形周長最長"<<fixed<<maxGrith<<'\n'; outfile<<"第"<<minGrithID<<"多變形周長最小"<<fixed<<minGrith<<'\n'; doublesumArea=accumulate(),(),; doubleaverageArea=sumArea/num; doublesumDeviation=; doublestaDeviation; for(i=0;i<num;i++) { sumDeviation+=(vec_area[i]-averageArea)*(vec_area[i]-averageArea); } doublesumStadardDevitation=sqrt(sumDeviation/num); inta=0; intb=0; intc=0; intd=0; for(i=0;i<num;i++) { if(vec_area[i]>(averageArea+sumStadardDevitation)) { a++; } if((vec_area[i]<(averageArea+sumStadardDevitation))&&(vec_area[i]>averageArea)) { b++; } if((vec_area[i]<averageArea)&&(vec_area[i]>(averageArea-sumStadardDevitation))) { c++; } if(vec_area[i]<(averageArea-sumStadardDevitation)) { d++; } } outfile<<"A類"<<a<<'\n'; outfile<<"B類"<<b<<'\n'; outfile<<"C類"<<c<<'\n'; outfile<<"D類"<<d<<'\n'; return0;}-vec_point[i].y)*(vec_point[i+1].x+vec_point[i].x)/2); } returnpolygon_area;}-vec_point[i].y)*(vec_point[i+1].y-vec_point[i].y)+(vec_point[i+1].x-vec_point[i].x)*(vec_point[i+1].x-vec_point[i].x); polygon_grith+=sqrt((double)grith); } returnpolygon_grith;}20112#include<iostream>#include<fstream>#include<vector>#include<>usingnamespacestd;structPOINT{ intx; inty; POINT() { x=0; y=0; }};intmain(){ constdoubledistance=4; intnum; num=0; doubledis=; ifstreaminfile(""); if(!infile) { cout<<"openfailed"<<endl; return1; } infile>>num; vector<vector<structPOINT>>PtrVector(num); vector<POINT>p(num)