Submission #856987


Source Code Expand

Copy
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <list>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(d) string(1,d)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll d[1005][1005];

#define MAX_V 1005
#define INF 1000000000

ll n;
ll s;

ll f2(ll a) {
  ll n1 = n;
  ll c = 0;
  while (1) {
    c += n1 % a;
    n1 /= a;
    if (n1 == 0)break;
  }
  return c;
}

ll f(ll a) {
  ll n1 = n;
  ll c = 0;
  while (1) {
    c += n1 % a;
    n1 /= a;
    if (n1 == 0)break;
  }
  if (c >= s)return 1;
  return 0;
}

int main() {
  cin >> n >> s;
  long long low = 2;
  long long high = 100000000011LL;

  while (low < high) {
    long long mid = (high + low) >> 1;

    if (f(mid) == 1) {
      high = mid;
    }
    else {
      low = mid + 1;
    }
  }
  ll mn = 100000000011LL;
  rep(i,max(2LL,low-100000),min(100000000000LL,low+100000)){
    if(f2(i)==s){
      mn = min(mn,i);
    }
  }
  if(mn ==  100000000011LL){
    cout << -1 << endl;
  }
  else{
    cout << mn << endl;
  }
  return 0;
}

Submission Info

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

Judge Result

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