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

Submission #855631

Source Code Expand

Copy
```#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <ctime>
#include <cstdlib>
#include <bitset>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
ll n , s , Min , tmp;

bool ok(int b){
ll p = 0;
for(ll x=n;x;x/=b)
p += x%b;
return p == s;
}

void check(ll b){
ll a = tmp / b , c = s - a;
if(a >= 0 && a <= b && c >= 0 && c <= b){
if(Min == -1 || Min > b + 1)
Min = b + 1;
}
}

int main(){
scanf("%lld%lld",&n,&s);
int up = sqrt(n) + 0.5;
for(int i=2;i<=up;++i) if(ok(i)){
printf("%d\n",i);
return 0;
}
if(n < s) return printf("-1\n") , 0;
tmp = n - s;
Min = -1;
for(int i=1;1ll*i*i<=tmp;++i) if(tmp % i == 0){
check(i);
check(tmp/i);
}
if(Min == -1 && n == s) Min = n + 1;
if(Min == -1) printf("-1\n");
else printf("%lld\n",Min);
return 0;
}
```

#### Submission Info

Submission Time 2016-08-28 21:27:07+0900 D - Digit Sum Y_UME C++14 (GCC 5.4.1) 500 1390 Byte AC 28 ms 256 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:46:28: 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 500 / 500
Status
 AC × 5
 AC × 47
Set Name Test Cases
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 4 ms 256 KB
subtask1_100000000000_100000000000.txt AC 22 ms 256 KB
subtask1_100000000000_2.txt AC 27 ms 256 KB
subtask1_100000000000_3.txt AC 27 ms 256 KB
subtask1_100000000000_50000000000.txt AC 26 ms 256 KB
subtask1_100000000000_50000000001.txt AC 26 ms 256 KB
subtask1_100000000000_99999999999.txt AC 22 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 5 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 AC 17 ms 256 KB
subtask1_49234683534_2461734011.txt AC 20 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 22 ms 256 KB
subtask1_68719476735_35.txt AC 11 ms 256 KB
subtask1_68719476735_36.txt AC 4 ms 256 KB
subtask1_68719476735_37.txt AC 23 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 AC 24 ms 256 KB
subtask1_79285169301_27.txt AC 4 ms 256 KB
subtask1_82914867733_1676425945.txt AC 25 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 27 ms 256 KB
subtask1_98750604051_977728851.txt AC 28 ms 256 KB
subtask1_99999515529_1.txt AC 22 ms 256 KB
subtask1_99999515529_316226.txt AC 28 ms 256 KB
subtask1_99999515529_316227.txt AC 28 ms 256 KB
subtask1_99999515529_316228.txt AC 28 ms 256 KB
subtask1_99999515529_49999757765.txt AC 26 ms 256 KB
subtask1_99999515529_49999757766.txt AC 26 ms 256 KB
subtask1_99999515530_2.txt AC 22 ms 256 KB
subtask1_99999999977_1.txt AC 28 ms 256 KB
subtask1_99999999977_2.txt AC 28 ms 256 KB
subtask1_99999999977_49999999989.txt AC 26 ms 256 KB
subtask1_99999999977_49999999990.txt AC 26 ms 256 KB
subtask1_99999999999_1.txt AC 28 ms 256 KB
subtask1_99999999999_100000000000.txt AC 22 ms 256 KB