problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02835
|
s589475132
|
Accepted
|
A = input().split()
B = int(A[0])+int(A[1])+int(A[2])
if B >= 22 :
print("bust")
else:
print("win")
|
p03592
|
s871462920
|
Accepted
|
n, m, k = map(int, input().split())
for i in range(n+1):
for j in range(m+1):
a = m*i + n*j - 2*i*j
if a == k:
print('Yes')
exit()
print('No')
|
p03071
|
s834026893
|
Wrong Answer
|
a, b = map(int, input().split())
# x = sorted([a, b, a - 1, b - 1], reverse=True)
# print(x[0] + x[1])
if a > b:
print(a * (a - 1))
elif b > a:
print(b * (b - 1))
else:
print(a + b)
|
p03286
|
s594208709
|
Accepted
|
N = int(input())
ans = []
while N != 0:
r = N % 2
N = (N - r) // (-2)
ans += [r]
print(''.join(map(str, ans[::-1])) if ans else 0)
|
p03474
|
s080840122
|
Accepted
|
A,B = map(int,input().split())
S = input()
if len(S)==A+B+1 and S[A]=="-" and S.count("-")==1:
print("Yes")
else:
print("No")
|
p02935
|
s103771705
|
Accepted
|
N = int(input())
v = list(map(int, input().split()))
v.sort()
ans = v[0]
for i in range(1, N):
ans = (ans + v[i]) / 2
print(ans)
|
p03723
|
s165592092
|
Accepted
|
a,b,c = map(int,input().split())
if (a%2!=0) or (b%2!=0) or (c%2!=0):
print(0)
elif (a == b ) and (b == c):
print(-1)
else:
def exchange(a,b,c):
return (b+c)/2,(c+a)/2,(a+b)/2
num = 0
ans = 0
while num == 0:
a,b,c = exchange(a,b,c)
ans += 1
for j in range(3):
if [a,b,c][j] % 2 ==1:
num = 1
print(ans)
|
p02583
|
s800575401
|
Accepted
|
import math
n = int(input())
l = list(map(int,input().split()))
cnt = 0
for i in range(n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if l[i] != l[j] and l[j] != l[k] and l[k] != l[i]:
if abs(l[i] - l[j]) < l[k] and l[k] < l[i] + l[j]:
cnt += 1
print(cnt)
|
p03377
|
s879107301
|
Accepted
|
a,b,x=map(int, input().split())
print("YES" if a+b>=x and a<=x else "NO")
|
p02613
|
s020360466
|
Accepted
|
N=int(input())
r=[input() for i in range(N)]
print("AC x",r.count("AC"))
print("WA x",r.count("WA"))
print("TLE x",r.count("TLE"))
print("RE x",r.count("RE"))
|
p03427
|
s129347263
|
Accepted
|
n = int(input())
c = len(str(n))
if c == 1:
print(n)
else:
for i in range(1,11):
if int(str(i)+"9"*(c-1)) > n:
print(9*(c-1)+(i-1))
break
|
p03795
|
s082333168
|
Wrong Answer
|
N=int(input())
print(N*800 - (N%15)*200)
|
p02642
|
s988687727
|
Accepted
|
n = int(input())
l = list(map(int,input().split()))
l.sort()
j = [0]*(10**6+1)
for i in l:
j[i] += 1
if j[i] == 1:
for k in range(2*i,10**6+1,i):
j[k] += 100
print(j.count(1))
|
p03221
|
s947992796
|
Wrong Answer
|
n, m = input().split()
n, m = int(n), int(m)
data = []
for _ in range(m):
temp_p, temp_y = input().split()
temp_p, temp_y = int(temp_p), int(temp_y)
data.append([temp_p, temp_y])
data.sort()
result = []
for temp_data in data:
result.append("{:0>6}".format(temp_data[0]) + "{:0>6}".format(temp_data[1]))
for s in result:
print(s)
|
p03284
|
s843645908
|
Accepted
|
n,k = map(int, raw_input().split())
print 0 if n % k == 0 else 1
|
p03385
|
s653774510
|
Accepted
|
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
S=list(input())
S.sort()
S=''.join(S)
YesNo(S=='abc')
if __name__ == '__main__':
main()
|
p03475
|
s926501854
|
Accepted
|
N = int(input())
csf = [list(map(int, input().split())) for _ in range(N-1)]
ans = [None]*N
ans[-1] = 0
for i in range(N-1):
now = 0
for j in range(i,N-1):
if now <= csf[j][1]:
now = csf[j][1]
else:
t = (now - csf[j][1] + csf[j][2]-1)//csf[j][2]
now = csf[j][1] + t*csf[j][2]
now += csf[j][0]
ans[i] = now
[print(a) for a in ans]
|
p03160
|
s575299268
|
Wrong Answer
|
n = int(input())
l = list(map(int, input().split()))
dp = [0]*n
for i in range(1,n):
d1 = dp[i-1] + abs(l[i] - l[i-1])
if i > 1:
d2 = dp[i-2] + abs(l[i] - l[i-2])
if d1 > d2:
d1 = d2
dp[i] = d1
print(l,dp)
|
p02576
|
s522697592
|
Accepted
|
def resolve():
import math
N, X, T = map(int, input().split())
print(math.ceil(N/X)*T)
resolve()
|
p03719
|
s093127026
|
Accepted
|
A, B, C = map(int, input().split())
if C >= A and C <= B:
print("Yes")
else:
print("No")
|
p02642
|
s650062500
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
M = 10**6 + 5
cnt = [0 for _ in range(M)]
for i in A:
if cnt[i] != 0:
cnt[i] = 2
continue
j = i
while j < M:
cnt[j] += 1
j += i
ans = 0
for i in A:
if cnt[i] == 1:
ans += 1
print(ans)
|
p02953
|
s323852726
|
Wrong Answer
|
import sys
N = int(input())
H = list(map(int, input().split()))
for i in range(N-1,0,-1):
if H[i-1] - H[i] > 1:
print('No')
sys.exit()
elif H[i-1] > H[i]:
H[i-1] += 1
print('Yes')
|
p03351
|
s330471676
|
Wrong Answer
|
a,b,c,d = map(int,input().split())
if abs(b-a) <= d and abs(c-b) <= d:
print("Yes")
else:
print("No")
|
p02785
|
s103142764
|
Accepted
|
N, K = map(int, input().split())
H_list = [i for i in map(int, input().split())]
sorted_H_list = sorted(H_list)
if N <= K:
print("0")
elif K == 0:
print(sum(sorted_H_list))
else:
print(sum(sorted_H_list[:-K]))
|
p02935
|
s750872437
|
Accepted
|
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def SS(): return map(str,sys.stdin.readline().rstrip().split())
def II(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
v = LI()
v.sort()
ans = v.pop(0)
for i in v:
ans = (ans+i)/2
print(ans)
|
p03644
|
s472905623
|
Accepted
|
print(1 << int(input()).bit_length() - 1)
|
p02658
|
s836571666
|
Accepted
|
def main():
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
print('0')
return
p=1
for i in A:
p=p*i
if p>1000000000000000000:
print(-1)
return
print(p)
main()
|
p04019
|
s444177830
|
Accepted
|
s = input()
if 'W' in s and 'E' in s and 'N' in s and 'S' in s:
print('Yes')
elif 'W' in s and 'E' in s and not 'N' in s and not 'S' in s:
print('Yes')
elif not 'W' in s and not 'E' in s and 'N' in s and 'S' in s:
print('Yes')
else:
print('No')
|
p03012
|
s598336221
|
Accepted
|
N=int(input())
W=list(map(int,input().split()))
l=[]
s=sum(W)
for i in range(N-1):
x=abs(2*(sum(W[0:i+1]))-s)
l.append(x)
print(min(l))
|
p03317
|
s958813728
|
Accepted
|
def main():
from math import ceil
n, k, *a = map(int, open(0).read().split())
ans = 1 + ceil((n - k) / (k - 1))
print(ans)
if __name__ == '__main__':
main()
|
p02838
|
s264534873
|
Accepted
|
mod = 1000000007
n = int(input())
a = list(map(int, input().split()))
lap = 0
big = max(a)
while big > 0:
big //= 2
lap += 1
xor = [0 for _ in range(lap)]
for i in a:
num = 0
for j in range(lap):
if i % 2 == 1:
xor[num] += 1
i //= 2
num += 1
ans = 0
for i in range(lap):
ans += pow(2, i, mod) * xor[i] * (n - xor[i]) % mod
ans %= mod
print(ans)
|
p02918
|
s804482637
|
Wrong Answer
|
N, K= [int(i) for i in input().split()]
Sn = [1] + [0 if i =="L" else 1 for i in input()] + [0]
init_happiness = 0
change_count = 0
for n in range(1, N+1):
if Sn[n] == 0 and Sn[n] == Sn[n-1]:
init_happiness += 1
elif Sn[n] == 1 and Sn[n] == Sn[n+1]:
init_happiness += 1
if Sn[n] == 1 and Sn[n+1] == 0:
change_count +=1
change2 = min(max(0, change_count -1), K)
change1 = change_count % 2 if change2 < K else 0
print(init_happiness + 2 * change2 + change1)
|
p02777
|
s839425098
|
Accepted
|
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:
A -= 1
else:
B -= 1
print(A, B)
|
p03208
|
s879037358
|
Accepted
|
N,K = map(int, input().split())
H = [int(input()) for _ in range(N)]
H.sort()
ans = float("inf")
for i in range(N - K + 1):
ans = min(ans, H[i + K - 1] - H[i])
print(ans)
|
p03803
|
s222362180
|
Accepted
|
#!/usr/bin/env python3
A, B = map(int, input().split())
if A == B:
print("Draw")
exit()
if A == 1:
print("Alice")
exit()
if B == 1:
print("Bob")
exit()
if A > B:
print("Alice")
else:
print("Bob")
|
p02817
|
s882653526
|
Accepted
|
# -*- coding:utf-8 -*-
#入力
s,t = map(str,input().split())
print(t+s)
|
p02717
|
s103120582
|
Wrong Answer
|
print(" ".join(list(map(str,input().split()))))
|
p02687
|
s599460064
|
Accepted
|
S = input()
if S == 'ABC':
print('ARC')
else:
print('ABC')
|
p02994
|
s818699518
|
Accepted
|
def main():
N, L = (int(x) for x in input().split())
azi = [L + i for i in range(N)]
ans = sum(azi)
if 0 not in azi:
if azi[0] > 0:
ans -= azi[0]
else:
ans -= azi[N-1]
print(ans)
if __name__ == "__main__":
main()
|
p03241
|
s326717352
|
Wrong Answer
|
n,m = map(int,raw_input().split())
def f(n,m):
for d in range(2, int(m ** 0.5) + 1):
if m % d == 0:
if m / d >= n:
return d
break
return 1
print f(n,m)
|
p03407
|
s055515472
|
Accepted
|
A, B, C = list(map(int, input().split()))
if A+B >= C:
print('Yes')
else:
print('No')
|
p02854
|
s685245378
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
t = [0]
for i in range(n):
t.append(t[i] + a[i])
t.pop(0)
p = t[-1]
m = 0
for i in range(n):
if p // 2 <= t[i]:
print(abs(sum(a[0:i+1]) - sum(a[i+1:n])))
break
|
p02836
|
s338101989
|
Wrong Answer
|
S = input()
s = list(S)
ss = list(reversed(S))
ans = 0
for i in range(len(S)):
if s[i] != ss[i]:
ans += 1
print(ans)
|
p02888
|
s290018399
|
Accepted
|
import bisect
n = int(input())
l = sorted(list(map(int,input().split())))
ans = 0
for i in range(n-2):
for j in range(i+1, n-1):
ans += bisect.bisect_left(l,l[i] + l[j]) - j - 1
print(ans)
|
p04031
|
s755141997
|
Accepted
|
n=int(input())
a=list(map(int, input().split()))
m=99999999999999
for i in range(min(a),max(a)+1):
k=0
for j in a:
k=k+(j-i)**2
if k<m:
m=k
print(m)
|
p03206
|
s878211923
|
Accepted
|
import sys
d = int(sys.stdin.readline().rstrip())
def main():
return 'Christmas' + ' Eve' * (25 - d)
if __name__ == '__main__':
ans = main()
print(ans)
|
p02971
|
s258320352
|
Accepted
|
N = int(input())
A = []
for n in range(N):
A.append(int(input()))
B = [0 for n in range(N)]
B[0] = A[0]
for n in range(N-1):
B[n+1] = max(B[n], A[n + 1])
C = [0 for n in range(N)]
C[-1] = A[-1]
for n in range(N - 1):
C[-n-2] = max(C[-n-1], A[-n - 2])
for n in range(N):
if n == 0:
print(C[1])
elif n == N - 1:
print(B[N - 2])
else:
print(max(B[n-1], C[n+1]))
|
p02957
|
s329649120
|
Accepted
|
a, b = map(int, input().split())
ans = a+b
if ans % 2:
print("IMPOSSIBLE")
else:
ans //= 2
print(ans)
|
p04030
|
s701098815
|
Accepted
|
x=input()
z=''
for i in x:
if i == '0':
z= z+i
elif i == '1':
z= z+i
elif i == 'B':
z= z[:-1]
print(z)
|
p02719
|
s073091024
|
Wrong Answer
|
import itertools
import math
import fractions
n,k = map(int,input().split())
ans = n
if k == 1 or n == 0 or n==k :
print("0")
exit()
if n > k:
ans = n%k
while(1):
ans = abs(ans-k)
if ans == n:
break
if ans == 1 or 0:
break
print(ans)
|
p03637
|
s866012039
|
Accepted
|
N=int(input())
a=list(map(int,input().split()))
p,q,r=0,0,0
for i in range(N):
if a[i]%2==0:
if a[i]%4==0:
r+=1
else:
q+=1
else:
p+=1
if p-1<r:
print('Yes')
elif p-1==r:
if q==0:
print('Yes')
else:
print('No')
else:
print('No')
|
p02765
|
s888341167
|
Accepted
|
N, R = map(int, input().split())
if N < 10:
R += 100*(10-N)
print(R)
|
p03695
|
s470690754
|
Wrong Answer
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
A = [int(x) for x in input().split()]
color = [0] * 9
ans = 0
for a in A:
if a >= 3200:
color[8] += 1
else:
color[a // 400] += 1
mi = 0
for c in color[:8]:
if c > 0:
mi += 1
print(mi, mi + color[8])
if __name__ == '__main__':
main()
|
p03962
|
s011216343
|
Wrong Answer
|
s=list(map(int,input().split()))
s.sort()
if s[0]==s[1]==s[2]:
print('1')
elif s[0]==s[1]!=s[2]:
print('2')
else:
print('3')
|
p02681
|
s301642508
|
Accepted
|
s=input()
t=input()
f=True
for i in range(len(s)):
if s[i]!=t[i]:
f=False
break
print('Yes' if f and len(s)+1==len(t) else 'No')
|
p02712
|
s247544362
|
Wrong Answer
|
a = int(input())
sum = 0
for i in range(a):
if i % 3 != 0 or i % 5 != 0:
sum += i
else:
pass
print(sum)
|
p02600
|
s436318737
|
Wrong Answer
|
X = int(input())
if X >=1800 and X <1900:
print(1)
elif X >=1600 and X <=1799:
print(2)
elif X >=1400 and X<=1599:
print(3)
elif X >=1200 and X<=1399:
print(4)
elif X >= 1000 and X <=1099:
print(5)
elif X >= 800 and X <= 999:
print(6)
elif X >= 600 and X <= 799:
print(7)
elif X >= 400 and X <= 599:
print(8)
|
p02657
|
s592504487
|
Accepted
|
from math import floor
import numpy as np
inputs = input().split()
multiple = np.int64(inputs[0]) * np.float64(inputs[1])
multiple_str = str(multiple)
if '.' in multiple_str:
ans = multiple_str.split('.')[0]
else:
ans = multiple_str
print(ans)
|
p02706
|
s700635732
|
Accepted
|
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=sum(a)
if n<b:
print("-1")
else:
print(n-b)
|
p03338
|
s277653098
|
Accepted
|
n = int(input())
s = input()
ans = 0
for i in range(1, n - 1):
sf = set(s[:i])
sb = set(s[i:])
cnt = 0
for j in sf:
if j in sb:
cnt += 1
ans = max(ans, cnt)
print(ans)
|
p02972
|
s962330803
|
Accepted
|
import sys
input = sys.stdin.readline
N = int(input())
a_list = list(map(int, input().split()))
ans_list = [0] * N
ans_text = ''
for i in range(N):
# j の倍数が何個あるか
j = N - i
sum_j = sum(ans_list[j-1::j])
if sum_j%2 != a_list[j-1]:
ans_list[j-1] = 1
ans_text += str(j) + ' '
print(sum(ans_list))
print(ans_text)
|
p02724
|
s224985275
|
Wrong Answer
|
n=int(input())
print(1000*(n//500) + 5*((n//500)//5))
|
p03544
|
s045438818
|
Accepted
|
N=int(input())
L=[2,1]
for _ in range(N-1):
L.append(L[-1]+L[-2])
print(L[-1])
|
p02795
|
s694273500
|
Wrong Answer
|
s = [int(input()) for i in range(3)]
target = s[2]
if s[0] >= s[1]:
long = s[0]
short = s[1]
else:
long = s[1]
short = s[0]
for i in range(short):
if long * i >= target:
print(str(i+1))
break
|
p03416
|
s049415880
|
Accepted
|
A,B = map(int,input().split())
ans = 0
for i in range(A,B+1):
if str(i)==str(i)[::-1]:
ans+=1
print(ans)
|
p02767
|
s031740256
|
Wrong Answer
|
n = int(input())
x = [int(i) for i in input().split()]
ans = 1000000
for i in range(max(x)):
l = 0
for j in range(n):
l += (x[j]-i)**2
if ans > l:
ans = l
print(ans)
|
p02959
|
s217893014
|
Accepted
|
N = int(input())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
ans = 0
for i in range(N):
p = A[i] + A[i+1]
if(p - B[i] >= 0):
ans += B[i]
if(A[i] - B[i] < 0):
A[i+1] = p - B[i]
else:
ans += p
A[i+1] = 0
print(ans)
|
p02657
|
s233516878
|
Accepted
|
A,B=map(int,input().split())
print(A*B)
|
p03131
|
s021017396
|
Accepted
|
k, a, b = list(map(int, input().split()))
l = k - (a - 1)
ab = a + (b - a) * (l // 2) + (l % 2)
print(max(1+k, ab))
|
p03852
|
s460019998
|
Wrong Answer
|
s=input()
print(["vowel","consonant"][s=="a" or s=="i" or s=="u" or s=="e" or s=="o"])
|
p03261
|
s006198756
|
Accepted
|
#ABC-109-B
N = int(input())
ans = "Yes"
memo = {}
word = input()
memo[word] = None
last_char = word[-1]
for _ in range(N-1):
word = input()
if word in memo:
ans = "No"
break
if word[0] != last_char:
ans = "No"
break
memo[word] = None
last_char = word[-1]
print(ans)
|
p03698
|
s989080649
|
Accepted
|
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
# Written by NoKnowledgeGG @YlePhan
#import math
#mod = 10**9+7
def main():
s = input()
dic = {}
i = 0
while i != len(s):
if not s[i] in dic.keys():
dic[s[i]] = 1
else:
print('no')
exit()
i +=1
print('yes')
if __name__ == '__main__':
main()
|
p03001
|
s444230570
|
Accepted
|
w,h,x,y=map(int,input().split())
op=0
if w/2==x and h/2==y:
op=1
print(w*h/2,op)
|
p02694
|
s733754014
|
Accepted
|
X = int(input())
ans = 0
yokin = 100
while True:
yokin = int(yokin * 1.01)
ans += 1
if yokin >= X:
break
print(ans)
|
p03241
|
s519688265
|
Accepted
|
N, M = map(int, input().split())
from fractions import gcd
def make_divisors(n: int):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
return divisors
divisors = make_divisors(M)
ans = 0
for i in range(len(divisors)):
d = divisors[i]
if d*(N-1) >= M:
continue
ans = max(ans, gcd(d, M-(d*(N-1))))
print(ans)
|
p03632
|
s247049787
|
Accepted
|
import sys
input = sys.stdin.readline
A, B, C, D = map(int, input().split(' '))
min_bd = min(B, D)
max_ac = max(A, C)
diff = min_bd - max_ac
ans = 0
if diff > 0:
ans = abs(diff)
print(ans)
|
p03042
|
s069873075
|
Wrong Answer
|
s = input()
a = int(s[:2])
b = int(s[2:])
if (1 <= a <= 12) and (1 <= b <= 12):
print("AMBIGUOUS")
elif (1 <= a <= 12):
print("YYMM")
elif (1 <= b <= 12):
print("MMYY")
else:
print("NA")
|
p03617
|
s434372193
|
Accepted
|
q,h,s,d = map(int, input().split())
n = int(input())
two = min(8*q, 4*h, 2*s, d)
one = min(4*q, 2*h, s)
x = n // 2 * two
x += (n % 2) * one
print(x)
|
p03163
|
s983633108
|
Accepted
|
import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,W = LI()
wv = [LI() for _ in range(N)]
dp = [[0]*(W+1) for _ in range(N+1)] #1_indexed
for i,j in itertools.product(range(1,N+1),range(W+1)):
w,v = wv[i-1]
if j-w>=0:
dp[i][j] = max(dp[i][j],dp[i-1][j-w]+v)
dp[i][j] = max(dp[i][j],dp[i-1][j])
print(dp[-1][-1])
|
p02786
|
s785717416
|
Accepted
|
H = int(input())
k = H
p = 1
s = 0
while k >1:
k = k // 2
p += 1
for i in range (p):
s += 2**i
print(s)
|
p02624
|
s676734266
|
Accepted
|
n = int(input())
ans = 0
for i in range(1, n + 1):
ans += i * (((n // i) * ((n // i) + 1)) // 2)
print(ans)
|
p02802
|
s496530895
|
Accepted
|
n,m = map(int,input().split())
li = [[0,0] for _ in range(n)]
t1,t2 = 0,0
for i in range(m):
a,b = input().split()
if li[int(a)-1][0] != 1:
if b == "WA":
li[int(a)-1][1] += 1
if b == "AC":
li[int(a)-1][0] += 1
for i in range(n):
t1 += li[i][0]
t2 += li[i][1]*li[i][0]
print(t1,t2)
|
p03351
|
s165560493
|
Accepted
|
a,b,c,d=map(int,input().split())
if (abs(b-a)<=d and abs(c-b)<=d) or abs(a-c) <=d:
print('Yes')
else:
print('No')
|
p03681
|
s405451908
|
Accepted
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from math import factorial
n, m = map(int, readline().split())
mod = 10 ** 9 + 7
ans = factorial(n) * factorial(m)
if abs(n - m) > 1:
ans = 0
elif n == m:
ans *= 2
print(ans % mod)
|
p03693
|
s626756442
|
Accepted
|
r,g,b = map(int,input().split())
n = 100*r + 10*g + b
if n % 4 == 0 :
print('YES')
else:
print('NO')
|
p02829
|
s004460824
|
Wrong Answer
|
import time
pretime = time.time()
print(pretime)
pretime = pretime
a = [x for x in range(10 ** 7)]
print(a[-5])
thistime = time.time()
print(thistime - pretime)
pretime = thistime
b = []
for x in range(10 ** 7): b.append(x)
print(b[-5])
thistime = time.time()
print(thistime - pretime)
pretime = thistime
c = [0] *(10 ** 7)
for x in range(10 ** 7): c[x] = x
print(c[-5])
thistime = time.time()
print(thistime - pretime)
pretime = thistime
d = list(range(0, 10 ** 7))
print(d[-5])
thistime = time.time()
print(thistime - pretime)
pretime = thistime
|
p03943
|
s066598509
|
Wrong Answer
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7
a,b,c=MI()
if (a+b+c)%2==0:
print("Yes")
else:
print("No")
|
p03328
|
s941723037
|
Wrong Answer
|
i = 1
a,b = map(int, input().split())
m = 0
while m <= a:
m += i
i += 1
diff = abs(m - a)
print(diff)
|
p02717
|
s435867375
|
Accepted
|
import sys
input = lambda: sys.stdin.readline().rstrip()
A,B,C = map(int, input().split())
print(C, A, B)
|
p03693
|
s984899537
|
Wrong Answer
|
r,g,b = map(int,input().split())
if g*10+b %4==0:
print("YES")
else:
print("NO")
|
p02646
|
s779356460
|
Wrong Answer
|
[A,V]=[int(i) for i in input().split()]
[B,W]=[int(i) for i in input().split()]
T=int(input())
if abs(A-B)>T*abs(V-W):print("NO")
else:print("YES")
|
p02697
|
s841283376
|
Wrong Answer
|
n,m = map(int,input().split())
a = 1
b = 2
for i in range(1,m+1):
print(a,b)
a = a + 1
b = b + i
|
p02554
|
s317386303
|
Accepted
|
N = int(input())
ans = (10**N + 8**N - 2*(9**N)) % (10**9 + 7)
print(ans)
|
p03095
|
s231072925
|
Accepted
|
from collections import Counter
n=int(input())
s=input()
S=Counter(s)
ans=1
for i in S.values():
ans *=i+1
print((ans-1)%(10**9+7))
|
p02548
|
s594377934
|
Accepted
|
import sys
def solve():
input = sys.stdin.readline
N = int(input())
count = N - 1
for i in range(2, N):
b = 1
while i * b < N:
count += 1
b += 1
print(count)
return 0
if __name__ == "__main__":
solve()
|
p03408
|
s197900426
|
Accepted
|
score_dic = {}
for i in range(int(input())):
s = input()
if s not in score_dic:
score_dic[s] = 1
else:
score_dic[s] += 1
for i in range(int(input())):
t = input()
if t not in score_dic:
score_dic[t] = -1
else:
score_dic[t] -= 1
max_value = max(score_dic.values())
if max_value < 0:
print(0)
else:
print(max_value)
|
p02811
|
s060433010
|
Wrong Answer
|
K,X=map(int,input().split())
if 500*K>X:
print('Yes')
else:
print('No')
|
p02879
|
s551451337
|
Wrong Answer
|
A, B = map(int, input().split())
if A < 9 and B < 9:
print(A * B)
else:
print(-1)
|
p02600
|
s964066976
|
Accepted
|
a = int(input())
if 400 <= a and a <= 599:
print(8)
elif 600 <= a and a <= 799:
print(7)
elif 800 <= a and a <= 999:
print(6)
elif 1000 <= a and a <= 1199:
print(5)
elif 1200 <= a and a <= 1399:
print(4)
elif 1400 <= a and a <= 1599:
print(3)
elif 1600 <= a and a <= 1799:
print(2)
elif 1800 <= a and a <= 1999:
print(1)
|
p02631
|
s290998681
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
l = [0] * 30
b = []
for i in range(n):
x = a[i]
t = ''
j = 29
while j >= 0:
if x < 2**j:
t += '0'
else:
x -= 2**j
t += '1'
l[j] += 1
j -= 1
b.append(t)
ans = []
for i in range(n):
t = b[i]
d = 0
for j in range(30):
k = l[j]
if t[j] == '1':
k += 1
k %= 2
d += k * 2**j
ans.append(d)
print(*ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.