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

Submission #855360

Source Code Expand

Copy
```#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

ll N,S;

ll f(ll b,ll n) {
if(n<b) return n;
return f(b,n/b)+(n%b);
}

void solve() {
int i,j,k,l,r,x,y; string s;

cin>>N>>S;
if(S>N) return _P("-1\n");
if(N==S) return _P("%lld\n",N+1);
set<ll> SS;
for(ll b=2;b*b<=N;b++) {
if(f(b,N)==S) SS.insert(b);
}
for(ll p=1;p*p<N && p<=S;p++) {
ll m=S-p;
if(N-m>=0 && (N-m)%p==0) {
ll b=(N-m)/p;
if(b>p && b>m) SS.insert((N-m)/p);
}

}

if(SS.size()) return _P("%lld\n",*SS.begin());
return _P("-1\n");
}

int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
```

#### Submission Info

Submission Time 2016-08-28 21:16:31+0900 D - Digit Sum kmjp C++14 (GCC 5.4.1) 500 1193 Byte AC 23 ms 256 KB

#### 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 17 ms 256 KB
subtask1_100000000000_100000000000.txt AC 4 ms 256 KB
subtask1_100000000000_2.txt AC 17 ms 256 KB
subtask1_100000000000_3.txt AC 17 ms 256 KB
subtask1_100000000000_50000000000.txt AC 22 ms 256 KB
subtask1_100000000000_50000000001.txt AC 22 ms 256 KB
subtask1_100000000000_99999999999.txt AC 22 ms 256 KB
subtask1_16983563041_1.txt AC 11 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 11 ms 256 KB
subtask1_49234683534_2461734011.txt AC 17 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 18 ms 256 KB
subtask1_68719476735_35.txt AC 14 ms 256 KB
subtask1_68719476735_36.txt AC 14 ms 256 KB
subtask1_68719476735_37.txt AC 14 ms 256 KB
subtask1_68719476736_1.txt AC 15 ms 256 KB
subtask1_68719476736_2.txt AC 15 ms 256 KB
subtask1_72850192441_16865701.txt AC 20 ms 256 KB
subtask1_79285169301_27.txt AC 15 ms 256 KB
subtask1_82914867733_1676425945.txt AC 21 ms 256 KB
subtask1_8594813796_75700.txt AC 9 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 22 ms 256 KB
subtask1_98750604051_977728851.txt AC 22 ms 256 KB
subtask1_99999515529_1.txt AC 17 ms 256 KB
subtask1_99999515529_316226.txt AC 23 ms 256 KB
subtask1_99999515529_316227.txt AC 23 ms 256 KB
subtask1_99999515529_316228.txt AC 23 ms 256 KB
subtask1_99999515529_49999757765.txt AC 22 ms 256 KB
subtask1_99999515529_49999757766.txt AC 22 ms 256 KB
subtask1_99999515530_2.txt AC 17 ms 256 KB
subtask1_99999999977_1.txt AC 17 ms 256 KB
subtask1_99999999977_2.txt AC 17 ms 256 KB
subtask1_99999999977_49999999989.txt AC 22 ms 256 KB
subtask1_99999999977_49999999990.txt AC 22 ms 256 KB
subtask1_99999999999_1.txt AC 17 ms 256 KB
subtask1_99999999999_100000000000.txt AC 4 ms 256 KB