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

Submission #856787

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 <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 pi M_PI

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;
else return f(b, n/b) + (n%b);
}

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

ll ans = -1;

if (n == s){
ans = n+1;
}else if ((n+1)/2 < s){
ans = -1;
}else{
FOR(i,2,sqrt(n)){
if (f(i, n) == s){
ans = i;
break;
}
}
if (ans == -1){
FORR(i,sqrt(n-1),1){
ll x = (n+i)/(i+1);
if (s > x) continue;
ans = n/(i+1) + 1 + x - s;
break;
}
}
}

cout << ans << endl;

return 0;
}
```

#### Submission Info

Submission Time 2016-08-28 22:21:28+0900 D - Digit Sum TangentDay C++14 (GCC 5.4.1) 0 1224 Byte WA 24 ms 256 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
 AC × 4 WA × 1
 AC × 31 WA × 16
Set Name Test Cases
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 4 ms 256 KB
subtask1_100000000000_100000000000.txt AC 4 ms 256 KB
subtask1_100000000000_2.txt WA 18 ms 256 KB
subtask1_100000000000_3.txt WA 18 ms 256 KB
subtask1_100000000000_50000000000.txt AC 24 ms 256 KB
subtask1_100000000000_50000000001.txt AC 4 ms 256 KB
subtask1_100000000000_99999999999.txt AC 4 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 4 ms 256 KB
subtask1_1_31415926535.txt AC 4 ms 256 KB
subtask1_239484768_194586924.txt AC 4 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 WA 12 ms 256 KB
subtask1_49234683534_2461734011.txt WA 19 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt WA 19 ms 256 KB
subtask1_68719476735_35.txt AC 10 ms 256 KB
subtask1_68719476735_36.txt AC 4 ms 256 KB
subtask1_68719476735_37.txt WA 16 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 WA 21 ms 256 KB
subtask1_79285169301_27.txt AC 4 ms 256 KB
subtask1_82914867733_1676425945.txt WA 22 ms 256 KB
subtask1_8594813796_75700.txt AC 6 ms 256 KB
subtask1_87654_12345.txt WA 4 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 4 ms 256 KB
subtask1_87654_45678.txt AC 4 ms 256 KB
subtask1_97822032312_49157112.txt WA 23 ms 256 KB
subtask1_98750604051_977728851.txt WA 24 ms 256 KB
subtask1_99999515529_1.txt AC 18 ms 256 KB
subtask1_99999515529_316226.txt WA 18 ms 256 KB
subtask1_99999515529_316227.txt AC 19 ms 256 KB
subtask1_99999515529_316228.txt WA 19 ms 256 KB
subtask1_99999515529_49999757765.txt AC 24 ms 256 KB
subtask1_99999515529_49999757766.txt AC 4 ms 256 KB
subtask1_99999515530_2.txt AC 18 ms 256 KB
subtask1_99999999977_1.txt WA 18 ms 256 KB
subtask1_99999999977_2.txt WA 19 ms 256 KB
subtask1_99999999977_49999999989.txt AC 24 ms 256 KB
subtask1_99999999977_49999999990.txt AC 4 ms 256 KB
subtask1_99999999999_1.txt WA 18 ms 256 KB
subtask1_99999999999_100000000000.txt AC 4 ms 256 KB