Submission #3388149
Source Code Expand
#include <bits/stdc++.h> #define For(i, j, k) for (int i = j; i <= k; ++ i) #define Forr(i, j, k) for (int i = j; i >= k; -- i) typedef long long ll; using namespace std; inline void File() { freopen("D.in", "r", stdin); freopen("D.out", "w", stdout); } ll n, s; inline ll calc(ll x, ll b) { ll res = 0; while (x) res += x % b, x /= b; return res; } int main() { cin >> n >> s; int lim = sqrt(n + 1); For(i, 2, lim + 1) if (calc(n, i) == s) return printf("%d\n", i), 0; Forr(x1, lim - 1, 1) { if ((n - s) % x1 > 0) continue; ll b = (n - s) / x1 + 1; if (b > lim && x1 <= s && s - x1 < b) { return printf("%lld\n", b), 0; } } if (n == s) return printf("%lld", n + 1), 0; puts("-1"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | LSTete |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 771 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt, example_03.txt, example_04.txt |
Subtask1 | example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
All | example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | WA | 1 ms | 256 KB |
example_02.txt | WA | 1 ms | 256 KB |
example_03.txt | WA | 1 ms | 256 KB |
example_04.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 1 ms | 256 KB |
subtask2_01.txt | WA | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 1 ms | 256 KB |
subtask2_06.txt | WA | 1 ms | 256 KB |
subtask2_07.txt | WA | 1 ms | 256 KB |
subtask2_08.txt | WA | 1 ms | 256 KB |
subtask2_09.txt | WA | 1 ms | 256 KB |
subtask2_10.txt | WA | 1 ms | 256 KB |
subtask2_11.txt | WA | 1 ms | 256 KB |