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

Submission #856278

Source Code Expand

Copy
```#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
if(p) cout << fixed << setprecision(p)  << a << "\n";
else cout << a << "\n";
}
// end of template

vector<ll> dec(ll n){
vector<ll> ret;
for(ll i = 1; i * i <= n; i++){
if(n % i == 0){
if(n / i == i) ret.pb(i);
else ret.pb(i), ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}

bool ok(ll b, ll n, ll s){ // nをb進法したものの各桁の和はsか?
ll ret = 0;
while(n > 0){
ret += n % b;
n /= b;
}
if (ret == s) return true;
else return false;
}

int main() {
cin.tie(0);
ios::sync_with_stdio(0);
// source code
ll n, s;
cin >> n >> s;
if(n == s){
output(n + 1, 0);
return 0;
}
if(n < s){
output(-1, 0);
return 0;
}
vector<ll> D = dec(n - s);
rep(i, D.size()) D[i]++;
rep(i, D.size()){
if(ok(D[i], n, s)){
output(D[i], 0);
return 0;
}
}
output(-1, 0);

return 0;
}```

#### Submission Info

Submission Time 2016-08-28 21:55:55+0900 D - Digit Sum ctyl C++14 (GCC 5.4.1) 500 1632 Byte AC 12 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 9 ms 256 KB
subtask1_100000000000_100000000000.txt AC 4 ms 256 KB
subtask1_100000000000_2.txt AC 10 ms 256 KB
subtask1_100000000000_3.txt AC 10 ms 256 KB
subtask1_100000000000_50000000000.txt AC 8 ms 256 KB
subtask1_100000000000_50000000001.txt AC 8 ms 256 KB
subtask1_100000000000_99999999999.txt AC 4 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 4 ms 256 KB
subtask1_239484768_194586924.txt AC 4 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 7 ms 256 KB
subtask1_49234683534_2461734011.txt AC 7 ms 256 KB
subtask1_4_1.txt AC 4 ms 256 KB
subtask1_58640129658_232122496.txt AC 8 ms 256 KB
subtask1_68719476735_35.txt AC 8 ms 256 KB
subtask1_68719476735_36.txt AC 8 ms 256 KB
subtask1_68719476735_37.txt AC 8 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 8 ms 256 KB
subtask1_79285169301_27.txt AC 9 ms 256 KB
subtask1_82914867733_1676425945.txt AC 9 ms 256 KB
subtask1_8594813796_75700.txt AC 5 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 10 ms 256 KB
subtask1_98750604051_977728851.txt AC 10 ms 256 KB
subtask1_99999515529_1.txt AC 9 ms 256 KB
subtask1_99999515529_316226.txt AC 9 ms 256 KB
subtask1_99999515529_316227.txt AC 9 ms 256 KB
subtask1_99999515529_316228.txt AC 9 ms 256 KB
subtask1_99999515529_49999757765.txt AC 8 ms 256 KB
subtask1_99999515529_49999757766.txt AC 12 ms 256 KB
subtask1_99999515530_2.txt AC 10 ms 256 KB
subtask1_99999999977_1.txt AC 9 ms 256 KB
subtask1_99999999977_2.txt AC 9 ms 256 KB
subtask1_99999999977_49999999989.txt AC 8 ms 256 KB
subtask1_99999999977_49999999990.txt AC 8 ms 256 KB
subtask1_99999999999_1.txt AC 9 ms 256 KB
subtask1_99999999999_100000000000.txt AC 4 ms 256 KB