problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03696 | s237440008 | Accepted | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
s=readline().strip()
left_left=0
need_left=0
for i in range(n):
if s[i]=="(":
left_left+=1
else:
if left_left>0:
left_left-=1
else:
need_left+=1
print("("*need_left+s+")"*left_left)
if __name__=="__main__":
main() |
p02608 | s698902723 | Accepted | L = 10**2+10
n = int(input())
ans = [0] * n
for i in range(1, L):
for j in range(1, L):
for k in range(1, L):
x = i**2+j**2+k**2+i*j+j*k+i*k
if x <= n:
ans[x-1] += 1
print(*ans, sep="\n")
|
p02959 | s143478420 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
kill = 0
for i in range(n):
for j in range(i,i+2):
if b[i] <= a[j]:
kill += b[i]
a[j] -= b[i]
continue
else:
kill += a[j]
b[i] -= a[j]
print(kill) |
p02995 | s113787786 | Wrong Answer | import math
def calc(n, c, d):
return n-(math.floor(n / c) +
math.floor(n / d) - math.floor(n / (c * d / math.gcd(c, d))))
def calc2(n, m):
return n-(math.floor(n / m))
def main():
a, b, c, d = map(int, input().split())
print(calc(b, c, d)-calc(a-1, c, d))
if __name__ == "__main__":
main()
|
p04030 | s369796860 | Accepted | s=input()
ans=""
for i in s:
if ans =="" and i=="B":
continue
elif ans != "" and i == "B":
ans = ans[:-1]
else:
ans += i
print(ans) |
p02946 | s369639370 | Wrong Answer | k,x = map(int,input().split())
print(list(range(x-k+1,x+k)))
|
p02572 | s244892649 | Accepted | N=int(input())
A=list(map(int, input().split()))
MOD=10**9+7
tmp1 = 0
tmp2 = 0
for a in A:
tmp1 += a
tmp2 += (a**2)
ans = (tmp1**2 - tmp2)//2
print(ans%MOD) |
p02712 | s909201730 | Accepted | n=int(input())
a=[0]*(n+1)
for i in range(n+1):
if i%3==0 or i%5==0:
a[i]=0
else:
a[i]=i
print(sum(a)) |
p02600 | s910294832 | Accepted | x=int(input())
if 400<=x<600:ans=8
if 600<=x<800:ans=7
if 800<=x<1000:ans=6
if 1000<=x<1200:ans=5
if 1200<=x<1400:ans=4
if 1400<=x<1600:ans=3
if 1600<=x<1800:ans=2
if 1800<=x<2000:ans=1
print(ans) |
p03657 | s115351364 | 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") |
p02554 | s705059284 | Wrong Answer | # -*- using:utf-8 -*-
def factorial_cor(n):
fact = 1
for integer in range(1, n + 1):
fact *= integer
return fact
if __name__ == "__main__":
MOD = 1000000007
N = int(input())
if N == 1:
print(0)
elif N == 2:
print(2)
else:
C = factorial_cor(N)
ten = 10 ** (N - 2) * C
ans = C % MOD
print(int(ans))
|
p02697 | s343283649 | Accepted | import sys
def main():
input = sys.stdin.buffer.readline
N, M = map(int, input().split())
skip = (N // 2) // 2 + 1 if N % 2 == 0 else None
count = 0
left, right = 0, N + 1
while count < M:
left += 1
if left == skip:
continue
right -= 1
print(left, right)
count += 1
if __name__ == '__main__':
main()
|
p02838 | s193227237 | Accepted | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
ans = 0
for i in range(60):
cou = 0
bit = 1 << i
for j in a:
if j & bit:
cou += 1
num1 = cou
num0 = n - num1
ans += ((num1*num0) * bit )%mod
print(ans%mod) |
p02995 | s739987064 | Wrong Answer | from fractions import gcd
a,b,c,d = map(int,input().split())
lcm = c*d / gcd(c,d)
x = lcm
div = 0
while a <= x <= b:
div += 1
x += lcm
cdiv = b//c - (a-1)//c
ddiv = b//d - (a-1)//d
print(b-a+1-cdiv-ddiv+div) |
p02663 | s525077127 | Wrong Answer | H1,M1,H2,M2,K = map(int,input().split())
if (M1 < M2):
H = H2 - H1 - 1
M = M1 - M2
else:
H = H2 - H1
M = M2 - M1
T = H * 60 + M
if T > K:
print(T - K)
else:
print("0") |
p02717 | s897533222 | Accepted | a, b, c = map(int, input().split())
a, b = b, a
a, c = c, a
print(a, b, c) |
p03672 | s082887133 | Wrong Answer | def main():
s = list(input())
if len(s) % 2 == 0:
del s[-2:]
else:
del s[-1]
half_len = len(s) // 2
for i in range(0, half_len, 2):
if s[:half_len-(i//2)] == s[half_len-(i//2):]:
break
else:
del s[-2:]
print(len(s))
if __name__ == '__main__':
main() |
p03761 | s751985247 | Accepted | from collections import Counter
n = int(input())
s = [None] * n
for i in range(n):
s[i] = Counter(input())
ans = ""
for c in "abcdefghijklmnopqrstuvwxyz":
cc = 50
for si in s:
cc = min(si.get(c, 0), cc)
ans += c * cc
print(ans) |
p02747 | s119949444 | Accepted | import re
given = input()
answer = re.sub(r'hi', "*", given)
if len(set(answer)) == 1 and answer[0] == "*":
print("Yes")
else:
print("No") |
p02952 | s762505556 | Accepted | N = int(input())
count = 0
for n in range(0, N+1):
if 1 <= n <= 9:
count = count + 1
if 100 <= n <= 999:
count = count + 1
if 10000 <= n <= 99999:
count = count + 1
print(count) |
p03785 | s801912222 | Accepted | n, c, k = map(int, input().split())
T = list(int(input()) for _ in range(n))
T.sort()
lmt = 0
flg = True
tmp_c = c
bus_cnt = 0
for i in range(len(T)-1):
if flg:
lmt = T[i] + k
flg = False
bus_cnt += 1
if tmp_c >= 0 or lmt >= T[i]:
tmp_c -= 1
if tmp_c <= 0 or lmt < T[i+1]:
flg = True
tmp_c = c
else:
if tmp_c <= 0 or lmt < T[-1]:
bus_cnt += 1
print(bus_cnt) |
p02831 | s924742524 | Accepted | import fractions
A, B = map(int, input().split())
def lcm(x,y):
return (x*y) // (fractions.gcd(x,y))
ans = lcm(A, B)
print(ans) |
p02795 | s590383010 | Wrong Answer | h = int(input())
w = int(input())
n = int(input())
a = max(h,w)
b = a
count = 0
if h*w == n:
print(h)
elif b >= n:
print(1)
else:
while b <= n:
b += a
count += 1
print(count) |
p02713 | s684344386 | Wrong Answer | import math
from functools import reduce
from itertools import *
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
K = int(input())
ans = 0
seq = [i for i in range(1,K+1)]
s = sum(seq)
seq = list(combinations_with_replacement(seq,3))
for a,b,c in seq:
if a == b and b == c:
continue
ans += gcd(a,b,c)
print(ans*3+s) |
p02664 | s142124683 | Wrong Answer | import sys
input = sys.stdin.readline
s=input()
s=[s[i] for i in range(len(s))]
s=s[:len(s)-1]
if s[0]=='?':
s[0]='D'
if s[-1]=='?':
s[-1]='D'
for i in range(len(s)-2):
if s[i+1:i+3]==['?','?']:
s[i+1]='P'
s[i+2]='D'
elif s[i]==s[i+2]=='D':
s[i+1]='P'
else:
s[i+1]='D'
print(''.join(s))
|
p03339 | s246836919 | Accepted | n = int(input())
s = input()
# full search
cnt = s.count('E')
ans = cnt
for i in range(n):
if s[i] == 'E':
cnt -= 1
if ans > cnt:
ans = cnt
else:
cnt += 1
print(ans) |
p03745 | s930864421 | Accepted | N = int(input())
A = [int(i) for i in input().split()]
count = 1
status = 0
for i in range(N-1):
if (A[i+1] - A[i]) == 0:
continue
elif (A[i+1] - A[i]) > 0:
if status == 0 or status == 1:
status = 1
continue
else:
count += 1
status = 0
elif (A[i+1] - A[i]) < 0:
if status == 0 or status == -1:
status = -1
continue
else:
count += 1
status = 0
print(count) |
p03000 | s097691125 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
for i in range(N-1):L[i+1]+=L[i]
count=1
for i in range(N):
if L[i]<=X:count+=1
print(count) |
p02729 | s472481350 | Wrong Answer | a,b = input().split()
a = int(a)
b = int(b)
A = (a*a-1)/2
B = (b*b-1)/2
if a <= 2 and b <= 2:
print(0)
elif a <=2 and b >= 1:
print(B)
elif a >= 1 and b <= 2:
print(A)
elif a>= 1 and b >=1:
print(A+B) |
p03478 | s053099834 | Wrong Answer | import numpy as np
N, A, B = map(int, input().split())
total = 0
for i in range(N+1):
a = i
lis =[]
while i >0:
lis.append(i%10)
i //=10
lis.reverse()
lis = np.array(lis)
SUM = np.sum(lis)
if SUM >=A and SUM <=B:
total += a |
p02819 | s321107471 | Accepted | import math
X = int(input())
def era(n):
O = [i + 2 for i in range(n-1)]
P = []
for i in range(int(math.sqrt(n))):
P.append(O[0])
O = [o for o in O if o % P[-1] != 0]
for o in O:
P.append(o)
return P
P = era(2*X)
for i in range(len(P)):
if X <= P[i]:
print(P[i])
break |
p02576 | s014124608 | Accepted | N,X,T = map(int, input().split())
if N%X==0:
ans = (N/X) * T
else:
ans = (N//X + 1) * T
print(int(ans)) |
p02861 | s438669038 | Accepted | from itertools import permutations
def dist(x,y):
return ((x[0]-y[0])**2+(x[1]-y[1])**2)**0.5
N = int(input())
X = [list(map(int,input().split())) for _ in range(N)]
cnt = 0
for z in permutations(range(N),N):
for i in range(1,N):
cnt += dist(X[z[i]],X[z[i-1]])
k = 1
for i in range(2,N+1):
k = k*i
print(cnt/k) |
p03479 | s802325633 | Accepted | x,y=map(int,input().split())
import bisect as bi
ans=1
for i in range(80):
if x*2<=y:
ans+=1
x*=2
print(ans) |
p02708 | s897825229 | Wrong Answer | n,k= list(map(int, input().split()))
mod=10**9+7
ans=0
for i in range(k,n+2):
min=(i-1)*i//2
max=((n+1)+(n-i+1))*i//2
ans+=max-min
print(ans % mod) |
p02627 | s797738256 | Accepted | string = input()
if string.isupper():
print('A')
else:
print('a')
|
p03760 | s327206144 | Accepted | O = list(input())
E = list(input())+['']
print(*[o+e for o,e in zip(O,E)], sep='') |
p03105 | s474702249 | Accepted | A, B, C= map(int, input().split())
print(min(B//A,C)) |
p02729 | s936402025 | Accepted | a = list(map(int,input().split()))
N = a[0]
M = a[1]
N_combi = N*(N-1)/2
M_combi = M*(M-1)/2
print(int(N_combi+M_combi)) |
p02959 | s295411249 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
cnt = 0
for i in range(n-1, -1, -1):
cnt += min(b[i], a[i]+a[i+1])
diff = b[i] - a[i+1]
if diff > 0:
a[i] = max(0, a[i]-diff)
print(cnt) |
p03285 | s072297495 | Wrong Answer | N = int(input())
flag = False
for i in range(N//4):
if (N-4*i) % 7 == 0:
flag = True
break
if flag:
print('Yes')
else:
print('No') |
p03059 | s539669592 | Accepted | A,B,T=map(int,input().split())
i=0
while A*i<=T:
i=i+1
print(B*(i-1)) |
p03815 | s891291156 | Accepted | x = int(input())
cnt = (x // 11)
x -= cnt*11
cnt *= 2
if x > 0:
if x > 6:
cnt += 2
else:
cnt += 1
print(cnt) |
p03767 | s527727421 | Accepted | N = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
c = 0
for i in range(N):
c += a[1 + i*2]
print(c)
|
p02711 | s121180572 | Wrong Answer | N = input()
if N[0] == '7' or N[1] == '7' or N[2] == '7':
print("yes")
else:
print("no")
|
p02570 | s863244129 | Wrong Answer | d,t,s=map(int,input().split())
if 1000//15>=s:
if 1000//15==s and 1000%15==0:
print('Yes')
else:
print('No')
else:
print('Yes') |
p03323 | s166161343 | Accepted | def main():
a,b = map(int, input().split())
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(")
if __name__ == '__main__':
main() |
p03495 | s545970835 | Accepted | n, k= map(int, input().split())
a = list(map(int, input().split()))
import collections
a = collections.Counter(a)
key = list(a.values())
#print(key)
key.sort()
#print(key)
ans = sum(key[:len(key)-k])
print(ans)
|
p03437 | s145627390 | Accepted | def main():
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
#inf = 10**17
#mod = 10**9 + 7
a,b = map(int, input().split())
if a%b == 0:
print(-1)
else:
print(a)
if __name__ == '__main__':
main() |
p03997 | s778237058 | Wrong Answer | # 入力
a = int(input())
b = int(input())
h = int(input())
# (a+b)*h/2
answer = (a + b) * h / 2
print(answer)
|
p02618 | s350841651 | Accepted | d = int(input())
c = list(map(int, input().split()))
for _ in range(d):
s = list(map(int, input().split()))
print(s.index(max(s)) + 1) |
p02729 | s786620391 | Accepted | import itertools
r = 2
N, M = map(int, input().split())
Nmath = len(list(itertools.combinations(range(N), r)))
Mmath = len(list(itertools.combinations(range(M), r)))
print(int(Nmath+Mmath)) |
p03221 | s768658634 | Accepted | from collections import defaultdict
from bisect import bisect
n,m=map(int,input().split())
l=[tuple(map(int,input().split())) for _ in range(m)]
a=defaultdict(list)
for x,y in sorted(l):
a[x]+=[y]
for x,y in l:
z=bisect(a[x],y)
print('%06d%06d'%(x,z)) |
p03262 | s530124813 | Wrong Answer | import fractions
from functools import reduce
n, x = map(int, input().split())
xx = list(map(int, input().split()))
xx.sort()
if n == 1:
ans = xx[0] - x
else:
dist = [xx[i + 1] - xx[i] for i in range(n - 1)]
ans = reduce(fractions.gcd, dist)
print(ans)
|
p03681 | s338279109 | Wrong Answer | #coding: utf-8
import math
import heapq
import bisect
import numpy as np
from collections import Counter, deque
#from scipy.misc import comb
MOD = 10**9+7
N,M = map(int, input().split())
if N < M: N,M = M,N
ans = 1
if N-M == 0:
for i in range(M):
ans *= i
ans % MOD
ans = (ans*ans)%MOD
elif N-M == 1:
for i in range(M):
ans *= i
ans %= MOD
ans = (ans*ans*2)%MOD
else: ans = 0
print(ans) |
p03241 | s207593806 | Wrong Answer | #!/usr/bin/env python3
n, m = list(map(int, input().split()))
ans = 1
num = int(m**0.5)+1
for i in range(1, num):
if m % i != 0:
continue
j = m//i
if i >= n:
ans = max(ans, j)
# if j >= n:
# ans = max(ans, i)
print(ans)
|
p02730 | s842796746 | Wrong Answer | st=input()
n=len(st)
if(n%2==0):
print("No")
exit(0)
if(st==st[::-1]):
s1=""
for i in range((n-1)//2+1):
s1+=st[i]
s2=""
for i in range((n+3)//2,n):
s2+=st[i]
if(s1==s1[::-1] and s2==s2[::-1]):
print("Yes")
else:
print("No")
else:
print("No") |
p02813 | s378944852 | Accepted | n = int(input())
p = list(input().split())
q = list(input().split())
l = list(range(1, n+1))
ll = []
def Count_Order(n, s):
if n == 0:
ll.append("".join(list(map(str, s))))
else:
for x in l:
if not x in s:
Count_Order(n-1, s+[x])
s = []
Count_Order(n, s)
print(abs(ll.index("".join(p)) - ll.index("".join(q)))) |
p02818 | s433108123 | Wrong Answer | A, B, K = map(int, input().split())
A_ = min(A, K)
print(A_, min(0, B-(K-A_))) |
p02689 | s392760749 | Accepted | N, M = [int(v) for v in input().split()]
H = [int(v) for v in input().split()]
is_good = [True] * N
for i in range(M):
A, B = [int(v) - 1 for v in input().split()]
if H[A] <= H[B]:
is_good[A] = False
if H[A] >= H[B]:
is_good[B] = False
print(sum(is_good)) |
p03852 | s207766522 | Wrong Answer | #!/usr/bin/env python3
def main():
c = input()
# i = list(map(int,input().split()))
# j = list(map(int,input().split()))
if c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'e':
print('vowel')
else:
print('consonant')
main()
|
p03293 | s897953725 | Accepted | s = input()
t = input()
for i in range(len(s)+5):
if s == t:
print("Yes")
break
s = s[-1] + s[:-1]
else:
print("No")
|
p02897 | s401620587 | Wrong Answer | print(1-(2/int(input()))) |
p03251 | s597620484 | Accepted | n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x.append(X)
y.append(Y)
x.sort()
y.sort()
if x[-1] >= y[0]:
print("War")
else:
print("No War") |
p03284 | s559736672 | Accepted | a,b=map(int, input().split())
if a%b==0:
print(0)
else:
print(1) |
p03150 | s728691915 | Accepted | def main():
S = input()
is_keyence = False
string = "keyence"
for i in range(len(string)):
if S.startswith(string[:i]) and S.endswith(string[i:]):
is_keyence = True
if is_keyence:
print("YES")
else:
print("NO")
if __name__ == "__main__":
main() |
p03377 | s440590389 | Wrong Answer | a, b, x = map(int,input().split())
if a+b > b:
print("YES")
else:
print("NO")
|
p02676 | s103082291 | Accepted | from sys import stdin
K = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
if len(S) <= K:
print(S)
else :
print(S[:K]+"...") |
p04012 | s089732679 | Wrong Answer | #美しい文字列 044_B
w=input()
count=0
ans='Yes'
for i in range(len(w)):
t=w[i]
for e in range(len(w)):
t==w[e]
count=count+1
if count%2==1:
ans='No'
else:
ans='Yes'
print(ans) |
p02688 | s045150902 | Accepted | N, K = map(int, input().split())
A = [None] * K
for i in range(K):
d = int(input())
A[i] = list(map(int, input().split()))
flat_list = [s for a in A for s in a]
set_a = set(flat_list)
ans = 0
for i in range(1, N + 1):
if not i in set_a:
ans += 1
print(ans)
|
p03730 | s411758527 | Wrong Answer | a,b,c=map(int,input().split())
x = any((a*i)%b==c for i in range(1,b+1))
print(x)
print("Yes" if x else "No") |
p02801 | s541847172 | Accepted | s=input()
print(chr(ord(s)+1)) |
p02951 | s108238847 | Wrong Answer | a, b, c = map(int, input().split(" "))
print((b + c) - a) |
p03817 | s230792249 | Wrong Answer | x = int(input())
if x<=6:
print(1);exit()
if x<=11:
print(2);exit()
ans=(x//11)*2
b = x-x//11*11
if b<=6:
ans+=1
else:
ans+=2
print(ans) |
p02622 | s341173713 | Wrong Answer | S='apple'
T='apple'
count=0;
for i in range(0,len(S)):
if (T[i]!=S[i]):
count+=1
print(count) |
p02681 | s248950366 | Wrong Answer | s=input()
t=input()
n=0
if(len(t)==len(s)+1):
for i in range(0,len(s)):
if(s[i]==t[i]):
n=n+1
if(n==len(s)):
print("Yes")
else:
print("Np")
|
p03262 | s329818055 | Wrong Answer | from fractions import gcd
N,X=map(int,input().split())
x=list(map(int,input().split()))
z=x+[X]
z.sort()
if N>1:
y=[0]*N
for i in range(N):
y[i] = z[i+1]-z[i]
ans=y[0]
for j in range(N):
ans = gcd(z[j],ans)
print(ans)
else:
print(abs(X-x[0])) |
p02618 | s807445846 | Wrong Answer | d = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(d)]
a = 0
S = 0
b = []
for j in range(d):
for k in range(26):
if S < s[j][k]:
S = s[j][k]
K = k
b.append(k)
print(*b,sep="\n") |
p03073 | s035014511 | Accepted | s = input()
n = s[::2].count('0') + s[1::2].count('1')
print(min(n, len(s) - n))
|
p02848 | s697769968 | Accepted | N = int(input())
S = list(input())
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"]
new_S = []
for i in range(len(S)):
s = alphabet.index(S[i])+N
if s >= 26 :
s -= 26
new_S.append(alphabet[s])
print("".join(new_S)) |
p03011 | s114309090 | Wrong Answer | print(sum(sorted(list(map(int,input().split()))[:2]))) |
p02578 | s926183361 | Wrong Answer | n = int(input())
inputs = list(map(int,input().split()))
As = []
sum = 0
step =0
for i in inputs:
As.append(int(i))
try:
for i in range(len(As)):
if As[i] < As[i + 1]:
step = As[i + 1] - As[i]
sum += step
except:
pass
print(sum) |
p02995 | s194147587 | Accepted | A, B, C, D = map(int, input().split())
def gcd(a, b):
if (b==0):
return a
else:
return gcd(b, a % b)
G = C * D // gcd(C, D)
ans_b = B - B//C - B//D + B//G
ans_a = A - 1 - (A-1)//C - (A-1)//D + (A-1)//G
print(ans_b - ans_a) |
p03211 | s684713061 | Wrong Answer | s=input()
ans=1000
for i in range(len(s)-3):
n=''
n+=s[i]
n+=s[i+1]
n+=s[i+2]
n=int(n)
ans=min(abs(n-753),ans)
print(ans) |
p03745 | s280554090 | Accepted | N = int(input())
A = list(map(int, input().split()))
p = 0
m = 0
cnt = 0
for i in range(N-1):
if(A[i] < A[i+1]):
p = 1
elif(A[i] == A[i+1]):
continue
else:
m = 1
if(p == m == 1):
cnt += 1
p = 0
m = 0
print(cnt+1) |
p02732 | s860528015 | Wrong Answer | import collections
from collections import defaultdict
n=int(input())
a=list(map(int,input().split()))
c=defaultdict(int)
for s in a:
c[s]+=1
print(c)
a1=list(set(a))
print(a1)
total=0
for j in range(len(a1)):
x=c[a[j]]
print(x)
total+=x*(x-1)/2
print('total=',total)
for i in range(n):
ans=total-c[a[i]]+1
print(int(ans)) |
p03013 | s873765991 | Wrong Answer | n,m = map(int,input().split())
dp = [1]*(n+1)
dp[1] = 2
mod = 10**9 + 7
for i in range(m):
a = int(input())
dp[a-1] = 0
if dp[0] == 0:
dp[1] =1
for i in range(1,n+1):
if dp[i] == 0:
continue
else:
if i == 1:
dp[i] = dp[i-1] +1
else:
dp[i] = (dp[i-1] + dp[i-2])%mod
#print(dp)
print(dp[n-1]) |
p02987 | s098128324 | Wrong Answer | S = str(input())
if (S[0]==S[1] and S[2]==S[3]) or (S[0]==S[2] and S[1]==S[3]) or (S[0]==S[3] and S[1]==S[2]):
print("Yes")
else:
print("No") |
p03545 | s634525828 | Wrong Answer | from sys import exit
def dfs(i,f,sum):
if i == n-1:
if sum ==7:
return print(f,"=7")
exit()
else:
dfs(i + 1, f + "+" + s[i + 1], sum+int(s[i+1]))
dfs(i + 1, f + "-" + s[i + 1], sum-int(s[i+1]))
s=input()
n=len(s)
dfs(0, s[0],int(s[0])) |
p03644 | s483568802 | Wrong Answer | n = int(input())
r = 1
while r < n:
r *= 2
print(int(r/2)) |
p02899 | s412899167 | Accepted | #!/usr/bin/env python3
import sys
input = sys.stdin.buffer.readline
N = int(input())
A = list(map(int,input().split()))
XY = list()
for i in range(N):
XY.append((A[i], i+1))
XY.sort()
Ans = list()
for x,y in XY:
Ans.append(y)
print(*Ans) |
p03331 | s492471267 | Accepted | n = input()
a = sum([int(n[i]) for i in range(len(n))])
if a==1:
print(10)
else:
print(a) |
p02633 | s751575761 | Accepted | X = int(input())
i = 0
Y = X
while Y % 360 != 0:
Y += X
i += 1
i += 1
print(i) |
p02786 | s537337096 | Accepted | import numpy as np
import math
H = int(input())
cnt = np.log2(H)
cnt = math.floor(cnt)
cnt = 2**(cnt + 1) - 1
print(cnt) |
p02583 | s564144318 | Accepted | N = int(input())
L = sorted(list(map(int, input().split())))
ans = 0
for i in range(N):
for j in range(i+1, N):
for k in range(j+1, N):
if L[i]==L[j] or L[j]==L[k]: continue
if L[i]+L[j]>L[k]: ans+=1
print(ans)
|
p02880 | s854350030 | Accepted | n = int(input())
for i in range(1, 10):
for j in range(1, 10):
if i*j == n:
print("Yes")
exit()
print("No")
|
p02744 | s441738258 | Wrong Answer |
n = int(input())
data = ["a"] * n
ans = ["".join(data)]
def print_str(ans, data, i):
if i == n:
return
while ord(data[i]) + 1 <= ord(data[i - 1]) + 1:
data[i] = chr(ord(data[i]) + 1)
ans.append("".join(data))
print_str(ans, data, i + 1)
print_str(ans, data, 1)
ans = sorted(set(ans))
for i in range(len(ans)):
print(ans[i]) |
p02594 | s351383000 | Wrong Answer | i = int(input())
if i <= 30:
print("Yes")
else:
print("No") |
p02766 | s839369508 | Wrong Answer | N, K = map(int, input().split())
t = 0
while(K**t < N):
#print(K**t)
t+=1
print(t) |
p03211 | s923546859 | Accepted | S = input()
N = len(S)
ans = float("inf")
for i in range(N-2):
ans = min(ans, abs(753 - int(S[i:i+3])))
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.