摘要:
#include#include#includeusing namespace std; map mp; void setMap(){ mp["zero"] = 0; mp["one"] = 1; mp["two"] = 2; mp["three"] = 3; mp["four"] = 4; mp["five"] = 5; mp["six"] = 6; mp["seven"] = 7; mp["eight"] = 8 阅读全文
摘要:
//只要看懂火星A+B的进位关系就好了#includeint p[26]={1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};int main(){ int a[26],b[26],sum[26]; int m,n,i,j,k,add,x,y,max; char c; while(1) { for(i=0;in?m:n;//比较a,b升序的大小 for(i=1,add=0,max=k;i=1)x=a[m--];//从低位进行操作 ,并取出... 阅读全文
摘要:
#include#includeint main(){ int A,k,B,sum,c,d; while(scanf("%d%d%d",&A,&B,&k)&&(A||B)) { if(A%(c=pow(10.0,k))==B%(d=pow(10.0,k))) { sum=-1; } else { sum=A+B; } printf("%d\n",sum); }}求A的第K位的数公式:A%((int)(pow(10,... 阅读全文