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

Submission #855816

Source Code Expand

Copy
```#include<cstdio>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<assert.h>
#include<sstream>
using namespace std;
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define rep(i,l,r) for(int i=(l);i<(r);++i)
#define setIO(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout);
typedef long long ll;
typedef pair<int, int> pii;
const ll LINF = 1e18 + 7;
const int N = 55;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const double EPS = 1e-8;
ll n, s;
ll f(ll b, ll n) {
if (n < b)
return n;
return f(b, n / b) + n % b;
}
ll solve() {
ll ret = -1;
if (n >= s) {
ll d = n - s;
for (ll b = 1, B = sqrt(d); b <= B; ++b)
if (d % b == 0) {
//				ll _b = b;
//				if (d / _b == n / (_b + 1)) {
//					if (ret == -1 || ret > _b + 1)
//						ret = _b + 1;
//				}
ll _b = d / b;
if (_b > sqrt(n) && d / _b == n / (_b + 1)) {
if (ret == -1 || ret > _b + 1)
ret = _b + 1;
}
}
}
for (ll b = 2, B = sqrt(n); b <= B; ++b)
if (f(b, n) == s) {
if (ret == -1 || ret > b)
ret = b;
break;
}
if (n == s && ret == -1)
ret = n + 1;
return ret;
}
int main() {
scanf("%lld%lld", &n, &s);
printf("%lld", solve());
return 0;
}
```

#### Submission Info

Submission Time 2016-08-28 21:34:58+0900 D - Digit Sum mcginn C++14 (GCC 5.4.1) 0 1404 Byte WA 21 ms 256 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:62:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld", &n, &s);
^
```

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
 AC × 5
 AC × 45 WA × 2
Set Name Test Cases
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 9 ms 256 KB
subtask1_100000000000_100000000000.txt AC 16 ms 256 KB
subtask1_100000000000_2.txt AC 21 ms 256 KB
subtask1_100000000000_3.txt AC 21 ms 256 KB
subtask1_100000000000_50000000000.txt AC 19 ms 256 KB
subtask1_100000000000_50000000001.txt AC 20 ms 256 KB
subtask1_100000000000_99999999999.txt AC 16 ms 256 KB
subtask1_16983563041_1.txt AC 6 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 WA 4 ms 256 KB
subtask1_2_2.txt AC 4 ms 256 KB
subtask1_31415926535_1.txt AC 13 ms 256 KB
subtask1_49234683534_2461734011.txt AC 16 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 17 ms 256 KB
subtask1_68719476735_35.txt AC 13 ms 256 KB
subtask1_68719476735_36.txt AC 8 ms 256 KB
subtask1_68719476735_37.txt AC 18 ms 256 KB
subtask1_68719476736_1.txt AC 8 ms 256 KB
subtask1_68719476736_2.txt AC 8 ms 256 KB
subtask1_72850192441_16865701.txt AC 18 ms 256 KB
subtask1_79285169301_27.txt AC 8 ms 256 KB
subtask1_82914867733_1676425945.txt AC 19 ms 256 KB
subtask1_8594813796_75700.txt AC 7 ms 256 KB
subtask1_87654_12345.txt AC 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 AC 21 ms 256 KB
subtask1_98750604051_977728851.txt AC 21 ms 256 KB
subtask1_99999515529_1.txt AC 21 ms 256 KB
subtask1_99999515529_316226.txt AC 21 ms 256 KB
subtask1_99999515529_316227.txt WA 21 ms 256 KB
subtask1_99999515529_316228.txt AC 21 ms 256 KB
subtask1_99999515529_49999757765.txt AC 19 ms 256 KB
subtask1_99999515529_49999757766.txt AC 19 ms 256 KB
subtask1_99999515530_2.txt AC 21 ms 256 KB
subtask1_99999999977_1.txt AC 21 ms 256 KB
subtask1_99999999977_2.txt AC 21 ms 256 KB
subtask1_99999999977_49999999989.txt AC 19 ms 256 KB
subtask1_99999999977_49999999990.txt AC 19 ms 256 KB
subtask1_99999999999_1.txt AC 21 ms 256 KB
subtask1_99999999999_100000000000.txt AC 16 ms 256 KB