1 solutions
-
0
#include<bits/stdc++.h> using namespace std; #define int long long int sz[500001], ans[500001]; signed main() { string s; cin >> s; reverse(s.begin(), s.end()); for (int i = s.length() - 1; i >= 0; i--) { sz[i] = sz[i + 1] + (s[i] - '0'); } for (int i = 0; i <= 500001; i++) { sz[i + 1] += sz[i] / 10; sz[i] %= 10; } int f = 500001; while (sz[f] == 0)f--; while (f >= 0) { cout << sz[f]; f--; } }
- 1
Information
- ID
- 824
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 30
- Accepted
- 13
- Uploaded By