ソースコード 拡げる

Copy
```/* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rep1(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += (ll)s)
#define rrep1(n) rrep2(i_, n)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, a, b) rrep4(i, a, b, 1)
#define rrep4(i, a, b, s) for (ll i = (ll)(b) - 1; i >= (ll)(a); i -= (ll)s)
#define each(x, c) for (auto &&x : c)
#define fs first
#define sc second
#define all(c) begin(c), end(c)
using ui = unsigned;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const int inf = 1e9 + 10;
const ll inf_ll = 1e18 + 10;
const ll mod = 1e9 + 7;
const ll mod9 = 1e9 + 9;
const int dx[]{-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[]{0, -1, 0, 1, -1, -1, 1, 1};
template<class T, class U> void chmin(T &x, const U &y){ x = min<T>(x, y); }
template<class T, class U> void chmax(T &x, const U &y){ x = max<T>(x, y); }
struct prepare_ { prepare_(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(12); } } prepare__;
/* ]]] */

int main(){
ll n, s;
cin >> n >> s;
if (n == s) cout << n + 1 << endl, exit(0);
ll res = inf;
rep(i, 2, n){
if (i * i > n) break;
ll x = n, t = 0;
while (x) t += x % i, x /= i;
if (s == t) chmin(res, i);
}
rep(i, 1, n){
if (i * i > n) break;
if ((n - (s - i)) % i) continue;
ll b = (n - (s - i)) / i;
if (s - i >= b) continue;
if (i * b + s - i != n) continue;
chmin(res, b);
}
cout << (res == inf ? -1 : res) << endl;
}

```

#### 提出情報

提出日時 2016-08-29 19:02:36+0900 C - 高橋君とカード jin_matakich C++14 (GCC 5.4.1) 0 1844 Byte WA 4 ms 256 KB

#### ジャッジ結果

セット名 Sample Subtask1 All

 WA × 4
 WA × 12
 WA × 24
セット名 テストケース
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
ケース名 結果 実行時間 メモリ
example_01.txt WA 4 ms 256 KB
example_02.txt WA 4 ms 256 KB
example_03.txt WA 4 ms 256 KB
example_04.txt WA 4 ms 256 KB
subtask1_01.txt WA 4 ms 256 KB
subtask1_02.txt WA 4 ms 256 KB
subtask1_03.txt WA 4 ms 256 KB
subtask1_04.txt WA 4 ms 256 KB
subtask1_05.txt WA 4 ms 256 KB
subtask1_06.txt WA 4 ms 256 KB
subtask1_07.txt WA 4 ms 256 KB
subtask1_08.txt WA 4 ms 256 KB
subtask1_09.txt WA 4 ms 256 KB
subtask2_01.txt WA 4 ms 256 KB
subtask2_02.txt WA 4 ms 256 KB
subtask2_03.txt WA 4 ms 256 KB
subtask2_04.txt WA 4 ms 256 KB
subtask2_05.txt WA 4 ms 256 KB
subtask2_06.txt WA 4 ms 256 KB
subtask2_07.txt WA 4 ms 256 KB
subtask2_08.txt WA 4 ms 256 KB
subtask2_09.txt WA 4 ms 256 KB
subtask2_10.txt WA 4 ms 256 KB
subtask2_11.txt WA 4 ms 256 KB