Contest Duration: - (local time) (100 minutes) Back to Home

Submission #855435

Source Code Expand

Copy
```#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <sstream>
#include <set>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int main() {
ll n, s;
while (cin >> n >> s) {
ll d = n - s;

// brute force
for (ll b = 2; b <= 1000000; ++b) {
ll sum = 0, now = n;
while (now > 0) {
sum += now % b;
now /= b;
}
if (sum == s) {
cout << b << endl;
goto NEXT;
}
}

// b is big value
if (d >= 1) {
vector<ll> cands;
for (ll i = 1; i * i <= d; ++i) {
if (d % i == 0) {
cands.push_back(i + 1);
cands.push_back(d / i + 1);
}
}
ll ret = 1LL << 60;
for (auto cand : cands) {
if (cand < 1000000) continue;
ll sum = n / cand + n % cand;
if (sum == s) ret = min(ret, cand);
}
cout << ((ret == (1LL << 60)) ? -1 : ret) << endl;
} else if (d == 0) {
cout << n + 1 << endl;
} else {
cout << -1 << endl;
}

NEXT:;
}
}
```

#### Submission Info

Submission Time 2016-08-28 21:19:12+0900 D - Digit Sum ir5 C++14 (GCC 5.4.1) 500 1424 Byte AC 51 ms 256 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
 AC × 5
 AC × 47
Set Name Test Cases
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 4 ms 256 KB
subtask1_100000000000_100000000000.txt AC 45 ms 256 KB
subtask1_100000000000_2.txt AC 50 ms 256 KB
subtask1_100000000000_3.txt AC 50 ms 256 KB
subtask1_100000000000_50000000000.txt AC 48 ms 256 KB
subtask1_100000000000_50000000001.txt AC 48 ms 256 KB
subtask1_100000000000_99999999999.txt AC 44 ms 256 KB
subtask1_16983563041_1.txt AC 4 ms 256 KB
subtask1_1_1.txt AC 4 ms 256 KB
subtask1_1_2.txt AC 22 ms 256 KB
subtask1_1_31415926535.txt AC 22 ms 256 KB
subtask1_239484768_194586924.txt AC 38 ms 256 KB
subtask1_2_1.txt AC 4 ms 256 KB
subtask1_2_2.txt AC 4 ms 256 KB
subtask1_31415926535_1.txt AC 45 ms 256 KB
subtask1_49234683534_2461734011.txt AC 46 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 47 ms 256 KB
subtask1_68719476735_35.txt AC 11 ms 256 KB
subtask1_68719476735_36.txt AC 4 ms 256 KB
subtask1_68719476735_37.txt AC 48 ms 256 KB
subtask1_68719476736_1.txt AC 4 ms 256 KB
subtask1_68719476736_2.txt AC 4 ms 256 KB
subtask1_72850192441_16865701.txt AC 48 ms 256 KB
subtask1_79285169301_27.txt AC 4 ms 256 KB
subtask1_82914867733_1676425945.txt AC 49 ms 256 KB
subtask1_8594813796_75700.txt AC 7 ms 256 KB
subtask1_87654_12345.txt AC 5 ms 256 KB
subtask1_87654_138.txt AC 4 ms 256 KB
subtask1_87654_30.txt AC 4 ms 256 KB
subtask1_87654_4294967308.txt AC 23 ms 256 KB
subtask1_87654_45678.txt AC 23 ms 256 KB
subtask1_97822032312_49157112.txt AC 50 ms 256 KB
subtask1_98750604051_977728851.txt AC 51 ms 256 KB
subtask1_99999515529_1.txt AC 22 ms 256 KB
subtask1_99999515529_316226.txt AC 50 ms 256 KB
subtask1_99999515529_316227.txt AC 22 ms 256 KB
subtask1_99999515529_316228.txt AC 27 ms 256 KB
subtask1_99999515529_49999757765.txt AC 48 ms 256 KB
subtask1_99999515529_49999757766.txt AC 49 ms 256 KB
subtask1_99999515530_2.txt AC 22 ms 256 KB
subtask1_99999999977_1.txt AC 50 ms 256 KB
subtask1_99999999977_2.txt AC 51 ms 256 KB
subtask1_99999999977_49999999989.txt AC 49 ms 256 KB
subtask1_99999999977_49999999990.txt AC 49 ms 256 KB
subtask1_99999999999_1.txt AC 50 ms 256 KB
subtask1_99999999999_100000000000.txt AC 45 ms 256 KB