Submission #61396046

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define int long long
#define isz(x) (int)x.size()
using namespace std;
void solve() {
    auto sum = [&](int n) -> int {
        int res = 0;
        while (n) {
            res += n % 10;
            n /= 10;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define int long long
#define isz(x) (int)x.size()
using namespace std;

void solve() {
    auto sum = [&](int n) -> int {
        int res = 0;
        while (n) {
            res += n % 10;
            n /= 10;
        }
        return res;
    };
    auto check = [&](int n) -> bool {
        return n % sum(n) == 0;
    };
    vector<int> vec;
    for (int n = 1; n < (int)2e6; ++n) {
        if (check(n) and check(n + 1)) {
            vec.emplace_back(n);
        }
    }

    string s;
    cin >> s;
    if (isz(s) < 7) {
        int n = 0;
        for (auto val : s) n = n * 10 + val - '0';
        int val = *lower_bound(all(vec), n);
        if (val + 1 > 2 * n) {
            cout << -1 << endl;
        }
        else {
            cout << val << endl;
        }
        return;
    }

    auto binpow = [&](int x, int y, int mod) -> int {
        int res = 1;
        while (y) {
            if (y & 1) res = res * x % mod;
            x = x * x % mod;
            y >>= 1;
        }
        return res;
    };

    int pos = (s[0] - '0') * 10 + (s[1] - '0') + 1, spos = sum(pos);
    int len = isz(s) - 2;

    auto ck = [&](int val) -> int {
        int csum = spos + sum(val);
        return (pos * binpow(10, len, csum) + val) % csum == 0;
    };
    auto print = [&](int val) -> void {
        int oval = val, cnt = 0;
        while (val) {
            ++cnt;
            val /= 10;
        }
        if (cnt == 0) cnt = 1;
        cout << pos;
        for (int i = 0; i < len - cnt; ++i) cout << 0;
        cout << oval << endl;
    };

    int val = 0;
    while (val < 1000000) {
        if (ck(val) and ck(val + 1)) {
            print(val);
            return;
        }
        ++val;
    }
    assert(0);
}

signed main() {

#ifndef CDuongg
    if (fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Submission Info

Judge Result