#pragma region include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include #include #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)1e18; const double PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; string tra(string str){ int size = str.size(); bool flag = false; int car = 1; for(int i = size-1;i>=0;--i){ if( str[i] >= '0' && str[i] <= '9' ){ flag = true; int num = str[i]-'0' + car; if( num >= 10 ){ car = 1; num -= 10; str[i] = '0' + num; }else{ car = 0; str[i] = '0' + num; } }else if( flag ){ if( car ){//'1'の入れる str.insert(i+1,"1"); car = 0; } break; } } if( flag && car ){ str.insert(0,"1"); } return str; } void solve(){ int N; cin >> N; string kai; getline(cin,kai);//残った改行を消す vector< string > ans; while(N--){ string str; getline(cin,str); ans.push_back( tra(str) ); //cout << tra(str) << endl; } int size = ans.size(); for(int i=0;i