hdu 4608——I-number
2013-07-24 21:19
281 查看
暴力枚举
#include <iostream> #include <string> using namespace std; string add(string str) { int i; int l = str.size(); str[l-1]++; for(int i=l-1;i>=1;i--) if(str[i]>'9') { str[i-1]+=(str[i]-'0')/10; str[i]=(str[i]-'0')%10+'0'; } else break; if(str[0]>'9') { str[0]=(str[0]-'0')%10+'0'; str="1"+str; } return str; } int main() { int t; string s1,s2; scanf("%d",&t); while(t--) { cin>>s1; int temp=1; while(temp%10!=0) { temp=0; s1=add(s1); for(int i=0;i<s1.size();i++) temp+=s1[i]-'0'; } cout<<s1<<endl; } return 0; }
相关文章推荐
- hdu 4608 I-number
- HDU 4608 I-number (数学&字符串处理)
- HDU 4608 I-number(暴力模拟)
- HDU 4608 I-number(YY)
- HDU - 4608 I-number
- HDU 4608 I-number 解题报告
- HDU 4608 I-number
- HDU 4608 I-number
- hdu 4608 I-number
- HDU 4608 I-number 2013 Multi-University Training Contest 1
- 杭电 HDU 4608 I-number
- hdu 4608 I-number
- hdu 4608 I-number(13多校#1 ,1009)
- hdu 4608 I-number
- HDU 4608 I-number(模拟)
- HDU-4608 I-number 枚举
- hdu 4608 I-number(13多校#1 ,1009)
- HDU 4608 I-number
- HDU 4608 I-number(模拟)
- hdu 4608 I-number 模拟