problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02707 | s484374741 | Accepted | N=int(input())
A=list(map(int, input().split()))
x = [0]*N
for a in A:
x[a-1] += 1
for i in x:
print(i)
|
p02831 | s356003383 | Accepted | #from math import gcd
from fractions import gcd
A,B = map(int,input().split())
#最小公倍数
def lcm(x,y):
return (x*y//gcd(x,y))
print(lcm(A,B))
|
p02615 | s330830527 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A.sort()
A.reverse()
happy = A[0]
circle = [A[0], A[1]]
for i in range(2, N):
circle.insert(len(circle)-1, A[i])
happy += min(circle[-1], circle[-3])
print(happy) |
p02697 | s197234066 | Wrong Answer | N, M = list(map(int, input().split()))
seki = [(1 + i*(i+1)//2)%N for i in range(2*M)]
for i in range(M):
print(seki[2*i], seki[2*i + 1]) |
p02947 | s042054503 | Wrong Answer | n = int(input())
a = [input() for i in range(n)]
for i in range(n):
a[i] = ''.join(sorted(a[i]))
a = sorted(a)
ans = 0
sum = 1
for i in range(n-1):
if a[i] == a[i+1]:
sum += 1
else :
ans += (sum*(sum-1))/2
sum = 1
ans += (sum*(sum-1))/2
print(ans) |
p02859 | s345013747 | Accepted | r=int(input())
print(r**2) |
p02879 | s624515400 | Accepted | A, B = map(int,input().split())
if A < 10 and B < 10: print(A * B)
else: print(-1) |
p03795 | s196919320 | Accepted | N = int(input())
# 1食 800 円で、15食食べる毎にその場で200 円値引き。
# 合計 N 食
# 今までに払った金額を x 円、レストランからもらった金額を y 円として、
# x−y を求めなさい。
x = 800 * N
y = N // 15 * 200
print(x - y) |
p03352 | s827121468 | Accepted | X = int(input())
ans = 1
for i in range(2,1000):
for j in range(2,10):
if i**j <= X:
ans = max(ans,i**j)
print(ans) |
p03001 | s638522853 | Accepted | w, h, x, y = map(int, input().split())
half = h*w / 2
if 2*x == w and 2*y == h:
p = 1
else:
p = 0
print(half, p) |
p02818 | s774785339 | Wrong Answer | input_from = input()
info = input_from.split(' ')
a = int(info[0])
b = int(info[1])
k = int(info[2])
a -= k
if a < 0:
b += a
a = 0
print("{0} {1}".format(a, b)) |
p02988 | s228001316 | Accepted | n=int(input())
p=list(map(int,input().split()))
c=0
for i in range(1,n-1):
if min(p[i-1],p[i+1])<p[i]<max(p[i-1],p[i+1]):
c+=1
print(c) |
p02909 | s898553792 | Wrong Answer | S=input()
flag=False
for i in range(len(S)):
if i%2==0:
if S[i]!='R' and S[i]!='U' and S[i]!='D':
flag=True
else:
if S[i]!='L' and S[i]!='U' and S[i]!='D':
flag=True
if flag==True:
print('No')
else:
print('Yes')
|
p03799 | s078826614 | Accepted | n,m=map(int,input().split())
cnt_s=n
cnt_c=m
ans=0
if cnt_s>cnt_c:
ans=cnt_c//2
print(ans)
elif cnt_s<=cnt_c:
ans+=min(n,cnt_c//2)
cnt_c-=2*min(n,cnt_c//2)
ans+=cnt_c//4
print(ans)
|
p02916 | s606322245 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
s = b[a[0]-1]
for i in range(1,n):
s += b[a[i]-1]
if(a[i] == a[i-1]+1):s+=c[a[i-1]-1]
print(s) |
p02693 | s690231932 | Accepted | K = int(input())
A, B = list(map(int, input().split()))
for i in range(A, B+1):
if i%K == 0:
print('OK')
exit()
print('NG') |
p02817 | s036433724 | Wrong Answer | S,T = input().split()
print(S,T) |
p03617 | s175033973 | Accepted | import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math
q,h,s,d = map(int,input().split())
n = int(input())
h = min(q*2,h)
s = min(h*2,s)
if n == 1:
print(s)
sys.exit()
if 2*s > d:
print(d*(n//2) + (n%2)*s)
else:
print(n*s) |
p03457 | s120862574 | Wrong Answer | N=int(input())
for i in range(N):
t,x,y = map(int,input().split())
if ((x+y+t)%2 != 0) & ((x+y)<t):
print("No")
exit()
print("Yes")
|
p03035 | s794155375 | Wrong Answer | A, B = map(int,input().split())
if A > 12:
print(B)
elif 6 <= A <= 12:
print(B/2)
else:
print(0) |
p03617 | s394821130 | Wrong Answer | # coding: utf-8
# Your code here!
cost=list(map(int,input().split()))
for i in range(4):
cost[i]/=2**(i-2)
N=int(input())
if min(cost)==cost[3]:
print(((N//2*2)*cost[3]+(N%2)*min(cost[:3])))
else:
print((min(cost)*N)) |
p02554 | s952872485 | Accepted | n = int(input())
mod = 10**9 + 7
a = (10**n + 8**n - 2*9**n)
print(a%mod) |
p03286 | s999571156 | Accepted | N=int(input())
ans_list=[]
sgn=1
for i in range(100):
if N%2==1:
ans_list.append("1")
N-=sgn
else:
ans_list.append("0")
N//=2
sgn*=-1
if N==0:
break
print("".join(reversed(ans_list))) |
p02766 | s159829920 | Accepted | N, K = list(map(int, input().split(' ')))
count = 1
com_val = K
while com_val <= N:
count += 1
com_val = pow(K, count)
print(count)
|
p03767 | s904221008 | Accepted | # -*- coding: utf-8 -*-
#----------
n = int(input().strip())
a_list = list(map(int, input().rstrip().split()))
#----------
a_list.sort()
a2_list = a_list[n:]
sum=0
for i in range( 0,len(a2_list),2 ):
sum += a2_list[i]
print(sum)
|
p03221 | s082449034 | Wrong Answer | import copy
n,m = map(int,input().split())
cnt = [0]*(10**5+4)
yy = []
yp = []
for _ in range(m):
a,b = map(int,input().split())
a,b = b,a
yy.append([a,0])
yp.append([a,b])
inlist = copy.deepcopy(yp)
yp.sort()
yy = dict(yy)
for i in range(m):
print(yp[i][1])
cnt[yp[i][1]]+=1
yy[yp[i][0]] = cnt[yp[i][1]]
for key,value in inlist:
print("{:06}{:06}".format(value,yy[key])) |
p02768 | s836231645 | Wrong Answer | N,a,b=input().split()
N=int(N)
a=int(a)
b=int(b)
LIM=10**9+7
hana=0
C=N
for i in range(1,N+1):
#print(i, C%LIM, hana)
if(i==a or i==b):
C=C*(N-i)//(i)
continue
else:
if(hana > LIM):
hana = hana % LIM
hana += hana + C%LIM
C=C*(N-i)//(i)
if(hana > LIM):
hana = hana % LIM
print(hana) |
p02766 | s260288286 | Accepted | N,K=map(int,input().split())
count=0
while N!=0:
N=N//K
count+=1
print(count) |
p02909 | s822082322 | Accepted | s = input()
if s == 'Sunny':
print('Cloudy')
elif s == 'Cloudy':
print('Rainy')
else:
print('Sunny')
|
p03759 | s094177061 | Wrong Answer | a, b, c = map(int, input().split())
print("YES" if a < b < c else "NO") |
p02664 | s483567412 | Accepted | T = input()
T = T.replace("?","D")
print(T) |
p03011 | s428566137 | Wrong Answer | a=list(map(int,input().split()))
a.sort()
print(a[0]*2+a[1])
|
p03665 | s542447551 | Accepted | N,P = map(int,input().split())
A = list(map(int,input().split()))
if all(a%2==0 for a in A):
print(0 if P else 2**N)
else:
print(2**(N-1)) |
p02859 | s981289021 | Accepted | r = int(input())
print(r*r) |
p03680 | s921214209 | Accepted | n = int(input())
dic = {}
for i in range(n):
a = int(input())
dic[i] = a-1
already = set()
already.add(0)
cur = 0
count = 0
while True:
cur = dic[cur]
count += 1
if cur == 1:
print(count)
break
if cur in already:
print(-1)
break
already.add(cur) |
p03997 | s171851846 | Accepted | # -*- coding: utf-8 -*-
a, b, h = map(int, open(0))
print((a + b) * h >> 1) |
p03693 | s904394866 | Wrong Answer | r, g, b = map(int, input().split(" "))
n = 100 * r + 10 * g + b
if n % 4 == 0:
print("Yes")
else:
print("No")
|
p03127 | s107396805 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
ans=2
if len(set(A))==1:
print(A[0])
else:
for a in A:
if a%2==1:
ans=1
print(ans) |
p03221 | s488778597 | Accepted | n, m = map(int, input().split())
Py = []
for i in range(m):
py = list(map(int, input().split()))
Py.append(py+[i])
Py = sorted(sorted(Py, key = lambda x: x[1]))
tmp = -1
ans = []
for i in range(m):
out = str(Py[i][0]).zfill(6)
cnt = cnt + 1 if Py[i][0] == tmp else 1
out += str(cnt).zfill(6)
tmp = Py[i][0]
ans.append([Py[i][2], out])
ans.sort()
for i in range(m):
print(ans[i][1]) |
p03817 | s595694330 | Wrong Answer | x = int(input())
y = x % 11
if y > 0:
cnt = 1
if y > 6:
cnt += 1
else:
cnt = 0
print(x // 11 + cnt)
|
p03076 | s664855381 | Wrong Answer | list=[int(input()) for i in range(5)]
sum=0
max=0
for x in list:
y = -(-x//10)*10
sum+=y
max=(y-x, max) |
p02663 | s326955863 | Accepted | a = list(map(int,input().split()))
print(a[2]*60+a[3]-a[0]*60-a[1]-a[4]) |
p03645 | s595351908 | Accepted | n,m=map(int,input().split())
G=[[] for i in range(n)]
for i in range(m):
a,b=map(int,input().split())
a-=1
b-=1
G[a].append(b)
G[b].append(a)
for g in G:
island_1=False
island_n=False
for gg in g:
if gg==0:
island_1=True
if gg==n-1:
island_n=True
if island_1==True and island_n==True:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
|
p03377 | s740798274 | Accepted | a,b,x = map(int,input().split())
if a <= x <= a + b:
print('YES')
else:
print('NO') |
p03386 | s041362016 | Wrong Answer | #Small and Large Integers
A,B,K = map(int,input().split())
L = []
for i in range(K):
if A+i <= B:
L.append(A+i)
if A <= B-i:
L.append(B-i)
S = set(L)
L = list(S)
for i in range(len(L)):
print(L[i]) |
p02582 | s931785837 | Accepted |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
S = input()
if 'RRR' in S:
return 3
if 'RR' in S:
return 2
if 'R' in S:
return 1
return 0
if __name__ == '__main__':
print(solve())
|
p03745 | s936077901 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
# dp table
INF = float('inf')
dp = [INF]*N
dp[0] = 0
inc, dec = 0, 0
for i in range(1,N):
if A[i] >= A[i-1]:
inc += 1
else:
inc = 1
if A[i] <= A[i-1]:
dec += 1
else:
dec = 1
dp[i] = min(dp[i-inc] + 1, dp[i-dec] + 1)
print(dp[N-1]) |
p03680 | s786261188 | Accepted | N = int(input())
a = [int(input()) for i in range(N)]
now = 1
ans = -1
for k in range(N):
now = a[now-1]
if now ==2:
ans = k +1
break
print(ans) |
p02832 | s395889609 | Accepted | n=int(input())
a=list(map(int, input().split()))
ans=0
for i in range(n):
if ans+1==a[i]:
ans+=1
if ans==0:
ans=n+1
print(n-ans) |
p03672 | s052465087 | Wrong Answer | s = input()
for i in range(1, len(s), 2):
a = s[:-i]
if a[:len(a)//2]==a[len(a)//2:]:
print(len(a))
exit() |
p03485 | s409313488 | Accepted | a, b = map(int, input().split())
print(((a+b)+1)//2) |
p02982 | s584816259 | Accepted | import math
n,d = map(int,input().split())
l = []
for i in range(n):
r = list(map(int,input().split()))
l.append(r)
f = []
for i in range(n-1):
for j in range(i+1,n):
e = []
for k in range(d):
e.append((l[i][k]-l[j][k])**2)
f.append(sum(e))
count = 0
for i in f:
if math.sqrt(i).is_integer():
count += 1
print(count) |
p02694 | s610531004 | Wrong Answer | a=int(input())
i=100
f=0
while i/a<=1:
i=int(i*1.01)
f=f+1
if a/i>10000000000000000:
i=i*1004291331219645824
f=f+3760
print(f) |
p03785 | s014741921 | Wrong Answer | n,c,k=[int(x) for x in input().rstrip().split()]
t=[]
for i in range(n):
T = int(input())
t.append([T,T+c])
t=sorted(t,key=lambda x :x[0])
# print(t)
right=0
ans=0
cnt=0
i=0
for s,e in t:
if s<= right<=e:
cnt+=1
if cnt==c:
ans+=1
right=e
cnt=0
else:
ans+=1
right=e
i+=1
print(ans)
|
p02663 | s550799025 | Accepted | H,M,h,m,K=map(int,input().split())
X=(h*60+m)-(H*60+M)
print(X-K) |
p02720 | s272840436 | Accepted | k = int(input())
a = [i+1 for i in range(9)]
while(1):
if k <= len(a):
print (a[k-1])
break
b = []
k = k - len(a)
x = a
a = b
b = x
for x in b:
for i in [-1,0,1]:
d = x%10 + i
if d < 0 or d > 9: continue
a.append( x*10 + d)
|
p02873 | s596372034 | Accepted | s = list(input())
a = [0] * (len(s) + 1)
for i in range(len(s)):
if s[i] == "<":
a[i+1] = a[i] + 1
for i in range(len(s)-1, -1, -1):
if s[i] == ">":
a[i] = max(a[i+1]+1, a[i])
print(sum(a)) |
p03145 | s485128380 | Accepted | A,B,C = map(int,input().split())
ans = (A * B) // 2
print(ans) |
p03061 | s043926019 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
def gcd(x,y):
while y:
x, y = y, x%y
return x
if n < 3:
print(max(a))
else:
ll, lr = [0]*n, [0]*n
ll[0], lr[n-1] = a[0], a[n-1]
for i in range(1,n):
ll[i] = gcd(ll[i-1], a[i])
lr[n-i-1] = gcd(lr[n-i], a[n-i-1])
print(max(ll[n-1], lr[1], *[gcd(l,r) for l,r in zip(ll[:n-1], lr[2:])])) |
p02597 | s924738536 | Accepted | N=int(input())
c=input()
R=c.count('R')
W=0
ans=[R,c.count('W')]
for i in range(N):
if c[i]=='W':
W+=1
else:
R-=1
ans.append(max(R,W))
print(min(ans)) |
p03861 | s328672442 | Accepted | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
a,b,x = map(int, input().split())
def function(n,x):
if (n>=0):
return n//x+1
else:
return 0
ans = function(b,x) - function(a-1,x)
print(ans)
|
p02790 | s444443921 | Accepted | a, b =map(int,input().split())
A = 0
B = 0
for i in range(b):
A += a*(10**i)
for i in range(a):
B += b*(10**i)
if a < b:
print(A)
elif a >b:
print(B)
else:
print(min(A,B)) |
p03163 | s959936724 | Accepted | l=list(map(int,input().split()))
n=l[0]
w=l[1]
va=[0]*n
wa=[0]*n
for i in range(n):
x=list(map(int,input().split()))
wa[i]=x[0]
va[i]=x[1]
dp=[[0 for i in range(w+1)] for j in range(n+1)]
for i in range(1,n+1):
for j in range(1,w+1):
if wa[i-1]>j:
dp[i][j]=dp[i-1][j]
else:
dp[i][j]=max(dp[i-1][j],dp[i-1][j-wa[i-1]]+va[i-1])
print(dp[-1][-1])
|
p04030 | s232130029 | Accepted | S = input()
ans = []
for s in S:
if s == 'B':
if len(ans) >= 1:
ans.pop()
else:
continue
else:
ans.append(s)
ans = ''.join(ans)
print(ans) |
p03041 | s209541944 | Accepted | N,K = map(int,input().split())
S = input()
ans = ""
for i in range(len(S)):
if i+1 == K:
ans += str.lower(S[i])
else:
ans += S[i]
print(ans) |
p03359 | s026490465 | Accepted | import itertools
def main():
a,b = map(int,input().split())
mm = a
if a > b:
mm -=1
print(mm)
if __name__ == '__main__':
main() |
p03544 | s544414281 | Accepted | N = int(input())
ans = [2,1]
for i in range(2,87):
tmp = ans[i-2] + ans[i-1]
ans.append(tmp)
print(ans[N]) |
p03548 | s636422804 | Wrong Answer | x,y,z = map(int,input().split())
people = 0
while x-y >0:
x = x-y
people += 1
x -= z
print(people)
|
p02628 | s632144243 | Accepted | n, k = map(int, input().split())
s = list(map(int, input().split()))
s.sort()
cost=0
for i in range(k):
cost+=s[i]
print(cost) |
p03408 | s557073273 | Wrong Answer | from collections import Counter
N=int(input())
s=[input() for i in range(N)]
M=int(input())
t=[input() for i in range(M)]
S=list(set((s)))
T=list(set((t)))
n=len(S)
ans=0
for i in range(n):
if s.count(s[i])-t.count(s[i])>ans:
ans=s.count(s[i])-t.count(s[i])
print(ans) |
p02687 | s649571809 | Accepted | #!/usr/bin/env python3
S = input()
if S == 'ABC':
print('ARC')
else:
print('ABC')
|
p02836 | s809338331 | Accepted | s = str(input())
ans = 0
j = len(s)-1
for i in range(len(s)):
if s[i] != s[j]:
ans += 1
j -= 1
print(int(ans/2)) |
p02645 | s091725664 | Wrong Answer | inp = input('enter :')
inp = inp[0:3]
print(inp) |
p02973 | s943818068 | Wrong Answer | n = int(input())
a = [int(input()) for i in range(n)]
cnt = 0
ans = 0
for i in range(1,n):
if a[i] <= a[i-1]:
cnt += 1
else:
cnt = 0
ans = max(ans, cnt)
ans = max(ans, cnt)
print (ans + 1) |
p03146 | s843059568 | Accepted | A=int(input())
B=set([A])
for i in range(1000000):
if A%2==0:
A=A//2
else:
A=3*A+1
if A in B:
print(len(B)+1)
exit()
else:
B.add(A) |
p02860 | s305315153 | Accepted | N = int(input())
S = input()
print('Yes' if S[:(N//2)] == S[(N//2):] else 'No') |
p03408 | s765325811 | Accepted | N=int(input())
A=[]
B=[]
for i in range(N):
A.append(input())
M=int(input())
for i in range(M):
B.append(input())
ans=0
for i in set(A):
s=0
s+=A.count(i)-B.count(i)
ans=max(ans,s)
print(ans) |
p03814 | s192541931 | Accepted | s = input()
print(s.rfind("Z")-s.find("A")+1) |
p03127 | s109914714 | Wrong Answer | N = int(input())
A = sorted([int(i) for i in input().split()])
amin = A[0]
multi = True
even = True
for i in range(N):
if A[i] % amin != 0:
multi = False
if A[i] % 2 != 0:
even = False
if multi: print(amin)
elif even: print(2)
else: print(1) |
p02882 | s726509546 | Wrong Answer | import math
a,b,x = map(int,input().split())
if (a**2)*b <= 2*x:
print(math.degrees(math.atan(2*((a**2)*b-x)/a**3)))
else:
print(math.degrees(math.atan(a*(b**2)/2*x))) |
p03672 | s566184666 | Accepted | S = list(input())
for i in range(len(S)//2):
flag =0
_ = S.pop(-1)
_ = S.pop(-1)
bf = S[:len(S)//2]
af = S[len(S)//2:]
for i in range(len(bf)):
if bf[i] != af[i]:
flag = 1
break
if flag ==0:
break
print(len(S))
|
p02631 | s942460019 | Accepted | import math
import fractions
import collections
import itertools
import pprint
N=int(input())
a=list(map(int,input().split()))
ex=a[0]
for i in range(1,N):
ex=ex^a[i]
l=[]
for i in range(N):
l.append(ex^a[i])
print(*l) |
p02784 | s499599772 | Wrong Answer | H, N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
print ("Yse")
else:
print ("No") |
p03105 | s033150226 | Accepted | A, B, C= map(int, input().split())
if A*C <= B:
print(C)
elif A <= B:
print(B//A)
else:
print(0) |
p02717 | s597620426 | Accepted | X,Y,Z = map(int,input().split())
print(str(Z) + " " + str(X) + " " + str(Y)) |
p02797 | s077896517 | Accepted | n,k,s = map(int,input().split())
for i in range(n):
if i < k:
print(s,end="")
else:
if s!=10**9:
print(10**9,end="")
else:
print(10**9-1,end="")
print(" ",end="")
print() |
p02553 | s846440334 | Accepted | a, b, c, d = map(int, input().split())
ans = max(a * c, a * d, b * c, b * d)
print(ans)
|
p03469 | s893473076 | Wrong Answer | s = input()
print('2017' + s[4:]) |
p02695 | s265320969 | Accepted | # C Many Requirements
from itertools import combinations_with_replacement as com
N, M, Q = map(int, input().split())
C = []
for q in range(Q):
C.append(tuple(map(int, input().split())))
As = com([i for i in range(1, M+1)], N)
ans = 0
for A in As:
point = 0
for Ci in C:
if A[Ci[1]-1] - A[Ci[0]-1] == Ci[2]:
point += Ci[3]
ans = max(ans, point)
print(ans) |
p02796 | s973466966 | Accepted | # -*- coding: utf-8 -*-
N = int(input())
items = [list(map(int, input().split())) for i in range(N)]
items = sorted(items, key=lambda x:x[0]+x[1])
res = 0
bf = -10**9
for x, l in items:
if bf <= x - l:
res += 1
bf = x + l
print(res)
|
p02899 | s951097867 | Accepted | N=int(input())
A=list(map(int,input().split()))
#print(A)
a=[]
l=[]
for i in range(N):
a.append([A[i],i+1])
a.sort(key=lambda x:x[0])
for i in range(N):
l.append(a[i][1])
print(*l, sep=" ")
|
p02973 | s694471352 | Accepted | import sys
from bisect import bisect_left
from collections import deque
def main():
input = sys.stdin.buffer.readline
n = int(input())
a = [int(input()) for _ in range(n)]
pile = deque()
for i in range(n):
index = bisect_left(pile, a[i])
if index == 0:
pile.appendleft(a[i])
else:
pile[index - 1] = a[i]
print(len(pile))
if __name__ == "__main__":
main()
|
p02594 | s098528782 | Accepted | import sys
sys.setrecursionlimit(500005)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
x = ni()
print("Yes" if x >= 30 else "No")
|
p02629 | s728081879 | Wrong Answer | import string
b = string.ascii_letters
a = int(input())
c = []
while(a!=0):
c.append(b[a%26-1])
a//=26
print(''.join(c)) |
p02578 | s986493283 | Accepted | import heapq
import math
def main():
N = input()
A = list(map(int, input().split()))
res = 0
max_a = A[0]
for a in A[1:]:
if max_a > a:
res += (max_a - a)
else:
max_a = a
print(res)
if __name__ == "__main__":
main() |
p02660 | s974176792 | Wrong Answer | import math
N=int(input())
count=0
for k in range(2,int(math.sqrt(N)+1)) :
if N%k == 0:
N=N/k
count+=1
if count==0 and N!=1:
print(1)
else:
print(count) |
p04005 | s880553259 | Accepted | A,B,C=map(int, input().split())
if A&1 and B&1 and C&1:
print(min(A*B,B*C,C*A))
else:
print(0) |
p03478 | s421278293 | Wrong Answer | n,a,b=map(int,input().split())
sum=0
for i in range(n+1):
wa = int((i / 1000) % 10) + int((i / 100) % 10) + int((i / 10) % 10) + int(i % 10)
if a <= wa and wa<=b:
sum += i
print(sum) |
p02811 | s448686031 | Accepted | K, X = map(int, input().split())
print('Yes' if K*500 >= X else 'No') |
p03160 | s528452377 | Accepted | import sys
#import numpy as np
#from collections import defaultdict
#import math
#from collections import deque
input = sys.stdin.readline
def main():
N = int(input())
H = list(map(int,input().split()))
H = [10**6] + H
dp= [0] *(N+1)
for i in range(2,N+1):
dp[i]= min(dp[i-2]+abs(H[i]-H[i-2]),dp[i-1]+abs(H[i]-H[i-1]))
print(dp[N])
if __name__ == "__main__":
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.