s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1 value | original_language stringclasses 11 values | filename_ext stringclasses 1 value | status stringclasses 1 value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s522065197 | p04014 | u915647268 | 1587822118 | Python | Python (3.4.3) | py | Runtime Error | 527 | 3316 | 392 | n = int(input())
s = int(input())
sq = n**.5
ans = '-1'
for b in range(2, int(sq)+1):
sum = 0
tmp = n
while tmp//b != 0:
sum += tmp%b
tmp //= b
sum += tmp
if sum == s:
ans = b
break
if ans == '-1':
if sq.is_integer():
sq -= 1
for p in range(int(sq), 0, -1):
b = (n-s+p)/p
if b.is_integer():
b = int(b)
q = n%b
if p+q == s:
ans = b
break
print(ans)
|
s769105797 | p04014 | u915647268 | 1587822010 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 461 | n = int(input())
s = int(input())
sq = n**.5
ans = '-1'
for b in range(2, int(sq)+1):
sum = 0
tmp = n
while tmp//b != 0:
sum += tmp%b
tmp //= b
sum += tmp
if sum == s:
ans = b
break
if ans == '-1':
if sq.is_integer():
sq -= 1
for p in range(int(sq), 0, -1):
b = (n-s+p)/p
if b.is_integer():
sum = 0
tmp = n
while tmp//b != 0:
sum += tmp%b
tmp //= b
sum += tmp
if sum == s:
ans = int(b)
break
print(ans)
|
s357764175 | p04014 | u915647268 | 1587821392 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 431 | n = int(input())
s = int(input())
sq = n**.5
ans = '-1'
for b in range(2, int(sq)+1):
sum = 0
tmp = n
while tmp//b != 0:
sum += tmp%b
tmp //= b
sum += tmp
if sum == s:
ans = b
break
if ans == '-1':
if sq.is_integer():
sq -= 1
for p in range(int(sq), 0, -1):
b = int((n-s+p)/p)
sum = 0
tmp = n
while tmp//b != 0:
sum += tmp%b
tmp //= b
sum += tmp
if sum == s:
ans = b
break
print(ans)
|
s269254208 | p04014 | u559200744 | 1587282078 | Python | PyPy3 (2.4.0) | py | Runtime Error | 569 | 206492 | 461 | N = int(input())
S = int(input())
def f(b, n):
if n < b:
return n
else:
return f(b, int(n/b)) + (n % b)
def solve(N, S):
if N == S:
return N+1
else:
for b in range(2, int(N**(1/2))+1):
if f(b, N) == S:
return b
for p in range(1, int(N**(1/2))+1):
b = int((N - S) / p + 1)
if f(b, N) == S:
return b
return -1
print(solve(N, S)) |
s559302314 | p04014 | u679154596 | 1586483999 | Python | Python (3.4.3) | py | Runtime Error | 416 | 3064 | 608 | import math
n = int(input())
s = int(input())
b = -1
def keisan(k, w):
l = []
while k >= w:
l.append(k % w)
k = k // w
else:
l.append(k)
return (sum(l))
if n == s:
b = n + 1
print(b)
exit()
if n < s:
b = -1
print(b)
exit()
n_r = math.floor(math.sqrt(n))
for i in range(2, n_r+1):
if keisan(n, i) == s:
b = i
print(b)
exit()
for i in range(1, n_r+1):
w = n - s
syou = w // i
amari = w % i
if syou > n_r-1 and amari == 0:
b_list = []
b_kouho = syou + 1
b_list.append(b_kouho)
if b_list != []:
print(min(b_list))
else:
print(-1) |
s239476095 | p04014 | u939198091 | 1586402381 | Python | Python (3.4.3) | py | Runtime Error | 318 | 3948 | 462 | import math
def func(b,n):
if b > n:
return n
else:
return func(b, math.floor(n/b)) + (n % b)
def solve(n,s):
for b in range(2,math.floor(math.sqrt(n))+1):
if func(b,n) == s:
return b
for p in range(1,math.floor(math.sqrt(n))+1):
if (n-s) % p == 0:
b = int((n-s)/p)+1
if func(b, n) == s:
return b
return -1
if __name__ == "__main__":
n = int(input())
s = int(input())
ans = solve(n,s)
print(ans)
|
s062807455 | p04014 | u939198091 | 1586402303 | Python | PyPy3 (2.4.0) | py | Runtime Error | 549 | 133724 | 462 | import math
def func(b,n):
if b > n:
return n
else:
return func(b, math.floor(n/b)) + (n % b)
def solve(n,s):
for b in range(2,math.floor(math.sqrt(n))+1):
if func(b,n) == s:
return b
for p in range(1,math.floor(math.sqrt(n))+1):
if (n-s) % p == 0:
b = int((n-s)/p)+1
if func(b, n) == s:
return b
return -1
if __name__ == "__main__":
n = int(input())
s = int(input())
ans = solve(n,s)
print(ans)
|
s834202075 | p04014 | u547167033 | 1586391108 | Python | PyPy3 (2.4.0) | py | Runtime Error | 296 | 41692 | 351 | n=int(input())
s=int(input())
if s==n:
print(n+1)
exit()
def f(x):
m=n
t=[]
while m>0:
y=m%x
t.append(y)
m-=m%x
m//=x
return sum(t)
for b in range(2,int(n**0.5)+1):
if f(b)==s:
print(b)
exit()
for p in range(1,int(n**0.5)+1):
if (n-s)%p==0:
b=(n-s)//p+1
if f(b)==s:
print(b)
exit()
print(-1) |
s314470476 | p04014 | u968846084 | 1585796395 | Python | Python (3.4.3) | py | Runtime Error | 73 | 3188 | 290 | def D(n,d):
r=0
while n>0:
r=r+n%d
n=n//d
return r
n=int(input())
s=int(input())
if n-s==0:
print(n+1)
exit()
A=[]
for i in range(1,int((n-s)**(1/2))+1):
if (n-s)%i==0:
A.append(i)
for i in range(len(A)):
if D(n,A[i]+1)==s:
print(A[i]+1)
exit()
print(-1) |
s647262625 | p04014 | u968846084 | 1585796038 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3316 | 288 | def D(n,d):
r=0
while n>0:
r=r+n%d
n=n//d
return r
n=int(input())
s=int(input())
if n-s==-1:
print(n)
exit()
A=[]
for i in range(1,int((n-s)**(1/2))+3):
if (n-s)%i==0:
A.append(i)
for i in range(len(A)):
if D(n,A[i]+1)==s:
print(A[i]+1)
exit()
print(-1) |
s815214084 | p04014 | u968846084 | 1585795793 | Python | Python (3.4.3) | py | Runtime Error | 72 | 3572 | 256 | def D(n,d):
r=0
while n>0:
r=r+n%d
n=n//d
return r
n=int(input())
s=int(input())
A=[]
for i in range(1,int((n-s)**(1/2))+3):
if (n-s)%i==0:
A.append(i)
for i in range(len(A)):
if D(n,A[i]+1)==s:
print(A[i]+1)
exit()
print(-1) |
s064948198 | p04014 | u893063840 | 1584018434 | Python | Python (3.4.3) | py | Runtime Error | 400 | 3936 | 472 | from math import floor, sqrt, ceil
def f(b, n):
if n < b:
return n
return f(b, floor(n / b)) + n % b
n = int(input())
s = int(input())
if n == s:
print(n + 1)
exit()
for b in range(2, floor(sqrt(n)) + 1):
if f(b, n) == s:
print(b)
exit()
for p in range(1, ceil(sqrt(n)))[::-1]:
b = (n - s) / p + 1
if b.is_integer():
b = int(b)
if f(b, n) == s:
print(b)
exit()
print(-1)
|
s729322023 | p04014 | u021916304 | 1583994651 | Python | Python (3.4.3) | py | Runtime Error | 293 | 3064 | 638 | import math
import sys
sys.setrecursionlimit(10000000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s >= n
if s == n:
print(n+1)
exit()
elif s > n:
print(-1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(1,int(up)+1)[::-1]:
if (n-s)%j == 0:
b = (n-s)/j + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s724008870 | p04014 | u021916304 | 1583994410 | Python | Python (3.4.3) | py | Runtime Error | 1521 | 689896 | 601 | import math
import sys
sys.setrecursionlimit(10000000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num <= base:
return num
else:
return num%base + colsum(num//base,base)
#s >= n
if s == n:
print(n+1)
exit()
elif s > n:
print(-1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(1,int(up)+1):
b = int((n-s)/j) + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s334935543 | p04014 | u021916304 | 1583994185 | Python | Python (3.4.3) | py | Runtime Error | 1520 | 689896 | 610 | import math
import sys
sys.setrecursionlimit(10000000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s = n(n<b)
if s == n:
print(n+1)
exit()
#s > n
if s > n:
print(-1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(1,int(up)+1):
b = int((n-s)/j) + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s330195988 | p04014 | u021916304 | 1583994157 | Python | Python (3.4.3) | py | Runtime Error | 1507 | 689896 | 611 | import math
import sys
sys.setrecursionlimit(10000000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s = n(n<b)
if s == n:
print(n+1)
exit()
#s > n
if s == n:
print(-1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(1,int(up)+1):
b = int((n-s)/j) + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s043086601 | p04014 | u021916304 | 1583994042 | Python | Python (3.4.3) | py | Runtime Error | 1525 | 689896 | 567 | import math
import sys
sys.setrecursionlimit(10000000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s = n(n<b)
if s == n:
print(n+1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(1,int(up)+1):
b = int((n-s)/j) + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s896417956 | p04014 | u021916304 | 1583993938 | Python | Python (3.4.3) | py | Runtime Error | 1367 | 702580 | 599 | import math
import sys
sys.setrecursionlimit(10000000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s = n(n<b)
if s == n:
print(n+1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(1,int(up)+1):
if (n-s)%j == 0:
b = (n-s)/j + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s902313146 | p04014 | u021916304 | 1583993688 | Python | Python (3.4.3) | py | Runtime Error | 481 | 95372 | 599 | import math
import sys
sys.setrecursionlimit(100000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s = n(n<b)
if s == n:
print(n+1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(2,int(up)+1):
# if (n-s)%j == 0:
b = (n-s)//j + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s145141647 | p04014 | u021916304 | 1583993461 | Python | Python (3.4.3) | py | Runtime Error | 285 | 96956 | 599 | import math
import sys
sys.setrecursionlimit(100000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return num%base + colsum(num//base,base)
#s = n(n<b)
if s == n:
print(n+1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(2,int(up)+1):
if (n-s)%j == 0:
b = (n-s)/j + 1
if s == colsum(n,b) and b > 1:
print(i)
exit()
print(-1) |
s042131133 | p04014 | u021916304 | 1583993103 | Python | Python (3.4.3) | py | Runtime Error | 377 | 92192 | 593 | import math
import sys
sys.setrecursionlimit(100000)
n = int(input())
s = int(input())
up = math.sqrt(n)
def colsum(num, base):
if num < base:
return num
else:
return colsum(math.floor(num/base),base)+num%base
#s = n
if s == n:
print(n+1)
exit()
#sqrt(n)まで探索
for i in range(2,int(up)+1):
if s == colsum(n,i):
print(i)
exit()
#2桁しかあり得ない場合(sqrt(n)<b<n)
for j in range(2,int(up)+1):
if (n-s)%j == 0:
b = (n-s)/j + 1
if s == colsum(n,b):
print(i)
exit()
print(-1) |
s726598110 | p04014 | u237316771 | 1582396201 | Python | Python (3.4.3) | py | Runtime Error | 324 | 3912 | 862 | #!/usr/bin/env python3
import sys
def f(b: int, n: int) -> int:
if n < b:
return n
return f(b, n // b) + n % b
def solve(n: int, s: int):
for b in range(2, int(n ** 0.5) + 1):
if f(b, n) == s:
print(b)
return
for p in reversed(range(int(n ** 0.5))):
q = s - p
if p == 0:
b, r = n + 1, 0
else:
b, r = divmod(n - q, p)
if r != 0 or b == 1:
continue
if f(b, n) == s:
print(b)
return
print(-1)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
n = int(next(tokens)) # type: int
s = int(next(tokens)) # type: int
solve(n, s)
if __name__ == '__main__':
main()
|
s538372789 | p04014 | u237316771 | 1582396025 | Python | Python (3.4.3) | py | Runtime Error | 323 | 3940 | 844 | #!/usr/bin/env python3
import sys
def f(b: int, n: int) -> int:
if n < b:
return n
return f(b, n // b) + n % b
def solve(n: int, s: int):
for b in range(2, int(n ** 0.5) + 1):
if f(b, n) == s:
print(b)
return
for p in reversed(range(int(n ** 0.5))):
q = s - p
if p == 0:
b, r = n + 1, 0
else:
b, r = divmod(n - q, p)
if r != 0:
continue
if f(b, n) == s:
print(b)
return
print(-1)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
n = int(next(tokens)) # type: int
s = int(next(tokens)) # type: int
solve(n, s)
if __name__ == '__main__':
main()
|
s404702083 | p04014 | u627600101 | 1582154150 | Python | Python (3.4.3) | py | Runtime Error | 649 | 3188 | 717 | n=int(input())
s=int(input())
No=0
if n==s:
print(n+1)
No =1
else:
for b in range(2,int(n**0.5)+2):
m=0
N=n
while N!=0:
m+=N%b
N=N//b
if m>s:
break
if m==s:
print(b)
No=1
exit()
for p in range(int(n**0.5-1),0,-1):
b = float(n-s)/float(p)+1.0
if abs(b-int(b))<10**(-10):
b=int(b)
m=0
N=n
while N!=0:
m+=N%b
N=N//b
if m>s:
break
if m==s:
print(b)
No=1
exit()
if No==0:
print(-1) |
s934811110 | p04014 | u627600101 | 1582153743 | Python | Python (3.4.3) | py | Runtime Error | 632 | 3188 | 717 | n=int(input())
s=int(input())
No=0
if n==s:
print(n+1)
No =1
else:
for b in range(2,int(n**0.5)+1):
m=0
N=n
while N!=0:
m+=N%b
N=N//b
if m>s:
break
if m==s:
print(b)
No=1
exit()
for p in range(int(n**0.5-1),0,-1):
b = float(n-s)/float(p)+1.0
if abs(b-int(b))<10**(-10):
b=int(b)
m=0
N=n
while N!=0:
m+=N%b
N=N//b
if m>s:
break
if m==s:
print(b)
No=1
exit()
if No==0:
print(-1) |
s028099006 | p04014 | u628976407 | 1580943817 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3056 | 152 | def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
print(Base_10_to_n(input(),input())) |
s529363230 | p04014 | u788137651 | 1580351443 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2107 | 66136 | 1861 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N = I()
S = I()
if N==S:
print(N+1)
return
def check(N,b):
res = 0
while N:
res += N%b
N//=b
return res == S
for b in range(2,int(sqrt(N)+1)):
if check(N,b):
print(b)
return
for p in range(1,int(sqrt(N)+1))[::-1]:
b = (N-S+p)//p
if check(N,b):
print(b)
return
print(-1)
if __name__ == '__main__':
main() |
s585992966 | p04014 | u788137651 | 1580349618 | Python | PyPy3 (2.4.0) | py | Runtime Error | 376 | 66064 | 2072 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N = I()
S = I()
if N==S:
print(N+1)
return
def check(N,b):
res = 0
while N:
res += N%b
N//=b
return res == S
for b in range(2,int(sqrt(N)+1)):
if check(N,b):
print(b)
return
raise Exception
for p in range(1,int(sqrt(N))):
b = (N-S)//p + 1
if check(N,b):
print(b)
return
else:
continue
if S < p:
break
q = S - p
N_ = N - q
if N_ % p == 0 and 0 <= q < N_//p:
print(N_//p)
return
print(-1)
if __name__ == '__main__':
main() |
s550892449 | p04014 | u788137651 | 1580349588 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2108 | 67552 | 2052 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N = I()
S = I()
if N==S:
print(N+1)
return
def check(N,b):
res = 0
while N:
res += N%b
N//=b
return res == S
for b in range(2,int(sqrt(N)+1)):
if check(N,b):
print(b)
return
for p in range(1,int(sqrt(N))):
b = (N-S)//p + 1
if check(N,b):
print(b)
return
else:
continue
if S < p:
break
q = S - p
N_ = N - q
if N_ % p == 0 and 0 <= q < N_//p:
print(N_//p)
return
print(-1)
if __name__ == '__main__':
main() |
s983161477 | p04014 | u892538842 | 1577414896 | Python | Python (3.4.3) | py | Runtime Error | 510 | 3960 | 460 | import math
def f(b, n):
if n < b:
return n
else:
return f(b, n // b) + n % b
n = int(input())
s = int(input())
def find_b(n, s):
if n == s:
return -1
p = int(math.sqrt(n))
i = 2
while i < (n-s)/p + 1:
if f(i, n) == s:
return i
i += 1
while p >= 1:
b = int((n-s)/p + 1)
if f(b, n) == s:
return b
p -= 1
return -1
print(find_b(n, s)) |
s989968993 | p04014 | u892538842 | 1577414714 | Python | Python (3.4.3) | py | Runtime Error | 528 | 3964 | 427 | import math
def f(b, n):
if n < b:
return n
else:
return f(b, n // b) + n % b
n = int(input())
s = int(input())
def find_b(n, s):
p = int(math.sqrt(n))
i = 2
while i < (n-s)/p + 1:
if f(i, n) == s:
return i
i += 1
while p >= 1:
b = int((n-s)/p + 1)
if f(b, n) == s:
return b
p -= 1
return -1
print(find_b(n, s)) |
s787759852 | p04014 | u906428167 | 1577397718 | Python | PyPy3 (2.4.0) | py | Runtime Error | 324 | 42140 | 500 | n = int(input())
s = int(input())
ans = float('inf')
for b in range(2, 10**6):
res = n
tmp = 0
while res > 0:
tmp += res % b
res = (res-res % b)//b
if tmp == s:
ans = min(ans, b)
if n < 10**6:
print(ans if ans != float('inf') else -1)
exit()
for p in range(1, 10**6):
if (n-s) % p != 0:
continue
else:
b = (n-s)//p + 1
if n % b == s-p:
ans = min(ans, b)
print(ans if ans != float('inf') else -1) |
s033708855 | p04014 | u905582793 | 1577204998 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | n,s=int(input())
if n*2<=s+1:
print(s-n+1)
else:
print(-1) |
s734665465 | p04014 | u141786930 | 1576385515 | Python | Python (3.4.3) | py | Runtime Error | 599 | 4056 | 458 | import math
n = int(input())
s = int(input())
ans = -1
def func(b, n):
if n < b:
return n
else:
return func(b, n//b) + n%b
if n < s:
ans = -1
elif n == s:
ans = n+1
else:
for b in range(2,int(math.sqrt(n))):
if func(b, n) == s:
ans = b
break
if ans == -1:
for p in range(1,int(math.sqrt(n))):
if func((n-s)/p+1, n) == s:
ans = int((n-s)/p+1)
print(ans) |
s109418030 | p04014 | u141786930 | 1576385345 | Python | Python (3.4.3) | py | Runtime Error | 220 | 3944 | 458 | import math
n = int(input())
s = int(input())
ans = -1
def func(b, n):
if n < b:
return n
else:
return func(b, n//b) + n%b
if n > s:
ans = -1
elif n == s:
ans = n+1
else:
for b in range(2,int(math.sqrt(n))):
if func(b, n) == s:
ans = b
break
if ans == -1:
for p in range(1,int(math.sqrt(n))):
if func((n-s)/p+1, n) == s:
ans = int((n-s)/p+1)
print(ans) |
s435239683 | p04014 | u440566786 | 1575120738 | Python | PyPy3 (2.4.0) | py | Runtime Error | 211 | 41456 | 654 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def f(b,n):
if(n<b): return n
return f(b,n//b)+n%b
def resolve():
n=int(input())
s=int(input())
if(s>n):
print(-1)
return
if(s==n):
print(n+1)
return
k=int(n**.5)
for b in range(2,k+1):
if(f(b,n)==s):
print(b)
return
B=[]
for p in range(1,b):
q=s-p
if(0>q or b-1<q): continue
if((n-q)%p): continue
t=(n-q)//p
if(k<t<=n):
B.append(t)
print(min(B) if(B) else -1)
resolve() |
s895197228 | p04014 | u912115033 | 1574025212 | Python | Python (3.4.3) | py | Runtime Error | 289 | 3952 | 581 | def f(p, q):
if q < p:
return q
else:
return f(p, q//p) + q%p
n = int(input())
s = int(input())
flag = 0
if n < s:
print(-1)
flag = 1
if flag == 0 and n == s:
print(n+1)
flag = 0
if flag == 0:
for i in range(2, int(n**0.5)+2):
if f(i, n) == s:
print(i)
flag = 1
break
if flag == 0:
for i in range(1, int(n**0.5)+2):
if (n-s)%i == 0:
if f((n-s)//i+1, n) == s:
print((n-s)//i+1)
flag = 1
break
if flag == 0:
print(-1) |
s007057864 | p04014 | u912115033 | 1574024700 | Python | Python (3.4.3) | py | Runtime Error | 280 | 3956 | 529 | def f(p, q):
if q < p:
return q
else:
return f(p, q//p) + q%p
n = int(input())
s = int(input())
flag = 0
if n < s:
print(-1)
flag = 1
if flag == 0:
for i in range(2, int(n**0.5)+2):
if f(i, n) == s:
print(i)
flag = 1
break
if flag == 0:
for i in range(1, int(n**0.5)+2):
if (n-s)%i == 0:
if f((n-s)//i+1, n) == s:
print((n-s)//i+1)
flag = 1
break
if flag == 0:
print(-1) |
s407969608 | p04014 | u912115033 | 1574024348 | Python | Python (3.4.3) | py | Runtime Error | 283 | 3948 | 562 | def f(p, q):
if q < p:
return q
else:
return f(p, q//p) + q%p
n = int(input())
s = int(input())
flag = 0
if s == 1:
print(n)
flag=1
if n == 1:
print(-1)
flag=1
if flag == 0:
for i in range(2, int(n**0.5)+2):
if f(i, n) == s:
print(i)
flag = 1
break
if flag == 0:
for i in range(2, int(n**0.5)+2):
if (n-s)%i == 0:
if f((n-s)//i+1, n) == s:
print((n-s)//i+1)
flag = 1
break
if flag == 0:
print(-1) |
s460886565 | p04014 | u912115033 | 1574023890 | Python | Python (3.4.3) | py | Runtime Error | 289 | 4068 | 528 | def f(p, q):
if q < p:
return q
else:
return f(p, q//p) + q%p
n = int(input())
s = int(input())
flag = 0
if s == 1:
print(n)
flag=1
if n == 1:
print(-1)
flag=1
for i in range(2, int(n**0.5)+2):
if f(i, n) == s:
print(i)
flag = 1
break
if flag == 0:
for i in range(2, int(n**0.5)+2):
if (n-s)%i == 0:
if f((n-s)//i+1, n) == s:
print((n-s)//i+1)
flag = 1
break
if flag == 0:
print(-1) |
s784972379 | p04014 | u606878291 | 1573413699 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 766 | import math
def digit_sum(b, n):
if b > n:
return n
else:
return digit_sum(b=b, n=n // b) + n % b
def main(n, s):
if s > n:
return -1
elif n == s:
return n + 1
else:
sqrt_n = int(math.sqrt(n))
for b in range(2, sqrt_n + 1):
if digit_sum(b, n) == s:
return b
b_min = 1L << 55
for p in range(1, sqrt_n):
if (n - s) % p == 0:
b = int((n - s) / p + 1)
if digit_sum(b, n) == s:
b_min = min(b_min, b)
p += 1
if b_min == 1L << 55:
return -1
else:
return b_min
if __name__ == '__main__':
N = int(input())
S = int(input())
print(main(n=N, s=S))
|
s552194483 | p04014 | u606878291 | 1573411759 | Python | Python (3.4.3) | py | Runtime Error | 426 | 3064 | 639 | import math
def digit_sum(b, n):
if b > n:
return n
else:
return digit_sum(b=b, n=n // b) + n % b
def main(n, s):
if n == s:
return n + 1
elif s == 1:
return n
elif s > n:
return -1
else:
sqrt_n = int(math.sqrt(n))
for b in range(2, sqrt_n + 1):
if digit_sum(b, n) == s:
return b
for p in range(1, sqrt_n + 1):
b = (n - s) // (p + 1)
if digit_sum(b, n) == s:
return b
return -1
if __name__ == '__main__':
N = int(input())
S = int(input())
print(main(n=N, s=S))
|
s111596999 | p04014 | u638795007 | 1573282952 | Python | PyPy3 (2.4.0) | py | Runtime Error | 218 | 40300 | 816 | def examD():
n = I(); s = I()
ans = -1
if s==n:
ans = n+1
else:
loop = int(n**(0.5))
for b in range(2,loop+1):
cur = n
ansC = 0
while cur>0:
ansC += cur%b
cur = cur//b
if ansC==s:
ans = b
break
if ans==-1:
for p in range(loop,0,-1):
bcandi = (n-s)//p + 1
ansC = n%bcandi + n//bcandi
if ansC==s:
ans = int(bcandi)
break
print(ans)
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examD()
|
s089935146 | p04014 | u638795007 | 1573282556 | Python | PyPy3 (2.4.0) | py | Runtime Error | 254 | 41308 | 814 | def examD():
n = I(); s = I()
ans = -1
if s==n:
ans = n+1
else:
loop = int(n**(0.5))
for i in range(2,loop+1):
cur = n
ansC = 0
while cur>0:
ansC += cur%i
cur = cur//i
if ansC==s:
ans = i
break
if ans==-1:
for p in range(loop,0,-1):
bcandi = (n-s)/p + 1
ansC = n%bcandi + n//bcandi
if ansC==s:
ans = int(bcandi)
break
print(ans)
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examD() |
s504244994 | p04014 | u638795007 | 1573281910 | Python | PyPy3 (2.4.0) | py | Runtime Error | 254 | 41180 | 818 | def examD():
n = I(); s = I()
ans = -1
if s==n:
ans = n+1
else:
loop = int(n**(0.5))
for i in range(2,loop+1):
cur = n
ansC = int(0)
while cur>0:
ansC += cur%i
cur = cur//i
if ansC==s:
ans = i
break
if ans==-1:
for p in range(1,loop+1):
bcandi = (n-s)/p + 1
ansC = n%bcandi + n//bcandi
if ansC==s:
ans = int(bcandi)
break
print(ans)
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examD() |
s363652002 | p04014 | u143278390 | 1572745194 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4028 | 864 | import math
import sys
import math
n=int(input())
s=int(input())
def f(b,n):
if(n<b):
return n
else:
return f(b,math.floor(n/b))+ n%b
if(s==n):
print(n+1)
sys.exit()
for b in range(2,int(math.sqrt(n))):
if(f(b,n)==s):
print(b)
sys.exit()
for b in range(int(math.sqrt(n)),n+1):
b=(n-s)//b+1
if(f(b,n)==s):
print(b)
sys.exit()
print(-1)
'''
N = int(input())
S = int(input())
def f(b,n):
if n//b==0:
return n
else:
return n%b + f(b,n//b)
ans = -1
if S==N:
ans = N+1
else:
for b in range(2,int(N**.5)+1):
if f(b,N)==S:
ans = b
break
if ans == -1:
for i in range(int(N**.5),0,-1):
b = (N-S)//i + 1
if b>1:
if f(b,N)==S:
ans = b
break
print(ans)
''' |
s137055222 | p04014 | u143278390 | 1572744494 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3964 | 402 | import math
import sys
import math
n=int(input())
s=int(input())
def f(b,n):
if(n<b):
return n
else:
return f(b,math.floor(n/b))+ n%b
if(s==n):
print(n+1)
sys.exit()
for b in range(2,int(math.sqrt(n))):
if(f(b,n)==s):
print(b)
sys.exit()
for b in range(int(math.sqrt(n)),n+1):
if(f(b,n)==s):
print(b)
sys.exit()
print(-1)
|
s877399483 | p04014 | u190086340 | 1572635782 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2111 | 531408 | 684 | import math
def f(n, base):
X_dumy = base
lis = []
while X_dumy > 0:
lis.append(X_dumy % n)
X_dumy = X_dumy // n
return sum(lis)
def solve():
N, S = int(input()), int(input())
# print(N, S)
if N == S:
return N + 1
for b in range(2, int(math.sqrt(N)) + 1):
if f(b, N) == S:
return b
largest = N**2
lowest = largest
for p in range(1, int(math.sqrt(N)) + 1):
b = int((N - S) / p + 1)
if f(b, N) == S:
lowest = min(lowest, b)
if not lowest == largest:
return lowest
return -1
if __name__ == '__main__':
res = solve()
print(res)
|
s646662521 | p04014 | u190086340 | 1572635536 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2110 | 592660 | 679 | import math
def f(n, base):
X_dumy = base
lis = []
while X_dumy > 0:
lis.append(X_dumy % n)
X_dumy = int(X_dumy / n)
return sum(lis)
def solve():
N, S = int(input()), int(input())
# print(N, S)
if N == S:
return N + 1
for b in range(2, int(math.sqrt(N)) + 1):
if f(b, N) == S:
return b
largest = N**2
lowest = largest
for p in range(1, int(math.sqrt(N)) + 1):
b = int((N - S) / p + 1)
if f(b, N) == S:
lowest = min(lowest, b)
if not lowest == largest:
return lowest
return -1
if __name__ == '__main__':
res = solve()
print(res)
|
s664112753 | p04014 | u190086340 | 1572634456 | Python | PyPy3 (2.4.0) | py | Runtime Error | 299 | 44892 | 852 | import math
def f(base, n):
# 10進数 n を, base 進数に変換して各桁を足し合わせる
lis = []
while n > 0:
# print('除', n // base, 'あまり', n % base)
lis.append(n % base)
n = n // base
return sum(lis)
def solve():
N, S = int(input()), int(input())
# print(N, S)
if N == S:
return N + 1
for b in range(2, int(math.sqrt(N)) + 1):
if f(b, N) == S:
return b
largest = N ** 2
lowest = largest
for p in range(1, int(math.sqrt(N)) + 1):
buf = (N - S) / p
if buf.is_integer():
if f(buf + 1, N) == S:
b = int(buf + 1)
lowest = min(lowest, b)
if not lowest == largest:
return lowest
return -1
if __name__ == '__main__':
res = solve()
print(res)
|
s093246538 | p04014 | u190086340 | 1572633744 | Python | PyPy3 (2.4.0) | py | Runtime Error | 284 | 43740 | 850 | import math
def f(base, n):
# 10進数 n を, base 進数に変換して各桁を足し合わせる
lis = []
while n > 0:
# print('除', n // base, 'あまり', n % base)
lis.append(n % base)
n = n // base
return sum(lis)
def solve():
N, S = int(input()), int(input())
# print(N, S)
if N == S:
return N + 1
for b in range(2, int(math.sqrt(N)) + 1):
if f(b, N) == S:
return b
largest = N + 2
lowest = largest
for p in range(1, int(math.sqrt(N)) + 1):
buf = (N - S) / p
if buf.is_integer():
if f(buf + 1, N) == S:
b = int(buf + 1)
lowest = min(lowest, b)
if not lowest == largest:
return lowest
return -1
if __name__ == '__main__':
res = solve()
print(res)
|
s075604327 | p04014 | u190086340 | 1572633298 | Python | PyPy3 (2.4.0) | py | Runtime Error | 281 | 43228 | 838 | import math
def f(base, n):
# 10進数 n を, base 進数に変換して各桁を足し合わせる
lis = []
while n > 0:
# print('除', n // base, 'あまり', n % base)
lis.append(n % base)
n = n // base
return sum(lis)
def solve():
N, S = int(input()), int(input())
# print(N, S)
if N == S:
return N + 1
for b in range(2, int(math.sqrt(N))):
if f(b, N) == S:
return b
largest = N + 2
lowest = largest
for p in range(1, int(math.sqrt(N))):
buf = (N - S) / p
if buf.is_integer():
if f(buf + 1, N) == S:
b = int(buf + 1)
lowest = min(lowest, b)
if not lowest == largest:
return lowest
return -1
if __name__ == '__main__':
res = solve()
print(res)
|
s683508850 | p04014 | u190086340 | 1572464822 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 385 | import math
def solve():
N, S = int(input()), int(input())
# print(N, S)
floor = math.floor
def f(b, n):
if n < b:
return n
if n >= b:
return f(b, floor(n / b)) + (n % b)
for b in range(2, N):
if f(b, N) == S:
return b
return -1
if __name__ == '__main__':
res = oracle()
print(res)
|
s016716029 | p04014 | u474423089 | 1570676359 | Python | Python (3.4.3) | py | Runtime Error | 406 | 3964 | 513 | import math
def f(b,n):
if n<b:
return n
return f(b,n//b)+n%b
def main():
n=int(input())
s=int(input())
if n==s:
return n+1
elif n <s:
return -1
else:
for b in range(2,int(math.sqrt(n))+2):
if f(b,n)==s:
print(b)
exit()
for p in range(int(math.sqrt(n-s)+1),0,-1):
b=(n-s)//p+1
if f(b,n)==s:
return b
return -1
if __name__ == '__main__':
print(main())
|
s198008203 | p04014 | u474423089 | 1570676153 | Python | Python (3.4.3) | py | Runtime Error | 435 | 3960 | 562 | import math
def f(b,n):
if n<b:
return n
return f(b,n//b)+n%b
def main():
n=int(input())
s=int(input())
if n==s:
print(n+1)
exit()
elif n <s:
print(-1)
exit()
else:
for b in range(2,int(math.sqrt(n))+2):
if f(b,n)==s:
print(b)
exit()
for j in range(int(math.sqrt(n)+1),0,-1):
b=(n-s)//j+1
if f(b,n)==s:
print(int(b))
exit()
print(-1)
if __name__ == '__main__':
main()
|
s504223492 | p04014 | u474423089 | 1570676059 | Python | Python (3.4.3) | py | Runtime Error | 430 | 3964 | 564 | import math
def f(b,n):
if n<b:
return n
return f(b,n//b)+n%b
def main():
n=int(input())
s=int(input())
if n==s:
print(n+1)
exit()
elif n <s:
print(-1)
exit()
else:
for b in range(2,int(math.sqrt(n))+2):
if f(b,n)==s:
print(b)
exit()
for j in range(int(math.sqrt(n)+1)+1,0,-1):
b=(n-s)//j+1
if f(b,n)==s:
print(int(b))
exit()
print(-1)
if __name__ == '__main__':
main()
|
s162531902 | p04014 | u701199820 | 1569781929 | Python | PyPy3 (2.4.0) | py | Runtime Error | 331 | 52720 | 417 | import math
n = int(input())
s = int(input())
ans = -1
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n%b
if n == s: ans = n+1
for i in range(2, int(math.sqrt(n))+1):
if f(i, n) == s:
ans = i
break
if ans == -1:
for i in range(int(math.sqrt(n)), 0, -1):
b = (n-s) // i + 1
if f(b,n) == s:
ans = b
break
print(ans)
|
s070495676 | p04014 | u404794295 | 1569327357 | Python | Python (3.4.3) | py | Runtime Error | 759 | 4036 | 353 | n=int(input())
s=int(input())
a="-1"
def f(b,n):
if n<b:
return n
else:
return f(b,n//b)+n%b
if n==s:
a=n+1
i=2
while 0<=i<=n**(1/2):
if f(i,n)==s:
a=i
break
i+=1
if a=="-1":
for p in range(1,int(n**(1/2))):
b=(n-s)/p+1
if f(b,n)==s:
a=b
break
print(int(a)) |
s092541786 | p04014 | u141610915 | 1568874696 | Python | Python (3.4.3) | py | Runtime Error | 485 | 3912 | 741 | import math
#平方オーダーなら収まるので平方根とって方針を分ける
n = int(input())
s = int(input())
if n == s:
print(n + 1)
exit(0)
def sqrt(k):
return int(math.sqrt(k))
def digitsum(b, m):
if m < b:
return m
return digitsum(b, m // b) + m % b
#√nより小さいなら
#全探索余裕 桁は多くて40程度なので
for b in range(2, sqrt(n) + 1):
if digitsum(b, n) == s:
print(b)
exit(0)
#√nより大きいなら
#b^2 > n である。２桁ということ
#2桁目がpなら、1桁目はs-pである
#pb + s - p = n
#b = (n - s) // p + 1
for p in range(1, sqrt(n)):
b = (n - s) // p + 1
if b == 1: continue
if digitsum(b, n) == s:
print((n - s) // p + 1)
exit(0)
print(-1) |
s883597439 | p04014 | u141610915 | 1568874548 | Python | Python (3.4.3) | py | Runtime Error | 286 | 3912 | 806 | import math
#平方オーダーなら収まるので平方根とって方針を分ける
n = int(input())
s = int(input())
if s == 1:
print(n)
exit(0)
if n == s:
print(n + 1)
exit(0)
def sqrt(k):
return int(math.sqrt(k))
def digitsum(b, m):
if m < b:
return m
return digitsum(b, m // b) + m % b
#√nより小さいなら
#全探索余裕 桁は多くて40程度なので
for b in range(2, sqrt(n) + 1):
if digitsum(b, n) == s:
print(b)
exit(0)
#√nより大きいなら
#b^2 > n である。２桁ということ
#2桁目がpなら、1桁目はs-pである
#pb + s - p = n
#b = (n - s) // p + 1
for p in range(2, sqrt(n)):
if (n - s) % p == 0:
b = (n - s) // p + 1
if b == 1: continue
if digitsum(b, n) == s:
print((n - s) // p + 1)
exit(0)
print(-1) |
s874584943 | p04014 | u141610915 | 1568874220 | Python | Python (3.4.3) | py | Runtime Error | 285 | 3948 | 746 | import math
#平方オーダーなら収まるので平方根とって方針を分ける
n = int(input())
s = int(input())
if s == 1:
print(n)
exit(0)
def sqrt(k):
return int(math.sqrt(k))
def digitsum(b, m):
if m < b:
return m
return digitsum(b, m // b) + m % b
#√nより小さいなら
#全探索余裕 桁は多くて40程度なので
for b in range(2, sqrt(n) + 1):
if digitsum(b, n) == s:
print(b)
exit(0)
#√nより大きいなら
#b^2 > n である。２桁ということ
#2桁目がpなら、1桁目はs-pである
#pb + s - p = n
#b = (n - s) // p + 1
for p in range(2, sqrt(n)):
if (n - s) % p == 0:
b = (n - s) // p + 1
if digitsum(b, n) == s:
print((n - s) // p + 1)
exit(0)
print(-1) |
s631845851 | p04014 | u993161647 | 1568082573 | Python | Python (3.4.3) | py | Runtime Error | 526 | 3964 | 515 | import sys, math
n = int(input())
s = int(input())
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n % b
if s == n:
print(n + 1)
sys.exit()
elif s > n:
print('-1')
sys.exit()
sqrt_n = math.floor(math.sqrt(n))
for b in range(2, sqrt_n + 1):
if f(b, n) == s:
print(b)
sys.exit()
for p in range(1, sqrt_n + 1):
P = sqrt_n + 1 - p
b = int( (n -s)/P ) + 1
if f(b, n) == s and b >= 2:
print(b)
sys.exit()
print('-1') |
s859679089 | p04014 | u993161647 | 1568082209 | Python | Python (3.4.3) | py | Runtime Error | 831 | 3960 | 538 | import sys, math
n = int(input())
s = int(input())
def f(b, n):
if n < b:
return n
else:
return f(b, math.floor(n/b)) + n % b
if s == n:
print(n + 1)
sys.exit()
elif s > n:
print('-1')
sys.exit()
for b in range(2, math.floor(math.sqrt(n))+1):
if f(b, n) == s:
print(b)
sys.exit()
for p in range(math.floor(math.sqrt(n)+1)):
P = math.floor(math.sqrt(n)) + 1 - p
b = int( (n -s)/P ) + 1
if f(b, n) == s and b >= 2:
print(b)
sys.exit()
print('-1') |
s407184943 | p04014 | u792670114 | 1567738655 | Python | Python (3.4.3) | py | Runtime Error | 365 | 3064 | 452 | n = int(input())
s = int(input())
def sub(n, b):
r = 0
while n > 0:
r += n%b
n = n//b
return r
if s == n:
b = n+1
print(b)
exit()
for b in range(2, n+1):
if b*b > n:
break
s2 = sub(n, b)
if s2 == s:
print(b)
exit()
bs = []
for p in range(1, n+1):
if p*p > n:
break
if (n-s)%p == 0:
b = (n-s)//p+1
bs.append(b)
bs.sort()
for b in bs:
s2 = sub(n, b)
if s2 == s:
print(b)
exit()
print(-1)
|
s570000607 | p04014 | u792670114 | 1567738505 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 16364 | 429 | n = int(input())
s = int(input())
def sub(n, b):
r = 0
while n > 0:
r += n%b
n = n//b
return r
if s == n:
b = n+1
print(b)
exit()
for b in range(2, n+1):
if b*b > n:
break
s2 = sub(n, b)
if s2 == s:
print(b)
exit()
bs = []
for p in range(1, n+1):
if p*p > n:
break
b = (n-s)//p+1
bs.append(b)
bs.sort()
for b in bs:
s2 = sub(n, b)
if s2 == s:
print(b)
exit()
print(-1)
|
s288002977 | p04014 | u594956556 | 1566872723 | Python | Python (3.4.3) | py | Runtime Error | 430 | 3188 | 309 | n=int(input())
s=int(input())
if n==s:
print(n+1)
exit()
for b in range(2,int(n**(1/2)+1)):
m=n
wa=0
while m>0:
wa+=m%b
m=m//b
if wa==s:
print(b)
exit()
for p in range(int(n**(1/2)),0,-1):
if (n-s)%p==0:
b=(n-s)//p+1
if p+n%b==s:
print(b)
exit()
print('-1')
|
s217376341 | p04014 | u594956556 | 1566872176 | Python | Python (3.4.3) | py | Runtime Error | 406 | 3188 | 309 | n=int(input())
s=int(input())
if n==s:
print(n+1)
exit()
for b in range(2,int(n**(1/2))+1):
m=n
wa=0
while m>0:
wa+=m%b
m=m//b
if wa==s:
print(b)
exit()
for p in range(int(n**(1/2)),0,-1):
if (n-s)%p==0:
b=(n-s)//p+1
if p+n%b==s:
print(b)
exit()
print(-1) |
s249243122 | p04014 | u842689614 | 1566167254 | Python | Python (3.4.3) | py | Runtime Error | 765 | 3188 | 345 | n=int(input())
s=int(input())
b_ans=1
for b in range(2,int(n**0.5)+1):
nn=n
st=[]
while(nn>0):
st.append(nn%b)
nn=(nn-st[-1])/b
if sum(st)==s:
b_ans=b
break
if b_ans==1:
for p in range(int(n**0.5)):
b=int(n/p)
q=n-p*b
if s==p+q:
b_ans=b
break
if b_ans!=1:
print(b_ans)
else:
print(-1) |
s947339825 | p04014 | u392319141 | 1566149717 | Python | PyPy3 (2.4.0) | py | Runtime Error | 584 | 205724 | 540 | def sol():
N = int(input())
S = int(input())
if N == S:
print(N + 1)
return
def digitSum(n, b):
if b < 0:
return -1
if n < b:
return n
return digitSum(n // b, b) + n % b
for b in range(2, int(N**0.5 + 10)):
if digitSum(N, b) == S:
print(b)
return
for p in range(1, int(N**0.5 + 10)):
b = (N - S) // p + 1
if digitSum(N, int(b)) == S:
print(int(b))
return
print('-1')
sol() |
s649925220 | p04014 | u423585790 | 1565209467 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2202 | 1467292 | 3028 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#A
def A():
n = II()
k = II()
x = II()
y = II()
ans = 0
for i in range(n):
if i >= k:
ans += y
else:
ans += x
print(ans)
return
#B
def B():
w = S()
d = defaultdict(int)
for s in w:
d[s] += 1
for di in d.values():
if di % 2:
print("No")
return
print("Yes")
return
#C
def C():
n, a = LI()
x = LI()
sumx = [0] * n
for i in range(n):
sumx[i] = sumx[i - 1] + x[i]
dp = [[[0] * (n+1) for i in range(sumx[-1] + 1)] for i in range(n)]
for i in range(n):
dp[i][x[i]][1] = 1
for i in range(1, n):
for s in range(sumx[i] + 1):
for k in range(1, i + 2):
if s >= x[i]:
dp[i][s][k] += dp[i - 1][s - x[i]][k - 1]
dp[i][s][k] += dp[i - 1][s][k]
ans = 0
for i in range(1, n + 1):
if a * i > sumx[-1]:
break
ans += dp[-1][a * i][i]
print(ans)
return
# D
# 解説AC
# 2 <= b <= √n
# までに関しては全探索すればよくて
# ここで解がない場合はそれ以上を見る
# √n < b <= n
# に関してはb進数表記で2桁になることが確定してて
# n = p*b+qとするなら p + q = s で(1 <= p < b, 0 <= q < b)
# n = p*b+q >= p*b > p**2 → √n > p がわかるからpを全探索
# b = (n-s)/p + 1なのでpを決めればbが決まってあとは調べればいい
# 数学じゃんこれ！
def D():
def f(b, n):
if n < b:
return n
return f(b, n // b) + (n % b)
n, s = IR(2)
if n == s:
print(n + 1)
return
for b in range(2, int(math.sqrt(n)) + 1):
if s == f(b, n):
print(b)
return
for p in range(int(math.sqrt(n)), 0, -1):
b = (n - s) // p + 1
if s == f(b, n):
print(b)
return
print(-1)
return
#Solve
if __name__ == '__main__':
D()
|
s332776176 | p04014 | u584174687 | 1564844490 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2106 | 41980 | 627 |
import sys
def check(num, s, b):
sum_keta = 0
while num > 0:
sum_keta += num % b
num //= b
if sum_keta == s:
return 1
else:
return 0
def main():
num = int(input())
s = int(input())
if num == s:
print(num + 1)
sys.exit()
for b in range(2, int(num ** 0.5) + 2):
if check(num, s, b):
print(b)
sys.exit()
for p in range(1, int(num ** 0.5) + 2):
b = (num - s) // p + 1
if check(num, s, b):
print(b)
sys.exit()
print(-1)
if __name__ == '__main__':
main() |
s309158611 | p04014 | u263830634 | 1561496303 | Python | Python (3.4.3) | py | Runtime Error | 464 | 95384 | 565 | import math
import sys
sys.setrecursionlimit(10**5)
n = int(input())
s = int(input())
if n < s:
print (-1)
exit()
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n%b
if s == n:
print (n+1)
exit()
if n == 1:
print (-1)
exit()
for i in range(2, int(math.sqrt(n))+2):
if f(i, n) == s:
print (i)
exit()
for p in range(int(math.sqrt(n))+1, 0, -1):
b = (n-s)//p + 1
if f(b, n) == s:
print (b)
exit()
print (-1)
# for i in range(2, 100):
# print (i, f(i,100)) |
s140317142 | p04014 | u263830634 | 1561494208 | Python | Python (3.4.3) | py | Runtime Error | 459 | 95392 | 508 | import math
import sys
sys.setrecursionlimit(10**5)
n = int(input())
s = int(input())
if n < s:
print (-1)
exit()
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n%b
if s == n:
print (n+1)
exit()
if n == 1:
print (-1)
exit()
for i in range(2, int(math.sqrt(n))+2):
if f(i, n) == s:
print (i)
exit()
for p in range(1, int(math.sqrt(n))+2):
b = (n-s)//p + 1
if f(b, n) == s:
print (b)
exit()
print (-1) |
s985992796 | p04014 | u263830634 | 1561494066 | Python | Python (3.4.3) | py | Runtime Error | 454 | 4084 | 468 | import math
n = int(input())
s = int(input())
if n < s:
print (-1)
exit()
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n%b
if s == n:
print (n+1)
exit()
if n == 1:
print (-1)
exit()
for i in range(2, int(math.sqrt(n))+2):
if f(i, n) == s:
print (i)
exit()
for p in range(1, int(math.sqrt(n))+2):
b = (n-s)//p + 1
if f(b, n) == s:
print (b)
exit()
print (-1) |
s381351015 | p04014 | u263830634 | 1561493788 | Python | Python (3.4.3) | py | Runtime Error | 459 | 3964 | 431 | import math
n = int(input())
s = int(input())
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n%b
if s == n:
print (n+1)
exit()
if n == 1:
print (-1)
exit()
for i in range(2, int(math.sqrt(n))+2):
if f(i, n) == s:
print (i)
exit()
for p in range(1, int(math.sqrt(n))+2):
b = (n-s)//p + 1
if f(b, n) == s:
print (b)
exit()
print (-1) |
s461586942 | p04014 | u163320134 | 1561247599 | Python | Python (3.4.3) | py | Runtime Error | 451 | 3956 | 434 | def f(b,n):
if b>n:
return n
else:
return f(b,n//b)+n%b
n=int(input())
s=int(input())
if s>n:
print(-1)
elif s==n:
print(n+1)
else:
ans=0
for i in range(2,int(n**0.5)+1):
if f(i,n)==s:
ans=i
break
if ans!=0:
print(ans)
else:
for i in range(1,int(n**0.5)+1):
tb=(n-s)//i+1
if f(tb,n)==s:
ans=tb
break
if ans!=0:
print(ans)
else:
print(-1) |
s416486502 | p04014 | u163320134 | 1561247243 | Python | Python (3.4.3) | py | Runtime Error | 454 | 3952 | 412 | def f(b,n):
if b>n:
return n
else:
return f(b,n//b)+n%b
n=int(input())
s=int(input())
if s==n:
print(n+1)
else:
ans=0
for i in range(2,int(n**0.5)+1):
if f(i,n)==s:
ans=i
break
if ans!=0:
print(ans)
else:
for i in range(1,int(n**0.5)+1):
tb=(n-s)//i+1
if f(tb,n)==s:
ans=tb
break
if ans!=0:
print(ans)
else:
print(-1) |
s887889770 | p04014 | u155024797 | 1557974191 | Python | PyPy3 (2.4.0) | py | Runtime Error | 531 | 207004 | 662 | import math
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n % b
def main():
n = int(input())
s = int(input())
if s == 1:
print(n)
return
elif s == n:
print(n+1)
return
elif s > n:
print(-1)
return
sqrt = int(math.sqrt(n))
for b in range(2, sqrt+1):
if f(b, n) == s:
print(b)
return
for x in range(sqrt, 0, -1):
if s < x:
continue
y = s - x
b = (n-y) // x
if f(b, n) == s:
print(b)
return
print(-1)
if __name__ == "__main__":
main()
|
s265804490 | p04014 | u155024797 | 1557614067 | Python | PyPy3 (2.4.0) | py | Runtime Error | 340 | 52976 | 664 | import math
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n % b
def main():
n = int(input())
s = int(input())
if s == 1:
print(n)
return
elif s == n:
print(n+1)
return
elif s > n:
print(-1)
return
sqrt = -int(-math.sqrt(n))
b = 2
for b in range(2, sqrt+1):
if f(b, n) == s:
print(b)
return
for x in range(sqrt, s, -1):
y = s - x
z = n - x
b = z // y
if z % y == 0 and f(b, n) == s:
print(b)
return
print(-1)
if __name__ == "__main__":
main()
|
s649515857 | p04014 | u155024797 | 1557613934 | Python | PyPy3 (2.4.0) | py | Runtime Error | 342 | 52976 | 664 | import math
def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n % b
def main():
n = int(input())
s = int(input())
if s == 1:
print(n)
return
elif s == n:
print(n+1)
return
elif s > n:
print(-1)
return
sqrt = -int(-math.sqrt(n))
b = 2
for b in range(2, sqrt+1):
if f(b, n) == s:
print(b)
return
for x in range(sqrt, 0, -1):
y = s - x
z = n - x
b = z // y
if z % y == 0 and f(b, n) == s:
print(b)
return
print(-1)
if __name__ == "__main__":
main()
|
s126984816 | p04014 | u619458041 | 1556074739 | Python | Python (3.4.3) | py | Runtime Error | 433 | 3948 | 467 | import sys
def f(b, n):
if b > n:
return n
return f(b, n//b) + n % b
def main():
input = sys.stdin.readline
n = int(input())
s = int(input())
if s == n:
return n+1
for i in range(2, int(n**0.5)):
if f(i, n) == s:
return i
for p in range(1, int(n**0.5)):
b = (n - s) // p + 1
if f(b, n) == s:
return b
return -1
if __name__ == '__main__':
print(main())
|
s397455249 | p04014 | u619458041 | 1556074624 | Python | Python (3.4.3) | py | Runtime Error | 231 | 3064 | 431 | import sys
def f(b, n):
if b > n:
return n
return f(b, n//b) + n % b
def main():
input = sys.stdin.readline
n = int(input())
s = int(input())
if s == n:
return n+1
for i in range(2, int(n**0.5)):
if f(i, n) == s:
return i
b = (n - s) // p + 1
if f(b, n) == s:
return b
else:
return -1
if __name__ == '__main__':
print(main())
|
s260792398 | p04014 | u155024797 | 1554958809 | Python | PyPy3 (2.4.0) | py | Runtime Error | 553 | 209052 | 561 | def f(b, n):
if n < b:
return n
else:
return f(b, n//b) + n % b
def main():
n = int(input())
s = int(input())
if s == 1:
print(n)
return
elif s > n:
print(-1)
return
b = 2
while b * b <= n:
if f(b, n) == s:
print(b)
return
b += 1
p = 1
while p * p <= n:
q = s - p
b = (n - q) // p
if f(b, n) == s:
print(b)
return
p += 1
print(-1)
if __name__ == "__main__":
main()
|
s580855953 | p04014 | u425287928 | 1553954872 | Python | Python (3.4.3) | py | Runtime Error | 460 | 3948 | 333 | n=int(input())
s=int(input())
def f(b,n):
if n < b:
return n
else:
return f(b,n//b)+n%b
ans=-1
if s>n:
pass
elif s==n:
ans=n+1
else:
for _b in range(2,int(n**0.5)+1):
if f(_b,n)==s:
ans=_b
break
if ans==-1:
for _p in range(1,int(n**0.5)+1):
_b = (n-s)//_p+1
if f(_b,n)==s:
ans=_b
break
print(ans) |
s589537272 | p04014 | u585482323 | 1551650411 | Python | PyPy3 (2.4.0) | py | Runtime Error | 279 | 40940 | 1721 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(s+1):
if k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
else:
dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
if a*i <= s:
ans += dp[n][i][a*i]
print(ans)
"""
#D
def f(b,n):
m = n
res = 0
while m > 0:
res += m%b
m //= b
return res
n,s = IR(2)
if n == s:
print(n+1)
quit()
if n == 1:
print(-1)
quit()
k = int(n**0.5)
for b in range(2,k+1):
if f(b,n) == s:
print(b)
quit()
for p in range(1,k+1)[::-1]:
if (n-s)%p == 0:
b = (n-s)//p+1
if f(b,n) == s:
print(b)
quit()
print(-1)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
s799085696 | p04014 | u585482323 | 1551650286 | Python | PyPy3 (2.4.0) | py | Runtime Error | 247 | 40940 | 1685 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(s+1):
if k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
else:
dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
if a*i <= s:
ans += dp[n][i][a*i]
print(ans)
"""
#D
def f(b,n):
m = n
res = 0
while m > 0:
res += m%b
m //= b
return res
n,s = IR(2)
if n == s:
print(n+1)
quit()
k = int(n**0.5)
for b in range(2,k+1):
if f(b,n) == s:
print(b)
quit()
for p in range(1,k+1)[::-1]:
if (n-s)%p == 0:
b = (n-s)//p+1
if f(b,n) == s:
print(b)
quit()
print(-1)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
s166727121 | p04014 | u585482323 | 1551650199 | Python | PyPy3 (2.4.0) | py | Runtime Error | 262 | 40940 | 1695 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(s+1):
if k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
else:
dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
if a*i <= s:
ans += dp[n][i][a*i]
print(ans)
"""
#D
def f(b,n):
k = b
m = n
res = 0
while m > 0:
res += m%b
m //= b
return res
n,s = IR(2)
if n == s:
print(n+1)
quit()
k = int(n**0.5)
for b in range(2,k+1):
if f(b,n) == s:
print(b)
quit()
for p in range(1,k+1)[::-1]:
if (n-s)%p == 0:
b = (n-s)//p+1
if f(b,n) == s:
print(b)
quit()
print(-1)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
s882525845 | p04014 | u585482323 | 1551649809 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2132 | 449648 | 1695 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(s+1):
if k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
else:
dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
if a*i <= s:
ans += dp[n][i][a*i]
print(ans)
"""
#D
sys.setrecursionlimit(100000000)
def f(b,n):
if n<b:
return n
else:
return n%b+f(b,n//b)
n,s = IR(2)
if n == s:
print(n+1)
quit()
k = int(n**0.5)
for b in range(2,k+1):
if f(b,n) == s:
print(b)
quit()
for p in range(1,k)[::-1]:
if (n-s)%p == 0:
b = (n-s)//p+1
if f(b,n) == s:
print(b)
quit()
print(-1)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
s812911327 | p04014 | u585482323 | 1551649627 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2131 | 449648 | 1687 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(s+1):
if k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
else:
dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
if a*i <= s:
ans += dp[n][i][a*i]
print(ans)
"""
#D
sys.setrecursionlimit(1000000)
def f(b,n):
if n<b:
return n
else:
return n%b+f(b,n//b)
n,s = IR(2)
if n == s:
print(n+1)
quit()
k = int(n**0.5)
for b in range(2,k+1):
if f(b,n) == s:
print(b)
quit()
for p in range(1,k):
if (n-s)%p == 0:
b = (n-s+p)//p
if f(b,n) == s:
print(b)
quit()
print(-1)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
s397294894 | p04014 | u585482323 | 1551649499 | Python | PyPy3 (2.4.0) | py | Runtime Error | 311 | 49008 | 1654 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
dp[i][0][0] = 1
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(s+1):
if k >= x[i-1]:
dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
else:
dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
if a*i <= s:
ans += dp[n][i][a*i]
print(ans)
"""
#D
def f(b,n):
if n<b:
return n
else:
return n%b+f(b,n//b)
n,s = IR(2)
if n == s:
print(n+1)
quit()
k = int(n**0.5)
for b in range(2,k+1):
if f(b,n) == s:
print(b)
quit()
for p in range(1,k):
if not (n-s)%p:
b = (n-s+p)//p
if f(b,n) == s:
print(b)
quit()
print(-1)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
s251748966 | p04014 | u706695185 | 1551182860 | Python | Python (3.4.3) | py | Runtime Error | 2139 | 520344 | 417 | n = int(input())
s = int(input())
memo = [[False for _ in range(n)] for _ in range(n)]
def f(x,y):
print(memo[x][y])
if memo[x][y]:
return memo[x][y]
elif y < x:
memo[x][y] = y
return y
else:
memo[x][y] = f(x, y//x)+(y%x)
return memo[x][y]
# f()
for i in reversed(range(n)):
print(f(i, n))
if f(i, n) == s:
print(b)
exit()
print(-1)
|
s680875096 | p04014 | u171366497 | 1550989593 | Python | Python (3.4.3) | py | Runtime Error | 409 | 3948 | 414 | #ABC044D
def fun(b,n):
if n<b:return n
return (n%b)+fun(b,n//b)
n=int(input())
s=int(input())
n_root=n**0.5
def main(n,n_root,s):
if s==n:return n+1
if s>n:return -1
for b in range(2,1+int(n_root)):
if fun(b,n)==s:
return b
for i in range(int(n_root),0,-1):
b=1+(n-s)//i
if fun(b,n)==s:
if b>1:return b
return -1
print(main(n,n_root,s))
|
s839396636 | p04014 | u171366497 | 1550988585 | Python | Python (3.4.3) | py | Runtime Error | 417 | 3948 | 434 | #ABC044D
def fun(b,n):
if n<b:return n
return (n%b)+fun(b,n//b)
n=int(input())
s=int(input())
n_root=n**0.5
def main(n,n_root,s):
if s==n:return n+1
if s>n:return -1
if s==1:return n
for b in range(2,1+int(n_root)):
if fun(b,n)==s:
return b
for i in range(int(n_root),0,-1):
b=1+(n-s)//i
if fun(b,n)==s:
if b>1:return b
return -1
print(main(n,n_root,s)) |
s461442612 | p04014 | u171366497 | 1550988473 | Python | Python (3.4.3) | py | Runtime Error | 421 | 3952 | 520 | #ABC044D
def fun(b,n):
if n<b:return n
return (n%b)+fun(b,n//b)
n=int(input())
s=int(input())
n_root=n**0.5
def main(n,n_root,s):
if s==n:return n+1
if s>n:return -1
if s==1:return n
for b in range(2,1+int(n_root//1)):
if fun(b,n)==s:
return b
for i in range(1+int(n_root//1),0,-1):
b=1+(n-s)//i
if fun(b,n)==s:
if b<=n_root or b<=1:continue
if n//b>=b or n//b<1:continue
return b
return -1
print(main(n,n_root,s))
|
s585561753 | p04014 | u983918956 | 1550452473 | Python | PyPy3 (2.4.0) | py | Runtime Error | 185 | 38384 | 674 | N,A = map(int,input().split())
X = [int(e) for e in input().split()]
# dp[i][k][s]: i番目まで見てk個選んで総和sとなる場合の数
# 初期条件: dp[0][0][0] = 1
# 遷移: dp[i][k][s] += dp[i-1][k-1][s-X[i]] + dp[i-1][k][s]
# 答え: sum(dp[N][k][k*A] 1 <= k <= N)
s_max = 2500
dp = [[[0]*(s_max+1) for k in range(N+1)] for i in range(N+1)]
dp[0][0][0] = 1
for i in range(1,N+1):
for k in range(N+1):
for s in range(s_max+1):
dp[i][k][s] += dp[i-1][k][s]
if k != 0 and 0 <= s-X[i-1] <= s_max:
dp[i][k][s] += dp[i-1][k-1][s-X[i-1]]
ans = 0
for k in range(1,N+1):
s = k*A
ans += dp[N][k][s]
print(ans) |
s334441775 | p04014 | u483645888 | 1550090401 | Python | Python (3.4.3) | py | Runtime Error | 573 | 3948 | 460 | n = int(input())
s = int(input())
flag = False
if s > n:
print(-1)
exit()
if s == n:
print(n+1)
exit()
def chk(b, n):
if n//b == 0:
return n
else:
return chk(b,n//b) + n%b
for b in range(2, int(n**0.5)+1):
if chk(b, n) == s:
print(b)
flag = True
exit()
for i in range(int(n**0.5), 0, -1):
b = (n-s)//i + 1
if chk(b, n) == s:
if b > 1:
print(b)
flag = True
exit()
if flag == False:
print(-1) |
s213404904 | p04014 | u483645888 | 1550090183 | Python | Python (3.4.3) | py | Runtime Error | 585 | 3956 | 440 | n = int(input())
s = int(input())
flag = False
if s > n:
print(-1)
exit()
if s == n:
print(n+1)
exit()
def chk(b, n):
if n//b == 0:
return n
else:
return chk(b,n//b) + n%b
for b in range(2, int(n**0.5)+1):
if chk(b, n) == s:
print(b)
flag = True
exit()
for i in range(int(n**0.5), 0, -1):
b = (n-s)//i + 1
if chk(b, n) == s:
print(b)
flag = True
exit()
if flag == False:
print(-1) |
s711296881 | p04014 | u483645888 | 1550089933 | Python | Python (3.4.3) | py | Runtime Error | 578 | 3952 | 438 | n = int(input())
s = int(input())
flag = False
if s > n:
print(-1)
exit()
if s == n:
print(n+1)
exit()
def chk(b, n):
if n//b == 0:
return n
else:
return chk(b,n//b) + n%b
for b in range(2, int(n**0.5)+1):
if chk(b, n) == s:
print(b)
flag = True
exit()
for i in range(int(n**0.5), 0, -1):
b = (n-s)//i + 1
if chk(b, n) == s:
print(b)
flag = True
exit()
if flag == False:
print(-1) |
s014128628 | p04014 | u483645888 | 1550089429 | Python | Python (3.4.3) | py | Runtime Error | 582 | 3944 | 407 | n = int(input())
s = int(input())
flag = False
if s == n:
print(n+1)
exit()
def chk(b, n):
if n//b == 0:
return n
else:
return chk(b,n//b) + n%b
for b in range(2, int(n**0.5)+1):
if chk(b, n) == s:
print(b)
flag = True
exit()
for i in range(int(n**0.5), 0, -1):
b = (n-s)//i + 1
if chk(b, n) == s:
print(b)
flag = True
exit()
if flag == False:
print(-1) |
s264807207 | p04014 | u483645888 | 1550089217 | Python | Python (3.4.3) | py | Runtime Error | 571 | 3944 | 406 | n = int(input())
s = int(input())
flag = False
if s == n:
print(n+1)
exit()
def chk(b, n):
if n//b == 0:
return n
else:
return chk(b,n//b) + n%b
for b in range(2, int(n**0.5)+1):
if chk(b, n) == s:
print(b)
flag = True
exit()
for i in range(int(n**0.5), 0, -1):
b = (n-s)//i + 1
if chk(b, n) == s:
print(b)
flag = True
break
if flag == False:
print(-1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.