HDU-4608 I-number 枚举

  题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4608

  直接暴力枚举,没什么好说的。。。。

  1 //STATUS:C++_AC_765MS_740KB
  2 #include <functional>
  3 #include <algorithm>
  4 #include <iostream>
  5 //#include <ext/rope>
  6 #include <fstream>
  7 #include <sstream>
  8 #include <iomanip>
  9 #include <numeric>
 10 #include <cstring>
 11 #include <cassert>
 12 #include <cstdio>
 13 #include <string>
 14 #include <vector>
 15 #include <bitset>
 16 #include <queue>
 17 #include <stack>
 18 #include <cmath>
 19 #include <ctime>
 20 #include <list>
 21 #include <set>
 22 #include <map>
 23 using namespace std;
 24 //using namespace __gnu_cxx;
 25 //define
 26 #define pii pair<int,int>
 27 #define mem(a,b) memset(a,b,sizeof(a))
 28 #define lson l,mid,rt<<1
 29 #define rson mid+1,r,rt<<1|1
 30 #define PI acos(-1.0)
 31 //typedef
 32 typedef __int64 LL;
 33 typedef unsigned __int64 ULL;
 34 //const
 35 const int N=100010;
 36 const int INF=0x3f3f3f3f;
 37 const int MOD=100000,STA=8000010;
 38 const LL LNF=1LL<<60;
 39 const double EPS=1e-8;
 40 const double OO=1e15;
 41 const int dx[4]={-1,0,1,0};
 42 const int dy[4]={0,1,0,-1};
 43 const int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
 44 //Daily Use ...
 45 inline int sign(double x){return (x>EPS)-(x<-EPS);}
 46 template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
 47 template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
 48 template<class T> inline T lcm(T a,T b,T d){return a/d*b;}
 49 template<class T> inline T Min(T a,T b){return a<b?a:b;}
 50 template<class T> inline T Max(T a,T b){return a>b?a:b;}
 51 template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}
 52 template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}
 53 template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}
 54 template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}
 55 //End
 56 
 57 char s[N];
 58 int num[N];
 59 int T,len;
 60 
 61 void add(int *num)
 62 {
 63     int i,t;
 64     num[0]+=1;
 65     if(num[0]<10)return;
 66     else t=1,num[0]=0;
 67     for(i=1;i<len;i++){
 68         num[i]+=t;
 69         t=num[i]/10;
 70         if(num[i]>=10)num[i]-=10;
 71         else return;
 72     }
 73     if(t){
 74         num[i]=1;
 75         len++;
 76     }
 77     return;
 78 }
 79 
 80 bool isok(int *num)
 81 {
 82     int i,sum=0;
 83     for(i=0;i<len;i++)
 84         sum+=num[i];
 85     return sum%10;
 86 }
 87 
 88 int main()
 89 {
 90  //   freopen("in.txt","r",stdin);
 91     int i,j;
 92     scanf("%d",&T);
 93     while(T--)
 94     {
 95         scanf("%s",s);
 96         len=strlen(s);
 97         for(i=0;i<len;i++){
 98             num[len-i-1]=s[i]-'0';
 99         }
100         add(num);
101         while(isok(num)){
102             add(num);
103         }
104 
105         for(i=len-1;i>=0;i--)
106             printf("%d",num[i]);
107         putchar('\n');
108     }
109     return 0;
110 }

 

posted @ 2013-07-23 22:35  zhsl  阅读(236)  评论(0编辑  收藏  举报