1、 return 0;1010诡秘的余数#include stringint quyu(string s,int n) int m=0; for(int i=0;is.size();i+) m=(m*10+si-48)n; return m;int main() string s; int n; while(cinsn) coutquyu(s,n)endl;1015简单的事情includeiostreamusing namespace std; int n,m,i,j,k; long nn; while(cinnm) if(n=m) cout1n/2) m=n-m; nn=1; for(i=n,
2、j=0,k=1;jm;i,j+,k+) nn=nn*i/k; coutnn int n,m,i,j,k,s,t; int a100100; cinn; for(i=0;in;i+) cinm; for(j=1;j=m;j+) for(k=1;k=m;k+) cinajk; if(m%2=0) for(j=1;j+) t=1; s=m; while(tm) if(ajt!=ajs) cout”no goto RL; t+; s-; j=m; s=m; while(tm) if(atj!=asj)no”endl; s-; else for(j=1; t=1; while(t!=(m+1)/2)=a
3、js)”no” goto RL; s-; while(t! if(atj!=asj) cout”no cout”yes”include mapint 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;j=n; tsum=tsum+aj; if(tsumsum) sum=tsum; besti=i; bestj=j; else if(tsum0) i=j+1; tsum=0; return sum; map m; int a1002;
4、 int i,n,j,k,ii,jj,flag,min; mA=13;mG=7;mM=-1;R=4; mB=12;mH=6;mN=0;mS=5; mC=11;I=-5;O=1;mT=6;D=-10;mJ=4;P=2;U=7; mE=-9;mK=-3;Q=3;mV=8; mF=8;mL=-2;mW=9;mX=10;Y=11;mZ=12; cins; k=1; flag=0; for(j=0;s.size(); ak+=msj; if(ak-10)/一定是k-1 flag=1; if(flag=0) min=a1; for(j=2;jk; if(ajmin) min=aj; coutaj” ”;
5、minmax_sum(a,k1,ii,jj) /coutii” jjset int n,i; string s,ss; set::iterator it;in; cins; sss.clear(); ss=s; reverse(ss.begin(),ss.end(); if(ss=s) sss。insert(s); sort(s。begin(),s。end();/一定得先进行排序 couts while(next_permutation(s。begin(),s。end()!=0) ss=s;sendl; reverse(ss.begin(),ss.end(); if(ss=s) sss.ins
6、ert(s); /coutmapbool prime(int t) int a,i; if(t=1) return 0; if(t=2) return 1; a=sqrt(double(t)+1; for(i=2;a; if(t%i=0) return 0; int n,i,j,k,t; string s,s1,s2;char,string m;=123”;J=123;S=D=”123M=”123”;mU=;G123”;mP=”123”; mB456”;mK=456mT=E=456”;mWHQZ=”456”;C=789”;L=”789”;mU=789F=”789”;=”789”;X mI789
7、”;mR cins; s1=ms0;s2=ms1;js1。size(); for(k=0;s2.size();k+) t=(s1j-48)10+(s2k48); if(prime(t)=1)tendl; goto RL; if(k=s2.size()1 int n,m,x,i,j,k; long a1000,b1000;n;mx; for(j=1;j=m; cinaj;j=x; for(k=1; if(k=m) bk=(ak+a1)%100; else bk=(ak+ak+1)100; ak=bk; if(j=m) coutaj; else coutaj mapint,char mm; for
8、(i=0;10; m0+i=i; mmi=0+i; while(cinsn) sum=0;flag=0;t=”; reverse(s。begin(),s.end(); for(i=0;s.size(); sum=msi*n+flag; flag=0; if(sum=10) flag=sum/10; sum=sum%10; t=mmsum+t; if(flag0) t=mmflag+t; if(t0=0) cout0t if(n2=0) m=n*n; t=n/21; s=m2*t1; for(i=0; if(i=n-1)s; couts”+”; s=s+2; coutendl; m=n*n; t
9、=n/2; s=m-2*t; couts; coutsinclude algorithmbool Comp(const int a,const int b) int m=0,n=0,i; for(i=a;i0;i=i/10) m=m*10+i10; for(i=b;0; n=n10+i%10; if(mn) return 0; else return 1; vectorint v; int n,m,i,j,tt; cinm; for(j=0;jm; cintt; v.push_back(tt); sort(v.begin(),v.end(),Comp);jv.size(); if(j=v。si
10、ze()-1)vj; coutvj ”; coutendl; v。clear();1039对称文 char c10000; /couta-A) s。erase(it+i); s.erase(it+s。size()-i-1); continue; elseNot symmetryendl; goto RL; if(si=() if(ss。size()-1i=)erase(it+s。size()i-1); else cout”Not symmetry” if(si=size()1-i=) s.erase(it+i);size()-i1); if(si=) if(ss.size()-1i=)eras
11、e(it+s.size()i-1); continue; cout”Not symmetry” if(si=Asi=Z) si=si+32;s ss=s;Symmetry” coutNot symmetry”RL: continue;1093求逆序数对 int n,a51,i,j,k,count;n) if(n=0)ai; j=0;count=0; while(jn) for(k=j+1; if(ajak) count+; j+;countab) if(i=0) i+; s=ss=”=29; if(j%2=1) s=s+c; s=s+ ; for(k=1;k=15; if(k%2=1) ss=ss+c; ss=ss+jb; /*if(a=b&j=b1) /cout else/ for(k=0;kab; /*if(k=ab-1)ss; else*/ coutss1099最少拦截系统struct ly int height; int used;ly zc100000;int count,n,a,i,j,result;int main()n)
copyright@ 2008-2023 冰点文库 网站版权所有
经营许可证编号:鄂ICP备19020893号-2