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

Submission #858767

Source Code Expand

Copy
```#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const long long INF = 0x3f3f3f3f3f3f3f3fLL;

long long n , s , n_s , t , rem , ans;
int tmp , cnt;

bool judge(long long b) {//判断b进制下的各位和是否等于s
rem = n;
t = 0;
while(rem > 0) {
t += rem % b;
rem /= b;
}
return t == s;
}

void solve() {
tmp = sqrt(0.0 + n);
n_s = n - s;
ans = (n == s ? n + 1 : INF);
for(int i = 2 ; i <= tmp ;++i) {//枚举到sqrt(n)
if(judge(i)) {
ans = min(ans , (long long) i);
}
if(n_s % i == 0 && judge(n_s / i + 1)) {//枚举所有的大于sqrt(b)且是n-s的因子的数
ans = min(ans , n_s / i + 1);
}
}
printf("%lld\n" , ans == INF ? -1 : ans);
}

int main() {
while(2 == scanf("%lld%lld", &n, &s)) {
solve();
}
return 0;
}
```

#### Submission Info

Submission Time 2016-08-29 16:17:17+0900 D - Digit Sum idealism C++14 (GCC 5.4.1) 0 934 Byte WA 2105 ms 128 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
 AC × 4 WA × 1
 AC × 36 WA × 10 TLE × 1
Set Name Test Cases
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 28 ms 128 KB
subtask1_100000000000_100000000000.txt TLE 2105 ms 128 KB
subtask1_100000000000_2.txt AC 28 ms 128 KB
subtask1_100000000000_3.txt WA 28 ms 128 KB
subtask1_100000000000_50000000000.txt WA 28 ms 128 KB
subtask1_100000000000_50000000001.txt AC 28 ms 128 KB
subtask1_100000000000_99999999999.txt AC 28 ms 128 KB
subtask1_16983563041_1.txt AC 13 ms 128 KB
subtask1_1_1.txt AC 2 ms 128 KB
subtask1_1_2.txt AC 2 ms 128 KB
subtask1_1_31415926535.txt AC 2 ms 128 KB
subtask1_239484768_194586924.txt AC 3 ms 128 KB
subtask1_2_1.txt WA 2 ms 128 KB
subtask1_2_2.txt AC 2 ms 128 KB
subtask1_31415926535_1.txt WA 17 ms 128 KB
subtask1_49234683534_2461734011.txt WA 20 ms 128 KB
subtask1_4_1.txt AC 2 ms 128 KB
subtask1_58640129658_232122496.txt AC 22 ms 128 KB
subtask1_68719476735_35.txt AC 23 ms 128 KB
subtask1_68719476735_36.txt AC 23 ms 128 KB
subtask1_68719476735_37.txt AC 23 ms 128 KB
subtask1_68719476736_1.txt AC 23 ms 128 KB
subtask1_68719476736_2.txt AC 24 ms 128 KB
subtask1_72850192441_16865701.txt AC 24 ms 128 KB
subtask1_79285169301_27.txt AC 25 ms 128 KB
subtask1_82914867733_1676425945.txt AC 26 ms 128 KB
subtask1_8594813796_75700.txt AC 10 ms 128 KB
subtask1_87654_12345.txt AC 2 ms 128 KB
subtask1_87654_138.txt AC 2 ms 128 KB
subtask1_87654_30.txt AC 2 ms 128 KB
subtask1_87654_4294967308.txt AC 2 ms 128 KB
subtask1_87654_45678.txt AC 2 ms 128 KB
subtask1_97822032312_49157112.txt AC 28 ms 128 KB
subtask1_98750604051_977728851.txt AC 28 ms 128 KB
subtask1_99999515529_1.txt AC 28 ms 128 KB
subtask1_99999515529_316226.txt AC 28 ms 128 KB
subtask1_99999515529_316227.txt AC 28 ms 128 KB
subtask1_99999515529_316228.txt AC 28 ms 128 KB
subtask1_99999515529_49999757765.txt WA 28 ms 128 KB
subtask1_99999515529_49999757766.txt AC 28 ms 128 KB
subtask1_99999515530_2.txt AC 28 ms 128 KB
subtask1_99999999977_1.txt WA 28 ms 128 KB
subtask1_99999999977_2.txt WA 28 ms 128 KB
subtask1_99999999977_49999999989.txt WA 28 ms 128 KB
subtask1_99999999977_49999999990.txt AC 28 ms 128 KB
subtask1_99999999999_1.txt WA 28 ms 128 KB
subtask1_99999999999_100000000000.txt AC 28 ms 128 KB