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

Submission #856127

Source Code Expand

Copy
```#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <istream>
#include <ostream>

#include <cstdlib>
#include <cmath>
#include <cstdio>

using namespace std;

#define fi first
#define se second
#define mkp make_pair
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define rep(i,n) for(ll i=0; i < (n); ++i)
#define rrep(i,n) for(ll i=((n)-1); i >= 0; --i)

#define OPLT(T) bool operator<(const T & lop_, const T & rop_)
#define OPEQ(T) bool operator==(const T & lop_, const T & rop_)

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

istream& operator>>(istream& istr, __float128& obj) { double d; istr >> d; obj = d; return istr; };
ostream& operator<<(ostream& ostr, __float128& obj) { ostr << static_cast<double>(obj); return ostr; };

template<class T>
T sqr(const T & a) {
return a * a;
}

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

int main() {
ll n, s;
ll b = -1;
cin >> n >> s;
for(ll i = 2; sqr(max(i-10,0ll)) <= n; i++) {
if(f(i, n) == s) {
b = i;
break;
}
}
if(n-s > 0) for(ll i = 1; sqr(max(i-10,0ll)) <= n; i++) {
if((n-s) % i == 0) {
ll bb = (n-s) / i + 1;
if(n/bb == i && n / bb < bb) {
if(b < 0) b = bb;
b = min(b, bb);
}
}
}
cout << b << endl;
return 0;
}
```

#### Submission Info

Submission Time 2016-08-28 21:48:05+0900 D - Digit Sum konjo C++14 (GCC 5.4.1) 0 1483 Byte WA 22 ms 256 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
 AC × 5
 AC × 46 WA × 1
Set Name Test Cases
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 10 ms 256 KB
subtask1_100000000000_100000000000.txt WA 16 ms 256 KB
subtask1_100000000000_2.txt AC 22 ms 256 KB
subtask1_100000000000_3.txt AC 22 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 6 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 6 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 14 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 9 ms 256 KB
subtask1_68719476735_37.txt AC 19 ms 256 KB
subtask1_68719476736_1.txt AC 8 ms 256 KB
subtask1_68719476736_2.txt AC 8 ms 256 KB
subtask1_72850192441_16865701.txt AC 19 ms 256 KB
subtask1_79285169301_27.txt AC 9 ms 256 KB
subtask1_82914867733_1676425945.txt AC 20 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 22 ms 256 KB
subtask1_98750604051_977728851.txt AC 22 ms 256 KB
subtask1_99999515529_1.txt AC 22 ms 256 KB
subtask1_99999515529_316226.txt AC 22 ms 256 KB
subtask1_99999515529_316227.txt AC 22 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 22 ms 256 KB
subtask1_99999999977_1.txt AC 22 ms 256 KB
subtask1_99999999977_2.txt AC 22 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 22 ms 256 KB
subtask1_99999999999_100000000000.txt AC 16 ms 256 KB