problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02879
|
s525202358
|
Wrong Answer
|
a,b=map(int,input().split())
if a|b > 9:
print(-1)
else:
print(a*b)
|
p03657
|
s209041437
|
Accepted
|
a,b = map(int,input().split())
if a % 3 == 0 or b % 3 == 0 or (a+b) % 3 == 0:
print('Possible')
else:
print('Impossible')
|
p02765
|
s285334843
|
Wrong Answer
|
from sys import stdin
N,R = [int(x) for x in stdin.readline().rstrip().split()]
print(R + (100*(10-N)))
|
p03997
|
s482044497
|
Accepted
|
from sys import stdin
input = stdin.readline
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h//2)
|
p03774
|
s607142135
|
Accepted
|
#11
n,m = map(int,input().split())
ab = []
cd = []
for i in range(n):
ab.append(list(map(int,input().split())))
for i in range(m):
cd.append(list(map(int,input().split())))
for i in range(n):
Max = [0,float("inf")]
for j in range(m):
l = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
if Max[1]>l:
Max = [j+1,l]
print(Max[0])
|
p03105
|
s711009307
|
Accepted
|
#import sys
#import numpy as np
import math
#import itertools
#from fractions import Fraction
#import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
#import bisect
a,b,c=map(int,input().split())
if b//a<c:
print(b//a)
else:
print(c)
|
p02682
|
s215019350
|
Accepted
|
a, b, c, k = map(int, input().split())
if a >= k:
print(k)
elif a+b >= k:
print(a)
elif a+b+c >=k:
sum = a - (k - (a+b))
print(sum)
|
p02694
|
s361228522
|
Accepted
|
x=int(input())
d=100
y=d
i=0
while(y<x):
y=int(y*1.01)
i+=1
print(i)
|
p03419
|
s397749930
|
Wrong Answer
|
n, m = map(int, input().split())
if n == 1 or m == 1:
print(max(n, m) - 2)
else:
print((n - 2) * (m - 2))
|
p03457
|
s898708069
|
Accepted
|
N = int(input())
now_t = 0
now_x = 0
now_y = 0
flag = 0
for i in range(N):
t,x,y = map(int,input().split())
if abs(x-now_x)+abs(y-now_y)<= abs(t-now_t) and (abs(x-now_x)+abs(y-now_y))%2 == abs(t-now_t)%2:
now_t = t
now_x = x
now_y = y
else:
flag += 1
break
if flag == 0:
print("Yes")
else:
print("No")
|
p03457
|
s765464118
|
Accepted
|
n=int(input())
t=[0]*(n+1)
x=[0]*(n+1)
y=[0]*(n+1)
for i in range(n):
t[i+1],x[i+1],y[i+1] = map(int,input().split())
flag=True
for i in range(n):
time=t[i+1]-t[i]
dist=abs(x[i+1]-x[i])+abs(y[i+1]-y[i])
if dist>time:
flag=False
if dist%2 != time%2:
flag=False
if flag == True:
print('Yes')
else:
print('No')
|
p02572
|
s724250222
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
answer = 0
mod = 10**9 + 7
total_sum = sum(a)
for idx in range(n - 1):
total_sum -= a[idx]
answer += a[idx] * total_sum
print(answer % mod)
|
p03745
|
s296019420
|
Accepted
|
N=int(input())
A=list(map(int,input().split()))
F=0
K=1
b=A[0]
for a in A:
if F==0:
if b<a:
F=1
b=a
elif b>a:
F=-1
b=a
elif F==1 and b>a:
K+=1
F=0
elif F==-1 and b<a:
K+=1
F=0
b=a
print(K)
|
p03457
|
s887876375
|
Accepted
|
N = int(input())
plan = [[0,0,0]]
plan.extend(list(map(int, input().split())) for i in range(N))
f = True
for i in range(N):
time = plan[i+1][0]-plan[i][0]
dist = abs(plan[i+1][1]-plan[i][1])+abs(plan[i+1][2]-plan[i][2])
if dist>time or (dist%2 != time%2):
f = False
print('Yes' if f else 'No')
|
p02552
|
s048284091
|
Accepted
|
print(int(input())^1)
|
p03075
|
s115555207
|
Accepted
|
import sys
a = [int(input()) for _ in range(6)]
for i in a[1:-1]:
if i-a[0] > a[-1]:
print(':(')
sys.exit()
print('Yay!')
|
p02661
|
s139372645
|
Accepted
|
import numpy as np
N = int(input())
A, B = [], []
for i in range(N):
a, b = map(int, input().split())
A.append(a if N & 1 else 2 * a)
B.append(b if N & 1 else 2 * b)
a, b = int(np.median(A)), int(np.median(B))
print(b - a + 1)
|
p03471
|
s222008953
|
Wrong Answer
|
n,y = map(int,input().split())
for a in range(2001):
for b in range(2001):
c = n - a - b
if 10000*a + 5000*b + 1000*c == y and 0 <= c <= 2000:
print(str(a) + " " + str(b) + " " + str(c))
break
|
p02675
|
s995828852
|
Wrong Answer
|
N=input()
a=[]
a=N
b=a[int(len(N))-1]
if(b==0 or b==1 or b==6 or b==8):
print('pon')
elif(b==3):
print('bon')
else:
print('hon')
|
p03481
|
s954666647
|
Accepted
|
X, Y = map(int, input().split())
cnt = 0
while X <= Y:
X *= 2
cnt += 1
print(cnt)
|
p03380
|
s132799637
|
Accepted
|
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
lst1 = list(map(int,readline().split()))
lst1.sort(reverse=True)
i = lst1[0]
lst1 = lst1[1:]
res = i/2
res2 = -1
minimum = 10**18
for j in lst1:
if abs(j-res) < minimum:
res2 = j
minimum = abs(j-res)
print(i,res2)
|
p04019
|
s574308497
|
Wrong Answer
|
import sys
from collections import Counter
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
s = input()
if not ("N" in s and "S" in s):
print("No")
exit()
if not ("E" in s and "W" in s):
print("No")
exit()
print("Yes")
|
p03994
|
s955737983
|
Wrong Answer
|
s = list(input())
k = int(input())
n = len(s)
c = ord("z") + 1
for i in range(n):
tmp = c - ord(s[i])
if k >= tmp:
s[i] = "a"
k -= tmp
if k > 0:
s[n-1] = chr((ord(s[n-1])+k%26)%123)
print("".join(s))
|
p03456
|
s057831082
|
Accepted
|
a,b=input().split()
a=str(a)
b=str(b)
n=int(a+b)
#print(n)
for i in range(500):
if n == i**2:
print("Yes")
exit()
print("No")
|
p02873
|
s136074486
|
Accepted
|
S=input()
import itertools
A=[]
for key,g in itertools.groupby(S):
A.append([key,len(list(g))])
ans=0
open=True
cur=0
for i in range(len(A)):
key=A[i][0]
n=A[i][1]
if (i==0 and key==">") or (i==len(A)-1 and key=="<"):
ans+=n*(n+1)//2
else:
if open:
cur=n
open=False
else:
if n>cur:
cur-=1
else:
n-=1
ans+=cur*(cur+1)//2+n*(n+1)//2
open=True
print(ans)
|
p04029
|
s304940336
|
Wrong Answer
|
n = int(input())
print(n*(n+1)/2)
|
p02689
|
s434412557
|
Accepted
|
def main():
n, m = map(int, input().split())
h = list(map(int, input().split()))
to = [0]*(n+1)
ans = 0
for _ in range(m):
a, b = map(int, input().split())
to[a] = max(to[a], h[b-1])
to[b] = max(to[b], h[a-1])
for i, hi in enumerate(h, 1):
t = to[i]
if t == 0 or hi > t:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02712
|
s044034889
|
Accepted
|
a = int(input())
sum = 0
for i in range(1,a+1):
if(i % 3==0 or i % 5==0 or i% 15 == 0):
continue
else:
sum += i
print(sum)
|
p02583
|
s180534992
|
Wrong Answer
|
import itertools
N=int(input())
LN=list(input().split(' '))
print(LN)
LN.sort()
LN_sort=list(dict.fromkeys(LN))
print(LN_sort)
cbn=list(itertools.combinations(LN_sort,3))
cnt=int(0)
for i in range(len(cbn)):
if int(cbn[i][0])+int(cbn[i][1])>int(cbn[i][2]):
cnt+=LN.count(cbn[i][0])*LN.count(cbn[i][1])*LN.count(cbn[i][2])
print(cnt)
|
p04030
|
s497966459
|
Wrong Answer
|
s = list(input())
s.reverse()
print(''.join(s))
b = 0
ans = ''
for c in s:
if c == 'B':
b += 1
else:
if b > 0:
b -= 1
continue
else:
ans += c
ans = list(ans)
ans.reverse()
print(''.join(ans))
|
p03633
|
s325090031
|
Accepted
|
from fractions import gcd
def lcm(a,b): return a*b//gcd(a,b)
n = int(input())
ans = 1
for i in range(n):
t = int(input())
ans = lcm(t, ans)
print(ans)
|
p02676
|
s459314982
|
Wrong Answer
|
k = int(input())
s = input()
if len(s) > len(s[:k]):
s += '...'
print(s)
|
p03264
|
s056290186
|
Accepted
|
import itertools
N = int(input())
odd = N // 2 + N % 2
even = N // 2
print(odd * even)
|
p02708
|
s074438835
|
Wrong Answer
|
mod=10**9+7
n,k=map(int,input().split())
ans=(n+1)*( (n+k+1)*(n-k+2)/2 - (n+2)*(2*n+3)/6 )+k*(k-1)*(2*k-1)/6+(n-k+2)
ans=int(ans)%mod
print(ans)
|
p04033
|
s151902454
|
Wrong Answer
|
a,b =map(int, input().split())
if b < 0:
if (b - a)%2 == 0:
print('Positive')
else:
print('Negative')
elif b >= 0 and a <= 0:
print('Zero')
else:
print('Positive')
|
p02882
|
s695102672
|
Accepted
|
# https://atcoder.jp/contests/abc144/tasks/abc144_d
import math
a, b, x = map(int, input().split())
# 高さ
y = x / (a ** 2)
if y >= ((1 / 2) * b):
d = math.atan2(2 * (y * a - a * b), a ** 2)
# dを度数法単位に変換
d_deg = math.degrees(d)
print(abs(d_deg))
else:
d = math.atan2((1 / 2) * (b ** 2), y * a)
# dを度数法単位に変換
d_deg = math.degrees(d)
print(abs(d_deg))
|
p03262
|
s099119189
|
Accepted
|
from math import *
def gcd2(array):
temp = array[0]
for a in array[1:]:
temp = gcd(temp, a)
return temp
N, X = map(int, input().split())
D = []
for x in map(int, input().split()):
D.append(abs(x-X))
print(gcd2(D))
|
p03386
|
s736891629
|
Wrong Answer
|
A, B, K = map(int, input().split())
for i in range(K):
print(A + i)
for j in reversed(range(K)):
print(B - j)
|
p03386
|
s738851490
|
Accepted
|
# -*- coding: utf-8 -*-
"""
Created on Wed May 13 17:30:58 2020
@author: shinba
"""
a,b,k = map(int,input().split())
if b-a+2 <= 2*k:
for i in range(a,b+1):
print(i)
else:
for i in range(a,a+k):
print(i)
for i in range(b-k+1,b+1):
print(i)
|
p02778
|
s630279067
|
Wrong Answer
|
s=input()
a = len(s)
for i in range(a):
print('x')
|
p02730
|
s300239680
|
Accepted
|
s = input();
n = len(s);
ss = "";
sss = "";
ssss = "";
for i in range(1,n+1):
ss = ss + s[n-i];
mid = int((n+1)/2);
for i in range(mid-1):
sss = sss + s[mid-2-i]
for i in range(mid-1):
ssss = ssss + s[n - i -1];
if ss ==s and sss == s[0:mid-1] and ssss == s[mid:n]:
print("Yes");
else:
print("No")
|
p03073
|
s678336258
|
Accepted
|
from distutils.util import strtobool
s = input()
ss = [int(s[0]) if x % 2 == 0 else int(s[0])^1 for x in range(len(s))]
cnt = 0
for i in range(len(s)):
if int(s[i]) != ss[i]:
cnt += 1
print(cnt)
|
p02953
|
s634253418
|
Wrong Answer
|
n = int(input())
h = list(map(int, input().split()))
zenkai_gen = False
no_flag = False
for i in range(n-1):
sa = h[i+1] - h[i]
if (zenkai_gen == True) and (sa < 0):
no_flag = True
elif sa <= -2:
no_flag = True
else:
pass
if sa <= 0:
zenkai_gen = True
else:
zenkai_gen = False
if no_flag == True:
print("No")
else:
print("Yes")
|
p02923
|
s517796192
|
Wrong Answer
|
import sys
N = int(input())
H = [int(N) for N in input().split()]
arr = []
cnt = 0
if H == sorted(H):
print(0)
sys.exit()
for i in range(0,N-1):
if H[i]>=H[i+1]:
cnt=cnt+1
print (cnt-1)
|
p02793
|
s285190344
|
Wrong Answer
|
import numpy as np
import fractions as fr
N = int(input())
As = np.array(list(map(int, input().split())), int)
def mylcm(a, b):
return a * b // fr.gcd(a, b)
M = As[0]
for Ai in As[1:]:
M = mylcm(M, Ai)
B = [M//Ai for Ai in As]
print(sum(B) % (10**9 + 7))
|
p03145
|
s811622045
|
Accepted
|
a,b,c=map(int,input().split())
a=0.5 * a* b
print("%d"%a)
|
p02702
|
s448166124
|
Accepted
|
S=list(map(int,input()[::-1]))
lenS=len(S)
cnt = [0]*2019
tmp = 0
for n,i in enumerate(S):
tmp += i*pow(10,n,2019)
cnt[tmp%2019]+=1
ans = cnt[0]*(cnt[0]+1)//2
for i in cnt[1:]:
ans += i*(i-1)//2
print(ans)
|
p03324
|
s357418495
|
Accepted
|
D,N=map(int,input().split())
print(100**D * N if N !=100 else 100**D*101)
|
p02571
|
s632183244
|
Accepted
|
S = input()
T = input()
res = 0
for i in range(len(S) - len(T) + 1):
tmp = 0
for j in range(len(T)):
if S[i+j] == T[j]:
tmp += 1
res = max(res, tmp)
print(len(T) - res)
|
p03617
|
s762249923
|
Accepted
|
q, h, s, d = map(int,input().split())
n = int(input())
v1 = min(q*4, h*2, s* 1)
v2 = min(v1 * 2, d)
print(n // 2 * v2 + n%2 * v1)
#print(v1, v2)
|
p02792
|
s475401488
|
Accepted
|
N = int(input())
table = [[0]*10 for i in range(10)]
for i in range(1, N+1):
s = str(i)
id1 = int(s[0])
id2 = int(s[-1])
table[id1][id2] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += table[i][j]*table[j][i]
print(ans)
|
p03262
|
s307579296
|
Accepted
|
from functools import reduce
def gcd(a, b):
while b:
a, b = b, a % b
return a
def gcd_n(numbers):
return reduce(gcd, numbers)
def main():
N, X, *x = map(int, open(0).read().split())
x = [abs(X - int(i)) for i in x]
print(gcd_n(x))
return
main()
|
p02924
|
s695646912
|
Accepted
|
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N = I()
print(N*(N-1)//2)
|
p03293
|
s201905015
|
Accepted
|
s = input()
t = input()
for i in range(len(s)):
s = s[-1] + s[:-1]
if s == t:
print("Yes")
exit()
else:
pass
print("No")
|
p03944
|
s681403266
|
Accepted
|
W,H,N = map(int,input().split())
height = set([])
wigth = set([])
for i in range(N):
x,y,a = map(int,input().split())
if a == 1:
for i in range(x):
wigth.add(i)
elif a == 2:
for i in range(x,W):
wigth.add(i)
elif a == 3:
for i in range(y):
height.add(i)
else:
for i in range(y,H):
height.add(i)
print((H-len(height))*(W-len(wigth)))
|
p02640
|
s515169224
|
Wrong Answer
|
x, y = list(map(int,input().split()))
ans = y / 2 - x
if y % 2 != 0:
print("No")
elif ans <= x or ans == x:
print("Yes")
else:
print("No")
|
p03012
|
s760242527
|
Accepted
|
m_num = int(input())
w = list(map(int,input().split()))
temp = []
for i in range(m_num -1 ):
temp.append(abs(sum(w[0:i+1]) - sum(w[i + 1:])))
print(min(temp))
|
p03986
|
s281365646
|
Accepted
|
if __name__ == '__main__':
x = list(input())
sl = []
ans = 0
for i in x:
if i == "S":
sl.append(1)
else:
if len(sl) != 0:
ans += sl.pop()
print(len(x) - ans * 2)
|
p02552
|
s829432726
|
Accepted
|
x = int(input())
print(int(not x))
|
p02629
|
s047847289
|
Accepted
|
# NK=list(map(int,input().split()))
N = int(input())
'''
An = list(map(int,input().split()))
Q = int(input())
Bn = [0] * Q
Cn = [0] * Q
for c in range(Q):
Bn[c], Cn[c] = map(int, input().split())
'''
alphabet = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n",
"o","p","q","r","s","t","u","v","w","x","y", "z"]
columnName = ""
modulo =0
while N>0:
modulo = (N-1)%26
columnName = alphabet[modulo]+columnName
N = int((N-modulo)/26)
print(columnName)
|
p02747
|
s041205728
|
Wrong Answer
|
s = raw_input()
print 'Yes' if 'hi' in s else 'No'
|
p03146
|
s934903998
|
Accepted
|
def main():
s = int(input())
e = set([s])
i = 1
while True:
i += 1
s = f(s)
if s in e:
print(i)
return
e.add(s)
def f(n):
if n % 2 == 0:
return n // 2
else:
return 3*n + 1
if __name__ == "__main__":
main()
|
p02600
|
s764321706
|
Accepted
|
X = int(input())
if 400 <= X <= 599:
print(8)
elif 600 <= X <= 799:
print(7)
elif 800 <= X <= 999:
print(6)
elif 1000 <= X <= 1199:
print(5)
elif 1200 <= X <= 1399:
print(4)
elif 1400 <= X <= 1599:
print(3)
elif 1600 <= X <= 1799:
print(2)
elif 1800 <= X <= 1999:
print(1)
|
p03380
|
s837128777
|
Accepted
|
n = int(input())
l = list(map(int,input().split()))
if n==2:
print(max(l),min(l))
exit()
maxi = max(l)
med = maxi//2
d = 10**9+1
ans = -1
for i in range(n):
x = l[i]
if l[i] > med:
x = maxi-l[i]
if med-x < d:
d = med-x
ans = l[i]
print(maxi,ans)
|
p03556
|
s865986363
|
Accepted
|
import math
n = int(input())
m = math.sqrt(n)
x = int(math.floor(m))
print(x**2)
|
p03103
|
s271813980
|
Accepted
|
N,M=map(int,input().split())
AB=[list(map(int,input().split())) for i in range(N)]
AB=sorted(AB,key=lambda x:x[0])
ans=0
for i in range(N):
if M-AB[i][1]>=0:
M-=AB[i][1]
ans+=AB[i][1]*AB[i][0]
else:
if M>0:
ans+=AB[i][0]*M
break
print(ans)
|
p03693
|
s211007975
|
Accepted
|
from sys import stdin
data = stdin.readline().rstrip().split()
total = 100 * int(data[0]) + 10 * int(data[1]) + int(data[2])
if total % 4 == 0:
print("YES")
else:
print("NO")
|
p03861
|
s783506328
|
Accepted
|
import sys
readline = sys.stdin.readline
a,b,x = map(int,readline().split())
print((b // x) - (a - 1)// x)
|
p02743
|
s057322464
|
Accepted
|
a, b, c = map(int, input().split())
if c-a-b < 0:
print("No")
else:
print("Yes" if (c-a-b)**2-4*a*b > 0 else "No")
|
p03623
|
s473798924
|
Accepted
|
a,b,c=map(int,input().split())
if abs(b-a)>abs(c-a):
print("B")
else:
print("A")
|
p03860
|
s140829793
|
Wrong Answer
|
print = ("A"+input()[8]+"C")
|
p03795
|
s516573406
|
Wrong Answer
|
N=int(input())
ans=1
for i in range(1,N+1):
ans=(ans*i)%1000000007
print(ans%(10**9+7))
|
p03071
|
s627207641
|
Wrong Answer
|
a,b = map(int,input().split())
if a > b:
print(a*(a-1))
elif a == b:
print(a*b)
elif a < b:
print(b*(b-1))
|
p02897
|
s743427331
|
Wrong Answer
|
N = int(input())
cnt = 0
for i in range(1,N+1):
if N%2:
cnt += 1
print(cnt/N)
|
p03323
|
s228899654
|
Accepted
|
a,b = map(int,input().split())
if a > 16/2 or b > 16/2:
print(":(")
else:
print("Yay!")
|
p02645
|
s396912861
|
Wrong Answer
|
S = input()
print(S[3:])
|
p02584
|
s128655985
|
Wrong Answer
|
import sys
input = sys.stdin.readline
def readstr():
return input().strip()
def readint():
return int(input())
def readnums():
return map(int, input().split())
def readstrs():
return input().split()
def main():
X, K, D = readnums()
if X // D >= K:
print(X - K * D)
else:
a1 = X % D
a2 = D - X % D
if (K - X // D) % 2:
print(a2)
else:
print(a1)
if __name__ == "__main__":
main()
|
p03779
|
s412247395
|
Accepted
|
import math
X = int(input())
P = math.ceil((-1+(1+8*X)**(1/2))/2)
print(P)
|
p02833
|
s767100983
|
Accepted
|
n=int(input())
if n%2==1:
print(0)
else:
ans=0
i=1
while 5**i*2<=n:
ans+=n//(5**i*2)
i+=1
print(ans)
|
p02699
|
s638938251
|
Accepted
|
#!/usr/bin/env python3
s, w = map(int, input().split())
print("unsafe" if s<=w else "safe")
|
p02948
|
s893314728
|
Accepted
|
def main():
N, M = (int(i) for i in input().split())
from heapq import heapify, heappop, heappush
from collections import defaultdict
sche = defaultdict(list)
for i in range(N):
a, b = (int(i) for i in input().split())
sche[a].append(b)
q = []
heapify(q)
ans = 0
for i in range(1, M+1):
for s in sche[i]:
heappush(q, -s)
if q:
ans += -heappop(q)
print(ans)
if __name__ == '__main__':
main()
|
p02642
|
s212626200
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
A = sorted(list(set(A)), reverse=True)
N = len(A)
if N == 1:
print(0)
exit()
ans = 0
for i in range(N-1):
flag = True
for j in range(i+1, N):
if A[i] % A[j] == 0:
flag = False
break
if flag:
ans += 1
print(ans+1)
|
p02813
|
s805312976
|
Accepted
|
import itertools
def main():
N = int(input())
P = input().replace(" ", "")
Q = input().replace(" ", "")
vals = []
for comb in itertools.permutations(list(map(str, range(1, N+1))), N):
vals.append("".join(comb))
vals.sort()
print(abs(vals.index(P) - vals.index(Q)))
if __name__ == '__main__':
main()
|
p03324
|
s007361305
|
Accepted
|
d, n = map(int, input().split())
arr = []
i = 1
while len(arr) != n:
if 100 ** d * i % 100 ** (d + 1) != 0:
arr.append(100 ** d * i)
i += 1
print(arr[-1])
|
p02702
|
s786426624
|
Accepted
|
def main():
s = list(input())[::-1]
ary_mod = [0] * 2019
ary_mod[0] = 1
now = 0
digit = 1
for i, ss in enumerate(s):
now += int(ss) * digit % 2019
digit *= 10
digit %= 2019
remind = now % 2019
ary_mod[remind] += 1
ans = 0
for i, n in enumerate(ary_mod):
ans += (n*(n-1)) // 2
print(ans)
if __name__=='__main__':
main()
|
p02628
|
s974295202
|
Accepted
|
n ,k = list(map(int, input().split()))
p_list = list(map(int,input().split()))
p_list.sort()
ans = sum(p_list[0:k])
print(ans)
|
p02700
|
s303005431
|
Accepted
|
a,b,c,d = map(int,input().split())
#a = Takahashi's HP,b = T's ATK, c = Aoki's HP, d = A's ATK
#T -> A -> T -> A...
print("Yes" if -(-a//d) >= -(-c//b) else "No")
|
p03680
|
s926773196
|
Wrong Answer
|
n, *a = map(int, open(0).read().split())
cnt = 0
a = [0] + a
i = 1
while 1:
tmp = i
i = a[i]
cnt += 1
if tmp == i:
print(-1)
break
elif a[i] == 2:
print(cnt+1)
break
elif cnt >= n:
print(-1)
break
|
p03385
|
s586051324
|
Wrong Answer
|
s = raw_input()
if 'a' or 'b' or 'c' in s:
print 'Yes'
elif 'a' or 'b' or 'c' not in s:
print 'No'
|
p03387
|
s873593679
|
Accepted
|
a,b,c = sorted(map(int,input().split()))
if (c-a)%2 ==0 and (c-b)%2 == 0:
print((c-a)//2+(c-b)//2)
elif (c-a)%2 == 1 and (c-b)%2 == 1:
print((2*c-b-a-2)//2+1)
elif (c-a)%2 == 0:
print((c-a)//2+(c+1-b)//2+1)
else:
print((c+1-a)//2+(c-b)//2+1)
|
p03419
|
s976920884
|
Accepted
|
n, m = map(int, input().split())
if n < 2 and m < 2:
ans = 1
elif n < 2:
ans = m - 2
elif m < 2:
ans = n - 2
else:
ans = n * m - (2 * n + 2 * m - 4)
print(ans)
|
p02647
|
s713671691
|
Wrong Answer
|
n,k,*a=map(int,open(0).read().split())
for _ in range(k):
b=[0]*n
for i,q in enumerate(a):
b[max(0,i-q)]+=1
if i+q+1<n:b[i+q+1]-=1
for i in range(1,n):b[i]+=b[i-1]
if b==a:break
a=b[:]
print(*a)
|
p02873
|
s115772754
|
Wrong Answer
|
S = input()
res = [0]*(len(S)+1)
# 左から探索
for i in range(len(S)):
if S[i]=='<':
res[i+1]=res[i]+1
for i in range(len(S)-1,0,-1):
if S[i]=='>':
res[i]=max(res[i],res[i+1]+1)
print(res)
print(sum(res))
|
p03803
|
s531755712
|
Accepted
|
A, B = map(int,input().split())
if A == 1:
A += 13
if B == 1:
B += 13
if A > B :
print('Alice')
elif B > A :
print('Bob')
else:
print('Draw')
|
p02778
|
s762036212
|
Accepted
|
s = input()
print('x'*len(s))
|
p03448
|
s634158389
|
Wrong Answer
|
A=int(input())
B=int(input())
C=int(input())
X=int(input())
count=0
for i in range(A+1):
for j in range(B+1):
for k in range(C+1):
if ((500*i)+(100*j)+(50*k))==0:
count+=1
print(count)
|
p03145
|
s917532694
|
Wrong Answer
|
a=sorted(list(map(int,input().split())))
print(a[0]*a[1])
|
p02918
|
s352434491
|
Accepted
|
N,K = map(int,input().split())
S = input()
print(min(sum(S[n]==S[n+1] for n in range(N-1))+2*K,N-1))
|
p03632
|
s002875097
|
Accepted
|
a, b, c, d = map(int, input().split())
a_b = set(range(a,b))
c_d = set(range(c,d))
time = a_b & c_d
print(len(time))
|
p03617
|
s074357025
|
Wrong Answer
|
def solve():
Q, H, S, D = [int(i) for i in input().split()]
P = [(0.25, Q), (0.5, H), (1, S), (2, D)]
P.sort(key=lambda t: t[1] / t[0])
N = int(input())
ans = 0
for p in P:
if N == 0:
break
x, y = p
n = N // x
ans += n * y
N -= n * x
print(int(ans))
if __name__ == "__main__":
solve()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.