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

Submission #856360

Source Code Expand

Copy
```#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif

int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
long long N,S;
cin >> N >> S;
for(int b =2; b <= 1000000; b++) {
long long x =N, s =0;
while(x > 0) {
s +=x%b;
x /=b;}
if(s == S) {cout << b << "\n"; return 0;}
}
long long minb =-1;
for(long long x =1; x <= 1000000; x++) {
long long r =S-x;
if(r < 0) continue;
long long y =N-r;
if(y < 0) continue;
if(y%x != 0) continue;
long long b =y/x;
if(b <= r || b == 0) continue;
long long z =N, s =0;
while(z > 0) {
s +=z%b;
z /=b;}
if(s == S) minb =(minb == -1)?b:min(minb,b);
}
if(minb != -1) {cout << minb << "\n"; return 0;}
if(S == N) {cout << N+1 << "\n"; return 0;}
cout << "-1\n";
return 0;}

// look at my code
// my code is amazing
```

Submission Info

Submission Time 2016-08-28 22:00:20+0900 D - Digit Sum xellos C++14 (GCC 5.4.1) 500 1658 Byte AC 64 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 64 ms 256 KB
subtask1_100000000000_2.txt AC 46 ms 256 KB
subtask1_100000000000_3.txt AC 46 ms 256 KB
subtask1_100000000000_50000000000.txt AC 63 ms 256 KB
subtask1_100000000000_50000000001.txt AC 63 ms 256 KB
subtask1_100000000000_99999999999.txt AC 63 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 21 ms 256 KB
subtask1_1_31415926535.txt AC 22 ms 256 KB
subtask1_239484768_194586924.txt AC 56 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 43 ms 256 KB
subtask1_49234683534_2461734011.txt AC 61 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 61 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 45 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 62 ms 256 KB
subtask1_79285169301_27.txt AC 4 ms 256 KB
subtask1_82914867733_1676425945.txt AC 62 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 26 ms 256 KB
subtask1_87654_45678.txt AC 24 ms 256 KB
subtask1_97822032312_49157112.txt AC 63 ms 256 KB
subtask1_98750604051_977728851.txt AC 63 ms 256 KB
subtask1_99999515529_1.txt AC 22 ms 256 KB
subtask1_99999515529_316226.txt AC 52 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 63 ms 256 KB
subtask1_99999515529_49999757766.txt AC 63 ms 256 KB
subtask1_99999515530_2.txt AC 22 ms 256 KB
subtask1_99999999977_1.txt AC 46 ms 256 KB
subtask1_99999999977_2.txt AC 46 ms 256 KB
subtask1_99999999977_49999999989.txt AC 63 ms 256 KB
subtask1_99999999977_49999999990.txt AC 63 ms 256 KB
subtask1_99999999999_1.txt AC 46 ms 256 KB
subtask1_99999999999_100000000000.txt AC 63 ms 256 KB