problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03252 | s337097182 | Wrong Answer | from collections import defaultdict
S, T = map(lambda x: x.strip(), open(0).read().split())
ds, dt = defaultdict(str), defaultdict(str)
ans = 'Yes'
for s, t in zip(S, T):
if ds[s] or ds[s] == t:
ds[s] = t
else:
ans = 'No'
break
if dt[t] or dt[t] == s:
dt[t] = s
else:
ans = 'No'
break
print(ans) |
p03380 | s742671796 | Accepted | N = int(input())
numbers = [int(x) for x in input().split()]
numbers.sort()
n = numbers.pop()
r = min(numbers, key=lambda x: abs(x - n / 2)) # N
print(n, r) |
p03360 | s014589402 | Wrong Answer | def main():
A = list(map(int, input().split()))
k = int(input())
A.sort()
print(sum(A[:-1])+A[-1]*2*k)
if __name__ == '__main__':
main()
|
p02705 | s458032139 | Accepted | import math
n=int(input())
a=math.pi
print((n+n)*a)
|
p03435 | s111170059 | Wrong Answer | # C - Takahashi's Information
a =[list(map(int, input().split())) for i in range(3)]
sum_a = sum(map(sum, a))
for i in range(3,300):
if sum_a % i == 0 and sum_a // i >= 3:
print("Yes")
exit()
else:
pass
print("No") |
p03493 | s543265094 | Accepted | s=input()
print(s.count("1")) |
p02935 | s593408535 | Accepted | n=int(input())
value=list(map(int, input().split()))
value.sort()
for i in range(n-1):
value[i+1] = (value[i]+value[i+1])/2
print(value[n-1]) |
p02676 | s701053681 | Accepted | k=int(input())
s=input()
if int(len(s))<=k:
print(s)
else:
print(s[0:k]+"...") |
p04031 | s622863932 | Accepted | N = int(input())
an = list(map(int, input().split()))
cost = 10000*N
ans = 10000*N
for i in range(-100,100+1):
cost = sum([(j - i)**2 for j in an])
ans = min(ans, cost)
print(ans) |
p02786 | s907565418 | Wrong Answer | h = int(input())
lhb = len(format(h, "b"))
print(2 ** lhb - 1 + lhb) |
p03379 | s059738570 | Accepted | n=int(input())
x=list(map(int,input().split()))
y=sorted(x)
ans1=y[(n//2)-1]
ans2=y[n//2]
for i in range(n):
if x[i]<=ans1:
print(ans2)
else:
print(ans1) |
p03696 | s581115129 | Accepted | N = int(input())
S = input()
need_left = 0
pointer = 0
for i in range(len(S)):
if S[i] == '(':
pointer += 1
else:
if pointer == 0:
need_left += 1
else:
pointer -= 1
need_right = pointer
res = "(" * need_left + S + ")" * need_right
print(res) |
p02627 | s533279386 | Accepted | a = input()
small = list(range(ord("a"), ord("z")+1))
big = list(range(ord("A"), ord("Z")+1))
if ord(a) in small:
print("a")
else:
print("A") |
p02640 | s469381876 | Wrong Answer | n, m = map(int, input().split())
a =0
for i in range(n+1):
for s in range(0, n+1-i)[::-1]:
if 4*(i) + 2*(s) == m:
a = a + 1
else:
a = a
if a > 0:
print('Yes')
else:
print("No") |
p03250 | s563167514 | Accepted | a,b,c = map(int,input().split())
print(max(a,b,c)*9+sum([a,b,c])) |
p02664 | s273285573 | Accepted | a = input()
b = len(a)
c = []
for i in range(b):
d = a[i]
if d == '?':
d='D'
else:
d = a[i]
c.append(d)
print(''.join(c))
|
p02744 | s627058359 | Wrong Answer | from string import ascii_lowercase
n = int(input())
d = {s: i for i, s in enumerate(ascii_lowercase)}
a = [s for s, i in d.items()]
ans = []
def dfs(k, s):
if n == k:
ans.append(s)
elif n > k:
for i in range(max([d[c] for c in s])+2):
v = s + a[i]
dfs(k+1, v)
dfs(1,"a")
ans.sort()
for k in ans:
print(k)
print('\n') |
p03693 | s021863815 | Wrong Answer | a,b,c=input().split()
num=int(a+b+c)
if num%4==0:
print("Yes")
else:
print("No") |
p03150 | s465713851 | Accepted | s=input()
l='keyence'
n=len(s)
for i in range(n-1):
for j in range(i,n):
r=s[:i]+s[j:]
if(r==l):
print("YES")
exit()
print("NO")
|
p03126 | s437608994 | Accepted | n,m = map(int,input().split())
s = set(range(1,m+1))
for i in range(n):
k,*a = map(int,input().split())
s &= set(a)
print(len(s)) |
p03041 | s148339790 | Accepted | n, k = map(int, input().split())
s = input()
print(s[:k-1] + s.lower()[k-1] + s[k:]) |
p02995 | s285215540 | Accepted | import math
a,b,c,d = map(int, input().split())
C = b//c - (a-1)//c
D = b//d - (a-1)//d
x = c*d//math.gcd(c,d)
CD = b//x - (a-1)//x
print((b-a+1) - (C+D-CD)) |
p03681 | s123705358 | Accepted | import numpy as np
n=10**6
nsq=10**3
mod=10**9+7
fact=np.arange(n,dtype=np.int64).reshape(nsq,nsq); fact[0,0]=1
for n in range(1,nsq):
fact[:,n]*=fact[:,n-1]; fact[:,n]%=mod
for n in range(1,nsq):
fact[n]*=fact[n-1,-1];fact[n]%=mod
fact=fact.ravel()
n,m=map(int,input().split())
p=fact[n]
q=fact[m]
if abs(n-m)>=2:
print(0)
elif abs(n-m)==1:
print((p*q)%(10**9+7))
else:
print(2*(p*q)%(10**9+7))
|
p03150 | s255544358 | Wrong Answer | s = input()
k = 'keyence'
ans = ''
j=0
for i, c in enumerate(s):
if c == k[i]:
pass
else:
ans = s[0:i]
s = s[i:]
j=i
break
for i, c in enumerate(s):
if k[j] == c:
j = i
ans += s[i:]
break
if ans == k:
print('YES')
else:
print('NO') |
p02618 | s059565075 | Accepted | d = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(d)]
cmax=max(c)
c_index = c.index(cmax)
for i in range(d):
if i % 5 == 4:
print(c_index+1)
else:
max_value = max(s[i])
max_index = s[i].index(max_value)
print(max_index+1)
|
p03417 | s052759199 | Wrong Answer | n,m=map(int,input().split())
if n>=3 and m>=3:
print((n-2)*(m-2))
elif n==1 or m==1:
print(n*m-2) |
p02860 | s225356195 | Accepted | N = int(input())
S = input()
if N % 2 == 1:
print("No")
else:
print("Yes" if S[0:N//2] == S[N//2:N] else "No") |
p03625 | s139443541 | Accepted | n = int(input())
a = list(map(int,input().split()))
dic = {}
for i in a:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
first = 0
second = 0
for i,j in dic.items():
if j >= 2:
if i > first :
second = first
first = i
elif i > second:
second = i
if j >= 4:
if i > first :
second = first
first = i
elif i > second:
second = i
print(first*second) |
p03612 | s543685303 | Accepted | n = int(input())
arr = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if arr[i] == i + 1:
ans += 1
arr[i+1], arr[i] = arr[i], arr[i+1]
if arr[n-1] == n:
ans += 1
print (ans) |
p03000 | s691823757 | Wrong Answer | N, X = map(int, input().split())
L = list(map(int, input().split()))
S = 0
for i in range(N):
S += L[i]
if S>X:
print(i+1)
break |
p03107 | s677568204 | Accepted | s = list(input())
print(2 * min(s.count("1"), s.count("0"))) |
p03067 | s605675554 | Wrong Answer | A, B, C = map(int, input().split())
print('Yes' if A <=C<=B else 'No') |
p02836 | s919824365 | Accepted | S = list(input())
cnt = 0
length = len(S) // 2
for i in range(length):
if S[i] != S[-1-i]:
cnt += 1
print(cnt)
|
p03556 | s006128491 | Accepted | n = int(input())
for i in range(1, 10**5):
p = i**2
if p > n:
print((i-1)**2)
break |
p04031 | s689617980 | Accepted | import sys
_input1 = int(input())
_input2 = [int(s) for s in input().split()]
_output = sys.maxsize
for i in range(min(_input2),max(_input2)+1):
score = 0
for j in _input2:
score += (j-i)**2
if score < _output:
_output = score
print(_output) |
p03456 | s569588126 | Wrong Answer | a, b = map(str, input().split())
c = int(a + b)
for i in range(1, 101):
if c == i*i:
print("Yes")
exit()
print("No") |
p02665 | s511758558 | Accepted | N = int(input())
A = list(map(int, input().split()))
d = [1] * (N+1)
d[0] -= A[0]
for i in range(N):
d[i+1] = d[i] * 2 - A[i+1]
if d[-1] < 0:
print(-1)
exit()
d[-1] = A[-1]
for i in range(N, 0, -1):
d[i-1] = min(d[i]+A[i-1], d[i-1]+A[i-1])
print(sum(d))
|
p02994 | s842420298 | Accepted | N, L = map(int, input().split())
min_s = 100000000000
s = 0
for i in range(1,N+1):
t = L+i-1
s += t
if abs(t) <= abs(min_s):
min_s = t
print(s-min_s) |
p02989 | s770312467 | Accepted | N = int(input())
d = list(map(int,input().split()))
d.sort()
n= int(N/2)
print(d[n]-d[n-1])
|
p02789 | s842989384 | Wrong Answer | N,M=list(map(int,input().split()))
a=(N==M)
print("WAC"[a:a+2]) |
p03077 | s323174980 | Accepted | n = int(input())
K = []
for i in range(5):
K.append(int(input()))
x = min(K)
print((n-1)//x+5) |
p02658 | s983160458 | Wrong Answer | N = int(input())
A = [int(i) for i in input().split()]
res = 1
for i in range(N):
break
if A[i] == 0:
res = 0
elif A[i] > 0:
res *= A[i];
if res > 1e+18:
res = -1
if res > 1e+18: print("-1")
else : print(res) |
p03607 | s964216546 | Accepted | from collections import defaultdict
n = int(input())
A = defaultdict(int)
for i in range(n):
a = int(input())
if A[a] == 1:
A[a] = 0
else:
A[a] = 1
print(sum(A.values()))
|
p02723 | s281885399 | Wrong Answer | s = input().lower()
if s[2] == s[3]:
if s[4] == s[5]:
print('yes')
else:
print('no') |
p02924 | s721491905 | Wrong Answer | N=int(input())
if N==2:
print("1")
else:
print(N*(N//2)) |
p02629 | s666644968 | Wrong Answer | #!/usr/bin/python3
import sys
input = lambda: sys.stdin.readline().strip()
n = int(input()) - 1
if n == 0:
print('a')
else:
ans = []
while n > 0:
ans.append(n % 26)
n //= 26
print(*reversed([chr(ord('a') + x) if i == 0 else ('z' if x == 0 else chr(ord('a') + x - 1)) for i, x in enumerate(ans)]), sep='') |
p03077 | s773046297 | Accepted | import math
n = int(input())
a = list(int(input()) for _ in range(5))
print(math.ceil((n/min(a)))+4) |
p03013 | s522264511 | Accepted | N, M = map(int, input().split())
mod = 1000000007
brokens = set([int(input()) for i in range(M)])
dp = [0] * (N + 1)
dp[0] = 1
for now in range(N + 1):
if now + 1 < N:
dp[now + 1] += dp[now] if now + 1 not in brokens else 0
dp[now + 2] += dp[now] if now + 2 not in brokens else 0
elif now < N:
dp[now + 1] += dp[now] if now + 1 not in brokens else 0
print(dp[-1] % mod) |
p03324 | s542421877 | Wrong Answer | D, N = map(int, input().split())
print(100 ** D * N) |
p03220 | s676402812 | Accepted | n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
min_tmp = 10 ** 5
index = 0
for i in range(n):
tmp = abs(a - (t - 0.006 * h[i]))
if tmp <= min_tmp:
min_tmp = tmp
index = i
# print(tmp)
print(index + 1)
|
p03759 | s742323632 | Accepted | a,b,c = map(int,input().split())
if b - a == c - b:
print("YES")
else:
print("NO") |
p02630 | s100654756 | Wrong Answer | n=int(input())
a_list=list(map(int,input().split()))
cnt = [0] * int(1e5 + 10)
sum=0
for i in a_list:
cnt[i] +=1
sum+=i
q=int(input())
ans=0
for j in range(q):
x,y=map(int,input().split())
ans=-(x-y)*cnt[x]+sum
print(ans)
cnt[x]+=cnt[y]
cnt[y]=0 |
p02607 | s298722539 | Accepted | import sys
sys.setrecursionlimit(300000)
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
N = I()
A = LMI()
ans = 0
for i, a in enumerate(A):
if i % 2 == 0 and a % 2 != 0:
ans += 1
print(ans) |
p03286 | s553576063 | Accepted | N = int(input())
ans = ''
if N == 0:
print(0)
exit()
while N != 0:
r = N%2
N = (N-r)//(-2)
ans += '1' if r else '0'
print(ans[::-1])
|
p03854 | s713781883 | Accepted | S = input()
x = S.replace('eraser', '').replace('erase', '').replace('dreamer','').replace('dream','')
print('YES' if not x else 'NO') |
p03289 | s486480276 | Wrong Answer | S = input()
if (S[0]=='A') and (S[2:-1].count('C') == 1) \
and (S not in 'BDEFGHIJKLMNOPQRSTUVWXYZ') and (S.count('C')==1) and (S.count('A')==1):
print('AC')
else:
print('WA') |
p02801 | s193112534 | Accepted | char = input()
print(chr(ord(char) + 1)) |
p02900 | s303761251 | Accepted | import fractions
a, b = map(int, input().split())
c = fractions.gcd(a, b)
def prime_factorize(n):
s = set()
while n % 2 == 0:
s.add(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
s.add(f)
n //= f
else:
f += 2
if n != 1:
s.add(n)
return s
print(1+len(prime_factorize(c))) |
p02831 | s026363974 | Wrong Answer | a, b = map(int, input().split())
for i in range(min(a,b), max(a,b)+1):
if not i % a and not i % b:
print(i)
quit() |
p03435 | s024485909 | Accepted | import sys
C11,C12,C13 = map(int, input().split())
C21,C22,C23 = map(int, input().split())
C31,C32,C33 = map(int, input().split())
if (C11+C22==C12+C21) and (C12+C23==C13+C22) and (C21+C32==C22+C31) and (C22+C33==C23+C32):
print('Yes')
sys.exit()
print("No") |
p03001 | s529621029 | Wrong Answer | w, h, x, y = map(int, input().split())
print((h * w) / 2, int(x == (w // 2) and y == (h // 2))) |
p03075 | s242012156 | Wrong Answer | l=[int(input()) for i in range(5)]
k=int(input())
cnt=0
for i in range(1,len(l)):
if l[i]-l[i-1] > k:
cnt +=1
if cnt > 0:
print(":(")
else:
print("Yay!") |
p03352 | s719104505 | Accepted | x=int(input())
print(max([i**j for i in range(33) for j in range(2,10) if i**j<=x])) |
p02718 | s168359849 | Accepted | n, m = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a) * (1 / (4 * m))
cnt = 0
for i in a:
if i >= s:
cnt += 1
if cnt >= m:
print("Yes")
else:
print("No")
|
p03835 | s330820312 | Accepted | def solve(K, S):
count = 0
for x in range(K+1):
for y in range(K+1):
if K >= S - (x + y) >= 0 :
count += 1
print(count)
if __name__ == '__main__':
K, S = map(int, input().split())
solve(K, S) |
p03137 | s806798265 | Accepted | N,M=map(int,input().split())
A=list(map(int,input().split()))
B=sorted(A)
if N>=M:
print(0)
else:
a=M-N
C=[0]*(M-1)
for i in range(M-1):
C[i]=B[i+1]-B[i]
D=sorted(C)
ans=sum(D[:a])
print(ans) |
p02714 | s172355083 | Wrong Answer | N = int(input())
S = str(input())
cnt = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
if S[i-1]==S[j-1]:
break
for k in range(j+1,N+1):
if S[i-1]==S[k-1] or S[j-1]==S[k-1]:
break
elif j-i == k-j:
break
else:
cnt = cnt+1
print(cnt) |
p03282 | s249560061 | Wrong Answer | def resolve():
s = input()
k = int(input())
cnt = -1
for i in range(len(s)):
if s[i] != '1':
break
cnt = i + 1
if cnt > k:
print(1)
else:
print(s[cnt] if len(s) > cnt > -1 else s[0])
if __name__ == '__main__':
resolve()
|
p02910 | s469850171 | Accepted | s=list(input())
l=[]
for i in s[1::2]:
l.append(i)
new_l=[]
for i in s[::2]:
new_l.append(i)
ans=0
if 'L' in new_l:
ans='No'
else:
ans='Yes'
num=0
if 'R' in l:
num='No'
else:
num='Yes'
if ans == 'Yes' and num == 'Yes':
print('Yes')
else:
print('No')
|
p02882 | s045980031 | Wrong Answer | import math
a,b,x = (int(a) for a in input().split())
if x <= a**2 * b / 2 :
t = b
s = 2 * x / (a*b)
r = s / t
print(90 - math.degrees(math.atan(r)))
else :
t = a
s = 2 * b ** 2 - 2 * x / (a ** 2)
r = s / t
print(math.degrees(math.atan(r)))
|
p03778 | s857268419 | Accepted | w, a, b = map(int, input().split())
if a <= b <= a + w or b <= a + w <= b + w or b <= a <= b+w or a <= b + w <= a + w:
print(0)
elif a + w < b:
print(b - a - w)
elif b+w < a:
print(a - b - w) |
p03327 | s912885349 | Wrong Answer | import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n = ni()
if n < 999:
print('ABC')
else:
print('ABD') |
p03862 | s291429184 | Accepted | N,x=map(int,input().split())
a=list(map(int,input().split()))
eat=0
for i in range(N-1):
num1=a[i]
num2=a[i+1]
if num1+num2>x:
buf=min(num1+num2-x,num2)
eat=eat+buf
num2=num2-buf
if num1>x:
buf=num1-x
eat=eat+buf
num1=num1-buf
a[i]=num1
a[i+1]=num2
#print(a)
print(eat) |
p02732 | s013933788 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a)
ans = 0
t = (n - 1) * (n - 2) // 2
for k, v in c.items():
ans += v * (v - 1) // 2
for y in a:
x = c[y]
print(ans - x * (x - 1) // 2 + (x - 1) * (x - 2) // 2)
|
p03665 | s782600771 | Accepted | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,P = MI()
A = LI()
x = sum(A[i] % 2 == 0 for i in range(N)) # Aiの中で、偶数であるものの個数
y = N-x # Aiの中で、奇数であるものの個数
if y == 0:
print(0 if P == 1 else 2**x)
else:
print(2**(x+y-1))
|
p03377 | s880122693 | Accepted | a,b,x=map(int,input().split())
print("YES" if a+b-x>=0 and x>=a else "NO") |
p02843 | s922132740 | Accepted | x=int(input())
t,m=divmod(x,100)
if t*5>=m:print(1)
else:print(0) |
p02595 | s825511378 | Wrong Answer | n, d = map(int,input().split())
cnt = 0
for i in range(n):
p,q = map(int,input().split())
if d <= (p**2)+(q**2):
cnt+=1
print(cnt) |
p03324 | s836005998 | Accepted | D, N = map(int, input().split())
if N<100:
print(100**D*N)
else:
print(100**D*101) |
p03013 | s890604422 | Accepted | N, M = map(int, input().split())
A = set([int(input()) for _ in range(M)])
mod = 10**9+7
step = [0] * (N+1)
step[0] = 1
step[1] = 1
for i in range(N+1):
if i==0 or i==1:
if i in A:
step[i] = 0
else:
step[i] = step[i-1]+step[i-2]
if i in A:
step[i] = 0
step[i] %= mod
print(step[-1]) |
p03644 | s866964697 | Accepted | N = int(input())
count = [0 for __ in range(N)]
Nl = [i for i in range(1,N+1)]
for i,n in enumerate(Nl):
while n%2==0:
n /= 2
count[i] += 1
idx = count.index(max(count))
print(Nl[idx]) |
p02729 | s409929801 | Accepted | N,M =map(int,input().split())
print(N*(N-1)//2+M*(M-1)//2)
|
p02724 | s529402694 | Accepted | X=int(input())
gohyaku = X//500
go = (X-gohyaku*500) // 5
print(gohyaku*1000+go*5) |
p03309 | s502508124 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
A_=A.copy()
for n in range(N):
A_[n] = A_[n]-(n+1)
A_.sort()
# A_s=A_[0]
# A_e=A_[-1]
# A_mean=(A_s+A_e)/2
A_mean=sum(A_)/len(A_)
A_mean
def cul_ans(i):
A_abs_=[]
for a in A_:
A_abs_.append(abs(a-i))
return A_abs_
ans=10**20
for i in range(int(A_mean)-3,int(A_mean)+2):
if ans>sum(cul_ans(i)):
ans=sum(cul_ans(i))
print(ans) |
p03011 | s165810609 | Wrong Answer | p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
print(p+q)
if p+r<p+q and p+r<q+r:
print(p+r)
if q+r<p+r and q+r<p+q:
print(q+r)
if p+q==q+r and p+q<p+r:
print(p+q)
if p+r==q+r and p+r<p+q:
print(p+r)
if p==q==r:
print(p+q) |
p02983 | s547758836 | Accepted | l, r = (int(_) for _ in input().split())
r = min(r,l+2019)
x = [i*ii%2019 for i in range(l,r+1) for ii in range(i+1,r+1)]
print(min(x))
|
p03852 | s103767555 | Accepted | c = input()
if c == "a" or c == "i" or c == "u" or c == "e" or c == "o":
print("vowel")
else:
print("consonant") |
p03038 | s323206320 | Accepted | from itertools import zip_longest
n, m = map(int, input().split())
A = list(map(int, input().split()))
BC = [list(map(int, input().split())) for _ in range(m)]
A.sort()
BC.sort(key=lambda x: -x[1])
stack = []
i = 0
while len(stack) < n and i < m:
for _ in range(BC[i][0]):
stack.append(BC[i][1])
if len(stack) >= n:
break
i += 1
ans = 0
for a, s in zip_longest(A, stack, fillvalue=0):
ans += max(a, s)
print(ans) |
p03487 | s549659802 | Accepted | import sys
input = sys.stdin.readline
N=int(input())
a=list(map(int,input().split()))
from collections import Counter
d=Counter(a)
ans=0
for key,val in d.items():
if key>val:
ans+=val
elif key<val:
ans+=val-key
print(ans)
|
p02963 | s266250732 | Accepted | def resolve():
'''
code here
'''
S = int(input())
a, b = divmod(S, 10**9)
x2 = (10**9 - b)%10**9
y2 = (S+x2) // (10**9)
print(0,0, 10**9, 1, x2, y2)
if __name__ == "__main__":
resolve()
|
p02624 | s384254532 | Accepted | N = int(input())
arr = [0]*(N+1)
ans =0
for i in range(1,N+1):
for j in range(i,N+1,i):
arr[j] += 1
ans += i*arr[i]
print(ans) |
p02742 | s248356900 | Accepted | H, W = map(int, input().split())
if H == 1 or W == 1:
print(1)
else:
if H * W % 2 == 0:
print(H * W // 2)
else:
print(H * W // 2 + 1) |
p02701 | s842827367 | Wrong Answer | N = int(input())
l = []
for i in range(N):
l.append(input())
k = sorted(l)
ans = 0
for i in range(N):
a = 0
if k[i]!=a:
ans+= 1
a = k[i]
print(ans) |
p03095 | s265110229 | Wrong Answer | # Problem A - Colorful Subsequence
# input
N = int(input())
S = list(input())
# initialization
word_dic = {}
ans = 1
# word count
for s in S:
if not s in word_dic:
word_dic[s] = 1
else:
word_dic[s] += 1
# output
for w in word_dic:
tmp = word_dic[w]
ans = ans * (tmp + 1)
ans -= 1
print(ans)
|
p02880 | s322682619 | 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') |
p03761 | s170120984 | Wrong Answer | n = int(input())
S = list(input() for _ in range(n))
if n == 1:
print(S[0])
else:
def intersect_list(l1, l2):
arr = []
lst = l1.copy()
for element in l2:
try:
lst.remove(element)
except ValueError:
pass
else:
arr.append(element)
return arr
l = intersect_list(list(S[0]), list(S[1]))
for i in range(2, n):
l = intersect_list(l, list(S[i]))
l.sort()
print("".join(l)) |
p02691 | s670827313 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
dic1 = {}
dic2 = {}
for i in range(n):
tmp1 = a[i] + (i + 1)
tmp2 = -a[i] + (i + 1)
if tmp1 in dic1:
dic1[tmp1] += 1
else:
dic1[tmp1] = 1
if tmp2 in dic2:
dic2[tmp2] += 1
else:
dic2[tmp2] = 1
for key in dic1.keys():
if key in dic2:
ans += dic1[key] * dic2[key]
print(ans)
|
p02707 | s932438042 | Accepted | import collections
N=int(input())
L=list(map(int,input().split()))
for i in range(N):
L.append(i+1)
S=collections.Counter(L)
S=sorted(S.items())
for x,y in S:
print(y-1) |
p02778 | s578234311 | Accepted | S = input()
print('x'* len(S)) |
p02873 | s809390987 | Accepted | # 解説動画視聴
s = input()
a = [0]*(len(s)+1)
if len(s) == 1:
print(1)
exit()
for i in range(len(s)):
if s[i] == '<':
a[i+1] = max(a[i+1],a[i]+1)
for i in range(len(s)-1,-1,-1):
if s[i] == '>':
a[i] = max(a[i],a[i+1]+1)
print(sum(a)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.