problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03324 | s611177294 | Accepted | from itertools import count
def count_div_by_100(n: int) -> int:
for idx in range(4):
q, r = divmod(n, 100)
if r != 0:
return idx
n //= 100
return -1
D, N = map(int, input().split())
current = 0
current_idx = 0
for n in count(start=1):
if count_div_by_100(n) == D:
... |
p03324 | s806542117 | Accepted | d, n = map(int, input().split())
ans = 100**d*n
if ans % 100**(d+1) == 0:
ans += 100**d
print(ans)
|
p03720 | s152064795 | Accepted | N, M = map(int, input().split())
load = {}
for i in range(N):
load[i] = 0
for i in range(M):
a, b = map(int, input().split())
load[a-1] += 1
load[b-1] += 1
for i in range(N):
print(load[i]) |
p02933 | s758738488 | Wrong Answer | a = int(input())
input_s = input()
if 3200 <= a <5000:
output_s = ("pink")
elif 2800 <= a <3200:
output_s = ("red")
print(output_s) |
p02577 | s632081522 | Wrong Answer | if sum(list(map(int,str(input()))))==9:
print("Yes")
else:
print("No") |
p02676 | s200083965 | Accepted | K=int(input())
S=input()
if K>=len(S):
print(S)
else:
print(S[0:K]+str("...")) |
p03380 | s893877972 | Accepted | n = int(input())
a = sorted(list(map(int,input().split())))
ans1 = a[-1]
ans2 = a[0]
for i in range(1,n-1):
if abs(ans2-ans1/2)>abs(a[i]-ans1/2):
ans2 = a[i]
print(ans1,ans2) |
p02768 | s101069110 | Wrong Answer | n, a, b = map(int, input().split())
mod = 10**9+7
def inv(x):
return pow(x, mod-2, mod)
def fact(x):
f = 1
for i in range(1, x + 1):
f *= i
f %= mod
return f
def comb(n, r):
return (fact(n) * inv(fact(n-r)) * inv(fact(r))) % mod
print((pow(2, n) - comb(n, a) - comb(n, b)) % mod) |
p03126 | s649894095 | Wrong Answer | n, m = map(int, input().split())
a = [set(list(map(int, input().split()))[1:]) for i in range(n)]
s = 0
for i in a:
if a.index(i) == 0:
s = i
else:
s = s & i
print(len(s)) |
p02682 | s313915594 | Accepted | A, B, C, K = map(int,input().split())
if K <= A:
print(K)
elif K <= A + B:
print(A)
else:
print(2*A + B - K) |
p02708 | s075651549 | Accepted | def coun(n,r):
return n*r+1+r-r**2
def sigma(func,frm,too):
result=0
for i in range(frm,too+2):
#print(i)
result=result+func(too,i)
#print(result)
print(result%mod)
n,k=list(map(int,input().split()))
mod=10**9+7
sigma(coun,k,n) |
p03284 | s181899866 | Accepted | n, k = map(int, input().split())
if n % k == 0:
print(0)
else:
print(1) |
p03779 | s041274415 | Accepted | X = int(input())
ans = 0
for i in range(X+1):
ans += i
if ans >= X:
print(i)
exit() |
p03611 | s431609274 | Accepted | N=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(N):
l.extend([a[i]-1,a[i],a[i]+1])
import collections
c=collections.Counter(l)
print(c.most_common()[0][1])
|
p02972 | s388423371 | Accepted | N = int(input())
*b, = map(int, input().split())
ans = []
for i in range(N)[::-1]:
n = i+1
if b[i]:
ans.append(n)
tmp = 1
while tmp*tmp <= n:
if n % tmp == 0:
b[tmp-1] ^= 1
if tmp != n//tmp:
b[n//tmp-1] ^= 1
... |
p02791 | s563120286 | Accepted | n = input()
p = list(int(i) for i in input().split())
count = 1
min_num = min(p[0:1])
for i in range(1,len(p)):
if(p[i] <= min_num):
count += 1
min_num = p[i]
print(count)
|
p02676 | s633015278 | Wrong Answer | K = int(input())
S = input()
if len(S) <= K:
print(S)
else:
s = S.split(S[K])
S = s[0]
S = S + "..."
print(S) |
p02983 | s119220648 | Accepted | def main():
L, R = map(int, input().split())
R = min(R, L + 4038)
ans = 2018
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
ans = min(ans, (i*j) % 2019)
print(ans)
if __name__ == "__main__":
main() |
p02546 | s589199499 | Wrong Answer | s=input()
print(s)
if s[-1]=='s':
print(s+"es")
print(s+"s")
|
p02554 | s368039175 | Accepted | def main():
n = int(input())
mod = 10**9 + 7
# すべての組み合わせから、いずれかの条件を満たさないパターンを引く
pattern = 10 ** n
not_pattern = (9 ** n) + (9 ** n) - (8 ** n)
answer = (pattern - not_pattern) % mod
print(answer)
if __name__ == "__main__":
main()
|
p03252 | s419103160 | Wrong Answer | S=list(input())
T=list(input())
if len(set(S))==len(set(T)):
bufs,buft='',''
cnts,cntt=1,1
for i in range(len(S)):
if bufs!=S[i]: bufs=S[i]; cnts=1
else: cnts+=1
if buft!=T[i]: buft=T[i]; cntt=1
else: cntt+=1
if cnts!=cnts: print('No'); exit()
print('Yes')
else:
... |
p03435 | s932629764 | Accepted | c = [list(map(int, input().split())) for _ in range(3)]
# a2 + b1 = c21
# a2 + b2 = c22
# a2 + b3 = c23
b1, b2, b3 = c[0][0], c[0][1], c[0][2]
if c[1][0] - b1 == c[1][1] - b2 == c[1][2] - b3 and c[2][0] - b1 == c[2][1] - b2 == c[2][2] - b3:
print('Yes')
else:
print('No')
|
p03206 | s345292338 | Accepted | D = int(input())
print("Christmas" + " Eve" * (25 - D))
|
p02713 | s656102338 | Wrong Answer | k = int(input())
n = 0
for i in range(1,k+1):
a = i**3
b = (i-1)**3
c = (a-b)*(k-i+1)
n += c
print(n)
|
p04043 | s180143803 | Accepted | l = list(map(int, input().split()))
l.sort(reverse=True)
if l[0] == 7 and l[1] == 5 and l[2] == 5:
print('YES')
else:
print('NO') |
p03617 | s254583261 | Wrong Answer | # coding: utf-8
# Your code here!
cost=list(map(int,input().split()))
for i in range(4):
cost[i]/=2**(i-2)
cost=list(map(int,cost))
N=int(input())
if min(cost)==cost[3]:
print(((N//2*2)*cost[3]+(N%2)*min(cost[:3])))
else:
print((min(cost)*N)) |
p03471 | s485964179 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for j in range(n - i + 1):
if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
print(i, j, n - i - j)
exit()
print("-1 -1 -1") |
p02570 | s345502984 | Accepted | import sys
def main():
D,T,S = map(int, input().split())
if D/S <= T:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() |
p03435 | s967380573 | Accepted | c_ = [list(map(int,input().split())) for i in range(3)]
a1 = 0
b1 = c_[0][0] - a1
a2 = c_[1][0] - b1
b2 = c_[0][1] - a1
a3 = c_[2][0] - b1
b3 = c_[0][2] - a1
a_ = [a1,a2,a3]
b_ = [b1,b2,b3]
flag = True
for i in range(3):
for j in range(3):
if c_[i][j] != a_[i] + b_[j]:
flag = False
print('Ye... |
p03103 | s570468238 | Accepted | from bisect import bisect_left
from itertools import accumulate
N, M = map(int, input().split())
shop = [list(map(int, input().split())) for _ in range(N)]
shop.sort(key=lambda x: x[0])
cnt = 0
ans = 0
for i in range(N):
cnt += shop[i][1]
if M <= cnt:
dif = cnt - M
ans += shop[i][0] * shop[i]... |
p03219 | s678267339 | Accepted | X,Y = map(int,input().split())
print(X+int(Y/2)) |
p02922 | s881829464 | Wrong Answer | A,B=map(int,input().split())
s=0
while B-(A-1)*s+1>0:
s+=1
print(s)
|
p02768 | s490617147 | Wrong Answer | from math import factorial
def combinationsCount(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
n,a,b = map(int, input().split())
print((2**n - 1 - combinationsCount(n, a) - combinationsCount(n, b)) / (10e9+7) ) |
p02747 | s624701663 | Accepted |
s = input()
if len(s) % 2 ==1:
print('No')
exit()
if s == "hi"* (len(s) // 2):
print('Yes')
else:
print('No') |
p02675 | s473714091 | Accepted | def main():
n = int(input())
if n % 10 == 3:
print('bon')
elif n % 10 == 0 or n % 10 == 1 or n % 10 == 6 or n % 10 == 8:
print('pon')
else:
print('hon')
if __name__ == "__main__":
main() |
p03779 | s039712465 | Accepted | x = int(input())
for i in range(1, x+1):
if i * (i + 1)//2 >= x:
print(i)
break
|
p02842 | s958107839 | Wrong Answer | import sys
n = int(input())
for i in range(n):
if i*108//100 == n:
print(i)
sys.exit()
print(":(")
|
p03239 | s166189040 | Accepted | N,T = map(int, input().split())
min_cost = 10**9
for i in range(N):
c,t = map(int, input().split())
if T >= t and min_cost > c:
min_cost = c
if min_cost == 10**9:
print("TLE")
exit()
print(min_cost) |
p03854 | s421843409 | Accepted | s = input()
while s!="":
if s[-5:]=="dream" or s[-5:]=="erase":
s = s[:-5]
elif s[-6:]=="eraser":
s = s[:-6]
elif s[-7:]=="dreamer":
s = s[:-7]
else:
print("NO")
exit()
print("YES")
|
p03854 | s302764228 | Accepted | import sys
sys.setrecursionlimit(10**6)
s = input()
def dfs(s):
while True:
f = True
for i in ['dream', 'dreamer', 'erase', 'eraser']:
if s[-len(i):]==i:
s = s[:-len(i)]
if s=='':
return True
f = False
if f: ret... |
p02836 | s325058440 | Accepted | s = input()
n = len(s)//2
ret = 0
for i in range(n):
if s[i] != s[-(i+1)]:
ret += 1
print(ret) |
p03331 | s681392885 | Accepted | n = int(input())
ans = 10**5
for i in range(n//2):
a = i+1
b = n-a
tmp = 0
for i in str(a):
tmp += int(i)
for i in str(b):
tmp += int(i)
ans = min(ans, tmp)
print(ans) |
p02694 | s880721378 | Wrong Answer | x=int (input())
i=1
c=100
d=100
while x >= d:
c=c+int(c*0.1)
d=d+c
i=i+1
print(i) |
p03086 | s657305899 | Accepted | S = input()
l = {"A", "C", "G", "T"}
ans = 0
tmp = ""
for s in S:
if s in l:
tmp += s
if len(tmp) > ans:
ans = len(tmp)
else:
tmp = ""
print(ans) |
p03146 | s415650443 | Accepted | #!/usr/bin/env python3
S = int(input())
if S == 1 or S == 2 or S == 4:
print(4)
exit()
e = S
cnt = 0
while True:
if e % 2 == 0:
v = e//2
else:
v = 3*e+1
e = v
cnt += 1
if v == 4:
print(cnt+4)
exit()
|
p03472 | s163766497 | Accepted | from math import ceil
n, h = map(int, input().split())
a = []
b = []
for i in range(n):
A, B = map(int, input().split())
a.append(A)
b.append(B)
ma = max(a)
mb = [i for i in b if i > ma]
mb.sort(reverse=True)
if sum(mb) >= h:
i = 0
while h > 0:
h -= mb[i]
i += 1
print(i)
else:
... |
p03274 | s941292186 | Accepted | n,k = map(int, input().split())
x = list(map(int, input().split()))
s = 10**9
for i in range(n-k+1) :
m = min(abs(x[i]) +abs(x[i+k-1] - x[i]) , abs(x[i+k-1]) + abs(x[i+k-1] - x[i]))
if s >m :
s = m
print(s)
|
p02848 | s889711171 | Accepted | N = int(input())
S = input()
for i in S:
print(chr(65 + (ord(i) - 65 + N) % 26), end = '')
|
p02665 | s193607688 | Accepted | N =int(input())
A = list(map(int,input().split()))
leaf = sum(A)
v = [[0,a] for a in A]
v[0][0] = 1
MAX = 2
for i in range(1,N+1):
v[i][0] = min((v[i-1][0]-v[i-1][1])*2,leaf)
leaf -= v[i][1]
MAX *= 2
v
if v[N][0] != v[N][1]:
print('-1')
exit()
ans = 0
for a,b in v:
if a <= 0:
print('... |
p03854 | s335676683 | Wrong Answer | S=input()
str_list=["dream","dreamer","erase","eraser"]
S_tmp=""
while True:
S_tmp=S
for str in str_list:
S=S.replace(str,"") #rstrip(str)はだめ
if S_tmp==S:
break
if S=="":
print("Yes")
if S!="":
print("No") |
p03386 | s314104868 | Wrong Answer | a,b,k = map(int,input().split())
for i in range(a,a+k):
print(i)
for i in range(b-k+1,b+1):
print(i) |
p03274 | s903527766 | Accepted | N, K = list(map(int,input().split()))
xlist = list(map(int,input().split()))
def f(min1,max1):
if min1>=0 and max1>=0:
return abs(max1)
elif min1<=0 and max1 <=0:
return abs(min1)
else:
return min([-2*min1 + max1,-min1 + 2*max1])
ans = 2*10**9
for i in range(N-K+1):
min1 = xlist[i]
max1 = xlist[... |
p02820 | s131226069 | Accepted | n, k = map(int, input().split())
rsp = list(map(int, input().split()))
t = input()
ans = 0
d = {'r': 2, 's':0, 'p': 1}
for c in t:
ans += rsp[d[c]]
for i in range(k):
prev = t[i]
seq = 1
for j in range(i+k, n, k):
if t[j] == prev:
seq += 1
else:
ans -= rsp[d[prev]] * (seq // 2)
prev = ... |
p03481 | s143258045 | Accepted | x,y=map(int,input().split())
a=y-x
c=0
b=0
for i in range(1000):
b=x*2**i
if b>y:
break
else:
c+=1
print(c) |
p03385 | s278657521 | Accepted | s = input()
if 'a' in s and 'b' in s and 'c' in s:
print('Yes')
else:
print('No') |
p02663 | s550009142 | Accepted | H1,M1,H2,M2,K = map(int,input().split())
t = (H2*60 + M2) - (H1*60 + M1) - K
print(t) |
p02612 | s867197956 | Accepted | n = int(input())
a = n % 1000
if a == 0:
print(0)
else:
print(1000 - a)
|
p02972 | s355658919 | Accepted | n=int(input())
l=list(map(int,input().split()))
for i in range(n,0,-1):
l[i-1]=sum(l[i-1::i])%2
print(sum(l))
print(*[i+1 for i in range(n) if l[i]]) |
p03719 | s261976950 | Accepted | a, b, c = map(int, input().split())
if a <= c <= b: print("Yes")
else: print("No")
|
p03632 | s678268223 | Accepted | a,b,c,d = map(int,input().split())
if b <= c or d <= a:
print(0)
elif a <= c:
print(min(b,d)-c)
elif a >= c:
print(min(b,d)-a) |
p02811 | s548574114 | Wrong Answer | input_line = input()
Line = input_line.split()
if 500*int(Line[0]) > int(Line[1]):
print('yes')
else:
print('no') |
p02843 | s447949651 | Wrong Answer | # For taking integer inputs.
def inp():
return(int(input()))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
... |
p03109 | s993168405 | Accepted | if int(input().split('/')[1]) > 4:
print('TBD')
else:
print('Heisei') |
p02732 | s207961703 | Accepted | from collections import Counter
from scipy.misc import comb
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
num = 0
for v in c.values():
if v > 1:
num += comb(v, 2,exact=True)
for k in range(N):
print(int(num - (c[A[k]]-1)))
|
p03627 | s782663359 | Accepted | import sys
from collections import Counter
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
counter = Counter(A)
ans = 0
pair = []
for l, count in sorted(counter.items(), reverse=True):
# print(l, count)
if count < 2:
continue
if count >= 4 and len(pair) == 0:
... |
p03285 | s634455705 | Accepted | n = int(input())
ans = 0
for i in range(100):
if n - 4 * i >= 0 and ( n - 4 * i )% 7 == 0:
ans += 1
#print(ans)
if ans >= 1:
print('Yes')
else:
print('No')
|
p02971 | s397723593 | Accepted | N = int(input())
A = [int(input()) for _ in range(N)]
MAX = max(A)
AA = A[:]
AA.pop(A.index(MAX))
SECOND = max(AA)
for a in A:
if a == MAX and a == SECOND:
print(MAX)
elif a == MAX and a != SECOND:
print(SECOND)
else:
print(MAX) |
p02797 | s497951959 | Wrong Answer | N, K, S = map(int, input().split())
if N == K:
print(*[S] * K)
quit()
if S % 2 == 1:
ki = S // 2
gu = S // 2 + 1
ans = []
for i in range(K + 1):
if i % 2 == 0:
ans.append(ki)
else:
ans.append(gu)
else:
ans = []
K -= 1
for i in range(K + 1):
... |
p03073 | s453250475 | Wrong Answer | s = list(map(int,input()))
print(s)
n = len(s)
count1 = 0
count2 = 0
if n == 1:
print(0)
else:
for i in range(n):
if i % 2 == 0 and s[i] != 0:
count1 += 1
elif i%2 !=0 and s[i] != 1:
count1 += 1
for i in range(n):
if i % 2 == 0 and s[i] != 1:
coun... |
p02833 | s643588621 | Accepted | N = int(input())
if N % 2 != 0:
print(0)
else:
fives = 0
power = 0
while (5 ** (power+1)) <= N: # Nには5のpower乗まで入る
power += 1
for i in range(1, power+1):
fives += N // (5 ** i) // 2
print(int(fives))
|
p02753 | s034645773 | Accepted | s=input()
if(s.count('A')>=1 and s.count('B')>=1):
print("Yes")
else:
print("No") |
p03860 | s366484572 | Accepted | A,s,C = input().split()
print(A[0] + s[0] + C[0])
|
p02820 | s572792244 | Wrong Answer | #149d
def win(n):
if n=='r':
return p
elif n=='s':
return r
else:
return s
n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
score=0
for i in t:
score += win(i)
#hands=list(t)
for i in range(n):
if i+k<n:
if t[i]==t[i+k]:
score-=win(t[i+k])
t[i+k].upper()
print(score) |
p04031 | s492793363 | Accepted | N,*a = open(0).read().split()
N=int(N)
list1=list(map(int,a))
#print(N)
#print(list1)
a=[]
for i in range(-100,101):
int1=0
for n in range(N):
x = (list1[n]-i)
y = x**2
int1+=y
if n==N-1:
a.append(int1)
#print(a)
#print(max(a))
print(min(a)) |
p03944 | s517402409 | Accepted | w, h, n = map(int, input().split())
xl = w
xs = 0
yl = h
ys = 0
for i in range(n):
x, y, a = map(int, input().split())
if a == 1:
xs = max(xs, x)
elif a == 2:
xl = min(xl, x)
elif a == 3:
ys = max(ys, y)
elif a == 4:
yl = min(yl, y)
if (yl <= ys) or (xl <= xs):
pr... |
p02801 | s145920107 | Accepted | C= input()
CC = ord(C)
CC = CC +1
out = chr(CC)
print(out)
#chr関数で逆のことができる。
|
p02957 | s243503047 | Wrong Answer | a,b = map(int,input().split())
print((a+b)//2) |
p03274 | s666476057 | Accepted | import sys
input = sys.stdin.buffer.readline
INF = 1001001001
N, K = map(int, input().split())
x = list(map(int, input().split()))
ans = INF
for i in range(N-K+1):
if x[i] < 0:
neg = -x[i]
else:
neg = 0
if x[i+K-1] > 0:
pos = x[i+K-1]
else:
pos = 0
tmp = neg + pos ... |
p02639 | s174111596 | Wrong Answer | print(input().split().index('0')) |
p03106 | s533191298 | Accepted | from fractions import gcd
A, B, K = map(int,input().split())
l = []
for k in range(1, gcd(A, B)+1):
if all(i % k == 0 for i in [A, B]):
l.append(k)
print(l[-K]) |
p02582 | s249356451 | Accepted | s = input()
ans = 0
if 'RRR' in s:
ans = 3
elif 'RR' in s:
ans = 2
elif 'R' in s:
ans = 1
print(ans) |
p02835 | s961599559 | Wrong Answer | a,b,c= map(int, input().split())
val = a+b+c
if val > 22:
print("bust")
else:
print("win")
|
p02792 | s481788078 | Wrong Answer | N=int(input())
IJ = [[0] * 10 for i in range(10)]
ans = 0
for i in range(N):
Top = str(i)[0]
Btm = str(i)[-1]
if Btm == '0':
continue
IJ[int(Top)][int(Btm)] += 1
for i in range(1, 10):
for j in range(1, 10):
ans += IJ[i][j] * IJ[j][i]
print(ans) |
p03427 | s298597580 | Wrong Answer | n = int(input())
if n == int("9" * len(str(n))):
print(9 * len(str(n)))
else:
print(9 * (len(str(n)) - 1) + int(str(n)[0]) - 1)
|
p03637 | s556527312 | Accepted | def resolve():
n = int(input())
a = list(map(int, input().split()))
div4 = 0
div2 = 0
divn = 0
for i in a:
if i % 4 == 0:
div4 += 1
elif i % 2 == 0:
div2 += 1
else:
divn += 1
if div2 > 0:
divn += 1
if div4 + 1 >= divn:
print('Yes')
else:
print('No')
resolve() |
p03544 | s734933573 | Accepted | N = int(input())
L = [2,1]
for i in range(2,N+1):
L.append(L[i-2]+L[i-1])
#print(L)
print(L[N]) |
p04044 | s191541417 | Accepted | N, L = [int(i) for i in input().split()]
S = sorted([input() for _ in range(N)])
print(*S, sep="")
|
p03645 | s528275076 | Wrong Answer | n,m=map(int,input().split())
l=[[0,0]]*m
t=[0]*m
tc=0
a=False
for k in range(m):
l[k]=list(map(int,input().split()))
l.sort()
for k in l:
if k[0]==1:
t[tc]=k[1]
tc+=1
elif k[1]==n:
if k[1] in t:
a=True
break
if a:
print("POSSIBLE")
else:
print("IMPOSSIBLE") |
p03696 | s258189918 | Accepted | n=int(input())
s=input()
if s[0]=="(":
c=1
d=1
else:
c=-1
d=-1
for i in range(1,n):
if s[i]=="(":
d+=1
else:
d-=1
c=min(c,d)
if c<0:
s="("*(-c)+s
print(s+")"*(s.count("(")-s.count(")")))
|
p02765 | s963244344 | Accepted | n,r=map(int,input().split())
ans=r
if n <10:
ans= r + (100*(10-n))
print(ans) |
p02699 | s761131652 | Accepted | sheeps, wolves = input().split(' ')
if (int(sheeps) > int(wolves)):
print('safe')
else:
print('unsafe') |
p03785 | s840278419 | Accepted | N, C, K = map(int, input().split())
T = [0 for _ in range(N)]
for i in range(N):
T[i] = int(input())
T = sorted(T)
flag = 0
cnt = 0
ans = 0
for i in range(len(T)):
time = T[i] - T[flag]
cnt += 1
if time > K or cnt > C:
flag = i
cnt = 1
ans += 1
print(ans + 1)
|
p03804 | s882244088 | Accepted | n,m=map(int,input().split())
a=[input() for i in range(n)]
b=[input() for i in range(m)]
ans="No"
for i in range(n-m+1):
for j in range(n-m+1):
if [line[j:j+m] for line in a[i:i+m]]==b:
ans="Yes"
break
if ans=="Yes":
break
print(ans) |
p03419 | s129222041 | Wrong Answer | n, m = list(map(int, input().split()))
nn = min(n, m)
mm = max(n, m)
if nn == mm:
if nn == 1:
print(1)
else:
print(max(nn-2, 0) * max(mm-2, 0))
else:
print(max(nn-2, 1) * max(mm-2, 1)) |
p02797 | s751678372 | Accepted | n, k, s = map(int, input().split())
ans = []
for i in range(k):
ans.append(s)
for i in range(n - k):
if s + 1 <= 10 ** 9:
ans.append(s + 1)
else:
ans.append(1)
print(*ans) |
p03103 | s127478224 | Accepted | import sys
N,M = map(int,input().split())
s = {}
ans = 0
for i in range(N):
a,b = map(int,input().split())
if a in s.keys():
s[a] += b
else:
s[a] = b
s = sorted(s.items(), key=lambda x:x[0])
for store in s:
price = store[0]
stock = store[1]
if M == 0: break
if M - stock >= 0:
M -= stock
ans += (stock... |
p02693 | s235841840 | Accepted | K = int(input())
A, B = map(int, input().split())
def solve():
for i in range(A, B + 1):
if i % K == 0:
return 'OK'
return 'NG'
print(solve())
|
p02759 | s775139962 | Wrong Answer | N=int(input())
|
p03730 | s774068653 | Accepted | A,B,C = [int(i) for i in input().split()]
D = max(A,B)
for i in range(1,D+1):
if A * i % B == C:
print("YES")
break
if A * i % B != C and i == D:
print("NO")
|
p02687 | s915365541 | Wrong Answer | s = input()
if s == "ABC":
print("ARC")
else:
print("ARC") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.