Submission #28186949

---

Source Code Expand

#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
// using P = pair<ll,ll>;

const ll INF = (ll)1e18;
// const int INF = (int)1e9+7;
// const int MOD = (int)1e9+7;
// const ll MOD = (int)1e9+7;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

void solve() {
    string s;
    cin >> s;
    reverse(all(s));
    int n = s.size();
    int sum = 0;
    rep(i,n) sum += s[i]-'0';

    string ans = "";
    int carry = 0;
    rep(i,n) {
        ans.push_back('0' + (carry+sum)%10);
        carry = (carry+sum) / 10;
        sum -= (s[i]-'0');
    }
    while (carry > 0) {
        ans.push_back('0' + carry%10);
        carry /= 10;
    }
    reverse(all(ans));
    cout << ans << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result