HDU 1013 Digital Roots
2014-04-11 00:07
295 查看
题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=1013
大数+九剩余定理;
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char num[1000];
while(cin>>num)
{
if(num[0]=='0')
break;
int len=strlen(num);
int i;
int sum=0;
for(i=0;i<len;i++)
sum+=num[i]-'0';
sum=sum%9;
if(sum==0)
cout<<"9"<<endl;
else
cout<<sum<<endl;
}
return 0;
}
大数+九剩余定理;
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char num[1000];
while(cin>>num)
{
if(num[0]=='0')
break;
int len=strlen(num);
int i;
int sum=0;
for(i=0;i<len;i++)
sum+=num[i]-'0';
sum=sum%9;
if(sum==0)
cout<<"9"<<endl;
else
cout<<sum<<endl;
}
return 0;
}
相关文章推荐
- hdu 1013 Digital Roots
- HDU - 1013 Digital Roots —— 树根
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots 题解
- HDU 1013 Digital Roots
- HDU_1013 Digital Roots
- HDU—— 1013 Digital Roots
- hdu 1013 Digital Roots(模拟 || 数论)
- hdu 1013 Digital Roots
- hdu 1013 Digital Roots
- HDU 1013 Digital Roots 大数水题
- HDU 1013 Digital Roots 模拟题
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- hdu 1013 Digital Roots
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- POJ 1519 && HDU 1013 Digital Roots(数论)