标签:mem sum one hose return lin tin ring roo
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 77880 Accepted Submission(s): 24325
1 #include<stdio.h> 2 int main() 3 { 4 long long int t; 5 scanf("%lld",&t); 6 while(t) 7 { 8 printf("%d\n",(t-1)%9+1); 9 scanf("%lld",&t); 10 } 11 return 0; 12 }
第一次的代码,没有考虑数字很大很大的情况下,所以一直是WA
下面使用字符串改进的代码,AC了
1 #include<iostream> 2 #include<stdio.h> 3 #include<string> 4 using namespace std; 5 int main() 6 { 7 string s; 8 while(1) 9 { 10 int m=0; 11 cin>>s; 12 if(s[0]-‘0‘==0&&s.length()==1) 13 break; 14 for(int i=0;i<s.length();i++) 15 { 16 m+=s[i]-‘0‘; 17 } 18 cout<<(m-1)%9+1<<endl; 19 } 20 }
标签:mem sum one hose return lin tin ring roo
原文地址:http://www.cnblogs.com/97-ly/p/6820719.html