hdu 1230 火星A+B(水题)

模拟加法

#include<iostream>
#include<string.h>
using namespace std;
int main(){
	int s1[100],s2[100],str[100];
	int prime[100]={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};
	char c;
	int i,j,n,m,t,k;
	while(1){
		memset(s1,0,sizeof(s1));
		memset(s2,0,sizeof(s2));
		i=0,c=',';
		//处理字符串的方式很巧妙 
		while(c!=' '){
			scanf("%d%c",&str[i++],&c);
		}
		for(j=0,i-=1;i>=0;i--){
			s1[j++]=str[i];
			
		}
		i=0;
		while(c!='\n'){
			scanf("%d%c",&str[i++],&c);
		}
		for(k=0,i-=1;i>=0;i--){
			s2[k++]=str[i];
			
		}
		if(j==k&&k==1&&s1[0]==s2[0]&&s1[0]==0){
			break;
		}
		for(i=0;i<25;i++){
			s1[i]+=s2[i];
			if(s1[i]>=prime[i]){
				s1[i+1]+=s1[i]/prime[i];//进位 
				s1[i]%=prime[i];
			}
		}
		for(i=50;!s1[i];i--);
		printf("%d",s1[i]);
		for(i-=1;i>=0;i--){
			printf(",%d",s1[i]);
		}
		printf("\n");
	}
	return 0;
}