TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Snuke has an integer sequence A of length N.  He will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E. The positions of the cuts can be freely chosen.  Let P,Q,R,S be the sums of the elements in B,C,D,E, respectively. Snuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller. Find the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.

Submission attempts (in order):
N=int(input())
inlis=[int(i) for i in input().split()]
csum=[0]*(N+1)
for i, v in enumerate(inlis, start=1): csum[i] = csum[i-1] + v

i, k = 1, 3
resmin = 9223372036854775807
print(csum)
for j in range(2, N-1):
    while abs((csum[i]-csum[0]) - (csum[j]-csum[i])) > abs((csum[i+1]-csum[0]) - (csum[j]-csum[i+1])): i += 1
    while abs((csum[k]-csum[j]) - (csum[N]-csum[k])) > abs((csum[k+1]-csum[j]) - (csum[N]-csum[k+1])): k += 1
    
    
    
    resmin = min(resmin, max(csum[i]-csum[0], csum[j]-csum[i], csum[k]-csum[j], csum[N]-csum[k]) - min(csum[i]-csum[0], csum[j]-csum[i], csum[k]-csum[j], csum[N]-csum[k]))

print(resmin)


N=int(input())
inlis=[int(i) for i in input().split()]
csum=[0]*(N+1)
for i, v in enumerate(inlis, start=1): csum[i] = csum[i-1] + v
i, k = 1, 3
resmin = 9223372036854775807
for j in range(2, N-1):
    while abs((csum[i]-csum[0]) - (csum[j]-csum[i])) > abs((csum[i+1]-csum[0]) - (csum[j]-csum[i+1])): i += 1
    while abs((csum[k]-csum[j]) - (csum[N]-csum[k])) > abs((csum[k+1]-csum[j]) - (csum[N]-csum[k+1])): k += 1
    resmin = min(resmin, max(csum[i]-csum[0], csum[j]-csum[i], csum[k]-csum[j], csum[N]-csum[k]) - min(csum[i]-csum[0], csum[j]-csum[i], csum[k]-csum[j], csum[N]-csum[k]))
print(resmin)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
def func(x):
    c = 0
    n = x
    while True:
        if n < 100:
            break

        if n % 100 == 0:
            c += 1
            n = n // 100
        else:
            break
    return c


def main():
    d, n = map(int, input().split())

    
    i = 10000
    count = 0
    if d == 0:
        while True:
            if i % 100 != 0:
                count += 1
            if count == n:
                break
            i += 1
    else:
        while True:
            if i % 100 == 0 and func(i) == d:
                count += 1
            if count == n:
                break
            
            i += 1000
    print(i)


if __name__ == '__main__':
    main()


def func(x):
    c = 0
    n = x
    while True:
        if n < 100:
            break
        if n % 100 != 0:
            break
        n = n // 100
        c += 1
    return c


def main():
    d, n = map(int, input().split())

    i = 1
    count = 0
    # while True:
    
    #         count += 1
    #     if count == n:
    #         break
    
    while True:
        if func(i) == d:
            count += 1
        if count == n:
            break
        i += 1
    print(i)


if __name__ == '__main__':
    main()


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n=map(int,input().split())
if n=100:
  print(100**d*101)
else:
  print(100**d*n)

d,n=map(int,input().split())
if n==100:
  print(100**d*101)
else:
  print(100**d*n)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = map(int, input().split())
count = 0
for i in range(0, 10000 * 100 + 1):
  if i % (pow(100 , d)):
    count += 1
    if count == n:
      print(i)
      return


def getDevide100Count(num: int):
    n = 0
    while num % 100 == 0:
        num = num / 100 
        n += 1
    return n


d, n = map(int, input().split())
count = 0
i = 0
while count != n:
    i += 1
    if getDevide100Count(i) == d:
        count += 1

print(i)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):

a = input().split()

b = int(a[0])
c = int(a[1])

if 0 < b < 2:
    print(c*(100**(b)))



a = input().split()

b = int(a[0])
c = int(a[1])

if 0 <= b <= 2:
    if 1<= c <= 99:

      print(c*(100**(b)))
    elif c == 100:
      print(101*(100**(b)))

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
a, b = map(int, input(" "))
if b == 0:
  print(a)
elif b == 1:
  print(a*100)
else:
  print(a*10000)

a, b = map(int, input().split(" "))
b += int(b/100)
  pass
print(b*(100**a))

a, b = map(int, input().split(" "))
b = b + int(b/100)
print(a*(100**b))

a, b = map(int, input().split(" "))
b += int(b/100)
print(b*(100**a))

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int,input().split())

if(N !=100):
    print((100 ** D) * N)    
else:
    print((100 ** D) * (N + 1)

D, N = map(int,input().split())

if(N !=100):
    print((100 ** D) * N)
else:
    print((100 ** D) * (N + 1))

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = map(int, input().split())
ans = 100 ** 2 * n
print(ans)

d, n = map(int, input().split())
ans = d * 100 * n
print(ans)

d, n = map(int, input().split())
if n == 100:
    print(100 ** d * 101)
else:
    print(100 ** d * n)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = [int(i) for i in input().split()]
base = pow(100, D)
 
i  = 0
while D > 0:
  i += 1
  if i % base == 0:
    continue
  D -= 1
 
print(i * base)

D, N = [int(i) for i in input().split()]
base = pow(100, D)
print(N * base if N != 100 else 101 * base)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n = map(int, input().split())
if d == 0:
    l = [i for i in range(1,100)]
elif d == 1:
    l = [i for i in range(100, 10000, 100)]
else:
    l = [i for i in range(10000, 1000000, 10000)]
print(l[n])

d,n = map(int, input().split())
r = 100 ** d
l = [i for i in range(0, r*100, r)]
if n == 100:
    print(100 ** (d + 1) + 100 ** d)
else:
    print(l[n])


Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
n,k=map(int,input().split())
if k==100:
  print(100**n*101)
else:
  print(100**2*k)

n,k=map(int,input().split())
if k==100:
  print(100**n*101)
else:
  print(100**n*k)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
#encoding:utf-8

d=int(input())

n=int(input())

r=(100**d)*n

print(r)


d=int(input())

n=int(input())

r=(100**d)*n

print(r)


# encoding:utf-8

import copy
import numpy as np
import random



d,n = map(int, input().split())
if n == 100:
    print(100**d*101)
    exit()
else:
    print(100**d*n)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int, input().split())
count = 0
ans = 0

while count != N:
    if D == 0:
        if N == 100:
            count += 1
            ans = count
    elif D == 1:
        count += 1
        ans = count * 100

    elif D == 2:
        count += 1
        ans = count * 10000

print(ans)


D, N = map(int, input().split())

if D == 1:
    num = [i*100 for i in range(1, N+1)]
    if N == 100:
        num[-1] += 100

elif D == 2:
    num = [i*10000 for i in range(1, N+1)]
    if N == 100:
        num[-1] += 10000

elif D == 0:
    num = [i for i in range(1, N+1)]
    if N == 100:
        num[-1] += 1

print(num[-1])


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1and n!=100:
    print(n*100)
elif d==1 and n==100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000)
elif d==2 and n==100:
    pront(1010000

d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1and n!=100:
    print(n*100)
elif d==1 and n=100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000)
elif d==2 and n==100:
    pront(1010000)

d,n=map(int,input().split())
if d==0 and n!=100:
    print(n)
elif d==0 and n==100:
    print(101)
elif d==1 and n!=100:
    print(n*100)
elif d==1 and n==100:
    print(10100)
elif d==2 and n!=100:
    print(n*10000) 
elif d==2 and n==100:
    print(1010000)

         


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int, input().split())

def chk(n):
    for _ in [0]*D:
        if n % 100 == 0:
            n //= 100
            continue
        else:
            return False
    return True

i = 1
cnt = 0
while cnt < N:
    i += 1
    if chk(i):
        cnt += 1

print(i)

D, N = map(int, input().split())

def chk(n):
    for _ in [0]*D:
        if n % 100 == 0:
            n //= 100
            continue
        else:
            return False
    if n % 100 == 0: return False
    else: return True

i = 0
cnt = 0
while cnt < N:
    i += 1
    if chk(i):
        cnt += 1

print(i)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n=map(int,input().split())
if d==0:
    ans=1*(n+n%100)
elif d==1:
    ans=100*(n+n%100)
else:
    ans=10000*(n+n%100)
print(ans)


d,n=map(int,input().split())
if d==0:
    ans=1*(n//100+n)
elif d==1:
    ans=100*(n//100+n)
else:
    ans=10000*(n//100+n)
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n=map(int,input().split())
if(n==100):
    n=101
print(m*pow(100,d))



import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, N = MAP()
if N == 100:
    print(100 ** D * N + 100 ** D)
else:
    print(100 ** D * N)


Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
a,b = map(int, input().split())
if b == 100:
    print(a ** 100 * 101)
else:
    print(a ** 100 * b)

a,b = map(int, input().split())
if b == 100:
    print(100 ** a * 101)
else:
    print(100 ** a * b)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n=input().split()
d=int(d)
n=int(n)

if d=0:
	print(d)
elif d=1:
	print(n*10)
else:
	print(n*10000)

d,n=input().split()
d=int(d)
n=int(n)

if d==0:
	print(d)
elif d==1:
	print(n*10)
else:
	print(n*10000)

d,n=input().split()
d=int(d)
n=int(n)

if d==0:
	if n==100:
		print(101)
	else:
		print(n)
elif d==1:
	if n==100:
		print(10100)
	else:
		print(n*100)
else:
	if n==100:
		print(1010000)
	else:
		print(n*10000)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int, input().split())

key = pow(100, D)


print(D, N)
if N != 100:
    print(key * N)
else:
    print(key * N + key)


D, N = map(int, input().split())

key = pow(100, D)


if N != 100:
    print(key * N)
else:
    print(key * N + key)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
a,b=map(int,input().split())
if b=100:
  b+=1

print(b*(100**a))


a,b=map(int,input().split())
if b==100:
  b+=1

print(b*(100**a))


Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = 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 = map(int, input().split())

if d == 0:
    if n <= 99:
        print(n)
    else:
        print(101)
elif d == 1:
    if n <= 99:
        print(n*100)
    else:
        print(10100)
elif d == 2:
    if n <= 99:
        print(n*10000)
    else:
        print(1010000)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N = map(int,input().split())
k = 100**D
m = 100**(D+1)
cnt = 0
for i in range(1,200):
  if (i*k)%m != 0:
    cnt +=1
    if cnt =N:
      print(i*k)
      break

D,N = map(int,input().split())
k = 100**D
m = 100**(D+1)
cnt = 0
for i in range(1,200):
  if (i*k)%m != 0:
    cnt +=1
    if cnt ==N:
      print(i*k)
      break

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N=map(int,input().split())
S=0
if D==0:
    if N=100:
        S=1
    print(N+S)
elif D==1:
    print(100*N)
else:
    print(10000*N)

D,N=map(int,input().split())
S=0
if N==100:
    S=1
print(100**D*(N+S))

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):

if a == 0 and b == 100:
    print(101)
elif a == 1 and b == 100:
    print(10100)
elif a == 2 and b == 100:
    print(1010000)
else:
    print(100**a * b)

a, b = [int(x) for x in input().split()]

if b == 100:
    b = 101
    
print(100**a * b)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
int_n = int(input())

bin_number = format(int_n, 'b')

bin_sum = sum(list(map(int, list(str(bin_number)))))

if int_n % bin_sum == 0:
    print("Yes")
else:
    print("No")



d, n = map(int, input().split())

print([i * (100 ** d) for i in range(1, 102) if i != 100][n - 1])







Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n = map(int,input())

if d == 0:
  print(n)
else:
  print(100*d*n)

d,n = map(int,input().split())
 
if d == 0:
    if n == 100:
        print(101)
  print(n)
else:
    if d == 1 and n == 100:
        print(10001)
  print(100*d*n)


d,n = map(int,input().split())
 
if d == 0:
    if n == 100:
        print(101)
    else: 
        print(n)
else:
    if n == 100:
        print(pow(100,d)*(n+1)) 
    else:
        print(pow(100,d)*n)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
ringo = list(map(int,input().split()))

a = 100**ringo[0]

print("answer is %d" % (ringo[1]*a))

ringo = list(map(int,input().split()))

a = (100**ringo[0])*ringo[1]

if ringo[1] is 100:	
	a = (100**ringo[0])*(ringo[1]+1)

print(a)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
def calc(n):
    if n % 100 != 0:
        return 0
    return calc(n // 100) + 1

D, N = map(int, input().split())

count = 0
i = 1
while(1):
    if (calc(i) == D):
        count += 1
        if count == N:
            print(i)
            break

D, N = map(int, input().split())
if N == 100:
    N += 1
ans = N * (100 ** D)
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
N = input()

tmp = 0
for i in range(len(N)):
    tmp += int(N[i])

if int(N) % tmp == 0:
    print('Yes')
else:
    print('No')

N = input()

tmp = 0
for i in range(len(N)):
    tmp += int(N[i])

if int(N) % tmp == 0:
    print('Yes')
else:
    print('No')

D, N = map(int, input().split())
if D == 0:
    if N == 100:
        print(101)
    else:
        print(N)
    
else:
    if N == 100:
        print((100 ** D) * (N + 1))
    else:
        print((100 ** D) * N)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int, input().split())

print(100**D + N)

D, N = map(int, input().split())
if N == 100:
	N += 1
print(N*100**D)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D N =input()
if D ==0:
    print(N)
elif D == 1:
    print(N*100)
elif D == 2:
    print(N*10000)

D,N =map(int,input().split())
if D ==0 and N <100:
    print(N)
elif D ==0 and N ==100:
    print(N+1)
elif D == 1 and N <100:
    print(N*100)
elif D ==1 and N ==100:
    print((N+1)*100)

elif D == 2 and N <100:
    print(10000*N)
elif D == 2 and N==100:
    print((N+1)*10000)


Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = map(int, input().split())
print(100**d+n)


d, n = map(int, input().split())
if n == 100:
    n = 101
print(100**d*n)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
number = input()
a = number.split()

D=int(a[0])
N=int(a[1])

if D=0:
    print(N)
elif D=1:
    answer = 100*N
    print(answer)
elif D=2:
    answer = 10000*N
    print(answer)

number = input()
a = number.split()

D=int(a[0])
N=int(a[1])

if N == 100:
    if D==0:
        print(N+1)
    elif D==1:
        answer = 100*N
        print(answer+100)
    elif D==2:
        answer = 10000*N
        print(answer+10000)

else:
    if D==0:
        print(N)
    elif D==1:
        answer = 100*N
        print(answer)
    elif D==2:
        answer = 10000*N
        print(answer)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = map(int, input().split())
print((100 ** d) * n if n % 100 != 0)
print((100 ** d) * (n+1) if n % 100 == 0)

d, n = map(int, input().split())
if n % 100 != 0:
    print((100 ** d) * n)
if n % 100 == 0:
    print((100 ** d) * (n+1))

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
def main():
	D, N = map(int, input().split())
	if N == 100:
		N += 1
	print(N * (100**D)

if __name__ == '__main__':
	main()

def main():
	D, N = map(int, input().split())
	if N == 100:
		N += 1
	print(N * (100**D))

if __name__ == '__main__':
	main()

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n = map(int, input().split())
if n == 100:
    print(100**d * 101)
else:
    print(100*d * n)


dn = input()
d , n = dn.split()
d = int(d)
n = int(n)
ringo = 100^d
res = ringo * n
print(res)


dn = input()
d, n = dn.split()
d = int(d)
n = int(n)
list = []
for i in range(1, 1000001):
    if i% 100**d:
        list.append(i)

print(list[n+1])


n = int(input())
line = input()
liststr = line.split()
list = []

for i in liststr:
    i = int(i)
    list.append(i)


cc = 0
for r in list:
    while r%2 == 0:
        r = r / 2
        cc = cc + 1


print(cc)


d,n = map(int, input().split())
if n == 100:
    print(100**d * 101)
else:
    print(100**d * n)


Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int, input().split())

if N == 100:
    num = 101 * (10**D)
else:
    num = 100 * (10**D)

print(num)

D, N = map(int, input().split())

if N == 100:
    num = 101 * (100**D)
else:
    num = N * (100**D)

print(num)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N=map(int,input().split())
if N==100:
  (n+1*(100**D)
else:
  print(N*(100**D)


D,N=map(int,input().split())
if N==100:
  print((N+1)*(100**D)
else:
  print(N*(100**D)


D,N=map(int,input().split())
if N==100:
  ((N+1)*(100**D)
else:
  print(N*(100**D)


D,N=map(int,input().split())
if N==100:
  print((N+1)*(100**D)
else:
  print(N*(100**D))

D,N=map(int,input().split())
if N==100:
  (N+1*(100**D)
else:
  print(N*(100**D)


D,N=map(int,input().split())
print(N*(100**D)

D,N=map(int,input().split())
if N==100:
  print((N+1)*(100**D))
else:
  print(N*(100**D))


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N = map(int,input().split())

print((100^D)*N)

D,N = map(int,input().split())
if N == 100:
  print((100**D)*(N+1))
else:
  print((100**D)*N)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
print(100 ** int(input()) * int(input())

D, N = map(int, input().split())
print(100 ** D * N if N != 100 else 100 ** D * 101)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
def test():
    d,n = map(int,input().split())
    if d == 0:
        a = [i for i in range(1,n+1) if int(i/100)==0 or i%100 != 0]
        print(a[n])
    elif d == 1:
        a = [i for i in range(1,n+1) if int(i/100)==1]
        print(a[n])
    elif d == 2:
        a = [i for i in range(1,n+1) if int(i/100)==2]
        print(a[n])


if __name__ == "__main__":
    test()


def test():
    d,n = map(int,input().split())
    if n == 100:
        n += 1
    print(100**d*n)


if __name__ == "__main__":
    test()


Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = map(int, input().split())
count = 0
i = 1
while True:
    if i%100*d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

d, n = map(int, input().split())
count = 0
i = 1

while True:
    c = 0
    num = i
    while num >= 100:
        if num%100==0:
            num = num//100
            c += 1
        else:
            break
    if c==d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
#ABC 100 B - Ringo's favorite number
A = [int(el) for el in input().split(' ')]
if N != 100:
    print(100**A[0] * A[1])
else:
    print(100**A[0] * 101)


#ABC 100 B - Ringo's favorite number
A = [int(el) for el in input().split(' ')]
if A[1] != 100:
    print(100**A[0] * A[1])
else:
    print(100**A[0] * 101)


Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):

def main():
    D, N = map(int, readline().split())
    if N!=100:
        ans = 100**D * N
    else:
        ans = 100**D*(N+1)
    print(ans)

D,N=map(int,input().split())
if N!=100:
    print(N*100**D)
else:
    print(101*100**D)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, M=map(int, input().split())
print((100**D)*N)

D, N=map(int, input().split())
a=0
if N==100:
  a=100**D
print((100**D)*N+a)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N = map(int,input().split())

if N < 100:
    X = (100 ** D) * N
else:
    X = (100 ** D) * (N+1)

    print(X)

D,N = map(int,input().split())

if N < 100:
    X = (100 ** D) * N
else:
    X = (100 ** D) * (N+1)

print(X)


Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
a,b=map(int,input().split())
print(b*100**2)

a,b=map(int,input().split())
if b!=100:
    print(b*100**a)
else: 
    print((b+1)*100**a)

Verdicts: Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n  = map(int, input().split())

if d == 0:
    if n == 100:
        print 101
    else:
        print(1 * n)
if d == 1:
    if n == 100:
        print 10001
    else:
        print(100 * n)
if d == 2:
    if n == 100:
        print 1000001
    else:
        print(10000 * n)

d, n  = map(int, input().split())

if d = 0:
    print(1 * n)
if d = 1:
    print(100 * n)
if d = 2:
    print(10000 * n)

d, n  = map(int, input().split())

if d == 0:
    if n == 100:
        print(101)
    else:
        print(1 * n)
if d == 1:
    if n == 100:
        print(10100)
    else:
        print(100 * n)
if d == 2:
    if n == 100:
        print(1010000)
    else:
        print(10000 * n)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
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)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


d, n = map(int, input().split())


def func(x):
    cnt = 0
    while x % 100 == 0:
        cnt += 1
        x /= 100
    return cnt == d


a = []

for i in range(1, 10000000):
    if func(i):
        a.append(i)
print(a[n-1])


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)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


d, n = map(int, input().split())


def func(x):
    cnt = 0
    while x % 100 == 0:
        cnt += 1
        x /= 100
    return cnt == d


cntcnt = 0

for i in range(1, 10000000):
    if func(i):
        cntcnt += 1
        if cntcnt == n:
            print(i)
            exit()


Verdicts: Time Limit Exceeded

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N=map(int,input().split())
if N=100 :
    print((N+1)*100**D)
else :
    print(N*100**D)

D,N=map(int,input().split())
if N=100 :
    print((N+1)*100*D)
else :    
    print(N*100**D)


D,N=map(int,input().split())
if N<100 :
    print(N*100**D)
else :
    print((N+1)*100**D)    


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d, n = map(int, input().split())
if n = 100:
  print(100**d*101)
else:
  print(100**d*n)

d, n = map(int, input().split())
if n == 100:
  print(100**d*101)
else:
  print(100**d*n)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D,N=map(int,input().split())
print((100**D)*N if N<100 else print((N+1)*(100**D))

D,N=map(int,input().split())
print(((100**D)*N) if N<100 else ((N+1)*(100**D)))

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
ｔd,n = map(int,input().split())
print(n*100**d)

d,n = map(int,input().split())
print(n*100**d if n < 100 else 101*100**d)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
a,b=input().split();print(100**a*b)

a,b=map(int,input().split());print(100**a*(b+b==100))

a,b=map(int,input().split());print(b**a*(100+b==100))

a,b=map(int,input().split());print((b+(b==100))*100**a)

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
print(d)
print(n)
print((100**d)*n)

a = input()
b = a.split()
d = float(b[0])
n = float(b[1])
print((100**d)*n)


a = input()
b = a.split()
d = int(b[0])
n = int(b[1])

if(n == 100):
  print((100**d)*(n + 1))
else:
  print((100**d)*n)


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
D, N = map(int, input().split())
if N = 100:
  print((100 ** D) * (101))
else:
  print((100 ** D) * N)


D, N = map(int, input().split())
if n = 100:
  print((100 ** D) * (N+1))
else:
  print((100 ** D) * N)

D, N = map(int, input().split())
if N == 100:
  print((100 ** D) * (101))
else:
  print((100 ** D) * N)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):
d,n = map(int,input().split())
if d == o:
  print(n)
elif d == 1:
  print(100*n)
elif d == 2:
  print(10000*n)

d,n = map(int,input().split())
print(n*100**d if 1<=n<=99 else 101*100**d)

Verdicts: Runtime Error

Accepted
Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.   As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 **exactly** D times.  Find the N-th smallest integer that would make Ringo happy.

Submission attempts (in order):

#                         created: 2019-11-08 12:38:16(JST)
## internal modules
import sys
# import collections
# import math
# import string

# import re
# import itertools
# import statistics
# import functools

## external modules
# import scipy.special   # if use comb function on AtCoder, 
# import scipy.misc      # select scipy.misc.comb (old version) 

def main():
    d, n = (int(x) for x in sys.stdin.readline().split())
    if n < 100:
        ans = n * 100 * d
    else:
        ans = 101 * 100 * d
    
    print(ans)


if __name__ == "__main__":
    # execute only if run as a script
    main()


import sys

d, n = map(int, sys.stdin.readline().split())

def main():
    return 100 ** d * n if n < 100 else 100 ** d * 101

if __name__ == '__main__':
    ans = main()
    print(ans)

Verdicts: Wrong Answer

Accepted