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

Submission #1338813

Source Code Expand

Copy
```#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) c.begin(), c.end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

ll f(ll b, ll n){
if (n < b) return n;
return f(b, n/b) + n % b;
}

int main() {
ll n, s;
cin >> n >> s;

for (ll b = 2; b * b <= n; b++){
if (f(b, n) == s){
cout << b << endl;
return 0;
}
}

ll ans = 1e18;
for (ll x = 1; x * x <= n - s; x++){
if ((n-s) % x != 0) continue;
ll b = (n-s) / x + 1;
if (x >= b) continue;
ll y = s - x;
if (y < 0 || y >= b) continue;
ans = min(ans, b);
}

if (ans != 1e18){
cout << ans << endl;
return 0;
}

if (n == s) cout << n+1 << endl;
else cout << -1 << endl;
return 0;
}```

Submission Info

Submission Time 2017-06-10 16:31:41+0900 D - Digit Sum TangentDay C++14 (GCC 5.4.1) 500 1288 Byte AC 11 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 1 ms 256 KB
subtask1_100000000000_100000000000.txt AC 8 ms 256 KB
subtask1_100000000000_2.txt AC 11 ms 256 KB
subtask1_100000000000_3.txt AC 11 ms 256 KB
subtask1_100000000000_50000000000.txt AC 10 ms 256 KB
subtask1_100000000000_50000000001.txt AC 10 ms 256 KB
subtask1_100000000000_99999999999.txt AC 8 ms 256 KB
subtask1_16983563041_1.txt AC 1 ms 256 KB
subtask1_1_1.txt AC 1 ms 256 KB
subtask1_1_2.txt AC 1 ms 256 KB
subtask1_1_31415926535.txt AC 1 ms 256 KB
subtask1_239484768_194586924.txt AC 2 ms 256 KB
subtask1_2_1.txt AC 1 ms 256 KB
subtask1_2_2.txt AC 1 ms 256 KB
subtask1_31415926535_1.txt AC 7 ms 256 KB
subtask1_49234683534_2461734011.txt AC 8 ms 256 KB
subtask1_4_1.txt AC 1 ms 256 KB
subtask1_58640129658_232122496.txt AC 9 ms 256 KB
subtask1_68719476735_35.txt AC 4 ms 256 KB
subtask1_68719476735_36.txt AC 1 ms 256 KB
subtask1_68719476735_37.txt AC 10 ms 256 KB
subtask1_68719476736_1.txt AC 1 ms 256 KB
subtask1_68719476736_2.txt AC 1 ms 256 KB
subtask1_72850192441_16865701.txt AC 10 ms 256 KB
subtask1_79285169301_27.txt AC 1 ms 256 KB
subtask1_82914867733_1676425945.txt AC 10 ms 256 KB
subtask1_8594813796_75700.txt AC 2 ms 256 KB
subtask1_87654_12345.txt AC 1 ms 256 KB
subtask1_87654_138.txt AC 1 ms 256 KB
subtask1_87654_30.txt AC 1 ms 256 KB
subtask1_87654_4294967308.txt AC 1 ms 256 KB
subtask1_87654_45678.txt AC 1 ms 256 KB
subtask1_97822032312_49157112.txt AC 11 ms 256 KB
subtask1_98750604051_977728851.txt AC 11 ms 256 KB
subtask1_99999515529_1.txt AC 8 ms 256 KB
subtask1_99999515529_316226.txt AC 11 ms 256 KB
subtask1_99999515529_316227.txt AC 11 ms 256 KB
subtask1_99999515529_316228.txt AC 11 ms 256 KB
subtask1_99999515529_49999757765.txt AC 10 ms 256 KB
subtask1_99999515529_49999757766.txt AC 10 ms 256 KB
subtask1_99999515530_2.txt AC 8 ms 256 KB
subtask1_99999999977_1.txt AC 11 ms 256 KB
subtask1_99999999977_2.txt AC 11 ms 256 KB
subtask1_99999999977_49999999989.txt AC 10 ms 256 KB
subtask1_99999999977_49999999990.txt AC 10 ms 256 KB
subtask1_99999999999_1.txt AC 11 ms 256 KB
subtask1_99999999999_100000000000.txt AC 8 ms 256 KB