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

Submission #856015

Source Code Expand

Copy
```#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define MOD 1000000007LL
#define endl "\n"
const ll UNDEF = -1;
const ll INF=1e18;
template<typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; }
template<typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; }
ll f(ll b,ll n) {
if (n<b) return n;
else return f(b,n/b)+(n%b);
}
ll solve(ll n, ll s) {
{
ll lim=sqrt(n)+5;
for (ll b=2;b<=lim;b++) {
if (f(b,n)==s) return b;
}
}
{
ll lim=sqrt(n)+5;
ll ans=INF;
for (ll x=1;x<=lim;x++) {
ll y=s-x;
if (y<0) continue;
ll lhs=n-y;
if (lhs%x==0) {
ll b=lhs/x;
//if (x==1) printf("ddx:%lld lhs:%lld b:%lld\n",x,lhs,b);
if (b>=lim&&x<b&&y<b) {
//printf("x:%lld lhs:%lld b:%lld\n",x,lhs,b);
chkmin(ans,b);
}
}
}
if (n==s) chkmin(ans,n+1);
if (ans>=INF) return -1;
return ans;
}
}
int main() {
ios_base::sync_with_stdio(false);
ll n,s; cin>>n>>s;
cout<<solve(n,s)<<endl;
}```

#### Submission Info

Submission Time 2016-08-28 21:43:15+0900 D - Digit Sum LiChenKoh C++14 (GCC 5.4.1) 500 1153 Byte AC 22 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 4 ms 256 KB
subtask1_100000000000_100000000000.txt AC 22 ms 256 KB
subtask1_100000000000_2.txt AC 17 ms 256 KB
subtask1_100000000000_3.txt AC 16 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 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 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 9 ms 256 KB
subtask1_68719476735_36.txt AC 4 ms 256 KB
subtask1_68719476735_37.txt AC 15 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 19 ms 256 KB
subtask1_79285169301_27.txt AC 4 ms 256 KB
subtask1_82914867733_1676425945.txt AC 21 ms 256 KB
subtask1_8594813796_75700.txt AC 6 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 16 ms 256 KB
subtask1_99999515529_316226.txt AC 22 ms 256 KB
subtask1_99999515529_316227.txt AC 17 ms 256 KB
subtask1_99999515529_316228.txt AC 22 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 16 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 16 ms 256 KB
subtask1_99999999999_100000000000.txt AC 21 ms 256 KB