problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02607 | s769945233 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
b = [(i * ai) % 2 for i, ai in enumerate(a)]
print(sum(b)) |
p02973 | s005876876 | Accepted | import bisect
from collections import deque
def LIS(a):
lis = deque()
lis.append(-1)
for i in range(len(a)):
index = bisect.bisect_left(lis,a[i])
if index == 0:
lis.appendleft(a[i])
else:
lis[index-1] = a[i]
return len(lis)
def main():
n = int(input())
a = [int(input()) for _ in range(n)]
print(LIS(a))
if __name__ == "__main__":
main() |
p03327 | s980162165 | Accepted | n=int(input())
if n < 1000:
print("ABC")
else:
print("ABD")
|
p02554 | s343865682 | Accepted | #!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
n = int(input())
mod = 10 ** 9 + 7
if n == 1:
print(0)
elif n == 2:
print(2)
else:
print((pow(10, n, mod) - pow(9, n, mod) * 2 + pow(8, n, mod)) % mod)
if __name__ == '__main__':
main()
|
p02748 | s870845106 | Accepted | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
xyc = [list(map(int, input().split())) for _ in range(M)]
# print(xyc)
cost = []
cost.append(min(a) + min(b))
for x, y, c in xyc:
tmp = a[x - 1] + b[y - 1] - c
cost.append(tmp)
print(min(cost))
|
p02767 | s671502615 | Wrong Answer | N = int(input())
X = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
k = []
for a in X:
k.append((a-i)**2)
if i==1:
ans = sum(k)
if ans>sum(k):
ans = sum(k)
print(ans) |
p02760 | s291571069 | Accepted | a = []
for _ in range(3):
a += list(map(int, input().split()))
n = int(input())
for _ in range(n):
b = int(input())
if b in a:
i = a.index(b)
a[i] = 0
if sum(a[0:3]) == 0 or sum(a[3:6]) == 0 or sum(a[6:]) == 0 \
or sum(a[0::3]) == 0 or sum(a[1::3]) == 0 or sum(a[2::3]) == 0 \
or sum(a[0::4]) == 0 or sum(a[2:7:2]) == 0:
print("Yes")
else:
print("No")
|
p02720 | s123231080 | Accepted | from heapq import heappop, heappush
k = int(input())
ten = [[0,1]] + [[i-1, i, i+1] for i in range(1,9)] + [[8,9]]
cnt = 0
heap = []
for i in range(1, 10):
heappush(heap, [i, i])
memo = set()
while heap or cnt < 20:
num,pre = heappop(heap)
if num in memo or num < 1:
continue
else:
memo.add(num)
cnt += 1
# print(num,pre)
if cnt >= k:
print(num)
break
for i in ten[pre]:
heappush(heap, [num*10+i, i])
|
p03013 | s658581413 | Wrong Answer | n,m=map(int,input().split())
lst=[int(input()) for i in range(m)]
DP=[0]*(n+1)
temp=0
DP[0]=1
DP[1]=1
for i in range(1, n+1):
if i in lst:
DP[i]=0
else:
DP[i]=(DP[i-1]+DP[i-2])%(10**9+7)
print(DP[n]) |
p03352 | s217389990 | Accepted | import math
def main():
x = int(input())
sum=0
if x==0 or x==1:
sum=x
else:
for i in range(2,int(math.sqrt(x))+1):
j=2
while True:
if pow(i,j) <= x:
if pow(i,j) > sum:
sum=pow(i,j)
else:
break
j+=1
print(sum)
main()
|
p03059 | s010171448 | Wrong Answer | A,B,T=map(int,input().split())
print(((T+0.5)//A)*B)
|
p03860 | s239542250 | Wrong Answer | s= str(input())
print('A' + ''+ s[0] + '' +'C') |
p03042 | s068681613 | Accepted | s=int(input())
s1=s//100
s2=s%100
if 12>=s1>=1 and 12>=s2>=1:
ans="AMBIGUOUS"
elif 12>=s1>=1 and not 12>=s2>=1:
ans="MMYY"
elif 12>=s2>=1 and not 12>=s1>=1:
ans="YYMM"
else:
ans="NA"
print(ans) |
p03105 | s097692588 | Accepted | a, b, c = map(int, input().split())
print(min(b//a, c)) |
p02899 | s401781033 | Wrong Answer | N=int(input())
C=list(map(int,input().split()))
ans=[0]*(N-1)
for i in range(1,N+1):
ans.insert(C[i-1],str(i))
for _ in range(N-1):
ans.remove(0)
ans=' '.join([str(n) for n in ans])
print(ans) |
p02687 | s793523280 | Wrong Answer | inpo=input().split()
for i in inpo:
if i=="B":
print("R",end="")
elif i=="R":
print("B",end="")
else:
print(i,end="") |
p02681 | s143398358 | Accepted | a = input()
x = [a[i:i+1] for i in range(len(a))]
b = input()
y = [b[i:i+1] for i in range(len(b))]
n=0
for i in range(len(x)):
n = n+1
if x[i] != y[i]:
print("No")
break
if n == len(a) and x[len(a)-1]==y[len(a)-1]:
print("Yes") |
p03062 | s249992234 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
aabs = [i if i>=0 else i*(-1) for i in a]
MIN = min(aabs)
ans = 0
mcount = 0
for i in range(n):
if a[i] < 0:
mcount += 1
if mcount%2 == 0:
for i in a:
ans += abs(i)
print(ans)
else:
for i in a:
ans += abs(i)
print(ans - 2*MIN)
|
p03136 | s448293505 | Accepted | N = int(input())
L = list(map(int, input().split()))
LM = max(L)
L.remove(LM)
print('Yes' if LM < sum(L) else 'No') |
p02621 | s441825674 | Wrong Answer | a=int(input())
print(a+a**2) |
p03243 | s558246656 | Accepted | n = int(input())
for i in range(n,1000):
arr = list(str(i))
s = list(set(arr))
if len(s) == 1:
print(i)
break
|
p02629 | s513991432 | Accepted | no = "abcdefghijklmnopqrstuvwxyz"
def main():
N = int(input())
ans = ""
while N > 0:
N -= 1
ans += no[N % 26]
N //= 26
return ans[::-1]
if __name__ == '__main__':
print(main()) |
p02924 | s889171660 | Accepted | n=int(input())
print(n*(n-1)//2) |
p03994 | s570978170 | Accepted | s = list(input())
k = int(input())
abc = "abcdefghijklmnopqrstuvwxyz"
c = 0
for e,i in enumerate(s):
# print(26-abc.index(i))
if k-26+abc.index(i)>=0 and i!='a':
s[e] = 'a'
k-=26-abc.index(i)
# print(k)
k+=abc.index(s[-1])
k%=26
s[-1] = abc[k]
print("".join(s)) |
p03607 | s254627115 | Accepted | N = int(input())
A = []
B = []
for i in range(N):
A.append(int(input()))
A.sort()
B.append(1)
for i in range(1, N):
if(A[i]!= A[i- 1]):
B.append(1)
else:
B[-1]+= 1
i+= 1
ans = list(filter(lambda x: x % 2 == 1, B))
print(len(ans)) |
p04033 | s303032736 | Accepted | import sys
#N = I()
#A = [LI() for _ in range(N)]
a, b = list(map(int,sys.stdin.readline().rstrip().split()))
if a > 0:
print('Positive')
elif a <= 0 and b >= 0:
print('Zero')
else:
if (a+b)%2 == 0:
print('Negative')
else:
print('Positive') |
p03145 | s600108139 | Wrong Answer | a,b,c = list(map(int, input().split()))
print((a * b) / 2)
|
p04044 | s154865464 | Accepted | n, l = map(int, input().split())
s = sorted([input() for i in range(n)])
ans = ""
for i in s:
ans += i
print(ans) |
p02582 | s859525188 | Wrong Answer | list = input()
#print(list[2])
#print(len(list))
cnt = 0
for n in list:
#print(n)
if n == "R":
cnt+=1
print(cnt)
|
p02621 | s187338839 | Accepted | import sys
import math
def II():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def MI():
return map(int, sys.stdin.readline().split())
def SI():
return sys.stdin.readline().strip()
n = II()
print(n+n**2+n**3) |
p02694 | s025185650 | Wrong Answer | import math
target = int(input()) # 目標金額
have = 100 # 手持ちの金額（100円スタート）
years = 0 # 何年かかるか
while have <= target:
#print(have, years)
have = math.floor(have * 1.01)
years += 1
print(years) |
p03062 | s120358861 | Accepted | import numpy as np
n = int(input())
a = np.array(tuple(map(int, input().split())))
b = len(np.where(a < 0)[0])
a = abs(a)
if b % 2 == 0:
print(np.sum(a))
else:
print(np.sum(a) - 2 * np.min(a)) |
p03251 | s826012799 | Wrong Answer | n,m,x,y = map(int,input().split())
d = "War"
l_x = sorted(list(map(int,input().split())))[::-1]
l_y = sorted(list(map(int,input().split())))
for i in range(x,y+1):
if l_x[0]<=i and l_y[0]>=i:
d = "No War"
break
print(d) |
p02910 | s311740018 | Accepted | s=input()
print('No') if 'L' in s[::2] or 'R' in s[1::2] else print('Yes') |
p03681 | s840506074 | Wrong Answer | n, m = map(int, input().split())
mod = 10**9+7
if abs(n - m) >= 2:
print(0)
exit()
import math
minx = min(n, m)
x = math.factorial(minx) % mod
if n == m:
print(2*pow(x,2,mod)%mod)
else:
print(pow(x,2,mod)*(x+1)%mod)
|
p02780 | s149673426 | Wrong Answer | N, K = map(int, input().split())
p = list(map(int, input().split()))
ansmax = 0
for i in range(N-K+1):
ans = 0
for j in range(K):
ans += (p[i+j]+1)/2
print(ans)
if(ansmax < ans):
ansmax = ans
print(ansmax) |
p03673 | s823228017 | Accepted | n,p=int(input()),list(map(int,input().split()))
k= n//2 if n%2==0 else n//2+1
a,b=list(range(0,k)),list(range(k-1,n))[::-1]
c=[]
for x,y in zip(a,b):
c.append(x)
c.append(y)
c= c if n%2==0 else c[:-1]
c=c[::-1]
l=list([])
for x,y in zip(c,list(range(n))):
l.append([x,y])
l=sorted(l)
for i in range(n):
print(p[l[i][1]],end=" ") |
p03371 | s922088537 | Accepted | def half_and_half(a,b,c,x,y):
z = x if x > y else y
can = []
for n in range(z+1):
p = x - n if x > n else 0
q = y - n if y > n else 0
amount = p*a + q*b + n*c*2
#print("%d = %d x %d + %d x %d + %d x %d " %(amount,p,a,q,b,n,c))
can.append(amount)
return min(can)
if __name__ == '__main__':
a,b,c,x,y = map(int,input().split())
print(half_and_half(a,b,c,x,y))
|
p03730 | s197497442 | Accepted | a, b, c = map(int, input().split())
s = set()
for i in range(1, b + 1):
aa = a * i
amari = aa % b
if amari in s:
break
s.add(amari)
if c in s:
print('YES')
else:
print('NO')
|
p03545 | s165394266 | Accepted | #ABC079-C-Train Ticket
s = input()
n = len(s) - 1
for i in range(n**2):
tmp = ""
for j in range(n+1):
tmp += s[j]
if (i >> j)&1 :
tmp += '+'
else:
tmp += '-'
tmp = tmp[:-1]
if eval(tmp) == 7:
print(tmp+'=7')
break |
p03657 | s542950092 | Accepted | a, b = map(int, input().split())
if a%3 == 0:
print('Possible')
elif b%3 == 0:
print('Possible')
elif (a+b)%3 == 0:
print('Possible')
else:
print('Impossible') |
p02612 | s255769125 | Accepted | n=int(input())
if n%1000:print(1000-(n%1000))
else:print(0) |
p02577 | s771895040 | Accepted | n = int(input())
if(n%9==0):
print("Yes")
else:
print("No") |
p03544 | s176887730 | Wrong Answer | n = int(input())
def luc(a, b, n):
if n > 0:
print(a,b)
return luc(b,a+b,n-1)
else:
return a
print(luc(2,1,n))
|
p04020 | s033352971 | Accepted | N=int(input())
A=[int(input()) for i in range(N)]
ans=0
for i in range(N):
ans+=A[i]//2
A[i]-=(A[i]//2*2)
if i>0:
d=min(A[i],A[i-1])
ans+=d
A[i]-=d
A[i-1]-=d
if i<N-1:
d=min(A[i],A[i+1])
ans+=d
A[i]-=d
A[i+1]-=d
print(ans) |
p03774 | s256242362 | Accepted | n, m = map(int, input().split())
students = [list(map(int, input().split())) for _ in range(n)]
checks = [list(map(int, input().split())) for _ in range(m)]
for s in students:
dis = [abs(s[0] - c[0]) + abs(s[1] - c[1]) for c in checks]
print(dis.index(min(dis))+1)
|
p03814 | s754295264 | Wrong Answer | s = input()
for i in range(len(s)):
if s[i] == "A":
a = i
elif s[i] == "Z":
b = i
print(b-a+1) |
p03281 | s436022264 | Accepted | n = int(input())
ans = []
for i in range(1, n+1):
cnt = 0
if i%2==1:
for j in range(1, i+1):
if i%j==0:
cnt += 1
if cnt==8:
ans.append(i)
print(len(ans)) |
p03042 | s540545555 | Accepted | S = input()
a = S[0:2]
b = S[2:4]
A = int(a)
B = int(b)
if A>=1 and A <=12:
if B>= 1 and B <= 12:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if B>= 1 and B<= 12:
print("YYMM")
else:
print("NA") |
p02554 | s164935226 | Wrong Answer | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(input())
mod = 10**9+7
print(pow(10,n,mod)-2*pow(9,n,mod)+pow(8,n,mod))
if __name__=='__main__':
main() |
p03861 | s386401369 | Wrong Answer | import numpy as np
import math
import sys
def sinput(): return sys.stdin.readline()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(): return list(imap())
def farr(): return list(fmap())
def sarr(): return sinput().split()
a, b, x = imap()
ans = math.floor(b/x) - math.floor(a/x)
if a % x == 0: ans += 1
print(ans) |
p03150 | s151773616 | Accepted | from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
s=input()
key = "keyence"
for i in range(len(s)):
j = i + len(s) -7
if s[:i] + s[j:] == key:
print("YES")
exit()
print("NO") |
p02597 | s334876389 | Wrong Answer | n = int(input())
C = list(input())
if "R" not in C:
print(n)
exit()
W = C.count("W")
R = C.count("R")
w = 0
r = R
ans = float('inf')
for c in C:
if c == "W":
w += 1
else:
r -= 1
ans = min(ans, max(w, r))
print(ans) |
p02621 | s069932176 | Accepted | n = int(input())
print(int(n + n**2 + n**3)) |
p03131 | s351127225 | Wrong Answer | K, A, B = map(int, input().split())
if A + 2 >= B:
print(K)
elif K <= A:
print(K)
else:
M = K - A + 1
ans = A + M // 2 * (B - A) + M % 2
print(ans) |
p03385 | s999311386 | Accepted | S = input()
if len(set(S)) == 3:
print('Yes')
else:
print('No') |
p02630 | s350943418 | Accepted | n = int(input())
a = list(map(int,input().split()))
d = {}
for i in a:
if i in d:
d[i] += 1
else:
d[i] = 1
ans = sum(a)
q = int(input())
for i in range(q):
b,c = map(int,input().split())
if b in d:
ans -= b * d[b]
ans += c * d[b]
if c in d:
d[c] += d[b]
else:
d[c] = d[b]
d[b] = 0
print(ans)
|
p03136 | s526324586 | Wrong Answer | # -*- coding: <encoding name> -*-
n = int(input())
l = list(map(int, input().split()))
s = sum(l)
print('Yes' if n < s else 'No') |
p04012 | s845359182 | Accepted | w = list(map(str, input()))
ans = 'Yes'
for i in (set(w)):
if w.count(i)%2!=0: ans ='No'
print(ans) |
p03494 | s384988551 | Accepted | def resolve():
input()
A = list(map(int,input().split()))
count=0
while len(list(filter(lambda x: x%2==1,A)))==0:
count+=1
A =list(map(lambda x:x//2,A))
print(count)
resolve() |
p02642 | s704760955 | Accepted | n=int(input())
l=list(map(int,input().split()))
ml=max(l)
m=[0]*(ml+1)
for i in l:
m[i]+=1
for i in range(ml+1):
if m[i]>=1:
for j in range(2*i,ml+1,i):
if m[j]>0:
m[j]=0
#print(j)
for i in range(ml+1):
if m[i]>=2:
m[i]=0
print(sum(m))
|
p02553 | s122916710 | Wrong Answer | import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
a,b,c,d=get_ints()
x=max(a,b)
y=max(c,d)
print(x*y) |
p02987 | s633063859 | Accepted | s = list(input())
import collections
c = collections.Counter(s)
ans = 1
for i in range(4):
if c[s[i]] != 2:
ans = 0
print(["No","Yes"][ans]) |
p02972 | s185920309 | Accepted | N = int(input())
a = [int(i) for i in input().split()]
ls = [0 for i in range(N+1)]
for i, x in enumerate(a[::-1]):
num = N - i
s = 0
for j in range(num, N+1, num):
if ls[j] == 1:
s += 1
if s%2 == x:
ls[num] = 0
else:
ls[num] = 1
print(sum(ls))
b = []
for i in range(N+1):
if ls[i] == 1:
b.append(i)
print(*b)
|
p02555 | s265905425 | Accepted | s=int(input())
mod=10**9+7
if s<=2:
print(0)
exit()
if s==3:
print(1)
exit()
dp=[0]*(s+1)
for i in range(3,s+1):
dp[i]+=1
for j in range(3,s+1):
if i+j>s:
continue
dp[i+j]+=dp[i]
dp[i+j]%=mod
dp[i]%=mod
print(dp[-1]%mod) |
p03695 | s350197585 | Wrong Answer | n=int(input())
a=list(map(lambda x:int(x)//400,input().split()))
cat=[0]*9
for ai in a:
if ai < 8:
cat[ai]=1
else:
cat[8]+=1
print(str(max(sum(cat[:8]),1))+' '+str(min(sum(cat),8))) |
p03211 | s186662414 | Accepted | N = str(input())
Sta = 753
Ans = 1000
for i in range(len(N)-2):
C_Ans = abs(Sta-int("".join(N[i:i+3])))
if C_Ans < Ans:
Ans = C_Ans
print(Ans) |
p03557 | s027069492 | Accepted | #20 AtCoder Beginner Contest 077 C - Snuke Festival
import bisect
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
c.sort()
ans = 0
for i in b:
ans+= (bisect.bisect_right(a, i-1))*(n-bisect.bisect_left(c, i+1))
print(ans) |
p02613 | s044126941 | Accepted | import sys
import numpy as np
A = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(A):
s = str(input())
if s == 'AC':
AC += 1
elif s == 'WA':
WA += 1
elif s == 'TLE':
TLE += 1
elif s == 'RE':
RE += 1
print('AC x', AC)
print('WA x', WA)
print('TLE x', TLE)
print('RE x', RE)
|
p02768 | s902886959 | Accepted | n, a, b = map(int, input().split())
mod = 10**9 + 7
def neko(n, k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
k = min(n - k, k)
ans = 1
inv = [1] * (k + 1)
if k >= 1:
ans *= (n - k + 1) % mod
for i in range(2, k + 1):
inv[i] = mod - inv[mod % i] * (mod // i) % mod
ans = ans * (n - k + i) * inv[i] % mod
return ans
print((pow(2, n, mod) - 1 - neko(n, a) - neko(n, b)) % mod)
|
p02983 | s986865718 | Wrong Answer | L, R = list(map(int, input().split()))
l = L%2019
print(l * (l+1) % 2019) |
p03719 | s913269217 | Wrong Answer | a, b, c = map(int, input().split())
print('YES' if a <= c <=b else 'NO') |
p03475 | s285203359 | Accepted | n = int(input())
l = [list(map(int, input().split())) for i in range(n - 1)]
for i in range(n):
t = 0
for c, s, f in l[i:]:
t = max(s, t)
mod = abs(t - s)%f
if mod != 0:
t += f - mod
t += c
print(t) |
p03416 | s512942564 | Accepted | A,B = map(int,input().split())
count = 0
for i in range(A,B+1):
i = str(i)
if i[0] == i[4] and i[1] == i[3]:
count += 1
print(count) |
p03262 | s878679734 | Accepted | import fractions
from functools import reduce
n, x = map(int, input().split())
xx = [abs(int(i) - x) for i in input().split()]
if n == 1:
ans = xx[0]
else:
ans = reduce(fractions.gcd, xx)
print(ans)
|
p03163 | s407483794 | Wrong Answer | N,W=map(int,input().split())
k=[[0,0] for i in range(N)]
dp=[[0]*(W+1) for j in range(N+1)]
for i in range(N):
k[i][0],k[i][1]=map(int,input().split())
for i in range(N):
for w in range(W+1):
if k[i][0]>w:
dp[i+1][w]=dp[i][w]
else:
dp[i+1][w] = max(dp[i][w-k[i][0]]+k[i][1],dp[i][w])
print(dp[N-1][W])
|
p02911 | s866515182 | Accepted | def resolve():
'''
code here
'''
N, M, Q = [int(item) for item in input().split()]
As = [int(input()) for _ in range(Q)]
memo = [0 for _ in range(N)]
for item in As:
memo[item-1] += 1
for item in range(N):
if M - Q + memo[item] > 0:
print('Yes')
else:
print('No')
if __name__ == "__main__":
resolve()
|
p03126 | s872809819 | Accepted | n, m = map(int, input().split())
k = []
tmp = [0] * m
for i in range(n):
k.append(list(map(int, input().split())))
k[i].pop(0)
ans = 0
cnt = 0
for i in k:
for j in i:
tmp[j-1] += 1
for i in tmp:
if i == n:
ans += 1
print(ans)
|
p02859 | s197944614 | Wrong Answer | import math
def recta():
r = int(input())
area1 = r**2 * math.pi
area2 = 1**2 * math.pi
print(int(area1 / area2))
if __name__ == "__main__":
recta()
|
p03419 | s342644391 | Wrong Answer | def solve():
n, m = map(int, input().split())
if n == 1 and m == 1:
print(0)
elif n == 1:
print(m-2)
else:
print((n-2)*(m-2))
return 0
if __name__ == "__main__":
solve() |
p02820 | s935816890 | Wrong Answer | N, K = map(int, input().split())
R, S, P = list(map(int, input().split()))
T = list(input())
result = [0] * N
for i,t in enumerate(T):
if t == "r":
result[i] = P
elif t == "s":
result[i] = R
else:
result[i] = S
for i in range(K, N):
if result[i] == result[i-K]:
result[i] = 0
print(sum(result)) |
p03485 | s613248182 | Accepted | a, b = map(int, input().split())
if (a+b)%2 == 0:
print((a+b)//2)
else:
print((a+b)//2 + 1) |
p03162 | s813150766 | Accepted | import sys
input = sys.stdin.readline
N=int(input())
lst=[[] for f in range(N)]
ans=[[0 for e in range(3)] for f in range(N)]
for i in range(N):
lst[i]=list(map(int,input().split()))
ans[0][0]=lst[0][0]
ans[0][1]=lst[0][1]
ans[0][2]=lst[0][2]
if N>1 :
for i in range(1,N):
ans[i][0]=max(ans[i-1][1],ans[i-1][2])+lst[i][0]
ans[i][1]=max(ans[i-1][0],ans[i-1][2])+lst[i][1]
ans[i][2]=max(ans[i-1][1],ans[i-1][0])+lst[i][2]
print(max(ans[N-1]))
|
p03095 | s458257804 | Accepted | import collections
n = int(input())
a = input()
ans = 1
mod = 10**9+7
a = collections.Counter(a)
for v in a.values():
ans *= (v+1) % mod
print((ans-1) % mod)
|
p02629 | s380678729 | Accepted | from collections import deque
def main():
N = int(input())
l = deque()
mozi = list("abcdefghijklmnopqrstuvwxyz")
a, b = divmod(N, 26)
N -= 1
while True:
a, b = divmod(N, 26)
l.appendleft(mozi[b])
N = a
N -= 1
if a == 0:
break
print("".join(l))
main() |
p03548 | s655786124 | Accepted | x,y,z = map(int,input().split())
a = x-z
b = a//(y+z)
print(b) |
p02993 | s304914794 | Accepted | i=list(input())
if(i[0]==i[1] or i[1]==i[2] or i[2]==i[3]):
print("Bad")
else:
print("Good") |
p03657 | s876510029 | 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') |
p02793 | s037964308 | Wrong Answer | import numpy as np
from functools import reduce
def gcd1(m, n):
r = m % n
return gcd1(n, r) if r else n
def lcm1(m, n):
return m//gcd1(m, n)*n
def lcm(numbers):
return reduce(lcm1, numbers, 1)
MOD = 10**9+7
n = int(input())
a = np.array(list(map(int, input().split())))
l = lcm(a)
ans = 0
for x in a:
ans = (ans + l//x)%MOD
print(ans) |
p03075 | s659895764 | Wrong Answer | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
A =[]
A.append(int(input()))
A.append(int(input()))
A.append(int(input()))
A.append(int(input()))
A.append(int(input()))
k = int(input())
for i in range(4):
if A[i+1] -A[i] >k:
print(":(")
exit( )
print("Yay!")
if __name__ == "__main__":
main()
|
p02714 | s744896000 | Accepted | import collections
n = int(input())
s=input()
l=list(collections.Counter(s).values())
if len(l) == 3:
ans=l[0]*l[1]*l[2]
for i in range(n):
for j in range(i+1,n):
k = 2*j-i
if n <= k:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans-=1
print(ans)
else:
print(0)
|
p02909 | s156350490 | Accepted | s=input()
w=["Sunny","Cloudy","Rainy","Sunny"]
print(w[w.index(s)+1]) |
p03910 | s264077402 | Wrong Answer | n=int(input())
from itertools import accumulate
a=[0]*(n+1)
for i in range(n+1):
a[i]=i
ac=list(accumulate(a))
for i in range(n+1):
if ac[i]+a[i+1]>=n:
print(a[i+1])
exit()
|
p02897 | s541934315 | Wrong Answer | #A
n = int(input())
if n == 1:
print(float(1))
elif n % 2 != 0:
print(float(3/5))
else:
print(float(1/2)) |
p03548 | s959004902 | Accepted | x,y,z=map(int,input().split())
n=0
while True:
if n*y+(n+1)*z>x:
print(n-1)
exit()
n+=1 |
p02946 | s428982149 | Accepted | K, X = map(int, input().split())
ans = []
for i in range(-K+1,K) :
ans.append(str(X+i))
print(" ".join(ans))
|
p03607 | s719900681 | Wrong Answer | n = int(input())
a = []
for i in range(n):
s = int(input())
a.append(s)
a.sort()
i = 0
cnt = 0
while i < n:
j = i+1
chk = 0
if j >= n:
cnt += 1
break
while a[i] == a[j]:
chk += 1
j += 1
if j >= n:
break
if chk%2 == 1:
cnt += 1
i = j
print(cnt) |
p02642 | s476928460 | Accepted | import collections
import heapq
import math
import random
import sys
input = sys.stdin.readline
sys.setrecursionlimit(500005)
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
rs = lambda: input().rstrip()
n = ri()
a = rl()
N = 1000000
f = [0] * (N + 10)
for v in a:
f[v] += 1
for i in range(N, 0, -1):
if f[i] == 0:
continue
j = i * 2
while j <= N:
f[j] += f[i]
j += i
cnt = sum(f[i] == 1 for i in a)
print(cnt)
|
p02729 | s550278074 | Accepted | n, m = map(int, input().split())
a = n * (n - 1) // 2
b = m * (m - 1) // 2
print(a + b)
|
p03767 | s229992753 | Wrong Answer | N = int(input())
power_list = list(map(int, input().split()))
print(sum(sorted(power_list)[N:2*N])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.