Submission #5445924


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;


//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

ll f(ll b,ll n){
  if(n < b) return n;
  else{
    // cout << f(b,floor(n / b)) << endl;
    //cout << "hi" << endl;
    // cout << b << endl;
    // cout << n % b << endl;
    return f(b,floor(n / b)) + (n%b);
  }
}


vector<int> divisors(int n) {
    vector<int> res;
    for(int i = 1; i*i <= n; ++i) {
        if(n % i != 0) continue;
        res.push_back(i);
        if(n/i == i) continue; // 上の行で追加済み。
        res.push_back(n/i);
    }
    return res;
}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n,s;
  cin >> n >> s;


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

  if(s>n){
    cout << -1 << endl;
    return 0;
  }
  set<ll> st;
  for(ll i = 2; i*i <= n; i++){
    if(s == f(i,n)){
      st.insert(i);
    }
  }



  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 && f(b,n) == s) st.insert(b);
    }
  }
  if(st.size()) cout << *st.begin() << endl;
  else cout << -1 << endl;

  return 0;
}

Submission Info

Submission Time
Task D - 桁和 / Digit Sum
User edamame88
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1809 Byte
Status
Exec Time 15 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask1_87654_30.txt, subtask1_87654_138.txt, subtask1_87654_45678.txt, subtask1_31415926535_1.txt, subtask1_1_31415926535.txt
All 500 / 500 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 11 ms 256 KB
subtask1_100000000000_100000000000.txt 1 ms 256 KB
subtask1_100000000000_2.txt 11 ms 256 KB
subtask1_100000000000_3.txt 11 ms 256 KB
subtask1_100000000000_50000000000.txt 14 ms 256 KB
subtask1_100000000000_50000000001.txt 14 ms 256 KB
subtask1_100000000000_99999999999.txt 14 ms 256 KB
subtask1_16983563041_1.txt 5 ms 256 KB
subtask1_1_1.txt 1 ms 256 KB
subtask1_1_2.txt 1 ms 256 KB
subtask1_1_31415926535.txt 1 ms 256 KB
subtask1_239484768_194586924.txt 2 ms 256 KB
subtask1_2_1.txt 1 ms 256 KB
subtask1_2_2.txt 1 ms 256 KB
subtask1_31415926535_1.txt 7 ms 256 KB
subtask1_49234683534_2461734011.txt 11 ms 256 KB
subtask1_4_1.txt 1 ms 256 KB
subtask1_58640129658_232122496.txt 11 ms 256 KB
subtask1_68719476735_35.txt 9 ms 256 KB
subtask1_68719476735_36.txt 9 ms 256 KB
subtask1_68719476735_37.txt 9 ms 256 KB
subtask1_68719476736_1.txt 9 ms 256 KB
subtask1_68719476736_2.txt 9 ms 256 KB
subtask1_72850192441_16865701.txt 13 ms 256 KB
subtask1_79285169301_27.txt 10 ms 256 KB
subtask1_82914867733_1676425945.txt 13 ms 256 KB
subtask1_8594813796_75700.txt 5 ms 256 KB
subtask1_87654_12345.txt 1 ms 256 KB
subtask1_87654_138.txt 1 ms 256 KB
subtask1_87654_30.txt 1 ms 256 KB
subtask1_87654_4294967308.txt 1 ms 256 KB
subtask1_87654_45678.txt 1 ms 256 KB
subtask1_97822032312_49157112.txt 14 ms 256 KB
subtask1_98750604051_977728851.txt 15 ms 256 KB
subtask1_99999515529_1.txt 11 ms 256 KB
subtask1_99999515529_316226.txt 15 ms 256 KB
subtask1_99999515529_316227.txt 15 ms 256 KB
subtask1_99999515529_316228.txt 15 ms 256 KB
subtask1_99999515529_49999757765.txt 15 ms 256 KB
subtask1_99999515529_49999757766.txt 15 ms 256 KB
subtask1_99999515530_2.txt 11 ms 256 KB
subtask1_99999999977_1.txt 11 ms 256 KB
subtask1_99999999977_2.txt 11 ms 256 KB
subtask1_99999999977_49999999989.txt 15 ms 256 KB
subtask1_99999999977_49999999990.txt 14 ms 256 KB
subtask1_99999999999_1.txt 11 ms 256 KB
subtask1_99999999999_100000000000.txt 1 ms 256 KB