浙江工業(yè)大學(xué)ACM.doc

浙江工業(yè)大學(xué)ACM部分程序解讀l 程序設(shè)計(jì)導(dǎo)引及在線實(shí)踐l 最重要的是邊界：輸入的邊界和輸出的邊界：l if(n=0)cout0endl;/一定要考慮最特殊的情況l cout.precision(3); coutfixedsumendl; printf(%.3fn,sum);/以后的采用l 時(shí)刻請(qǐng)注意清空，向量及變量Zjut1002數(shù)字游戲#include using namespace std;int divide(int x, int y,int& k) if(x=y) return k; if(x%y=0)k+;return divide(x/y,y,k); return 1;int main()int n,i,x,k,ki; while(scanf(%d,&n)&n!=0)ki=k=1; x=n; for(i=2; in; i+) if(n%i=0) k=divide(n,i,k); if(k!=1) x=i; ki=k;/important k=1;/important continue; /out if(ki=1) printf(%d %dn,0,0); else printf(%d %dn,x,ki); return 0;1010詭秘的余數(shù)#include #include using namespace std;int quyu(string s,int n)int m=0;for(int i=0;isn)coutquyu(s,n)endl;return 0;1015簡單的事情#includeusing namespace std;int main()int n,m,i,j,k;long nn;while(cinnm)if(n=m)cout1n/2)m=n-m;nn=1;for(i=n,j=0,k=1;jm;i-,j+,k+)nn=nn*i/k;coutnnendl;return 0;1016折紙游戲#include using namespace std;int main()int n,m,i,j,k,s,t;int a100100;cinn;for(i=0;im;for(j=1;j=m;j+)for(k=1;kajk;if(m%2=0)for(j=1;j=m;j+)t=1;s=m;while(tm)if(ajt!=ajs)coutnoendl;goto RL;t+;s-;for(j=1;j=m;j+)t=1;s=m;while(tm)if(atj!=asj)coutnoendl;goto RL;t+;s-;elsefor(j=1;j=m;j+)t=1;s=m;while(t!=(m+1)/2)if(ajt!=ajs)coutnoendl;goto RL;t+;s-;for(j=1;j=m;j+)t=1;s=m;while(t!=(m+1)/2)if(atj!=asj)coutnoendl;goto RL;t+;s-;coutyesendl;RL:continue;return 0;1021ACMICPC#pragma warning(disable:4786)#include #include #include using namespace std;int max_sum(int a,int n,int &besti,int &bestj)int i,j,tsum,sum;tsum=0;sum=0;besti=0;bestj=0;i=1;for(j=1;jsum)sum=tsum;besti=i;bestj=j;else if(tsum0)i=j+1;tsum=0;return sum;int main()map m;int a1002;string s;int i,n,j,k,ii,jj,flag,min;mA=-13;mG=-7;mM=-1;mR=4;mB=-12;mH=-6;mN=0;mS=5;mC=-11;mI=-5;mO=1;mT=6;mD=-10;mJ=-4;mP=2;mU=7;mE=-9;mK=-3;mQ=3;mV=8;mF=-8;mL=-2;mW=9;mX=10;mY=11;mZ=12;cinn;for(i=0;is;k=1;flag=0;for(j=0;j0)/一定是k-1flag=1;if(flag=0)min=a1;for(j=2;jmin)min=aj;coutaj ;coutminendl;elsecoutmax_sum(a,k-1,ii,jj)endl;/coutii jjendl;flag=0;return 0;1022IOI#pragma warning(disable:4786)#include #include #include #include using namespace std;int main()int n,i;string s,ss;set sss;set:iterator it;cinn;for(i=0;is;sss.clear();ss=s;reverse(ss.begin(),ss.end();if(ss=s)sss.insert(s);sort(s.begin(),s.end();/一定得先進(jìn)行排序coutsendl;while(next_permutation(s.begin(),s.end()!=0)ss=s;coutsendl;reverse(ss.begin(),ss.end();if(ss=s)sss.insert(s);/coutsendl;it=sss.begin();if(sss.empty()=1)coutSorryendl;elsecout*itendl;return 0;1023OJ#pragma warning(disable:4786)#include #include #include #include using namespace std;bool prime(int t)int a,i;if(t=1) return 0;if(t=2) return 1;a=sqrt(double(t)+1;for(i=2;ia;i+)if(t%i=0)return 0;return 1;int main()int n,i,j,k,t;string s,s1,s2;map m;mA=123;mJ=123;mS=123;mD=123;mM=123;mU=123;mG=123;mP=123;mY=123;mB=456;mK=456;mT=456;mE=456;mN=456;mW=456;mH=456;mQ=456;mZ=456;mC=789;mL=789;mU=789;mF=789;mO=789;mX=789;mI=789;mR=789;cinn;for(i=0;is;s1=ms0;s2=ms1;for(j=0;js1.size();j+)for(k=0;ks2.size();k+)t=(s1j-48)*10+(s2k-48);if(prime(t)=1)couttendl;goto RL;if(k=s2.size()cout-1endl;RL:continue;return 0;1026做游戲#include using namespace std;int main()int n,m,x,i,j,k;long a1000,b1000;cinn;for(i=0;imx;for(j=1;jaj;for(j=1;j=x;j+)for(k=1;k=m;k+)if(k=m)bk=(ak+a1)%100;elsebk=(ak+ak+1)%100;for(k=1;k=m;k+)ak=bk;for(j=1;j=m;j+)if(j=m)coutaj;elsecoutaj ;coutendl;return 0;1027大數(shù)的乘法#pragma warning(disable:4786)#include #include #include #include using namespace std;void delete1(string s)int i;for(i=0;is.size();i+)si=si+1;int main()string s,t;int i,n,sum,flag;map m;map mm;for(i=0;isn)sum=0;flag=0;t=;reverse(s.begin(),s.end();for(i=0;i=10)flag=sum/10;sum=sum%10;t=mmsum+t;if(flag0)t=mmflag+t;if(t0=0)cout0endl;elsecouttendl;return 0;1032立方數(shù)與連續(xù)奇數(shù)和#include using namespace std;int main()int n,i,m,t,s;while(cinn)if(n%2=0)m=n*n;t=n/2-1;s=m-2*t-1;for(i=0;in;i+)if(i=n-1)couts;elsecouts+;s=s+2;coutendl;elsem=n*n;t=n/2;s=m-2*t;for(i=0;in;i+)if(i=n-1)couts;elsecouts+;s=s+2;coutendl;return 0;1036倒置排序#include #include #include using namespace std;bool Comp(const int &a,const int &b)int m=0,n=0,i;for(i=a;i0;i=i/10)m=m*10+i%10;for(i=b;i0;i=i/10)n=n*10+i%10;if(mn)return 0;elsereturn 1;int main()vector v;int n,m,i,j,tt;cinn;for(i=0;im;for(j=0;jtt;v.push_back(tt);sort(v.begin(),v.end(),Comp);for(j=0;jv.size();j+)if(j=v.size()-1)coutvj;elsecoutvj ;coutendl;v.clear();return 0;1039對(duì)稱文#include #include #include using namespace std;int main()string s,ss;char c10000;int i;/couta-Aendl;string:iterator it;while(cin.getline(c,10000)s=c;if(s=000000)break;for(i=0;is.size();i+)it=s.begin();if(si=)s.erase(it+i);s.erase(it+s.size()-i-1);continue;elsecoutNot symmetryendl;goto RL;if(si=()if(ss.size()-1-i=)s.erase(it+i);s.erase(it+s.size()-i-1);continue;elsecoutNot symmetryendl;goto RL;if(si=)if(ss.size()-1-i=)s.erase(it+i);s.erase(it+s.size()-i-1);continue;elsecoutNot symmetryendl;goto RL;if(si=)if(ss.size()-1-i=)s.erase(it+i);s.erase(it+s.size()-i-1);continue;elsecoutNot symmetryendl;goto RL;for(i=0;i=A&si=Z)si=si+32;coutsendl;ss=s;reverse(s.begin(),s.end();if(ss=s)coutSymmetryendl;elsecoutNot symmetryendl;RL:continue;return 0;1093求逆序數(shù)對(duì)#include using namespace std;int main()int n,a51,i,j,k,count;while(cinn)if(n=0)break;for(i=0;iai;j=0;count=0;while(jn)for(k=j+1;kak)count+;j+;coutcountendl;return 0;1097門簾設(shè)計(jì)#include #include using namespace std;int main()char c;int a,b,j,i=0,k;string s,ss;while(cincab)if(i=0)i+;elsecoutendl;s=;ss=;for(j=1;j=29;j+)if(j%2=1)s=s+c;elses=s+ ;for(k=1;k=15;k+)if(k%2=1)ss=ss+c;elsess=ss+ ;for(j=0;jb;j+)/*if(a=b&j=b-1)/couts; else*/coutsendl;for(k=0;ka-b;k+)/*if(k=a-b-1)coutss; else*/coutssendl;return 0;1099最少攔截系統(tǒng)#include using namespace std;struct ly int height; int used;ly zc100000;int count,n,a,i,j,result;int main() while(cinn) for(i=0;ia; zci.height=a; count=0;result=0; for(i=0;in;i+) zci.used=0; for(i=0;in & countn;i+) if(zci.used=0) zci.used=1; count+; result+; else continue; int maxheight=zci.height; for(int j=i+1;j=zcj.height) maxheight=zcj.height; zcj.used=1; count+; coutresultendl; return 0;2000支票保護(hù)#pragma warning(disable:4786)#include #include #include using namespace std;int main()string s,s1;map m1;map m2;m2100=ONE HUNDRED;m2200=TWO HUNDRED;m2300=THREE HUNDRED;m2400=FOUR HUNDRED;m2500=FIVE HUNDRED;m2600=SIX HUNDRED;m2700=SEVEN HUNDRED;m2800=EIGHT HUNDRED;m2900=NINE HUNDRED;m220=TWENTY;m230=THIRTY;m240=FORTY;m250=FIFTY;m260=SIXTY;m270=SEVENTY;m280=EIGHTY;m290=NINETY;m20=ZERO;m21=ONE;m22=TWO;m23=THREE;m24=FOUR;m25=FIVE;m26=SIX;m27=SEVEN;m28=EIGHT;m29=NINE;m210=TEN;m211=ELEVEN;m212=TWELVE;m213=THIRTEEN;m214=FOURTEEN;m215=FIFTEEN;m216=SIXTEEN;m217=SEVENTEEN;m218=EIGHTEEN;m219=NINETEEN;int i,j,k,flag,c1,c2,c3,l,a,b,b1,b2,b3,a1;for(i=0;is)flag=s.find(.);c1=0;c2=0;c3=0;if(flag!=4294967295)s1=;for(j=0;jflag;j+)c1=c1*10+m1sj;/if(s.length()-flag-1=1)/c2=m1sflag+1*10;/elsefor(k=flag+1;ks.length();k+)/c2=c2*10+m1sk;s1=s1+sk;/if(c1=0)cout=1&c1=19)if(c1=1)coutm2c1 Dollar;elsecoutm2c1=100)a=c1/100;coutm2a*1000)if(c1=1&c1=19)coutm2c1 Dollars;elseb=c1/10;coutm2b*100)coutm2c1 Dollars;elsecout Dollars;elsecout Dollars;elseb1=c1/10;coutm2b1*100)coutm2c1 Dollars;elsecout0)if(c2/100)cout and c2/100endl;elsecout and 0c2/100endl;*/if(s10=0)cout and s11/100endl;elsecout and s1/100endl;continue;elsefor(l=0;ls.length();l+)c3=c3*10+m1sl;if(c3=0)coutZERO Dollar=1&c3=19)if(c3=1)coutm2c3 Dollarendl;elsecoutm2c3 Dollars=100)a1=c3/100;coutm2a1*1000)if(c3=1&c3=19)coutm2c3 Dollarsendl;elseb2=c3/10;coutm2b2*100)coutm2c3 Dollarsendl;elsecout Dollarsendl;elsecout Dollarsendl;elseb3=c3/10;coutm2b3*100)coutm2c3 Dollarsendl;elsecout Dollarsendl;return 0;1084剔除相關(guān)數(shù)#pragma warning(disable:4786)#include #include #include #include #include #include using namespace std;bool Comp(const string &a,const string &b)return a.length()!=b.length()?a.length()b.length():ab;int main()string s,b1000,t;int n,i,k,flag;vector v;map m;set ss;map:iterator it;while(cinn)if(n=0)break;ss.clear();m.clear();v.clear();for(i=0;is;bi=s;sort(s.begin(),s.end();/coutsendl;ms+;/coutmsendl;flag=0;for(it=m.begin();it!=m.end();it+)if(*it).second=1)ss.insert(*it).first);flag=1;if(flag=0)coutNoneendl;elsefor(i=0;in;i+)t=bi;sort(t.begin(),t.end();if(ss.find(t)!=ss.end()v.push_back(bi);sort(v.begin(),v.end(),Comp);for(k=0;kv.size();k+)if(k=v.size()-1)coutvk;elsecoutvk ;coutendl;return 0;1077火星數(shù)排序#pragma warning(disable:4786)#include #include #include #include using namespace std;bool Comp(const string &a,const string &b)int m=0,n=0,i;for(i=0;ia.size();i+)if(ai=0)m=m*10+0;else if(ai=1)m=m*10+2;else if(ai=2)m=m*10+4;else if(ai=3)m=m*10+5;else if(ai=4)m=m*10+7;else if(ai=5)m=m*10+3;else if(ai=6)m=m*10+9;else if(ai=7)m=m*10+8;else if(ai=8)m=m*10+1;else if(ai=9)m=m*10+6;for(i=0;ib.size();i+)if(bi=0)n=n*10+0;else if(bi=1)n=n*10+2;else if(bi=2)n=n*10+4;else if(bi=3)n=n*10+5;else if(bi=4)n=n*10+7;else if(bi=5)n=n*10+3;else if(bi=6)n=n*10+9;else if(bi=7)n=n*10+8;else if(bi=8)n=n*10+1;else if(bi=9)n=n*10+6;if(m!=n)return mn;elsereturn mn;int main()int n,m,i,j;string s;vector v;cinn;for(i=0;im;v.clear();for(j=0;js;v.push_back(s);sort(v.begin(),v.end(),Comp);for(j=0;jm-1;j+)coutvj ;coutvm-1endl;return 0;1079美麗的數(shù)#pragma warning(disable:4786)#include #include #include using namespace std;bool Comp(const int &a,const int &b)int c1=0,c2=0,i,f1,f2,f3,f4,c;f1=0;f2=0;f3=0;f4=0;for(i=a;i0;i=i/10)c=i%10;if(c=2&f1=0)c1+;f1=1;else if(c=3&f2=0)c1+;f2=1;else if(c=5&f3=0)c1+;f3=1;else if(c=7&f4=0)c1+;f4=1;f1=0;f2=0;f3=0;f4=0;for(i=b;i0;i=i/10)c=i%10;if(c=2&f1=0)c2+;f1=1;else if(c=3&f2=0)c2+;f2=1;else if(c=5&f3=0)c2+;f3=1;else if(c=7&f4=0)c2+;f4=1;if(c1!=c2)return c1c2;if(a!=b)return ab;int main()int n,i,j;int s;vector v;while(cinn)if(n=0)break;v.clear();for(i=0;is;v.push_back(s);sort(v.begin(),v.end(),Comp);coutv0endl;return 0;1105水果#include #include #include #include using namespace std;struct shuiguostring a;string b;int c;bool Comp(const shuiguo &s1,const shuiguo &s2)if(s1.b!=s2.b)return s1.bs2.b;if(s1.a!=s2.a)return s1.as2