input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from math import gcd
N = int(eval(input()))
A = list([int(x) for x in input().split()])
max_a = 10**6 + 1
before = 0
result = [0 for _ in range(max_a + 1)]
for i in A:
before = gcd(before, i)
result[i] += 1
is_pairwise = True
for i in range(2, max_a + 1):
cnt = 0
for j in range(i, ... | from math import gcd
def main():
N = int(eval(input()))
A = list([int(x) for x in input().split()])
max_a = max(A)
before = 0
result = [0 for _ in range(max_a + 1)]
for i in A:
before = gcd(before, i)
result[i] += 1
is_pairwise = True
for i in range... | p02574 |
from math import gcd
inpl = lambda: list(map(int,input().split()))
def primes(N):
P = []
for i in range(2,N):
sieve = 1
for p in P:
if p*p > i:
break
elif i % p == 0:
sieve = 0
break
if sieve == 0:
... | from math import gcd
inpl = lambda: list(map(int,input().split()))
def primes(N):
P = []
firstfactor = [1]*N
for i in range(2,N):
sieve = 1
for p in P:
if p*p > i:
break
elif i % p == 0:
sieve = 0
firstfactor... | p02574 |
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy
import heapq
import random
import time
import os
import sys
from functools... | # coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy
import heapq
import random
import time
import os
import sys
from functools... | p02574 |
import bisect
import math
n = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
cons = 10 ** 6
is_prime = [True] * (cons + 1)
Ds = [i for i in range(cons+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(cons**0.5) + 1):
if not is_prime[i]:
continue
for j... | import bisect
import math
n = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
cons = 10 ** 6
is_prime = [True] * (cons + 1)
Ds = [i for i in range(cons + 1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(cons**0.5) + 1):
if not is_prime[i]:
continue
for... | p02574 |
import bisect
import math
n = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
# cons = 10 ** 6
# is_prime = [True] * (cons + 1)
# is_prime[0] = False
# is_prime[1] = False
# for i in range(2, int(cons**0.5) + 1):
# if not is_prime[i]:
# continue
# for j in range(i * 2, ... | import bisect
import math
n = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
# cons = 10 ** 6
# is_prime = [True] * (cons + 1)
# is_prime[0] = False
# is_prime[1] = False
# for i in range(2, int(cons**0.5) + 1):
# if not is_prime[i]:
# continue
# for j in range(i * 2, ... | p02574 |
import bisect
import math
n = int(eval(input()))
As = list(map(int, input().split()))
As.sort()
cons = 10 ** 6
is_prime = [True] * (cons + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(cons**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, cons + 1, i):
... | import math
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if ... | p02574 |
import math
N=int(eval(input()))
ls=[int(s) for s in input().split()]
M=max(ls)
SQRT_M=int(math.sqrt(M))+1
#素数のリスト作成
prime=[1 for i in range(SQRT_M+1)]
prime[0]=0
prime[1]=0
primels=[]
primedic={}
for i in range(2,SQRT_M+1):
if prime[i]==1:
primels.append(i)
primedic[i]=0
a=1
while a*i... | import math
import time
start=time.time()
N=int(eval(input()))
ls=[int(s) for s in input().split()]
M=max(ls)
SQRT_M=int(math.sqrt(M))+1
#素数のリスト作成
prime=[1 for i in range(SQRT_M+1)]
prime[0]=0
prime[1]=0
primels=[]
primedic={}
for i in range(2,SQRT_M+1):
if prime[i]==1:
primels.append(i)
p... | p02574 |
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
ma=a[-1]
pn=[i for i in range(ma+1)]
for i in range(2,ma//2+1):
j=2
while j*i<=ma:
pn[j*i]=i
j+=1
chk=[0]*(ma+1)
for i in a:
if i==1:
continue
x=pn[i]
chk[x]+=1
while x!=i:
while i%x==0:
i//=x
x=pn[i]
... | def resolve():
import sys
input = sys.stdin.readline
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
ma=a[-1]
pn=[i for i in range(ma+1)]
for i in range(2,ma//2+1):
j=2
while j*i<=ma:
pn[j*i]=min(pn[j*i],i)
j+=1
chk=[0]*(ma+1)
fo... | p02574 |
n=int(eval(input()))
l=list(map(int,input().split()))
m=max(l)
prime=[True]*(m+1)
prime[0]=False
prime[1]=False
d=[0]*(m+1)
for i in range(2,int(m**0.5)+1):
if prime[i]:
for j in range(i*2,m+1,i):
prime[j]=False
d[j]=i
s=[i for i in range(m+1) if prime[i]]
for ss in s:
d[ss]=ss
di... | n=int(eval(input()))
l=list(map(int,input().split()))
m=max(l)
from math import gcd
g=gcd(l[0],l[1])
for i in range(2,n):
g=gcd(g,l[i])
if g!=1:
print('not coprime')
exit()
prime=[True]*(m+1)
prime[0]=False
prime[1]=False
d=[0]*(m+1)
for i in range(2,int(m**0.5)+1):
if prime[i]:
for j in... | p02574 |
from math import gcd
N = int(eval(input()))
num_lis = list(map(int, input().split()))
c1 = True
c2 = True
def osa_k(max_num):
lis = [i for i in range(max_num+1)]
p = 2
while p**2 <= max_num:
if lis[p] == p:
for q in range(2*p, max_num+1, p):
if lis[q] == q:
lis[q] = p
... | from math import gcd
N = int(eval(input()))
num_lis = list(map(int, input().split()))
c1 = True
c2 = True
def osa_k(max_num):
lis = [i for i in range(max_num+1)]
p = 2
while p**2 <= max_num:
if lis[p] == p:
for q in range(2*p, max_num+1, p):
if lis[q] == q:
lis[q] = p
... | p02574 |
from math import gcd
N = int(eval(input()))
num_lis = list(map(int, input().split()))
c = True
def osa_k(max_num):
lis = [i for i in range(max_num+1)]
p = 2
while p**2 <= max_num:
if lis[p] == p:
for q in range(2*p, max_num+1, p):
if lis[q] == q:
lis[q] = p
p += 1
... | from math import gcd
N = int(eval(input()))
num_lis = list(map(int, input().split()))
def osa_k(max_num):
lis = [i for i in range(max_num+1)]
p = 2
while p**2 <= max_num:
if lis[p] == p:
for q in range(2*p, max_num+1, p):
if lis[q] == q:
lis[q] = p
p += 1
return l... | p02574 |
import math
N = int(eval(input()))
A = [int(i) for i in input().split()]
flag =False
ans = math.gcd(A[0], A[1])
tmp = math.gcd(A[0], A[1])
maxa = (A[0] * A[1] // math.gcd(A[0], A[1]))
if tmp > 1:
flag = True
for i in range(2, N):
ans = math.gcd(ans, A[i])
tmp = math.gcd(maxa, A[i])
if tmp ... | import math
def sieve_of_erastosthenes(num):
is_prime = [True for i in range(num+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(num**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, num + 1, i):
is_prime[j] = False
r... | p02574 |
def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
... | def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
... | p02574 |
class prime_factorize_by_osa_k():
def __init__(self, max_val):
'''
割ることが出来る最小の値を格納したリストを返す
:param max_val:
:return:
'''
self.minFactor = [-1] * (max_val + 1)
for i in range(2, max_val + 1):
if self.minFactor[i] == -1:
self... | def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
... | p02574 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
m = max(2, max(A))
P = {p: True for p in range(2, m + 1)}
for i in range(2, m + 1):
for j in range(2 * i, m + 1, i):
P[j] = False
P = {p: 0 for p in P if P[p]}
for a in A:
for p in P:
if a % p == 0:
P[p] += 1
s ... | n = int(eval(input()))
*A, = list(map(int, input().split()))
m = max(2, max(A))
P = {p: True for p in range(2, m + 1)}
for i in range(2, m + 1):
for j in range(2 * i, m + 1, i):
P[j] = False
Pmap = {p: 0 for p in P if P[p]}
Amap = {a: 0 for a in range(1, m + 1)}
for a in A:
Amap[a] += 1
for p... | p02574 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
m = max(2, max(A))
P = {p: True for p in range(2, m + 1)}
for i in range(2, m + 1):
for j in range(2 * i, m + 1, i):
P[j] = False
Pmap = {p: 0 for p in P if P[p]}
Amap = {a: 0 for a in range(1, m + 1)}
for a in A:
Amap[a] += 1
for p... | n = int(eval(input()))
*A, = list(map(int, input().split()))
m = max(A)
C = [0 for a in range(m + 1)]
for a in A:
C[a] += 1
s = 0
for a in range(2, m + 1):
s = max(s, sum(C[a::a]))
if s < 2:
print('pairwise coprime')
elif s < n:
print('setwise coprime')
else:
print('not coprime')
| p02574 |
n=int(eval(input()))
if n%2!=0:
print((0))
else:
a=0
for i in range(1,26):
a+=(n//(2*5**i))
print(a) | n=int(eval(input()))
ans=0
if n%2==1:
print((0))
else:
n=n//2
for i in range(1,50):
ans+=(n//(5**i))
print((int(ans))) | p02833 |
N = int(eval(input()))
if N%2==1:
print((0))
exit()
two, five = 0, 0
for i in range(1, 100):
two += N//2**i
for i in range(1, 100):
five += N//(2*5**i)
print((min(two, five))) | N = int(eval(input()))
if N%2==1:
print((0))
exit()
two = 0
p = 1
while 2**p<=N:
two += N//2**p
p += 1
five = 0
p = 1
while 2*5**p<=N:
five += N//(2*5**p)
p += 1
print((min(two, five))) | p02833 |
N = int(eval(input()))
if N % 2 == 1:
print((0))
else:
cnt = 0
div = 10
for _ in range(100):
cnt += N // div
div *= 5
print(cnt)
|
N = int(eval(input()))
if N % 2 == 1:
print((0))
else:
ans = 0
div = 10
for _ in range(100):
ans += N // div
div *= 5
print(ans)
| p02833 |
N = int(eval(input()))
if N % 2 == 1:
print((0))
else:
ans = 0
div = 10
for _ in range(100):
ans += N // div
div *= 5
print(ans)
|
N = int(eval(input()))
if N % 2 == 1:
print((0))
else:
ans = 0
div = 1
for _ in range(100):
div *= 5
ans += N // (div * 2)
print(ans)
| p02833 |
N=int(eval(input()))
if N%2==0:
cou=0
i=1
while(N>=(2*5**i)):
cou+=N//(2*5**i)
i+=1
print(cou)
elif N%2==1:
print((0)) | from sys import stdin
from sys import exit
def main():
#入力
readline=stdin.readline
n=int(readline())
if n%2==1:
print((0))
exit()
n//=2
ans=0
x=5
while n//x>=1:
ans+=n//x
x*=5
print(ans)
if __name__=="__main__":
main() | p02833 |
c,n=0,int(eval(input()))
if n%2<1:
n//=2
while n: n//=5; c+=n
print(c) | a,n=0,int(eval(input()))
if n%2<1:
n//=2
while n:n//=5;a+=n
print(a) | p02833 |
n = int(eval(input()))
if n%2==1:
print((0))
exit()
ans = 0
n//=2
while True:
ans +=n//5
n//=5
if n==0:
print(ans)
exit() | n = int(eval(input()))
if n%2==1:
print((0))
exit()
ans = 0
while True:
ans +=n//10
n//=5
if n==0:
print(ans)
exit() | p02833 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
... | p02833 |
def wtf(x):
fives = 0
for j in range(1, 60):
bs = 2 * 5 ** j
fives = fives + x // bs
return fives
x = int(eval(input()))
print((wtf(x) if x % 2 == 0 else 0)) | def z(x):
fives = 0
for j in range(1, 60):
bs = 2 * 5 ** j
fives = fives + x // bs
return fives
x = int(eval(input()))
print((z(x) if x % 2 == 0 else 0)) | p02833 |
import math
N = int(eval(input()))
ans = 0
if N % 2 == 1:
pass
else:
div = 10
#for i in range(0, 25):
while div <= N:
ans += N // div
div *= 5
print(ans) | N = int(eval(input()))
ans = 0
if N % 2 == 1:
pass
else:
div = 10
for i in range(0, 25):
#while div <= N:
ans += N // div
div *= 5
print(ans) | p02833 |
N = int(eval(input()))
ans = 0
if N % 2 == 1:
pass
else:
div = 10
for i in range(0, 25):
#while div <= N:
ans += N // div
div *= 5
print(ans) | N = int(eval(input()))
ans = 0
if N % 2 != 0:
pass
else:
for i in range(0, 25):
ans += N // (10*5**i)
print(ans) | p02833 |
N = int(eval(input()))
ans=0
if N%2==1:
print(ans)
else:
for i in range(1,40):
a = 2*pow(5,i)
ans+=(N//a)
print(ans) | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
if N%2==1:
print((0))
exit()
ans=0
for i in range(1,100... | p02833 |
N = int(eval(input()))
hoge = []
if N % 2 != 0:
print((0))
else:
for i in range(1, 40):
hoge.append((N // 10) // (5 ** i))
print((sum(hoge) + (N // 10)))
| N = int(eval(input()))
hoge = []
if N % 2 != 0:
print((0))
else:
for i in range(1, 27):
hoge.append((N // 10) // (5 ** i))
print((sum(hoge) + (N // 10)))
| p02833 |
n = int(eval(input()))
if n & 1:
print((0))
else:
ans = 0
x = 10
while n >= x:
ans += n // x
x *= 5
print(ans)
| n = int(eval(input()))
i = 10
ans = 0
while i <= n:
ans += (n // i)
i *= 5
print((ans if n & 1 == 0 else 0))
| p02833 |
def main():
N = int(eval(input()))
if N % 2 == 1:
return 0
ret = 0
for p in range(1, 30 + 1):
ret += N // (2 * pow(5, p))
return ret
if __name__ == '__main__':
print((main()))
| N = int(eval(input()))
if N % 2 == 1:
print((0))
else:
N //= 2
print((sum(N // pow(5, j) for j in range(1, 30))))
| p02833 |
n=int(eval(input()))
if n%2:
print((0))
exit()
n//=2
ans=0
i=1
while n>=(5**i):
ans+=n//(5**i)
i+=1
print(ans)
| n=int(eval(input()))
if n%2:
print((0))
exit()
else:
n//=2
ans=0
while n>=5:
ans+=n//5
n=n//5
print(ans)
| p02833 |
N = int(eval(input()))
if N%2==1:
cnt = 0
else:
K = N//10
cnt = K
n = 5
while K//n>0:
cnt += K//n
n *= 5
print(cnt) | N = int(eval(input()))
if N%2==1:
ans = 0
else:
n = N//10
ans = n
k = 1
while 5**k<=n:
ans += n//(5**k)
k += 1
print(ans) | p02833 |
x=int(eval(input()))
c=0
if x%2==1:
print((0))
else:
s=0
l=1
j=10
while j<=x:
s+=(x//j)
#s+=(x//p)//2
j*=5
print(s)
#print(s+(x//50)//2) | x=int(eval(input()))
s=0
if x%2==0:
p=10
while(p<=x):
s+=x//p
p*=5
print(s) | p02833 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
minans = inf ;ans = 0 ;count = 0 ;pro = 1
n=int(eval(input()))
if n%2==1:
print((0))
exit()
k=10
for i in range(1,100):
... | count=0
k=5
n=int(eval(input()))
if n%2==1:
print((0))
else:
n//=2
for i in range(1,100):
count+=int(n//(k))
k*=5
print(count)
| p02833 |
N = int(eval(input()))
if N % 2 == 1:
print((0))
exit()
ans = 0
mod = 10
while (mod <= N):
ans += N // mod
mod *= 5
print(ans)
| N = int(eval(input()))
ans = 0
if N % 2 == 0:
mod = 10
while N >= mod:
ans += N // mod
mod *= 5
print(ans)
| p02833 |
N = int(eval(input()))
ans = 0
if N % 2 == 0:
mod = 10
while N >= mod:
ans += N // mod
mod *= 5
print(ans)
| # def f(n):
# if n < 2:
# return 1
# else:
# return n * f(n - 2)
# for i in range(2, 150, 2):
# print(i, f(i))
N = int(eval(input()))
if N % 2 == 1:
print((0))
exit()
k = 10
cnt = 0
while k <= N:
cnt += N // k
k *= 5
print(cnt)
| p02833 |
n = int(eval(input()))
ans = 0
a = 1
na = n
if n % 2 == 1:
print((0))
else:
# for i in range(3):
# n100 = n // 100
# n50 = n // 50
# n = n // 10
# ans += n + n50 - n100
# print(n,n50,n100)
# print(ans)
# for i in range(1,20):
... | n = int(eval(input()))
ans = 0
if n % 2 == 1:
print((0))
exit()
for i in range(50):
if n >= 10*(5**(i)):
ans += n//(10*(5**(i)))
print(ans)
| p02833 |
N = int(eval(input()))
if N%2 != 0:
ans = 0
else:
ans = 0
for i in range(1,1000):
ans += N//(2*(5**i))
print(ans)
| N = int(eval(input()))
if N%2:
print((0))
exit()
ans = 0
i = 5
while i < N:
ans += N//(2*i)
i *= 5
print(ans)
| p02833 |
import math
n = int(eval(input()))
if n%2==1:
print((0))
else:
print((sum([n//(2*pow(5,i)) for i in range(1,math.ceil(math.log(n+1,5)))]))) | from math import ceil, log
n = int(eval(input()))
if n%2==1:
print((0))
else:
print((sum([n//(2*pow(5,i)) for i in range(1,ceil(log(n+1,5)))]))) | p02833 |
n=int(eval(input()))
if n<=6:
print((0))
else:
if n%2==0:
i=1
c_of_5=0
while 5**i <= n:
c_of_5+=n//((5**i)*2)
i+=1
print(c_of_5)
else:
print((0)) | n=int(eval(input()))
if n%2==0:
i=1
c_of_5=0
while 5**i <= n:
c_of_5+=n//((5**i)*2)
i+=1
print(c_of_5)
else:
print((0)) | p02833 |
import sys
n = int(eval(input()))
if n % 2 == 1:
print((0))
sys.exit()
ans = 0
x = 2
while n >= x:
x *= 5
ans += n // x
print(ans) | n = int(eval(input()))
if n%2 == 1:
print((0))
else:
x = 10
ans = 0
while n >= x:
ans += n // x
x *= 5
print(ans) | p02833 |
n = int(eval(input()))
if n % 2:
print((0))
else:
i, k = 0, [1]
while n > 10*5**i:
k.append(5*k[i] + 1)
i += 1
ans, r = 0, n
while i:
q, r = divmod(r, 10*5**i)
ans += q*k[i]
i -= 1
print((ans + r//10)) | n = int(eval(input()))
if n % 2:
print((0))
else:
memo = [5**(i+1) for i in range(26)]
print((sum((n//memo[i])//2 for i in range(26)))) | p02833 |
n=int(eval(input()))
a=n
count=0
if n%2 == 0:
for i in range(1,27):
count+=(n//((5**i)*2))
print(count)
else:
print((0)) | n=int(eval(input()))
c=0
i=1
tmp=n//2
while tmp!=0:
tmp=tmp//5
c=c+tmp
if n%2==0:
print((int(c)))
else:
print((int(0))) | p02833 |
n = int(eval(input()))
if n % 2 == 1:
print((0))
exit()
ans = 0
for i in range(1, 100):
ans += n //(2* 5**i)
print(ans) | n = int(eval(input()))
if n % 2 == 1:
print((0))
exit()
cnt_5 = 0
for i in range(1, 100):
cnt_5 += (n // (2 * 5 ** i))
print(cnt_5)
| p02833 |
n=int(eval(input()))
if n%2==1:
print((0))
else:#2,4,6,8,10...
n=(n//2)
k=0
while n>0:
k+=(n//5)
n=(n//5)
print(k)
| n=int(eval(input()))
if n%2==1:
print((0))
else:#2,4,6,8,10...
n=(n//2)
k=0
while n>4:
n=(n//5)
k+=n
print(k)
| p02833 |
def fun(n):
if n%2!=0:
return 0
else:
ans=0
n//=2
while(n):
ans=ans+n//5
n=n//5
return ans
n = int(eval(input()))
if n>=2:
print((fun(n)))
else:
print((0))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n1 = int(readline())
if n1 % 2 == 1:
print((0))
else:
n1 //= 2
ans = 0
while n1:
n1 //= 5
ans += n1
print(ans) | p02833 |
N = int(eval(input()))
if N % 2 == 1:
print((0))
exit(0)
n = 10
ans = 0
while True:
if n > N:
break
ans += N//n
n *= 5
print(ans) | N = int(eval(input()))
def solve_function(N):
if N % 2 == 1:
return 0
n = 10
ans = 0
while True:
if n > N:
break
ans += N//n
n *= 5
return ans
if solve_function(N):
print((solve_function(N)))
else:
print((0)) | p02833 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) f... | p02833 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
if N % 2:
print((0))
return
N //= 10
ans = N
while N:
N //= 5
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
if N % 2:
print((0))
return
ans = 0
N //= 2
while N:
N //= 5
... | p02833 |
import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
def main():
N = int(eval(input()))
if N < 2:
print((0))
return
if N % 2 == 1:
print((0))
return
n = 2
cnt = 0
while n * 5 <= N:
n *= 5... | import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
def main():
N = int(eval(input()))
def F(N):
if N & 1:
return 0
N //= 2
x = 0
while N:
N //= 5
x += N
return x
... | p02833 |
n, k = list(map(int, input().split()))
*A, = list(map(int, input().split()))
MOD = 10**9 + 7
C = {a for a in A}
n = len(C)
m = [[0]*256 for i in range(n+1)]
m[0][0] = 1
for c in C:
for i in range(n-1, -1, -1):
for j in range(256):
m[i+1][c^j] += m[i][j]
m[i+1][c^j] %= ... | n, k = list(map(int, input().split()))
*A, = list(map(int, input().split()))
MOD = 10**9 + 7
C = {a for a in A}
n = len(C)
m = [[0]*256 for i in range(n+1)]
m[0][0] = 1
for c in C:
for i in range(n-1, -1, -1):
s = m[i]; t = m[i+1]
for j in range(256):
t[c^j] += s[j]
ans... | p03931 |
from itertools import chain
n=int(eval(input()))
c=list(range(1,1+2*n))
for _ in[0]*int(eval(input())):
k=int(eval(input()))
c=c[k:]+c[:k]if k else list(chain.from_iterable(x for x in zip(c[:n],c[n:])))
for x in c:print(x)
| from itertools import chain
n=int(eval(input()))
c=list(range(2*n))
for _ in[0]*int(eval(input())):
k=int(eval(input()))
c=c[k:]+c[:k]if k else list(chain.from_iterable(list(zip(c[:n],c[n:]))))
for x in c:print((x+1))
| p00436 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0513
"""
import sys
from sys import stdin
from itertools import chain
input = stdin.readline
def flatten(listOfLists):
"Flatten one level of nesting"
return chain.from_iterable(listOfLists)
def cut(k):
... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0513
AC
"""
import sys
from sys import stdin
from itertools import chain
input = stdin.readline
def flatten(listOfLists):
"Flatten one level of nesting"
return chain.from_iterable(listOfLists)
def cut(k):
... | p00436 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(c_num):
for j in range(money - coins[i] + 1):
rec[j + coins[i]] = min(rec[j + coins[i]], rec[j] + 1)
return rec
if _... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(c_num):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ == '... | p02314 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(all_coins):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for coin in coins:
for current_cost in range(coin, total_cost + 1):
rec[current_cost] = min(rec[current_cost], rec[current_cost - coin * 1] + 1... | p02314 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for coin in coins:
for current_cost in range(coin, total_cost + 1):
rec[current_cost] = min(rec[current_cost], rec[current_cost - coin * 1] + 1... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for coin in coins:
for current_cost in range(coin, total_cost + 1):
rec[current_cost] = min(rec[current_cost], rec[current_cost - coin] + 1)
... | p02314 |
import itertools
def coin_change(coins, val):
num = 1
while True:
for subset in itertools.combinations_with_replacement(coins, num):
if sum(subset) == val:
return num
num += 1
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
... | def coin_change(coins, payment):
T = [0] + [50001] * payment
for c in coins:
for i in range(c, payment + 1):
T[i] = min(T[i], T[i - c] + 1)
return T[payment]
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = coin_change(c, n)
print(ans) | p02314 |
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
dp = [float("inf")]*(n+1)
dp[0] = 0
for i in range(m):
for j in range(c[i], n+1):
dp[j] = dp[j - c[i]]+1 if dp[j - c[i]] < dp[j] else dp[j]
print((dp[n])) | n, m = list(map(int, input().split()))
dp = [0]+[float("inf")]*n
for coin in map(int, input().split()):
for i, j in zip(list(range(n)), list(range(coin, n+1))):
dp[j] = min(dp[i]+1, dp[j])
print((dp[n]))
| p02314 |
# -*- coding: utf-8 -*-
"""
Created on Sat May 26 12:16:54 2018
DPL-1A Rec Call Revised
@author: maezawa
"""
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
c.sort()
dp = [float('inf') for _ in range(n+1)]
dp[0] = 0
#print(n,m)
#print(c)
#print(*dp, sep='\n')
for j in range(... | n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
dp = [0] * (n+1)
for i in range(1, n+1):
dp[i] = min([dp[i - c[j]]+1 for j in range(m) if i-c[j]>=0])
print((dp[n]))
| p02314 |
from itertools import product
class DP:
def __init__(self, value, variety, coins):
self.value = value
self.variety = variety
self.coins = coins
self.DP = [[0 for _ in range(value + 1)] for _ in range(variety)]
self.DPinit()
def DPinit(self):
for row i... | from itertools import product
value, variety = list(map(int, input().split()))
coins = list(map(int, input().split()))
dp = [float("inf") for _ in range(value + 1)]
dp[0] = 0
for (c,j) in product(coins,list(range(value + 1))):
if c <= j:
dp[j] = min(dp[j], dp[j - c] + 1)
else:
dp[j] =... | p02314 |
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
DP = [i for i in range(n + 1)]
for cost in c:
for i in range(cost, n + 1):
DP[i] = min(DP[i], DP[i - cost] + 1)
print((DP[n]))
| #!/usr/bin/env python
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
DP = {}
for i in range(n + 1):
DP[i] = n
DP[0] = 0
for cost in c:
for i in range(cost, n + 1):
DP[i] = min(DP[i], DP[i - cost] + 1)
print((DP[n]))
| p02314 |
n,m = list(map(int,input().split()))
c = list(map(int,input().split()))
minimum = [50000] * (n+1)
minimum[0] = 0
for i in range(1,n+1):
if minimum[i] <= 1:
continue
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i-c[j]]+1
prin... | n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
m = len(c)
minimum = [n] * (n+1)
minimum[0] = 0
for i in c:
minimum[i] = 1
for i in range(1,n+1):
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i-c[j... | p02314 |
n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
m = len(c)
minimum = [n] * (n+1)
minimum[0] = 0
for i in c:
minimum[i] = 1
for i in range(1,n+1):
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i-c[j... | n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
m = len(c)
minimum = [ i for i in range(n+1) ]
for i in c:
minimum[i] = 1
for i in range(1,n+1):
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i-c[j]]... | p02314 |
n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
m = len(c)
minimum = [ i for i in range(n+1) ]
for i in c:
minimum[i] = 1
for i in range(1,n+1):
if minimum[i] <= 2:
continue
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]... | n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
minimum = [ i for i in range(n+1) ]
for i in c:
minimum[i] = 1
for i in range(2,n+1):
for j in c:
if j<=i and minimum[i-j] + 1 < minimum[i]:
minimum[i] = minimum[i-j]+1
print((minimum[n])) | p02314 |
n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
minimum = [ i for i in range(n+1) ]
for i in range(2,n+1):
for j in c:
if j <= i and minimum[i-j] + 1 < minimum[i]:
minimum[i] = minimum[i-j]+1
print((minimum[n])) | n = int(input().split()[0])
c = list(map(int,input().split()))
minimum = [ i for i in range(n+1) ]
for i in range(2,n+1):
for j in c:
if j <= i and minimum[i-j] + 1 < minimum[i]:
minimum[i] = minimum[i-j]+1
print((minimum[n])) | p02314 |
n,m = list(map(int, input().split()))
l = list(map(int, input().split()))
d = [0] * (n+1)
for i in range(1,n+1):
if i in l:
d[i] = 1
else:
min = 50000
for j in range(i+1):
if d[i-j]+d[j] < min and d[i-j]+d[j]>0:
min = d[i-j] + d[j]
d[i] = ... | n = int(input().split()[0])
c = list(map(int,input().split()))
dp = [ i for i in range(n+1) ]
for i in range(2,n+1):
c2 = [n for n in c if n<=i]
for j in c2:
if j <= i and dp[i-j] + 1 < dp[i]:
dp[i] = dp[i-j] + 1
print((dp[n])) | p02314 |
n = int(input().split()[0])
c = list(map(int,input().split()))
dp = [ i for i in range(n+1) ]
for i in range(2,n+1):
c2 = [n for n in c if n<=i]
for j in c2:
if j <= i and dp[i-j] + 1 < dp[i]:
dp[i] = dp[i-j] + 1
print((dp[n])) | n = int(input().split()[0])
c = list(map(int,input().split()))
dp = list(range(n+1))
for i in range(2,n+1):
for j in c:
if j <= i and dp[i-j] + 1 < dp[i]:
dp[i] = dp[i-j]+1
print((dp[n])) | p02314 |
n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
INF = 10**12
T = [[INF for i in range(n+1)] for j in range(m)]
for i in range(n+1):
T[0][i] = i
for i in range(m):
T[i][0] = 0
for i in range(m):
for j in range(1, n+1):
if j - c[i] >= 0:
T[i]... | n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
INF = 10**12
T = [i for i in range(n+1)]
for i in range(m):
for j in range(1, n+1):
if j - c[i] >= 0:
T[j] = min(T[j], T[j - c[i]] + 1)
print((T[n])) | p02314 |
import math
n, m = list(map(int,input().split(' ')))
d = list(map(int,input().split(' ')))
d.sort()
inf = n
dp = [ [ inf for i in range(m+1)] for j in range(n+1) ]
# dp
for j in range(m+1):
dp[0][j]=0
for j in range(m-1,-1,-1):
for i in range(n+1):
for k in range(math.floor(i/d[j])+1 ):... | import math
n, m = list(map(int,input().split(' ')))
d = list(map(int,input().split(' ')))
d.sort()
inf = n
dp = [ [ inf for i in range(m+1)] for j in range(n+1) ]
# dp
for j in range(m+1):
dp[0][j]=0
for j in range(m-1,-1,-1):
for i in range(n+1):
#for k in range(math.floor(i/d[j])+1):... | p02314 |
n, m = list(map(int, input().split()))
l = list(map(int, input().split()))
dp = [False for i in range(n + 1)]
for i in range(m):
if l[i] <= n: dp[l[i]] = True
cnt = 1
while 1:
if dp[n]: break
ndp = [False for i in range(n + 1)]
for i in range(n+1):
if dp[i]:
ndp[i] = True
... | n, m = list(map(int, input().split()))
l = list(map(int, input().split()))
INF = 1<<31
dp = [INF]*(n+1)
dp[0] = 0
for c in l:
for i in range(n-c+1):
if dp[i] != INF:
dp[i + c] = min(dp[i] + 1, dp[i + c])
print(dp[n]) | p02314 |
def calc_number_of_coin(sum, coins):
dp = [999999999]*(sum+1)
dp[0] = 0
for i in range(len(coins)):
for j in range(coins[i], sum+1):
dp[j] = min(dp[j], dp[j-coins[i]]+1)
return dp[sum]
if __name__ == '__main__':
# ??????????????\???
# f = open('input.txt')
... | def calc_number_of_coin(sum, coins):
dp = [999999999]*(sum+1) # ??????????????????????????????????????????????????????????????????dp[sum]????????????????±????????????????????´?????????????9999???????????????????????°
dp[0] = 0 # 0??????????????????????????¶???????????°???0???
... | p02314 |
# -*- coding: utf-8 -*-
N, M = tuple(map(int, input().split()))
coins = sorted(tuple(map(int, input().split())))
counts = [float("inf") for _ in range(N+1)]
counts[0] = 0
for m in range(M):
coin = coins[m]
for n in range(coin, N+1):
counts[n] = min(counts[n], counts[n-coin] + 1)
print((co... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
n, m = inpl()
C = sorted(inpl())
DP = list(range(n+1))
for c in C[1:]:
for i in range(n-c+1):
if DP[i] + 1 < DP[i+c]:
DP[i+c] = DP[i] + 1
print((DP[-1]))
| p02314 |
D, N = list(map(int, input().split()))
if (N == 100):
print(((N * (100 ** D)) + 100**D))
else:
print((N * (100 ** D)))
| D, N = list(map(int, input().split()))
if N == 100:
print((100**D*N+100**D))
else:
print((100**D*N))
| p03324 |
import sys
input=sys.stdin.readline
import fractions
d,n = list(map(int, input().split()))
ans = 100**d*n
if d == 0:
if ans == 100:
ans += 1
elif d == 1:
if ans == 10000:
ans += 100
elif d == 2:
if ans == 1000000:
ans += 10000
print(ans)
| import sys
input=sys.stdin.readline
d,n = list(map(int, input().split()))
if n == 100:
n += 1
print((100**d*n))
| p03324 |
d,n = list(map(int, input().split()))
if d==0:
if n!=100:
print((1*n))
else:
print((101))
else:
if n!=100:
print((100**d*n))
else:
print((100**d*n+100**d)) | d, n = list(map(int, input().split()))
if n == 100:
n = 101
print((str(n) + ('00' * d)))
| p03324 |
d, n = list(map(int, input().split()))
i = 0
j = 1
ans = 0
while i < n:
if j%(100**d) == 0 and j%(100**(d+1)) != 0:
i +=1
ans = j
j +=1
print(ans) | d, n = list(map(int, input().split()))
if n != 100:
print((n*100**d))
else:
print(((n+1)*100**d)) | p03324 |
d, n = list(map(int, input().split()))
if n != 100:
print((n*100**d))
else:
print(((n+1)*100** d))
| d, n= list(map(int, input().split()))
if n != 100:
print((100**d*n))
else:
print((100**d*101))
| p03324 |
d,n = list(map(int, input().split()))
if n == 100: print((100**d*101))
else: print((100**d*n)) | d,n = list(map(int, input().split()))
if d == 0:
if n == 100: print((101))
else: print(n)
elif d == 1:
if n == 100: print((n*100+100))
else: print((n*100))
else:
if n == 100: print((n*(100**2)+10000))
else: print((n*(100**2))) | p03324 |
import math
import string
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
def has_duplicates2(seq):
seen = []
for item in seq:
if not(item in seen):
seen.append(item)
re... | import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factoria... | p03324 |
D, N = list(map(int, input().split()))
ans = 100 ** D
if N // 100 > 0: N += 1
print((ans * N)) | D, N = list(map(int, input().split()))
if N // 100 > 0: N += 1
print((N * 100 ** D)) | p03324 |
d, n = list(map(int, input().split()))
n+=(n>99)
print((n*100**d)) | d,n=list(map(int,input().split()));print((100**d*n if n!=100 else 100**d*101)) | p03324 |
d, n = list(map(int, input().split()))
if d == 0:
if n <= 99:
print(n)
else:
print((101))
elif d == 1:
if n <= 99:
print((100 * n))
else:
print((10100))
else:
if n <= 99:
print((10000 * n))
else:
print((1010000)) | d, n = list(map(int, input().split()))
if d == 0:
if n < 100:
print(n)
else:
print((101))
elif d == 1:
if n < 100:
print((100 * n))
else:
print((10100))
else:
if n < 100:
print((10000 * n))
else:
print((1010000)) | p03324 |
d,n = list(map(int,input().split()))
if n==100 and d==0:
ans = 100**d*n+1
elif n==100 and d==1:
ans = 100**d*n + 100
elif n==100 and d==2:
ans = 100**d*n + 10000
else:
ans = 100**d*n
print(ans)
| d,n = list(map(int,input().split()))
if n==100:
ans = 100**d*(n+1)
else:
ans = 100**d*n
print(ans) | p03324 |
def main():
D, N = (int(i) for i in input().split())
ans = {0: [i for i in range(1, 100)]}
ans[0].append(101)
ans[1] = [100*i for i in range(1, 100)]
ans[1].append(10100)
ans[2] = [10000*i for i in range(1, 100)]
ans[2].append(1010000)
print((ans[D][N-1]))
if __name__ == '__... | def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N * 100**D))
if __name__ == '__main__':
main()
| p03324 |
def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N * 100**D))
if __name__ == '__main__':
main()
| def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N*(100**D)))
if __name__ == '__main__':
main()
| p03324 |
d,n=list(map(int, input().split()))
if n == 100:
print((101 * n**d))
else:
print((100**d * n)) | d, n = list(map(int, input().split()))
if n == 100:
print((101*100**d))
else:
print((100**d*n))
| p03324 |
D,N = list(map(int,input().split()))
ans = (100**D) * N
if(N == 100):
ans += 100**D
print(ans) | d,n = list(map(int,input().split()))
ans = n * 100**d
if n == 100:
ans += 100**d
print(ans) | p03324 |
d, n = list(map(int, input().split()))
for i in range(1, 100000000):
if i % (100 ** d) == 0 and i % (100 * 100 ** d) != 0:
n -= 1
if n == 0:
print(i)
exit()
| # Problem B - Ringo's Favorite Numbers
# input
D, N = list(map(int, input().split()))
# initialization
ans = 0
tmp = 100**D
# count
i = 1
while i<=N:
if i==100:
ans = tmp * (i + 1)
break
ans = tmp * i
i += 1
# output
print(ans)
| p03324 |
d,n =list(map(int,input().split()))
if d==0:
if n==100:
print((101))
else:
print(n)
else:
if n==100 and d==1:
print((100**1*100+100))
elif n==100 and d==2:
print((100**2*100+10000))
else :
print((100**d*n)) | d,n =list(map(int,input().split()))
if n == 100:
n+=1
print((100**d*n)) | p03324 |
D, N = list(map(int, input().split()))
n = 100**D
count = 0
while True:
target = n
count_div = 0
while True:
if target % 100 == 0:
count_div += 1
target //= 100
else:
break
if count_div == D:
count += 1
if count == N:
... | D, N = list(map(int, input().split()))
n = 0
count = 0
while True:
n += 100**D
target = n
count_div = 0
while True:
if target % 100 == 0:
count_div += 1
target //= 100
else:
break
if count_div == D:
count += 1
if coun... | p03324 |
from itertools import *
def nth(iterable, n, default=None):
"Returns the nth item or a default value"
return next(islice(iterable, n, None), default)
D, N = list(map(int, input().split()))
delta = 100 ** D
ite = (x for x in count(delta, delta) if x % (delta * 100) != 0)
print((nth(ite, N - 1))) | from itertools import *
d, n = list(map(int, input().split()))
delta = 100 ** d
ite = (x for x in count(delta, delta) if x % (delta * 100) != 0)
print((list(islice(ite, n - 1, n))[0])) | p03324 |
from itertools import *
d, n = list(map(int, input().split()))
delta = 100 ** d
ite = (x * delta for x in count() if x % 100 != 0)
print((next(islice(ite, n - 1, None)))) | from itertools import *
d, n = list(map(int, input().split()))
ite = (x * 100 ** d for x in count() if x % 100 != 0)
print((next(islice(ite, n - 1, None)))) | p03324 |
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
D, N = list(map(int, input().split()))
l=[(100**D)*x for x in range(2*N) if (100**D)*x % (100**(D+1)) != 0]
print(l[N-1])
| # -*- coding: utf-8 -*-
# スペース区切りの整数の入力
D,N = list(map(int, input().split()))
print((100**D)*(N + (1 if N==100 else 0)))
| p03324 |
d, n = list(map(int, input().split()))
def division(x):
if x % 100 != 0:
return 0
else:
return division(x//100) +1
count= 0
for i in range(1, 1010001):
if division(i) == d:
count +=1
if count == n:
print(i)
break | d, n = list(map(int, input().split()))
if d == 0:
count = 0
for i in range(1, 110):
if i % 100 != 0:
count += 1
if count == n:
print(i)
break
else:
continue
if d == 1:
count = 0
for i in range(10... | p03324 |
D,N=list(map(int,input().split()))
if N!=100:
print((N*100**D))
else:
print((101*100**D))
| D,N=list(map(int,input().split()))
print(((N+N//100)*100**D)) | p03324 |
def func(x):
if(x % 100 != 0):
return 0
else:
return func(x / 100) + 1
if __name__ == '__main__':
d, n = list(map(int, input().split()))
x = 1
cnt = 0
while True:
if func(x) == d:
cnt += 1
if cnt == n:
print(x)
e... | d, n = list(map(int, input().split()))
if n % 100 == 0:
n += 1
print((n * 100 ** d))
| p03324 |
D, N = list(map(int,input().split()))
if N != 100:
print(((100**D)*N))
else:
print(((100**D)*(N+1))) | D, N = list(map(int,input().split()))
if N != 100:
print((str(N)+"0"*(D*2)))
else:
print(((N+1)*(100**D)))
| p03324 |
D,N = list(map(int,input().split()))
if N == 100:
print((100**D*101))
else:
print((100**D*N))
| D,N = list(map(int,input().split()))
if N == 100:
print(((100**D)*(N+1)))
else:
print(((100**D)*N)) | p03324 |
D,N = list(map(int,input().split()))
if D==0:
if N<100:
print(N)
else:
print((101))
else:
if N<100:
print((100**D*N))
else:
print((100**D*101)) | D,N = list(map(int,input().split()))
if D==0 and N<=99:
print((1+N-1))
elif D==0 and N==100:
print((101))
elif D==1 and N<=99:
print((100*N))
elif D==1 and N==100:
print((10100))
elif D==2 and N<=99:
print((10000*N))
elif D==2 and N==100:
print((10000*101)) | p03324 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.