hdu 4608

来源:互联网 发布:java数据结构视频教程 编辑:程序博客网 时间:2024/06/06 05:42
#pragma comment(linker, "/STACK:102400000,102400000")#include<iostream>#include<vector>#include<algorithm>#include<cstdio>#include<queue>#include<stack>#include<string>#include<map>#include<set>#include<cmath>#include<cassert>#include<cstring>#include<iomanip>#include<ctime>using namespace std;#ifdef _WIN32typedef __int64 i64;#define out64 "%I64d\n"#define in64 "%I64d"#elsetypedef long long i64;#define out64 "%lld\n"#define in64 "%lld"#endif/************ for topcoder by zz1215 *******************/#define foreach(c,itr)  for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)#define S64(a)          scanf(in64,&a)#define SS(a)           scanf("%d",&a)#define LL(a)           ((a)<<1)#define RR(a)           (((a)<<1)+1)#define pb              push_back#define pf              push_front#define X               first#define Y               second#define CL(Q)           while(!Q.empty())Q.pop()#define MM(name,what)   memset(name,what,sizeof(name))#define MC(a,b)memcpy(a,b,sizeof(b))#define MAX(a,b)        ((a)>(b)?(a):(b))#define MIN(a,b)        ((a)<(b)?(a):(b))#define read            freopen("in.txt","r",stdin)#define write           freopen("out.txt","w",stdout)const int inf = 0x3f3f3f3f;const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;const double oo = 10e9;const double eps = 10e-9;const double pi = acos(-1.0);const int maxn = 101111;int T;int n;void spp(string &s){reverse(s.begin(), s.end());s[0]++;for (int i = 0; i < (int)s.length(); i++){if (s[i]>'9'){s[i] = '0';if (i + 1 < (int)s.length()){s[i + 1]++;}else{s += '1';}}}reverse(s.begin(), s.end());}bool yes(string & s){int temp = 0;for (int i = 0; i <(int) s.length(); i++){temp += s[i] - '0';}if (temp % 10){return false;}else{return true;}}int main(){cin >> T;string s;while (T--){cin >> s;spp(s);while (!yes(s)){spp(s);}cout << s << endl;}return 0;}

0 0
原创粉丝点击