1、 cc+1uvuviw=u/10(i/2);y=v/10(i/2);x=u-w*10(i/2);z= v-y*10(i/2);w,x,y,zuv=wy10i+(w+x)(y+z)-wy-xz)10(i/2)+xz- 1010(i/2),10(i)for-1#includeiostream.hint weishu(int x)int i;while(x!=0)x=x/10;i+;return i;void main()int u,v;cout:endl;cinu;cinv;int i,j,m,n;int p,x,y,z,w;int a=1;int b=1;i=weishu(u);for(int
2、k=1;k=i;k+)a=a*10;for(int q=1;q=i/2;q+)b=b*10;w=u/b;y=v/b;x=u-w*b;z=v-y*b;p=w*y*a+(w+x)*(y+z)-w*y-x*z)*b+x*z;coutu*v=p; 0/1cc+for i-0 to nvi,0-0end forfor j-0 to cvj,0-0end forfor i-1 to nfor j-1 to cvi,j-vi-1,jif(si=j and vi-1,j-si+vi)vi,j )vi,j-vi-1,j-si+viitemj=iend forend forfor i-c downto 1 (i=
3、i-itemi)printf(sitemi)end forreturn vn,cfor-vn+1c+1c+ for- vn+1c+1#includeiostream.h#define n 10#define c 12void main()int sn,vn;int vn+1c+1;int itemc;cout:endl;for(int f=0;fn;f+)cinsf;cout:endl;for(int h=0;hn;h+)cinvh;for(int k=0;k=n;k+)vk0=0;for(int m=0;m=c;m+)v0m=0;for(int i=1;i=n;i+)for(int j=1;
4、j=c;j+)vij=vi-1j;if(si=j vi-1j-si+vivij) vij=vi-1j-si+vi; itemj=i;cout:endl; for(int p=c;p=1;p=p-sitemp)coutsitemp;coutendl;cout:;coutvncendl; 0103918 103 2011 2012 3 2012 2 18 1 typedef struct list double elem100; int length;listlength while(lowhigh)mid=(low+high)/2; if(l.elemmid=key) else if(l.ele
5、mmidkey)low=mid;outfilemid+1endl; break;elsehigh=mid;if(high=low+1) outfile!break;endl;lowhiahint init_list(listl)input.txtint search(int low,int high,listl)#include iostream #includefstream using namespace std; typedef struct list double elem100; int length;list;int init_list(listl)/ int search(int
6、 low,int high,listl)/ int search(int low,int high,listl); int n=0; ifstream infile;cout()endl; infile.open(input.txt,ios:in); ofstream outfile;outfile.open(output.txt,ios:app);while(infilel.elemn)/n+;infile.close(); l.length=n;for(int i=0;il.length-1;i+)/ if(l.elemil.elemi+1) outfile!endl; return 0;/cout.endl; search(0,l.length-1,l);return 1;ofstream outfile;outfile.open(output.txt,ios:app); int mid=0;/- 1. 2. 3. 4. c1. (1) nn=2k(2) (3) c2. (1) nn=2k(2) stranssen(3) c1. 2. 300 - 2012 (1) nnnnn100 5001000
