problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03767
|
s175946717
|
Accepted
|
n = int(input())
aList = list(map(int, input().split()))
aList.sort()
aList = aList[n:]
sums = 0
for i in range(2 * n):
if i % 2 == 0:
sums += aList[i]
print(sums)
|
p03086
|
s646888705
|
Accepted
|
# -*- coding:utf-8 -*-
import re
S = input()
S_sp = re.split("[^ACGT]",S)
ans = 0
for moji in S_sp:
if len(moji) > ans:
ans = len(moji)
print(ans)
|
p03657
|
s625824085
|
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")
|
p03417
|
s840231664
|
Wrong Answer
|
n,m = map(int,input().split())
if (n == 2 and m != 1) or (m == 2 and n != 1):
print(0)
elif n ==1 and m != 1:
print(m-2)
elif m == 1 and n != 1:
print(n-2)
elif n == 1 and m == 1:
print(1)
else:
print((n+m-2)*2)
|
p02642
|
s296930681
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
A.sort()
MAX = A[-1]+1
num_tmp = [0]*MAX
for a in A:
num_tmp[a] += 1
if num_tmp[a] == 1:
for i in range(2*a,MAX,a):
num_tmp[i] = 2
print(num_tmp.count(1))
|
p03910
|
s062776358
|
Accepted
|
n=int(input())
i=1
num=0
suml=[0]
while num<=10**7+1000:
num+=i
suml.append(num)
i+=1
j=1
while n>suml[j]:
j+=1
k=suml[j]-n
for ii in range(1,j+1):
if ii!=k:
print(ii)
|
p02923
|
s288496329
|
Accepted
|
n = int(input())
h = list(map(int,input().split()))
ans = 0
tmp = 0
for i in range(1,n):
if h[i] <= h[i - 1]:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
ans = max(ans,tmp)
print(ans)
|
p03146
|
s185548580
|
Accepted
|
a=[int(input())]
cnt=0
flag=True
while flag:
cnt+=1
if a[cnt-1]%2:
a.append(3*a[cnt-1]+1)
else:
a.append(a[cnt-1]//2)
for i in range(cnt):
if a[i]==a[cnt]:flag=False
print(cnt+1)
|
p02553
|
s407732311
|
Accepted
|
a,b,c,d = map(int, input().split())
array = []
array.append(a*c)
array.append(b*d)
array.append(a*d)
array.append(b*c)
if (a <= 0 and b >= 0) or (c <= 0 and d >= 0):
array.append(0)
print(max(array))
|
p02947
|
s025333785
|
Accepted
|
import sys
from collections import defaultdict
n, *s = sys.stdin.read().split()
d = defaultdict(int)
ans = 0
for si in s:
d[''.join(sorted(si))] += 1
for x in d.values():
ans += x * (x - 1) // 2
print(ans)
|
p02700
|
s250121660
|
Wrong Answer
|
a,b,c,d=map(int,input().split())
x = a/d
y = c/b
if 1 <= x and 1 <= y:
print('Yes')
else:
print('Yes' if x <= y else 'No')
|
p03274
|
s695222881
|
Accepted
|
n,k = map(int,input().split())
l = list(map(int,input().split()))
m = 10**9
for i in range(n-k+1):
a = l[i]
b = l[i+k-1]
m = min(m,b-a+min(abs(a),abs(b)))
print(m)
|
p02612
|
s653298368
|
Accepted
|
n=int(input())
if n%1000==0:
print(0)
else:
print(1000-n%1000)
|
p02848
|
s328322577
|
Accepted
|
n = int(input())
s = input()
alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
ans = ""
for i in range(len(s)):
ans+= alphabet[(alphabet.find(s[i])+n)%26]
print(ans)
|
p02570
|
s571396058
|
Accepted
|
def main():
d, t, s = map(int, input().split())
if d/s <= t:
return "Yes"
else:
return "No"
if __name__ == "__main__":
print(main())
|
p03693
|
s899093597
|
Accepted
|
r,g,b = map(int,input().split())
print("YES" if (10*g+b)%4==0 else "NO" )
|
p02836
|
s239876612
|
Accepted
|
from sys import stdin
S = list(input())
ans = 0
for i in range(len(S)//2):
if S[i] != S[-i-1]:
ans += 1
print(ans)
|
p02693
|
s589641566
|
Accepted
|
k=int(input())
a,b=map(int,input().split())
c=b//k
if a<=k*c:
print("OK")
else:
print("NG")
|
p03456
|
s143259531
|
Wrong Answer
|
a, b = input().split()
c = int(a+b)
for i in range(3333):
if c == i**2:
print("YES")
exit()
print("NO")
|
p03680
|
s685226287
|
Accepted
|
n = int(input())
A = []
bool = [True] * n
for i in range(n):
a = int(input())
a -= 1
A.append(a)
j = A[0]
cnt = 1
for i in range(n):
if j == 1:
print(cnt)
exit()
if bool[A[j]] == True:
bool[A[j]] = False
j = A[j]
cnt += 1
else :
print(-1)
exit()
|
p03359
|
s996984306
|
Wrong Answer
|
a,b = map(int,input().split())
print(min(a,b))
|
p02700
|
s992366029
|
Accepted
|
a, b, c, d = (int(x) for x in input().split())
while 1:
c -= b
if c <= 0:
print('Yes')
exit()
a -= d
if a <= 0:
print('No')
exit()
|
p03673
|
s424823668
|
Wrong Answer
|
n=int(input())
a=list(map(int,input().split()))
cnt=1
if n==1:
print(*a)
exit()
from collections import deque
ans=deque(str(a[0]))
for i in range(1,n):
cnt+=1
if cnt%2==0:
ans.appendleft(str(a[i]))
else:
ans.append(str(a[i]))
if cnt%2==0:
print(" ".join(list(ans)))
else:
print(" ".join(reversed(list(ans))))
|
p02641
|
s810525495
|
Wrong Answer
|
def main():
x,y = list(map(int, input().split()))
if y == 0:
print(x)
exit()
nums = list(map(int, input().split()))
ans = 101
for i in range(1, 101):
if i not in nums:
ans = ans if abs(ans-x) <= abs(i-x) else i
print(ans)
if __name__ == '__main__':
main()
|
p02993
|
s431246756
|
Accepted
|
s=input()
for i in range(3):
if s[i]==s[i+1]:
print("Bad")
exit()
print("Good")
|
p02659
|
s314338464
|
Wrong Answer
|
import math
a, b = input().split()
c=int(a)
d=float(b)
print(math.floor(c*d))
|
p02779
|
s678358951
|
Accepted
|
N = int( input() )
A = [int(x) for x in input().split()]
if( N == len( list(set(A)) ) ):
print( 'YES' )
else:
print( 'NO' )
|
p03285
|
s077233210
|
Wrong Answer
|
n = int(input())
if n < 4:
print("No")
elif (n%4==0)|(n%7==0)|((n-4)%7==0)|((n-7)%4==0):
print("Yes")
else:
print("No")
|
p03103
|
s722366342
|
Wrong Answer
|
N,M = map(int,input().split())
A = []
B = []
count = M
ans = 0
for i in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
C = sorted(A)
for i in range(N):
min_a = C[0]
min_index = A.index(min_a)
min_B = B[min_index]
if count <= 0:
break
if min_B <= count:
ans += min_B*min_a
count -= min_B
else:
ans += min_a*count
count = 0
C.pop(0)
print(ans)
|
p03665
|
s250947795
|
Accepted
|
from collections import Counter
from functools import reduce
from operator import mul
def ncr(n, r):
r = min(r, n - r)
numer = reduce(mul, range(n, n - r, -1), 1)
denom = reduce(mul, range(1, r + 1), 1)
return numer // denom
N, P = list(map(int, input().split()))
A = Counter(list(map(lambda x: int(x) % 2, input().split())))
ans = 2 ** A[0]
if P:
print(ans * sum(ncr(A[1], i) for i in range(1, A[1] + 1, 2)))
else:
print(ans * sum(ncr(A[1], i) for i in range(0, A[1] + 1, 2)))
|
p03779
|
s735569509
|
Accepted
|
x = int(input())
t = 0
while(True):
if (t*(t+1)) / 2 >= x:
break
else:
t += 1
print(t)
|
p03387
|
s206227261
|
Accepted
|
a,b,c=map(int,input().split())
l=[a,b,c]
l.sort()
cnt=l[2]-l[1]
sa=l[2]-(l[0]+cnt)
cnt+=sa//2
if sa%2!=0:
cnt+=2
print(cnt)
|
p03986
|
s257225308
|
Wrong Answer
|
X=list(map(str,input()))
t=0
s=0
i=0
h=len(X)//2
#print(h)
while t!=h:
if X[i]=="T":
t=t+1
i=i+1
#print("t",t)
else:
s=s+1
i=i+1
#print("s",s)
print(len(X)-s*2)
|
p02688
|
s020983006
|
Accepted
|
def main():
N, K = input().split()
N = int(N)
K = int(K)
s = set()
for k in range(K):
d = int(input())
A = input().split()
for i in range(d):
s.add(A[i])
print(N - len(s))
if __name__ == "__main__":
main()
|
p03633
|
s820709445
|
Wrong Answer
|
from fractions import gcd
n = int(input())
def lcm_base(x,y):
return x*y/gcd(x,y)
ans =1
for i in range(n):
a = int(input())
ans = lcm_base(ans,a)
print(int(ans))
|
p02675
|
s770017906
|
Wrong Answer
|
N = input("How many books?\n")
N = int(N)
N1= N % 10
num = {2:"hon",4:"hon",5:"hon",7:"hon",9:"hon",\
0:"pon",1:"pon",6:"pon",8:"pon",\
3:"bon"}
if N in num:
val = num[N]
print(val)
else:
print("エラー")
|
p02681
|
s717311777
|
Accepted
|
s=input()
t=input()
print('Yes' if s==t[:-1] else 'No')
|
p03994
|
s412261464
|
Wrong Answer
|
s = list(input())
n = len(s)
k = int(input())
t = [ord(s[i]) - 97 for i in range(n)]
for i in range(n):
if k == 0:
break
x = 26 - t[i]
if 0 < x % 26 <= k:
k -= x
s[i] = "a"
if k > 0:
s[-1] = chr((k + t[-1]) % 26 + 97)
print("".join(s))
|
p03385
|
s694413832
|
Wrong Answer
|
li = list(input())
if li[0] != li[1] and li[1] != li[2] and li[2] != li[0]:
print('Yes')
else:
print('Yes')
|
p02861
|
s265148667
|
Wrong Answer
|
from itertools import permutations
from math import sqrt, pow, factorial
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
sum = 0
def calc(a, b):
[x1, y1] = a
[x2, y2] = b
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2))
for i in permutations(range(n)):
distance = 0
for j in range(1, n):
distance = calc(xy[i[j]], xy[i[j-1]])
sum += distance
print(sum / factorial(n))
|
p03672
|
s891733355
|
Accepted
|
def main():
S = list(input())
for i in range(1, len(S)-1):
sub_str = S[:len(S)-i]
if len(sub_str) % 2 == 1:
continue
elif sub_str[:int(len(sub_str)/2)] == sub_str[int(len(sub_str)/2):]:
print(len(sub_str))
break
if __name__ == '__main__':
main()
|
p03804
|
s272412519
|
Wrong Answer
|
N,M=map(int,input().split())
A=[]
B=[]
for i in range(N):
A.append(input())
for i in range(M):
B.append(input())
for i in range(N-M+1):
for j in range(N-M+1):
f=True
for k in range(M):
if A[i+k][i:M+i]==B[k]:continue
else:
f=False
break
if f:
print("Yes")
exit()
print("No")
|
p02600
|
s632966073
|
Accepted
|
x = int(input())
if x <= 599:
print(8)
elif x <= 799:
print(7)
elif x <= 999:
print(6)
elif x <= 1199:
print(5)
elif x <= 1399:
print(4)
elif x <= 1599:
print(3)
elif x <= 1799:
print(2)
elif x <= 1999:
print(1)
|
p02601
|
s903757607
|
Wrong Answer
|
A, B, C = map(int, input().split())
K = int(input())
for _ in range(K):
if A > B:
B *= 2
elif B > C:
C *= 2
else:
A *= 2
if A < B < C:
print('Yes')
else:
print('No')
|
p02843
|
s735820126
|
Wrong Answer
|
x = int(input())
n = x//100
x -= n*100
if 5*n >= x:
print("Yes")
else:
print("No")
|
p03042
|
s009817186
|
Accepted
|
S = input()
f = int(S[:2])
s = int(S[2:])
if 1 <= f <= 12 and 1 <= s <= 12:
print("AMBIGUOUS")
elif 1 <= f <= 12:
print("MMYY")
elif 1 <= s <= 12:
print("YYMM")
else:
print("NA")
|
p02779
|
s041776672
|
Accepted
|
n=int(input())
l1=list(map(int,input().split()))
if(len(l1)==len(set(l1))):
print("YES")
else:
print("NO")
|
p02952
|
s050722007
|
Accepted
|
N=int(input())
ans=0
for i in range(1,N+1):
if len(str(i))%2!=0:
ans+=1
print(ans)
|
p03555
|
s810357007
|
Accepted
|
c1=input()
c2=input()
if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0]:
print("YES")
else:
print("NO")
|
p03284
|
s582065468
|
Accepted
|
n, k = map(int, input().split())
if n % k:
print(1)
else:
print(0)
|
p03804
|
s568387868
|
Wrong Answer
|
a_lines = []
b_lines = []
N, M = tuple(map(int, input().split()))
for _ in range(N):
a_lines.append(input())
for _ in range(M):
b_lines.append(input())
a_idx = 0
final_ok = False
while a_idx + len(b_lines) <= len(a_lines)-1:
ok = True
for b_line in b_lines:
if b_line not in a_lines[a_idx]:
ok = False
break
if ok:
final_ok = True
break
a_idx += 1
if final_ok:
print('Yes')
else:
print('No')
|
p02582
|
s568566117
|
Accepted
|
s = input().split('S')
ans = 0
for i in s:
if len(i) > ans:
ans = len(i)
print(ans)
|
p03592
|
s920381545
|
Accepted
|
def resolve():
'''
code here
'''
N, M, K = [int(item) for item in input().split()]
is_found = False
for i in range(N+1):
for j in range(M+1):
if i*M + j*N -2*j*i == K:
is_found = True
break
print('Yes') if is_found else print('No')
if __name__ == "__main__":
resolve()
|
p02783
|
s513582369
|
Accepted
|
H,A = map(int, input().split())
t = 0
if H <= A:
# print(str(t) + 'の攻撃で、〇〇は倒れた')
print(1)
else:
while H > 0:
H -= A
t += 1
# print('◆◆の攻撃' + str(A) + 'のダメージ' + '、〇〇の残り体力' + str(H))
else:
# print(str(t) + '回の攻撃で、〇〇は倒れた')
print(t)
|
p02881
|
s178684802
|
Accepted
|
import math
n = int(input())
t = int(math.sqrt(n))
ans = 0
for i in reversed(range(t+1)):
if n % i == 0:
ans = n//i+i
break
print(ans-2)
|
p02953
|
s793431261
|
Accepted
|
N = int(input())
H = list(map(int, input().split()))
max_h = H[0]
flag = 0
for i in range(1, N):
max_h = max(max_h, H[i])
if max_h - H[i] > 1:
flag += 1
if flag:
print('No')
else:
print('Yes')
|
p02862
|
s774808690
|
Accepted
|
def com(n,r,m):
f=[1,1]
for i in range(2,n+1):
f.append(f[i-1]*i%m)
return f[n]*pow(f[r]*f[n-r]%m,m-2,m)%m
mod=10**9+7
x,y=map(int,input().split())
z=(x+y)//3
if (x+y)%3 or abs(x-y)>z:
ans=0
else:
ans=com(z,x-z,mod)
print(ans)
|
p03386
|
s863193011
|
Accepted
|
a, b, k = map(int, input().split())
upper = min(a + k, b)
bottom = max(b - k + 1, upper)
for i in range(a, upper):
print(i)
for j in range(bottom, b + 1):
print(j)
|
p04044
|
s238246335
|
Accepted
|
n,l=map(int,input().split());print(*sorted([input() for _ in range(n)]),sep='')
|
p04031
|
s547268198
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
def dist(x):
ret = 0
for i in A:
ret+=(x-i)**2
return ret
ans = dist(100)
for X in range(-100,100):
ans=min(ans,dist(X))
print(ans)
|
p02706
|
s697336473
|
Wrong Answer
|
n,m = map(int, input().split())
a = map(int, input().split())
print(n-sum(a))
-1 if n < sum(a) else n-sum(a)
|
p02814
|
s481667301
|
Accepted
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
def func(n):
ret=0
n=n/2
while n.is_integer():
ret+=1
n=n/2
return ret
b=func(a[0])
for i in range(1,n):
if b==func(a[i]):
continue
else:
print(0)
exit(0)
from fractions import gcd
lcmn=a[0]//2
for i in range(1,n):
lcmn=(lcmn*a[i]//2)//gcd(lcmn,a[i]//2)
print((1+m//lcmn)//2)
|
p02717
|
s590315023
|
Wrong Answer
|
X, Y, Z = map(int, input().split())
print('{} {} {}'.format(Y, Z, X))
|
p02694
|
s242851714
|
Accepted
|
X = int(input())
n = 100
A = 100
i = 0
while n < X:
n = A*1.01
A = int(n)
i += 1
if A >= X:
print(i)
break
|
p03105
|
s154264935
|
Accepted
|
A, B, C = map(int, input().split(' '))
print(min(C, B // A))
|
p03745
|
s988244550
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
counter = 1 ###グループ数
sign = 0 ###増減、-1,0,1、0はグループの初回、または初回以降増減が見られないときのみ
for x in range (1,N):
if A[x]>A[x-1] and (sign==0 or sign==1):
sign = 1
elif A[x]>A[x-1] and (sign==-1):
counter += 1
sign = 0
elif A[x]<A[x-1] and (sign==0 or sign==-1):
sign = -1
elif A[x]<A[x-1] and (sign==1):
counter += 1
sign = 0
print(counter)
|
p02631
|
s839983926
|
Accepted
|
n = int(input())
A = list(map(int, input().split()))
X = A[0]
for a in A[1:]:
X = X ^ a
for i in range(n):
A[i] = str(X ^ A[i])
print(" ".join(A))
|
p03835
|
s707355894
|
Accepted
|
k, s = map(int, input().split())
ans = 0
for x in range(k+1):
if x > s:
break
else:
for y in range(k+1):
if x+y > s:
break
elif s - x - y <= k:
ans += 1
print(ans)
|
p02729
|
s083789786
|
Accepted
|
n,m = map(int, input().split())
print((n*(n-1) + m*(m-1)) // 2)
|
p02618
|
s489431479
|
Accepted
|
import random
N = int(input())
for i in range(N):
print(random.randint(1, 26))
|
p02546
|
s765333072
|
Accepted
|
s=input()
if s[len(s)-1]=="s":
s+="es"
else:
s+="s"
print(s)
|
p03438
|
s646907622
|
Wrong Answer
|
N = int(input())
a= list(map(int,input().split()))
b= list(map(int,input().split()))
a.sort()
b.sort()
#print(a)
#print(b)
if sum(a)>sum(b):
print("No")
else:
kachi = [a[i]-b[i] if(a[i]>b[i]) else 0 for i in range(N)]
make = [b[i]-a[i] if(b[i]>a[i]) else 0 for i in range(N)]
#print("kachi",kachi)
#print("make",make)
#print(sum(a))
#print(sum(b))
if sum(kachi)>0:
print("No")
else:
print("Yes")
|
p02596
|
s221470450
|
Accepted
|
K = int(input())
cur = 7
for n in range(K):
if cur % K != 0:
cur = (cur * 10 + 7) % K
else:
print(n + 1)
break
else:
print(-1)
|
p02939
|
s709188540
|
Accepted
|
S = input()
ans = 1
tmp = S[0]
flg = False
for i in range(1,len(S)):
if flg:
tmp += S[i]
ans += 1
flg = False
continue
if S[i] != tmp:
tmp = S[i]
ans += 1
else:
flg = True
print(ans)
|
p02765
|
s999630595
|
Accepted
|
N, R = map( int, input().split() )
if N >= 10:
print( R )
else:
print( R + 100 * ( 10 - N ) )
|
p03555
|
s757958564
|
Accepted
|
S0 = input()
S1 = input()
ans = "YES"
for i in range(3):
if S0[i] != S1[2-i]:
ans ="NO"
break
print(ans)
|
p03827
|
s463214250
|
Accepted
|
n = int(input())
s = input()
x = 0
result = x
for c in s:
if c == "I":
x += 1
else:
x -= 1
result = max(result, x)
print(result)
|
p03644
|
s166914282
|
Wrong Answer
|
N=int(input())
for i in range(7):
k= 2**i
if k > N:
break
print(k//2)
|
p02951
|
s216427164
|
Wrong Answer
|
a, b, c = map(int, input().split())
ans = a - b
ans = c - ans
print(ans)
|
p02556
|
s843495880
|
Wrong Answer
|
n = int(input())
max_x = max_y = 0
min_x = min_y = 10**9
for i in range(n):
X, Y = map(int, input().split())
x = X + Y
y = X - Y
max_x = max(max_x, x)
max_y = max(max_y, y)
min_x = min(min_x, x)
min_y = min(min_y, y)
print(max(max_x - min_x, max_y - min_y))
|
p03455
|
s570708265
|
Accepted
|
a, b = map(int, input().split())
if a*b % 2 == 0:
out = "Even"
else:
out = "Odd"
print("{}".format(out))
|
p03071
|
s320987805
|
Accepted
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b = map(int, input().split())
r = 0
if a < b:
r = b
b = b - 1
else:
r = a
a = a - 1
r = r + max(a, b)
print(r)
|
p03011
|
s332480774
|
Accepted
|
print(sum(sorted(map(int, input().split()))[:2]))
|
p02924
|
s119719502
|
Wrong Answer
|
N=int(input())
print(int(N*(N-1)/2))
|
p02916
|
s785609491
|
Accepted
|
N = input()
A = [int(t)-1 for t in raw_input().split()]
B = map(int, raw_input().split())
C = map(int, raw_input().split())
ans = 0
for i in range(N):
ans += B[A[i]]
if i>0 and A[i]==A[i-1]+1:
ans += C[A[i-1]]
print ans
|
p03838
|
s453493197
|
Wrong Answer
|
def main():
x, y = list(map(int, input().split()))
ans = abs(y) - abs(x)
if x >= 0 and y >= 0 or x < 0 and y < 0:
if x > y:
print(x - y + 2)
else:
print(y - x)
elif x < 0 and y >= 0:
print(min(y - x, abs(y - abs(x)) + 1))
elif x >= 0 and y < 0:
print(min(x - y, abs(x - abs(y)) + 1))
if __name__ == '__main__':
main()
|
p02583
|
s157937507
|
Wrong Answer
|
import sys
input = sys.stdin.readline
import itertools as it
def li():
return [int(x) for x in input().split()]
N = int(input())
L = li()
# 組み合わせ列挙
c = it.combinations(L, 3)
c_list = list(c)
cnt = 0
for l in c_list:
unique_l = len(set(l))
if unique_l != 3:
continue
sum_l = l[0] + l[1] + l[2]
max_l = max(l)
sum_lest = sum_l - max_l
if sum_lest > max_l:
print(l)
cnt += 1
print(cnt)
|
p02801
|
s889353528
|
Accepted
|
import string
s = input()
lis = string.ascii_lowercase
for i in range(len(lis)):
if lis[i] == s:
print(lis[i+1])
|
p03137
|
s700780141
|
Wrong Answer
|
n,m = map(int, input().split())
x = sorted(list(map(int, input().split())))
nums = [0]*(m-1)
for i in range(m-1): nums[i] = x[i+1] - x[i]
nums = sorted(nums)
print(sum(nums[:m-1-(n-1)]))
|
p02657
|
s206386045
|
Wrong Answer
|
ab = input()
|
p03607
|
s290843563
|
Accepted
|
n=int(input())
dic={}
for i in range(n):
v=int(input())
dic[v]=dic.get(v,0)+1
count=0
for k in dic.keys():
if dic[k]%2!=0:
count+=1
print(count)
|
p03419
|
s054734684
|
Accepted
|
n, m = map(int, input().split())
print(abs((n-2)*(m-2)))
|
p03556
|
s400459561
|
Accepted
|
print(int(int(input())**0.5)**2)
|
p02819
|
s135584294
|
Accepted
|
x=int(input())
prime=0
tmp=x
while prime==0:
flag=True
for i in range(2,int(tmp*0.5)+1):
if tmp%i==0:
flag=False
break
if flag:
prime=tmp
tmp+=1
print(prime)
|
p02953
|
s131198369
|
Accepted
|
N = int(input())
H = list(map(int, input().split()))
for i in range(0, N-1):
if H[N-i-2]-1 == H[N-i-1]:
H[N-i-2] = H[N-i-2]-1
elif H[N-i-2]-1 > H[N-i-1]:
print ("No")
break
else:
print ("Yes")
|
p03456
|
s805044194
|
Wrong Answer
|
if __name__ == '__main__':
b, c = map(int, input().split())
a = int(str(b)+str(c))
for i in range(2,101):
if a < i* i:
print("No")
break
elif a == (i * i) :
print("Yes")
break
|
p03624
|
s505306304
|
Wrong Answer
|
s = list(input())
s.sort()
a = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'r', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
for i in a:
if i not in s:
print(i)
exit()
print('None')
|
p02699
|
s264941587
|
Wrong Answer
|
s, w = map(int, input().split())
if w > s:
print("unsafe")
else:
print("safe")
|
p02664
|
s346145356
|
Accepted
|
T = input()
print(T.replace('?', 'D'))
|
p02691
|
s720223268
|
Accepted
|
import sys
from collections import Counter
N = int(sys.stdin.readline().rstrip())
As = list(map(int, sys.stdin.readline().rstrip().split()))
ll = [0] * N
lr = [0] * N
for i, a in enumerate(As):
ll[i] = i + a
lr[i] = i - a
cl = Counter(ll)
cr = Counter(lr)
ans = 0
for l in cl.keys():
ans += cl[l] * cr[l]
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.