problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p04043 | s371144445 | Wrong Answer | a = []
a = input().split(' ')
if 5 in a:
a.remove(5)
if 7 in a:
a.remove(7)
if 5 in a:
print('YES')
else:
print('NO')
else:
print('NO')
else:
print('NO') |
p03073 | s653432864 | Accepted | s = input()
n = len(s)
a = "10" * (n // 2) + "1" * (n % 2)
b = "01" * (n // 2) + "0" * (n % 2)
print(min(bin(int(s,2) ^ int(a, 2)).count("1") , bin(int(s, 2) ^ int(b, 2)).count("1"))) |
p03761 | s695803088 | Wrong Answer | from collections import Counter
n=int(input())
s=[ input() for i in range(n)]
alf=list("abcdefghijklmnopqrstuvwxyz")
ans=dict()
for i in alf:
ans[i]=1000
for i in s:
sl=list(i)
sl=Counter(sl)
for j in alf:
if not sl[j]:
ans[j]=0
elif ans[j]>sl[j]:
ans[j]=sl[j]
s=""
for i in ans:
if ans[i]!=0:
s+=(i*ans[i])
print(s) |
p02618 | s296965837 | Wrong Answer | import sys
input=sys.stdin.readline
d=int(input())
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for _ in range(d)]
A=[sorted([[j,S[i][j]] for j in range(26)],key=lambda x:x[1],reverse=True) for i in range(d)]
DP=[0]*26
for i in range(d):
num,index=0,0
for j in range(26):
if A[i][j][1]-C[j]*(i-DP[j])>num:
num=A[i][j][1]-C[j]*(i-DP[j])
index=i
print(index) |
p02777 | s136082701 | Wrong Answer | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
import numpy as np
def main():
S,T = input().split()
A,B = MAP()
U = input()
if S == U:
print(A-1,B)
else:
print(A,B-1)
return
if __name__ == '__main__':
main()
|
p03127 | s528782066 | Wrong Answer | import fractions
def myAnswer(N:int,A:list) -> int:
A.sort()
target = A.pop(0)
for a in A:
if(fractions.gcd(target,a)==1):
return 1
return target
def modelAnswer():
return
def main():
N = int(input())
A = list(map(int,input().split()))
print(myAnswer(N,A[:]))
if __name__ == '__main__':
main() |
p02659 | s531748915 | Wrong Answer | import math
A,B=input().split()
ans=int(A)*float(B)
print(math.floor(ans)) |
p02833 | s599714191 | Accepted | import math
n = int(input())
if n%2==1:
print(0)
else:
print(sum([n//(2*pow(5,i)) for i in range(1,math.ceil(math.log(n+1,5)))])) |
p03262 | s283582588 | Accepted | import math
n, x = map(int,input().split())
p = list(map(int,input().split()))
if n == 1:
print(abs(p[0]-x))
else:
g = math.gcd(p[0]-x,p[1]-x)
for i in range(2,n):
g = math.gcd(g,p[i]-x)
print(g) |
p03486 | s631025363 | Wrong Answer | s = str(input())
t = str(input())
s = sorted(s)
t = sorted(t)
if(''.join(s) <= ''.join(t)):
print('Yes')
else:
print('No') |
p04012 | s774447937 | Accepted | import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
from fractions import Fraction
mod = int(1e9+7)
INF = 1<<29
def main():
w = input()
if len(w)%2!=0:
print('No')
return
s = sorted(w)
for i in range(0,len(s),2):
if s[i]!=s[i+1]:
print('No')
return
print('Yes')
return
if __name__=='__main__':
main()
|
p03221 | s709421957 | Wrong Answer | N, M = map(int, input().split())
city = [input().split() for i in range(M)]
city_sorted = sorted(city, key=lambda x: (x[0],x[1]))
for i in range(M):
A = city_sorted.index(city[i]) + 1
pre = ['0', '0', '0', '0', '0', '0']
C = ['0', '0', '0', '0', '0', '0']
print(''.join((pre+list(city[i][0]))[-6:]+ (C+list(str(A)))[-6:])) |
p03681 | s787537433 | Wrong Answer | n,m = map(int,input().split())
a = n-m
ans = 0
if abs(a) > 1:
ans = 0
elif abs(a) == 1:
x = 1
if a < 0:
s = n
else:
s = m
for i in range(1,m+1):
x *= i % (10**9+7)
ans = x * (x *(i+1)) %(10**9+7)
else:
x = 1
for i in range(1,n+1):
x *= i % (10**9+7)
ans = 2*x **2 %(10**9+7)
print(ans) |
p04031 | s947000358 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
mini = 40000*100
for n in range(-100,100):
cost = 0
for item in A:
cost += (item-n)**2
if cost < mini:
mini = cost
print(mini) |
p02717 | s138573711 | Accepted | x,y,z=map(int,input().split())
print(z,x,y) |
p02678 | s849125441 | Accepted | from collections import deque
n, m = map(int, input().split())
ab = [[] for i in range(n+1)]
for i in range(m):
a, b = map(int,input().split())
ab[a].append(b)
ab[b].append(a)
ans = [-1]*(n+1)
que = deque([1])
while que:
q = que.popleft()
for i in ab[q]:
if ans[i] == -1:
que.append(i)
ans[i] = q
print("Yes")
for i in range(2,n+1):
print(ans[i]) |
p03061 | s812646334 | Accepted | def gcd(a, b):
while b:
a, b = b, a % b
return a
N = int(input())
A = list(map(int, input().split()))
L = [0]*(N+1)
R = [0]*(N+1)
for i in range(N):
L[i+1] = gcd(L[i], A[i])
R[N-i-1] = gcd(R[N-i], A[N-i-1])
M = []
for i in range(N):
M.append(gcd(L[i],R[i+1]))
print(max(M)) |
p02817 | s303567559 | Accepted | s, t = map(str, input().split())
print(t + s) |
p02791 | s923237779 | Accepted | n=int(input())
P=list(map(int,input().split()))
ans=0
minp=n+1
for i in range(n):
minp=min(minp,P[i])
if minp==P[i]:
ans+=1
print(ans) |
p02742 | s989720668 | Wrong Answer | from math import floor, ceil
h, w = map(int, input().split())
ans = 0
ans += floor(h / 2) * floor(w / 2)
ans += ceil(h / 2) * ceil(w / 2)
print(ans) |
p02570 | s308789248 | Accepted | d,t,s=map(int,input().split())
x=s*t-d
if x>=0:
print("Yes")
else:
print("No") |
p03617 | s663962918 | Wrong Answer | q,h,s,d = map(int,input().split())
n = int(input())
a = 0
if n%2 == 1:
n -= 1
a += 1
ans = n//2*min(8*q,4*h,2*s,d)+a*min(4*q,2*h,s,d)
print(ans) |
p02645 | s894085626 | Accepted | import random
name = input()
start = random.randint(0, len(name) - 3)
nickname = name[start:start + 3]
print(nickname)
|
p02789 | s429708722 | Wrong Answer | N,M=map(int,input().split())
if N==M:
print("YES")
else:
print("NO") |
p03455 | s856488928 | Wrong Answer | a,b=map(int,input().split())
print("No") if a*b%2>0 else print("Yes") |
p02831 | s630697165 | Accepted | from fractions import gcd
A, B = map(int, input().split())
def lcm(x, y):
return (x * y) // gcd(x, y)
print(lcm(A, B))
|
p03379 | s873087039 | Wrong Answer | n = int(input())
x = list(map(int, input().split()))
total = sum(x)
for i in range(n):
avg = (total - x[i])/(n-1)
ans = 10**9
for j in range(n):
if i == j: continue
if abs(avg - x[j]) < abs(avg - ans): ans = x[j]
print(ans) |
p02792 | s441712406 | Wrong Answer | n = int(input())
count = 0
for a in range(1, n):
for b in range(1, n):
if(a == b):
break
ah = str(a)[0]
al = str(a)[-1]
bh = str(b)[0]
bl = str(b)[-1]
if ah == bl and bh == al:
count += 1
print(count)
|
p03126 | s235733084 | Wrong Answer | N, M = map(int, input().split())
A = []
for i in range(N):
A.append(list(map(int, input().split())))
s = set(list(A[0]))
for i in range(N):
_s = set(A[i])
s &= _s
print(len(s)) |
p03261 | s780170200 | Wrong Answer | n = int(input())
list = [input() for _ in range(n)]
a = 'Yes'
if len(set(list))!=n:
ans = 'No'
for i in range(n-1):
if list[i][-1]!=list[i+1][0]:
a = 'No'
print(a) |
p03696 | s719700586 | Accepted | n = int(input())
s = input() #sys.stdin.readlineは最後が改行
rcount = 0
rmargin = 0
lcount = 0
lmargin = 0
for i in range(n):
if s[i] == ')':
if rmargin ==0: rcount +=1
else: rmargin -= 1
else: rmargin +=1
if s[-1-i] == '(':
if lmargin ==0: lcount +=1
else: lmargin -= 1
else: lmargin +=1
ans = '('*rcount + s + ')'*lcount
print(ans)
|
p03137 | s420104587 | Wrong Answer | N, M = map(int, input().split())
if N > M:
print(0)
exit()
X = list(map(int, input().split()))
X.sort()
leng = []
for i in range(1, M):
leng.append(X[i] - X[i-1])
leng.sort()
print(sum(leng[:M-3])) |
p02760 | s809373744 | Wrong Answer | import numpy
a = input().split()
b = input().split()
c = input().split()
A = numpy.array((a,b,c), dtype=int)
A.shape = (3, 3)
N = int(input())
counter = 0
while N > 0:
B = int(input())
for i in range(3):
for j in range(3):
if B == A[i][j]:
counter += 1
N -= 1
if counter > 0:
print("Yes")
else:
print("No")
|
p02753 | s691649891 | Accepted | s = input()
if s == "AAA" or s == "BBB":
print("No")
else:
print("Yes") |
p02547 | s960040996 | Accepted | N = int(input())
D = [None] * N
for i in range(N):
D[i] = list(map(int, input().split()))
for i in range(N-2):
for j in range(3):
if D[i+j][0] != D[i+j][1]:
break
else:
print('Yes')
exit()
print('No')
|
p02681 | s544579622 | Accepted | S=input()
T=input()
a=T.find(S)
if (S in T) and a==0:
print('Yes')
else:
print('No')
|
p02572 | s358335754 | Wrong Answer | # -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
# スペース区切りの整数の入力
zzz = list(map(int, input().split()))
b=sum(zzz)**2
a=0
for i in range(n):
# print(i)
x=zzz[i]**2
print(x)
a +=x
# print(b)
# for a in zzz:
# print(a)
# print(b)
# print(a)
ans = (b-a)//2%(10**9+7)
print(ans)
|
p03417 | s983487540 | Accepted | N, M = map(int, input().split())
if N >= 2:
N -= 2
if M >= 2:
M -= 2
print(N*M) |
p03284 | s547892559 | Wrong Answer | A = list(map(int, input().split()))
print(A[0] % A[1]) |
p03069 | s233800256 | Accepted | import sys
N = int(sys.stdin.readline().rstrip())
S = list(map(str, sys.stdin.readline().rstrip()))
left = [None] * N
right = [None] * N
tmp_white,tmp_black = 0,0
for i in range(N):
if S[i] == '#':
tmp_black += 1
left[i] = tmp_black
for i in range(N):
if S[-(i+1)] == '.':
tmp_white += 1
right[-(i+1)] = tmp_white
ans = min(left[-1], right[0])
for i in range(1,N):
ans = min(ans, left[i-1] + right[i])
print(ans) |
p03309 | s787439175 | Accepted | N = int(input())
A = sorted(a-i-1 for i,a in enumerate(map(int,input().split())))
print(sum(abs(a-A[N//2]) for a in A)) |
p02689 | s561061563 | Accepted | a,b=map(int,input().split())
ct=0
c=list(map(int,input().split()))
point=[0]*(len(c)+1)
for i in range(b):
l,s=map(int,input().split())
l-=1
s-=1
if c[l]>c[s]:
point[s]+=1
elif c[l]<c[s]:
point[l]+=1
else:
point[s]+=1
point[l]+=1
print(point.count(0)-1) |
p03281 | s182629704 | Wrong Answer | N = int(input())
cnt = 0
for i in range(1, N + 1):
k = 0
for j in range(1, N + 1):
if i % j == 0:
k += 1
if k == 8:
cnt += 1 |
p02548 | s144851109 | Accepted | import math
N = int(input())
if N == 1:
print(0)
exit()
con = 0
for i in range(1,N):
if N % i == 0:
con += N // i - 1
else:
con += N // i
print(con)
|
p02767 | s806614867 | Wrong Answer | import os
def main():
count = int(input())
int_list = list(map(int, input().split()))
int_min,int_max = min(int_list),max(int_list)
score = 0
int_avg = int(sum(int_list) / len(int_list)) + 1
print(int_avg)
for i in int_list:
score += (i - int_avg)**2
print(score)
if __name__ == "__main__":
main() |
p03161 | s930208289 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
dp=[10000]*N
dp[0]=0
#配るDP作戦 dp[i]の値が分かっている場合にdp[i]を用いてdp[i+1],dp[i+2]...を更新
for i in range(N):
for k in range(1,min(K+1,N-i)):
dp[i+k]=min(dp[i+k],dp[i]+abs(h[i]-h[i+k]))
# print("i=",i," dp=",dp)
print(dp[-1])
|
p04031 | s485808660 | Accepted | N = int(input())
l = list(map(int,input().split()))
l_ans = [[] for _ in range(201)]
for i in range(-100,101):
sum = 0
for j in range(N):
sum = sum + (i-l[j])**2
l_ans[i+100] = sum
print(min(l_ans)) |
p02946 | s468117723 | Accepted | k,x = map(int, input().split())
print(*[i for i in range(x-(k-1), x+k)], sep=' ')
|
p02819 | s357806712 | Wrong Answer | x=int(input())
while True:
cnt=0
if x%2==0:
x+=1
continue
for i in range(2,x):
if x%i==0:
cnt=1
continue
if cnt==1:
x+=1
else:
print(x)
break |
p02748 | s105270979 | 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)]
ans_kouho = [min(a)+min(b)] + [a[x-1]+b[y-1]-c for x, y, c in xyc]
print(min(ans_kouho))
|
p02838 | s318972780 | Accepted | n = int(input())
a = list(map(int,input().split()))
mod = 10**9+7
ans = 0
for i in range(60):
x = 1<< i
l = len([1 for j in a if j & x])
ans += x * l * (n-l) % mod
ans %= mod
print(ans) |
p02691 | s091887044 | Accepted | import collections
n = int(input())
A = list(map(int, input().split()))
ans = 0
cnt = collections.defaultdict(int)
for i in range(1, n+1):
ans += cnt[i-A[i-1]]
cnt[i+A[i-1]] += 1
print(ans) |
p02912 | s314050993 | Accepted | import heapq
n, m = map(int, input().split())
a = [-int(i) for i in input().split()]
heapq.heapify(a)
for _ in range(m):
heapq.heappush(a, ((heapq.heappop(a)*-1//2)*(-1)))
print(sum(a)*-1) |
p02688 | s046618223 | Accepted | import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(10**7)
N, K = map(int, input().split())
snuke = [0] * N
for i in range(K):
d = int(input())
A = map(int, input().split())
for a in A:
a -= 1
snuke[a] += 1
cnt = 0
for s in snuke:
if s == 0:
cnt += 1
print(cnt)
|
p02909 | s976933375 | Wrong Answer | S = input()
print("No" if "L" in S[::2] or "R" in S[1::2] else "Yes") |
p03627 | s533750519 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
count_a = Counter(a)
new_a = [i for i in count_a.keys() if count_a[i] >= 2]
#print(new_a)
if len(new_a) < 2:
print(0)
exit()
new_a = sorted(new_a, reverse=True)
if count_a[new_a[0]] >= 4:
ans = new_a[0] ** 2
else:
ans = new_a[0] * new_a[1]
print(ans) |
p02555 | s718913658 | Accepted | N=int(input())
MOD = 10**9+7
DP=[0]*(N+1)
DP[0]=1
for i in range(3,N+1):
for j in range(0,i-2):
DP[i]+=DP[j]
print(DP[N]%MOD)
|
p03075 | s716251589 | Accepted | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a > k:
print(":(")
else:
print("Yay!") |
p03030 | s418438320 | Wrong Answer | N = int(input())
sp = []
for i in range(N):
s, p = input().split()
sp.append([s, int(p), i+1])
sp1 = sorted(sp, key = lambda x: x[0])
sp2 = sorted(sp1, key = lambda x: -1*x[1])
for i in range(N):
print(sp2[i][2])
|
p03076 | s087566445 | Accepted | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
li = [a,b,c,d,e]
index = -1
def rou(n):
if(n%10==0): return n
return n+10-n%10
mi=(li[0]-1)%10
for i in range(5):
if((li[i]-1)%10 <= mi):
mi=(li[i]-1)%10
index = i
ans = 0
for i in range(5):
if(index == i):
ans += li[i]
else:
ans += rou(li[i])
print(ans)
|
p02708 | s774596047 | Accepted | N, K = map(int, input().split())
s = [0 for i in range(N+2)]
mod = 10**9+7
#s[i]:i個選んだ時の総和
for k in range(N+2):
a = (k-1)*k/2
b = (N+N-k+1)*k/2
s[k] = b-a+1
#ss[i+1]:i個までの個数の総和
ss = [0 for i in range(N+2)]
for i in range(N+1):
ss[i+1] = ss[i] + s[i]
ans = int(ss[N+1]-ss[K]) % mod
print(ans+1) |
p03478 | s935063708 | Accepted | def main():
inp = list(map(int, input().split()))
n = inp[0]
a = inp[1]
b = inp[2]
n_sum = 0
res = 0
for i in range(1, n+1):
n_list = list(map(int, list(str(i))))
n_sum = sum(n_list)
if a <= n_sum and n_sum <= b:
res += i
print(res)
if __name__ == '__main__':
main() |
p02700 | s161148527 | Accepted | import math
A,B,C,D = map(int,input().split())
aoki_out = math.ceil(C/B)
taka_out = math.ceil(A/D)
if(aoki_out <= taka_out):
print('Yes')
else:
print('No') |
p03284 | s196961680 | Accepted | n,k = map(int,input().split())
print(0 if n%k==0 else 1) |
p02646 | s199591825 | Accepted | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = ["YES","NO"]
distance = abs(b-a)
speed = v-w
result = distance - speed * t
if result <= 0:
print(ans[0])
elif result > 0:
print(ans[1])
|
p02993 | s218048870 | Wrong Answer | s = input()
if len(set(s)) == 4:
print("Good")
else:
print("No") |
p02546 | s598051988 | Wrong Answer | import sys
def input(): return sys.stdin.readline().rstrip("\r\n")
def List(): return list(map(int, input().split()))
def Num(): return int(input())
s = input()
if s[-1] != 'e':
print(s + 'es')
else:
print(s + 's')
|
p02795 | s974629219 | Accepted | # -*- coding: utf-8 -*-
import sys
from fractions import gcd
from string import ascii_lowercase as ABC
#input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
H = int(input())
W = int(input())
N = int(input())
X = max(H, W)
print(-(-N//X)) |
p03385 | s921615445 | Accepted | S = input()
if "a" in S and "b"in S and "c" in S:
print('Yes')
else:
print('No') |
p02987 | s225926951 | Accepted | S = input().strip()
C = {}
for i in range(len(S)):
if S[i] not in C:
C[S[i]] = 0
C[S[i]] += 1
if len(C)==2:
flag = 0
for a in C:
if C[a]!=2:
flag = 1
break
if flag==0:
print("Yes")
else:
print("No")
else:
print("No") |
p02848 | s551706720 | Wrong Answer | import sys
def main():
input = sys.stdin.readline
n = int(input())
s = input()
first = ord("A") - 1
last = ord("Z")
increment = lambda x: chr(ord(x)+n) if ord(x)+n <= last else chr(first + (ord(x)+n - last))
new_s = "".join(map(increment, s))
print(new_s)
if __name__ == '__main__':
main()
|
p03289 | s640514306 | Wrong Answer | s = list(input())
if s[0].isupper() and s[2:-1].count('C') == 1:
s.pop(0)
s.pop(s.index('C'))
cnt = 0
for si in s:
if si.islower():
cnt += 1
if cnt == len(s):
print('AC')
else:
print('WA')
else:
print('WA')
|
p03407 | s341772369 | Accepted | a,b,c=map(int,input().split())
print('Yes' if c<=a+b else 'No')
|
p03131 | s205641644 | Wrong Answer | K,A,B=map(int,input().split(' '))
print(max(K+1,B+(B-A)*max(0,(K-(A+1))//2)+max(0,(K-(A+1)))%2)) |
p03767 | s887490797 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
ans = sum(A[1:2*N:2])
print(ans)
|
p03221 | s567514617 | Accepted | from bisect import bisect_left
n, m = map(int, input().split())
city_list = [[0] for _ in range(n + 1)]
city = [[]]
for _ in range(m):
p, y = map(int, input().split())
city_list[p].append(y)
city.append([p, y])
for i in range(1, n + 1):
city_list[i].sort()
for i in range(1, m + 1):
ID = ''
p = city[i][0]
order = str(bisect_left(city_list[p], city[i][1]))
p = str(p)
ID = ID + ('0' * (6 - len(p)))
ID += p
ID += ('0' * (6 - len(order)))
ID += order
print(ID) |
p03495 | s134087200 | Accepted | import collections as c
n,k=map(int,input().split());a=c.Counter(map(int,input().split()))
print([0,sum(sorted([*a.values()])[:len(a)-k])][len(a)>k]) |
p03206 | s126281840 | Wrong Answer | D = int(input())
print("christmas" + " Eve" * (25-D))
|
p03339 | s621490006 | Wrong Answer | n = int(input())
s = input()
if s.count("E") >= (n+1)//2:
print(n-s.count("E"))
else:
print(s.count("E"))
|
p03252 | s465058859 | Accepted | from collections import Counter
s = Counter(input())
t = Counter(input())
sc = sorted([x for x in s.values()])
tc = sorted([x for x in t.values()])
print("Yes" if sc==tc else "No") |
p03998 | s558507487 | Accepted | from collections import deque
A = deque(list(input()))
B = deque(list(input()))
C = deque(list(input()))
def res(turn,str="NULL"):
if len(turn) == 0: print(str.upper())
else:
str=turn.popleft()
if str=="a": res(A,str)
elif str=="b": res(B,str)
elif str=="c": res(C,str)
res(A,"NULL") |
p03407 | s587187636 | Wrong Answer | a, b, c = map(int, input().split())
print("Yes" if a+b>c else "No") |
p03012 | s186043435 | Wrong Answer |
n = int(input())
w = list(map(int,input().split()))
l = []
r = []
print(w)
min = abs(w[0] - sum(w[1:]))
#print(min)
s1 = 0
s2 = 0
for i in range(n-1):
s1 = sum(w[:i+1])
s2 = sum(w[i+1:])
tmp = abs(s1 - s2)
print(s1,s2,tmp)
if tmp < min:
min = tmp
print(min)
|
p03944 | s632196569 | Wrong Answer | w, h, n = map(int, input().split())
xya = []
left = 0
right = w
under = 0
upper = h
for _ in range(n):
x, y, a = map(int, input().split())
if a==1:
left = x
elif a==2:
right = x
elif a==3:
under = y
else:
upper = y
ans = (upper-under)*(right-left)
print(max(ans, 0)) |
p02899 | s393387017 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
a = sorted(a)
b = []
for i in range(1,n+1):
b.append(a.index(i)+1)
print(*b) |
p02708 | s764716053 | Accepted | if __name__ == '__main__':
a,b= map(int,input().split())
maxnum =0
minnum =0
diff = 10**9 +7
ans = 0
for i in range(b,a+2):
max = (i * (2*a+1-i)) / 2
min = (i* (i - 1) / 2)
ans += max-min+1
ans = ans % diff
print(int(ans))
|
p03705 | s145292507 | Accepted | n,a,b = map(int, input().split())
if a > b or (n==1 and a != b):
print(0)
else:
Max = a + b * (n-1)
Min = a * (n-1) + b
print(Max - Min + 1) |
p03624 | s226300671 | Wrong Answer | S=sorted(set(input()))
i = 0
tf = True
for s in S:
if s == chr(ord('a')+i):
i+=1
continue
else:
print(chr(ord('a')+i))
tf = False
break
if tf:
print('None') |
p03324 | s306915222 | Accepted | from itertools import permutations
def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
D, N = mi()
if N == 100:
print(100**D*101)
else:
print(100**D*N)
if __name__ == '__main__':
main() |
p03814 | s361593425 | Wrong Answer | a = input()
for i in range(len(a)):
if a[i] == "A":
b = i
break
for j in range(len(a)):
if a[j] == "Z":
c = j
break
print(c-b+1)
|
p03206 | s561728914 | Accepted | print('Christmas'+' Eve'*(25-int(input()))) |
p03605 | s665451776 | Accepted | n = int(input())
if str(9) in str(n):
print("Yes")
else:
print("No") |
p03548 | s597678458 | Accepted | x,y,z=map(int,input().split())
x-=z
print(int(x/(y+z))) |
p02775 | s288284350 | Accepted | N = [int(_) for _ in list(input())]
a, b = 0, 1
for n in N:
a, b = min(a + n, b + 10 - n), min(a + (n + 1), b + 10 - (n + 1))
print(a)
|
p02881 | s320811754 | Accepted | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(input())
for i in reversed(range(1, int(n ** 0.5) + 1)):
if n % i == 0:
j = n // i
print(i + n // i - 2)
exit()
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
p02639 | s879050269 | Wrong Answer | a=list(map(int,input().split()))
for i in range(1,5):
if a[i-1]==0:
print(i)
break |
p02598 | s366479150 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
l,r=0,max(a)
while 1<r-l:
m=(l+r)//2;c=0
for i in a:c+=math.ceil(i/m)-1
if c>k:l=m
else:r=m
print(r) |
p03289 | s846857453 | Wrong Answer | import sys
import re
S = input()
array_S = list(S)
if not ( 4 <= len(S) <= 10 ):
sys.exit()
if len(re.findall('[A-Z]',S)) != 2:
print('WA')
sys.exit()
result = 0
if array_S[0] != 'A': result += 1
if array_S[2:-2].count('C') != 1: result += 1
array_S.pop(0)
array_S.pop(array_S.index('C'))
if not "".join(array_S).islower(): result += 1
print('WA') if result != 0 else print('AC') |
p02603 | s727154646 | Wrong Answer | N = int(input())
list_A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N - 1):
if list_A[i] < list_A[i + 1]:
stock = money // list_A[i]
money -= stock * list_A[i]
elif list_A[i] > list_A[i + 1]:
money += stock * list_A[i]
stock = 0
money += stock * list_A[-1]
print(money) |
p02995 | s772211140 | 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 main():
a, b, c, d = map(int, input().split())
print(calc(b, c, d)-calc(a-1, c, d))
if __name__ == "__main__":
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.