Submission #2225461


Source Code Expand

//#include <bits/stdc++.h>
 
#include <iostream>
#include <algorithm>
 
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
 
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
 
 
using namespace std;
#define int long long
 
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
 
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
 
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
 
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
 
//debug
#define DEBUG 
 
#define DUMPOUT cout
 
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...) 
#endif
 
void dump_func() {DUMPOUT << endl;};
 
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
 
//ostream 
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}
 
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n;
int s;

vector<int> divisor(int n){
    vector<int> div;
    for (int i=1; i*i<=n; i++){
        if (n%i==0){
            div.push_back(i);
            if (i!=n/i) div.push_back(n/i);
        }
    }
    return div;
}

signed main() {	
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> s;
    if (n < s) {
        cout << -1 << endl;
        return 0;
    }
    vector<int> v = divisor(n);
    rep2(b, 2, 1000000 + 6) {
        int tmp = n;
        int ketawa = 0;
        while (tmp > 0) {
            ketawa += tmp % b;
            tmp /= b;
        }
        if (ketawa == s) {
            cout << b << endl;
            return 0;
        }
    }
    if (n <= 1e6) {
        cout << -1 << endl;
        return 0;
    }
    sort(all(v));
    int idx = -1;
    rep(i, v.size()) {
        if (v[i] > 1e6) {
            idx = i;
            break;
        }
    }
    rep2(i, idx, v.size()) {
        int k = n / v[i];
        if (s - k >= 0 && (s - k) % k == 0) {
            if (i == idx) {
                if (v[i] - (s - k) / k > 1e6) {
                    cout << v[i] - (s - k) / k << endl;
                    return 0;
                }
            }
            else {
                if (v[i] - (s - k) / k > v[i - 1]) {
                    cout << v[i] - (s - k) / k << endl;
                    return 0;
                }
            }
        }
    }

    if (n == s) {
        cout << n + 1 << endl;
        return 0;
    }
    cout << -1 << endl;
}

Submission Info

Submission Time
Task D - Digit Sum
User roto_37
Language C++14 (GCC 5.4.1)
Score 0
Code Size 4959 Byte
Status WA
Exec Time 28 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 5
AC × 38
WA × 9
Set Name Test Cases
Sample subtask1_87654_30.txt, subtask1_87654_138.txt, subtask1_87654_45678.txt, subtask1_31415926535_1.txt, subtask1_1_31415926535.txt
All subtask1_100000000000_1.txt, subtask1_100000000000_100000000000.txt, subtask1_100000000000_2.txt, subtask1_100000000000_3.txt, subtask1_100000000000_50000000000.txt, subtask1_100000000000_50000000001.txt, subtask1_100000000000_99999999999.txt, subtask1_16983563041_1.txt, subtask1_1_1.txt, subtask1_1_2.txt, subtask1_1_31415926535.txt, subtask1_239484768_194586924.txt, subtask1_2_1.txt, subtask1_2_2.txt, subtask1_31415926535_1.txt, subtask1_49234683534_2461734011.txt, subtask1_4_1.txt, subtask1_58640129658_232122496.txt, subtask1_68719476735_35.txt, subtask1_68719476735_36.txt, subtask1_68719476735_37.txt, subtask1_68719476736_1.txt, subtask1_68719476736_2.txt, subtask1_72850192441_16865701.txt, subtask1_79285169301_27.txt, subtask1_82914867733_1676425945.txt, subtask1_8594813796_75700.txt, subtask1_87654_12345.txt, subtask1_87654_138.txt, subtask1_87654_30.txt, subtask1_87654_4294967308.txt, subtask1_87654_45678.txt, subtask1_97822032312_49157112.txt, subtask1_98750604051_977728851.txt, subtask1_99999515529_1.txt, subtask1_99999515529_316226.txt, subtask1_99999515529_316227.txt, subtask1_99999515529_316228.txt, subtask1_99999515529_49999757765.txt, subtask1_99999515529_49999757766.txt, subtask1_99999515530_2.txt, subtask1_99999999977_1.txt, subtask1_99999999977_2.txt, subtask1_99999999977_49999999989.txt, subtask1_99999999977_49999999990.txt, subtask1_99999999999_1.txt, subtask1_99999999999_100000000000.txt
Case Name Status Exec Time Memory
subtask1_100000000000_1.txt AC 4 ms 256 KB
subtask1_100000000000_100000000000.txt AC 28 ms 256 KB
subtask1_100000000000_2.txt AC 28 ms 256 KB
subtask1_100000000000_3.txt AC 28 ms 256 KB
subtask1_100000000000_50000000000.txt WA 28 ms 256 KB
subtask1_100000000000_50000000001.txt AC 28 ms 256 KB
subtask1_100000000000_99999999999.txt AC 28 ms 256 KB
subtask1_16983563041_1.txt AC 3 ms 256 KB
subtask1_1_1.txt AC 1 ms 256 KB
subtask1_1_2.txt AC 1 ms 256 KB
subtask1_1_31415926535.txt AC 1 ms 256 KB
subtask1_239484768_194586924.txt AC 21 ms 256 KB
subtask1_2_1.txt AC 1 ms 256 KB
subtask1_2_2.txt AC 1 ms 256 KB
subtask1_31415926535_1.txt AC 25 ms 256 KB
subtask1_49234683534_2461734011.txt AC 26 ms 256 KB
subtask1_4_1.txt AC 1 ms 256 KB
subtask1_58640129658_232122496.txt WA 26 ms 256 KB
subtask1_68719476735_35.txt AC 8 ms 256 KB
subtask1_68719476735_36.txt AC 4 ms 256 KB
subtask1_68719476735_37.txt AC 27 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 WA 27 ms 256 KB
subtask1_79285169301_27.txt AC 4 ms 256 KB
subtask1_82914867733_1676425945.txt WA 27 ms 256 KB
subtask1_8594813796_75700.txt AC 4 ms 256 KB
subtask1_87654_12345.txt AC 2 ms 256 KB
subtask1_87654_138.txt AC 1 ms 256 KB
subtask1_87654_30.txt AC 1 ms 256 KB
subtask1_87654_4294967308.txt AC 1 ms 256 KB
subtask1_87654_45678.txt AC 13 ms 256 KB
subtask1_97822032312_49157112.txt WA 28 ms 256 KB
subtask1_98750604051_977728851.txt WA 28 ms 256 KB
subtask1_99999515529_1.txt AC 15 ms 256 KB
subtask1_99999515529_316226.txt WA 28 ms 256 KB
subtask1_99999515529_316227.txt AC 15 ms 256 KB
subtask1_99999515529_316228.txt AC 18 ms 256 KB
subtask1_99999515529_49999757765.txt AC 28 ms 256 KB
subtask1_99999515529_49999757766.txt WA 28 ms 256 KB
subtask1_99999515530_2.txt AC 15 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 28 ms 256 KB
subtask1_99999999977_49999999990.txt WA 28 ms 256 KB
subtask1_99999999999_1.txt AC 28 ms 256 KB
subtask1_99999999999_100000000000.txt AC 1 ms 256 KB