problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02952 | s708777170 | Accepted | def main():
# 入力
n = int(input())
cnt = 0
for i in range(1, n+1):
if len(str(i)) % 2 == 1:
cnt += 1
print(cnt)
main()
|
p02719 | s251426465 | Accepted | N, K = map(int, input().split())
if K > N :
print(min(abs(N-K),N))
else:
first = N // K
first_1 = N % K
print(min(first_1, K - first_1))
|
p03206 | s584224305 | Accepted | d = int(input())
print('Christmas'+(25-d)*' Eve') |
p03012 | s103173423 | Accepted | N = int(input())
W = list(map(int,input().split()))
s = 0
i = 0
sw = sum(W)
while s < sw/2:
s += W[i]
i += 1
print(min( abs(sum(W[0:i])-sum(W[i:N])) , abs(sum(W[0:i-1])-sum(W[i-1:N])) )) |
p02911 | s777645163 | Accepted | import sys
input = sys.stdin.readline
n, k, q = map(int, input().split())
aq = [int(input()) for _ in range(q)]
point = [0 for _ in range(n+1)]
for i in aq:
point[i] += 1
for j in range(1, n+1):
if k - q + point[j] > 0:
print('Yes')
else:
print('No')
|
p02675 | s175434017 | Wrong Answer | N=int(input())
L=str(N)
if L[-1]==2 or L[-1]==4 or L[-1]==5 or L[-1]==7 or L[-1]==9:
print("hon")
elif L[-1]==0 or L[-1]==1 or L[-1]==6 or L[-1]==8:
print("pon")
else:
print("bon")
|
p03103 | s197250876 | Accepted | n,m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
money = 0
drink = 0
for a,b in ab:
money += a*b
drink += b
if drink >= m:
money -= (drink-m) * a
break
print(money) |
p02701 | s754230240 | Wrong Answer | N = input()
list = list(input())
print(len(set(list))) |
p03998 | s446391313 | Accepted | S={s:list(input()) for s in 'abc'}
t='a'
while len(S[t])>0:
t=S[t].pop(0)
print(t.upper())
|
p02596 | s002550955 | Accepted | # C - Repsept
K = int(input())
tmp = 0
ans = -1
for i in range(1,2*K):
tmp = (10*tmp+7)%K
if tmp==0:
ans = i
break
print(ans) |
p02724 | s853808761 | Wrong Answer | coin = int(input())
coin = coin * 2
if coin == 0:
print(0)
else:
print(coin) |
p03730 | s622080719 | Accepted | a, b, c = map(int, input().split())
ans = 'NO'
for i in range(1, b+1):
if (a*i) % b == c:
ans = 'YES'
break
print(ans)
|
p02813 | s200076885 | Accepted | from itertools import permutations
n = int(input())
p = [int(x) for x in input().split()]
q = [int(x) for x in input().split()]
for i, l in enumerate(permutations(range(1, n+1)), 1):
if p == list(l):
a = i
if q == list(l):
b = i
print(abs(a-b)) |
p03150 | s062136641 | Accepted | s = input()
key = 'keyence'
if len(s) < len(key):
print('NO')
else:
for i in range(len(key)):
if s[:i] + s[-7+i:] == key:
print('YES')
break
else:
print('NO')
|
p02817 | s443750497 | Accepted | s, t = input().split()
print(t+s) |
p02791 | s238920874 | Accepted | n = int(input())
p = list(map(int, input().split()))
num = p[0]
ans = 1
for i in range(1, n):
if num >= p[i]:
ans += 1
num = p[i]
print(ans) |
p03699 | s296432889 | Accepted | import sys
n = int(input())
s_list = [int(input()) for _ in range(n)]
s_list.sort()
num_sum = sum(s_list)
if num_sum % 10 == 0:
for num in s_list:
if num % 10 != 0:
print(num_sum-num)
sys.exit()
else:
print(num_sum)
sys.exit()
print(0) |
p02552 | s916067108 | Accepted | x = int(input())
if x:
print(0)
else:
print(1) |
p03261 | s583865019 | Wrong Answer | N = int(input())
W = [input() for i in range(N)]
flag = True
if len(set(W)) == N:
for i in range(N - 1):
if W[i][-1] != W[i + 1][0]:
flag = False
break
if flag:
print('Yes')
else:
print('No')
|
p03095 | s118063689 | Accepted | n = int(input())
s = list(input())
mod = 10 ** 9 + 7
alph_count = [0] * 200
ans = 0
for i in s:
m = ord(i)
alph_count[m] += 1
c = 1
for j in range(97, 123):
if not m == j:
c *= alph_count[j] + 1
c %= mod
ans += c
ans %= mod
print(ans) |
p02946 | s905292451 | Wrong Answer | k,x = map(int,input().split())
minx,maxx = -1000000, 1000000
if minx + (k-1) > x:
l = [i for i in range(minx,minx+x+1)]
print("".join(str(l)))
elif maxx - (k-1) < x:
l = [i for i in range(maxx-x,maxx+1,-1)]
print("".join(str(l)))
else:
l = [i for i in range(x-(k-1),x+(k-1)+1)]
print("".join(str(l)))
|
p02628 | s435819202 | Wrong Answer | n,k = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
print(sum(p[0:n])) |
p03071 | s473820970 | Accepted | a,b=map(int,input().split())
print(max(2*a-1,2*b-1,a+b)) |
p03797 | s128651803 | Wrong Answer | s,c=map(int,input().split())
c=c-s*2
if c<=0: print(s)
else: print(c//4+s) |
p02888 | s349407682 | Accepted | from bisect import bisect, bisect_left
N=int(input())
L=list(map(int,input().split()))
L.sort()
ans = 0
for i in range(N-2):
a=L[i]
for k in range(i+1,N-1):
b=L[k]
t=bisect_left(L,a+b)
ans+=t-k-1
print(ans) |
p02646 | s290174992 | Accepted | a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(input())
if a > b:
a, b = a-v*t, b-w*t
# a = -1 * 10**9 if a < -1 * 10**9 else a
# b = -1 * 10**9 if b < -1 * 10**9 else b
if a <= b:
print('YES')
else:
print('NO')
else:
a, b = a+v*t, b+w*t
# a = 10**9 if a > 10**9 else a
# b = 10**9 if b > 10**9 else b
if a >= b:
print('YES')
else:
print('NO')
|
p03012 | s972517108 | Wrong Answer | n = int(input())
w = list(map(int, input().split()))
for i in range(n):
ans = min(10**100, abs(sum(w[:i]) - sum(w[i:])))
print(ans) |
p03994 | s453008127 | Wrong Answer | def main():
s = list(input())
k = int(input())
for i in range(len(s)):
mod = 26-(ord(s[i])-97)%26
if k >= mod:
k -= mod
s[i] = 'a'
if k == 0:
break
if k > 0:
mod = ((ord(s[-1])-97)%26+k)%26
s[-1] = chr(mod+97)
print(''.join(s))
if __name__ == '__main__':
main()
|
p02996 | s176968675 | Accepted | n = int(input())
task =[]
for i in range(n):
task.append(list(map(int,input().split())))
task.sort(key = lambda x:x[1])
total = 0
for j in range(n):
total += task[j][0]
if(total > task[j][1]):
print("No")
break
if(j == n-1):
print("Yes")
|
p03698 | s438381734 | Wrong Answer | import sys
sys.setrecursionlimit(300000)
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
S = input()
print('Yes' if len(set(list(S))) == len(S) else 'No')
|
p02761 | s752197435 | Accepted | n, m = map(int, input().split())
constrict = [list(map(int, input().split())) for _ in range(m)]
flag = False
for i in range(10**(n-1)-1, 10**n):
if len(str(i)) != n:
continue
is_correct = True
for j, k in constrict:
if str(i)[j-1] != str(k):
is_correct = False
break
if is_correct:
flag = True
print(i)
break
if not flag:
print(-1)
|
p03632 | s178671855 | Accepted | a,b,c,d = map(int, input().split())
if b<=c or d <=a:
print(0)
exit()
if a<=c and d<=b:
print(d-c)
elif a<=c and b<=d:
print(b-c)
elif c<=a and d<=b:
print(d-a)
elif c<=a and b<=d:
print(b-a) |
p02645 | s858339022 | Accepted | S = input()
print(S[:3]) |
p02640 | s552241231 | Accepted | x, y = map(int, input().split())
for i in range(x + 1):
s = i
t = x - i
# print(s, t)
if 2 * s + 4 * t == y:
print('Yes')
exit()
print("No")
|
p02657 | s162076588 | Accepted | a,b=map(int,input().split())
print(a*b) |
p03206 | s776429264 | Accepted | D = int(input())
if D == 25:
print('Christmas')
elif D == 24:
print('Christmas Eve')
elif D == 23:
print('Christmas Eve Eve')
elif D == 22:
print('Christmas Eve Eve Eve')
|
p03803 | s782824861 | Accepted | a,b = map(int,input().split())
if a==1:
a=14
if b==1:
b=14
if a>b:
print('Alice')
elif a<b:
print('Bob')
else:
print('Draw') |
p02888 | s638892346 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
l = list(map(int,input().split()))
l.sort()
c = 0
import bisect
for i in range(n):
for j in range(i+1,n):
ind = bisect.bisect_left(l,l[i]+l[j])
c += max((ind-j)-1 , 0)
print(c) |
p04029 | s463015329 | Accepted | n = int(input())
candy = 0
for i in range(n+1):
candy += i
print(candy) |
p02995 | s288427526 | Accepted | a,b,c,d = map(int,input().split())
cc = b//c -(a-1)//c
dd = b//d -(a-1)//d
#a,bの最大公約数
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
cd = lcm(c, d)
cdcd = b//cd -(a-1)//cd
print(b-a+1-cc-dd+cdcd) |
p02802 | s176613018 | Wrong Answer | n,m=map(int,input().split())
a=[0]*(n+1)
b=[0]*(n+1)
for i in range(m):
p,s=input().split()
p=int(p)
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n):
if a[i]==0:
b[i]==0
print(sum(a),sum(b)) |
p02699 | s425877231 | Accepted | S,W=list(map(int, input().split()))
if S>W:
print("safe")
else:
print("unsafe") |
p02947 | s291881430 | Wrong Answer | from collections import Counter
N = int(input())
S = [str(sorted(input())) for _ in range(N)]
C = Counter(S)
ans = 0
for v in C.values():
# ans += v * (v - 1) // 2
if v > 1:
if v == 2:
ans += 1
else:
ans += v
print(ans) |
p03419 | s384515606 | Wrong Answer | n,m = [int(i) for i in input().split()]
if 2 <= n and 2 <= m:
print((n-2)*(m-2))
elif 2 <= n:
print((n-2)*m)
elif 2 <= m:
print(n*(m-2))
else:
print(0) |
p03720 | s534972255 | Accepted | N,M=map(int,input().split())
way=[0]*(N+1)
for i in range(M):
a,b=map(int,input().split())
way[a]+=1
way[b]+=1
for i in range(N+1):
if i!=0:
print(way[i])
|
p02843 | s974277440 | Accepted | n=int(input())
dp=[0]*(10**5+1)
dp[0]=1
for i in range(n+1):
for j in range(100,106):
dp[i]=max(dp[i],dp[i-j])
if dp[n]==1:
print(1)
else:
print(0) |
p03377 | s458643622 | Accepted | A, B, X = map(int, input().split())
if 0 <= X - A <= B:
print("YES")
else:
print("NO") |
p03862 | s888636608 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split()))
last = a[0]
ans = 0
for i in range(1, n):
if last + a[i] > x:
num = last + a[i] - x
ans += num
last = max(0, a[i] - num)
else:
last = a[i]
print(ans)
|
p03030 | s869361507 | Wrong Answer | n = int(input())
l = [[i+1]+input().split() for i in range(n) ]
l.sort(key=lambda x: [x[1],-1*x[2]])
for i in range(n):
print(l[i][0]) |
p03745 | s286423723 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 1
status = 0
prev = a[0]
for i in a:
diff = i - prev
if diff == 0:
pass
elif diff > 0:
if status >= 0:
status = diff
else:
ans += 1
status = 0
else:
if status <= 0:
status = diff
else:
ans += 1
status = 0
prev = i
print(ans) |
p03487 | s106806472 | Wrong Answer | import numpy as np
N = int(input())
A = list(map(int,input().split()))
counter = 0
AN = set(A)
A = np.array(A)
for i in AN:
num = len(A[A < i])
counter += abs(num - i)
print(counter) |
p02775 | s348804175 | Accepted | n = str(input())
l = len(n)
c = 0
n = "00"+ n
dnow = int(n[l+1])
for i in range(l+1):
dnext = int(n[l-i])
if dnow <= 4:
c += dnow
elif dnow == 5:
if dnext <= 4:
c += 5
else:
dnext += 1
c += 5
elif dnow == 10:
dnext += 1
else:
c += 10 - dnow
dnext += 1
dnow = dnext
print(c) |
p03137 | s139405211 | Wrong Answer | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
n, m = na()
x = na()
x.sort()
d = [x[i] - x[i - 1] for i in range(1, m)]
d.sort()
print(sum(d[:m - n])) |
p02847 | s736191008 | Wrong Answer | l = ['MON','TUE','WED','THU','FRI','SAT','SUN']
s = input()
print(6 - l.index(s)) |
p02719 | s159922417 | Wrong Answer | from fractions import gcd
n,k=map(int,input().split())
if n == 1 or k == 1:
print(0)
else:
print(gcd(n,k)) |
p02832 | s983002479 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
bef=1
ans=0
for i in range(n):
if A[i]==bef:
bef+=1
ans+=1
print(n-ans)
|
p02766 | s933598580 | Accepted | import math
N,K=map(int,input().split())
ans = int(math.log(N,K)+1)
print(ans) |
p03624 | s982773464 | Accepted | S = set(list(input()))
A = set(list('abcdefghijklmnopqrstuvwxyz'))
ans = list(A-S)
if len(ans) == 0:
print('None')
else:
ans.sort()
print(ans[0]) |
p02787 | s641545835 | Accepted | import sys
h, n = list(map(int, input().split()))
INF = 10 ** 18
dp = [INF] * (20201)
dp[0] = 0
for line in sys.stdin:
a, b = map(int, line.split())
for i in range(10000):
if dp[i] == INF:
continue
dp[i + a] = min(dp[i + a], dp[i] + b)
print(min(dp[h:]))
|
p02801 | s499833846 | Accepted | C = input()
CC = chr(ord(C) + 1)
print(CC) |
p03086 | s557431254 | Wrong Answer | s = list(input())
l = len(s)
a=0
m=0
for i in range(l):
if s[i]=='A' or s[i]=='C' or s[i]=='G' or s[i]=='T':
a+=1
else:
a = max(m, a)
print(a) |
p02793 | s986195992 | Wrong Answer | from fractions import Fraction
n = int(input())
a = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
for i in range(n):
ans += Fraction(1, a[i])
print(ans.numerator % MOD) |
p02717 | s581603772 | Accepted | a = list(map(int, input().split()))
print(a[2],a[0],a[1]) |
p03838 | s884903452 | Accepted | x,y = map(int,input().split())
f = lambda x,y: y-x if y >= x else float('inf')
print(min(f(x,y), 1+f(-x,y), 2+f(-x,-y), 1+f(x,-y))) |
p02725 | s742160463 | Accepted | def resolve():
K, N = map(int, input().split())
A = tuple(map(int, input().split()))
diff_max = 0
A_sum = 0
for i in range(N):
if i == N-1:
diff = K-A[i]+A[0]
else:
diff = A[i+1] -A[i]
diff_max = max(diff_max, diff)
A_sum += diff
print(A_sum - diff_max)
if __name__ == '__main__':
resolve() |
p02995 | s881654124 | Accepted | from fractions import gcd
A,B,C,D=map(int,input().split())
A-=1
lcm=C*D//gcd(C,D)
print(B-B//C-B//D+B//lcm-(A-A//C-A//D+A//lcm)) |
p02598 | s154911914 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
def f(x):
cnt = 0
for a in A:
cnt += ceil(a / x) - 1
return True if cnt <= K else False
OK, NG = 10**9, 0
while OK - NG > 1:
mid = (OK + NG) // 2
if f(mid):
OK = mid
else:
NG = mid
print(OK)
|
p03338 | s125577980 | Accepted | _ = input()
S = input()
print(max([len(set(S[:i]) & set(S[i:])) for i in range(len(S))])) |
p02801 | s258149750 | Accepted | S = input()
print(chr(ord(S)+1))
|
p03493 | s225151866 | Accepted | import numpy as np
a,b,c = input()
#print(a)
#print(b)
#print(c)
s = np.zeros(3)
num = 0
if a == '1':
num = num + 1
if b == '1':
num = num + 1
if c == '1':
num = num + 1
print(num) |
p02629 | s724479632 | Wrong Answer | from string import ascii_lowercase
N = int(input())
s = list()
while N > 0:
m = N%26 - 1
s.append(ascii_lowercase[m])
N = int(N/26)
s.reverse()
s = ''.join(s)
print(s) |
p04031 | s623923447 | Accepted | n = int(input())
a = list(map(int, input().split()))
i = 0
m = 100
M = -100
s = 0
while i < n:
s += a[i]
i+=1
s1 = s//n
s2 = s1 + 1
i = 0
x1 = 0
x2 = 0
while i < n:
x1 += (s1-a[i])**2
x2 += (s2-a[i])**2
i+=1
if x1<x2:
ans = x1
else:
ans = x2
print(ans)
|
p02707 | s431584137 | Accepted | n = int(input())
A = [-1] + [int(x) - 1 for x in input().split(" ")]
resses = [0] * n
for i in range(1, n):
resses[A[i]] += 1
for res in resses:
print(res)
|
p03472 | s577789914 | Accepted | n,h = map(int,input().split())
a = []
b = []
for i in range(n):
a_,b_ = map(int,input().split())
a.append(a_)
b.append(b_)
b.sort(reverse = True)
max_a = max(a)
ans =0
for i in range(n):
ans +=1
if max_a > b[i]:
ans -=1
break
h -= b[i]
if h <= 0:
break
if h > 0:
d,f = divmod(h,max_a)
ans += d
if f != 0:
ans +=1
print(ans) |
p02972 | s126522790 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
def cnt_rem(ans, x):
i = 2
ret = 0
while (x + 1) * i <= n:
ret += ans[(x + 1) * i - 1]
i += 1
return ret
for i in range(n - 1, -1, -1):
cnt = cnt_rem(ans, i)
if cnt != a[i]:
ans[i] += 1
print(sum(ans))
for i in range(n):
if ans[i] == 1:
print(i + 1, end = " ") |
p03997 | s204569989 | Accepted | def main():
a,b,h = (int(input()) for _ in range(3))
print((a+b)*h//2)
if __name__ == '__main__':
main() |
p03360 | s627934910 | Accepted | List = sorted([int(i) for i in input().split(" ")],reverse=True)
K = int(input())
List[0] = List[0]*(2**K)
print(sum(List)) |
p03331 | s107493980 | Wrong Answer | def soma(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return soma(x)
def main():
n = int(input())
somad = soma(n)
for i in range(1, n):
soman = soma(i)+soma(n-i);
if(soman==somad):
break
print(soman,"\n")
main()
|
p02753 | s235964402 | Accepted | # -*- coding: utf-8 -*-
s = set(list(input()))
if len(s) == 1:
print('No')
else:
print('Yes')
|
p03327 | s353118630 | Accepted | n=int(input())
if n<1000:
print("ABC")
else:
print("ABD")
|
p02730 | s101686715 | Wrong Answer | s = input()
n = len(s)
top = s[:n//2]
under = s[n//2+1:n]
if s == s[::-1]:
if top == top[::-1]:
if under == under[::-1]:
print("Yes")
else:
print("No")
else:
print("No") |
p02602 | s165559747 | Wrong Answer | n,k=map(int,input().split())
a = list(map(int,input().split()))
zenki = a[k-1]
#print(zenki)
for i in range(k-1):
zenki *= a[k-2-i]
#print(zenki)
count = k
while count < n:
konki = (zenki / a[count-k] * a[count])
#print(konki)
if konki > zenki :print("YES")
else:print("NO")
zenki = konki
count += 1
|
p02712 | s569798587 | Wrong Answer | n = int(input())
ans = 0
for i in range(1,n):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) |
p02613 | s585848886 | Accepted | N= int(input())
flaga=0
flagw=0
flagt=0
flagr=0
for _ in range(N):
K = str(input())
if(K=='AC'):
flaga+=1
if(K=='WA'):
flagw+=1
if(K=='TLE'):
flagt+=1
if(K=='RE'):
flagr+=1
print("AC x "+str(flaga))
print("WA x "+str(flagw))
print("TLE x "+str(flagt))
print("RE x "+str(flagr)) |
p02628 | s258676547 | Accepted | R = lambda: map(int, input().split())
n, k = R()
print(sum(sorted(R())[:k]))
|
p02732 | s301449692 | Wrong Answer | n = int(input())
a =list(map(int,input().split()))
d = [0]*(n+1)
answer = 0
for i in range(n):
d[a[i]]+=1
for j in range(n):
answer+= int((d[j]*(d[j]-1))/2)
for k in range(n):
print(answer+1-(d[a[k]])) |
p02897 | s167795035 | Wrong Answer | x = int(input())
if x == 1:
print(1.0000000000)
elif x % 2 == 0:
print(0.5000000000)
else:
print(0.6000000000)
|
p03293 | s687509976 | Wrong Answer | s = list(input())
t = input()
ans = "No"
for i in range(len(s)):
s.append(s.pop(0))
print(s)
if "".join(s)==t:
ans = "Yes"
print(ans) |
p03524 | s171517731 | Wrong Answer | from collections import Counter
s = sorted(list(Counter(list(input())).values()))[::-1]
if len(s)<=2:
print("NO")
exit()
a = s[0]
for i in s:
if a==i or a==i+1:
continue
else:
print('NO')
else:
print("YES") |
p03639 | s532800046 | Accepted | def main():
N = int(input())
A = list(map(int, input().split()))
a4 = 0; a2 = 0
for a in A:
if a%2 == 0:
a2 += 1
if a%4 == 0:
a4 += 1
a2 -= a4
if N//2 <= a4:
print('Yes')
else:
if N - 2*a4 <= a2:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
p03261 | s282714143 | Accepted | n =int(input())
w = []
for i in range(n):
w.append(input())
for i in range(n - 1):
for j in range(i + 1, n):
if w[i] == w[j]:
print("No")
exit()
for i in range(n - 1):
if w[i][-1] != w[i + 1][0]:
print("No")
exit()
print("Yes") |
p02786 | s198232968 | Accepted | H = int(input())
ans = 0
enemy = 1
while H>1:
ans += enemy
enemy *= 2
H //= 2
ans += enemy
print(ans) |
p03160 | s288329122 | Wrong Answer | n = int(input())
*A, = map(int, input().split())
DP = [[0 for j in range(n+1)] for i in range(n+1)]
for l in range(1, n+1):
for i in range(n-l+1):
j = i+l
DP[i][j] = max(A[i]-DP[i+1][j], A[j-1]-DP[i][j-1])
print(DP[0][n])
|
p02729 | s379585527 | Accepted | a,b = map(int, input().split())
print(int((a*(a-1))/2 + (b*(b-1))/2)) |
p03286 | s304786784 | Accepted | n=int(input())
if n==0:
print(0)
exit()
ans=''
while n!=0:
q=n%(-2)
if q<0:
q+=2
ans+=str(q)
n-=q
n//=(-2)
print(ans[::-1]) |
p03339 | s977876072 | Wrong Answer | import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(input())
S = input().strip()
c = Counter(S)
ans = float("inf")
w_c = 0
for i in range(N):
tmp = c['E']
tmp += w_c
ans = min(ans, tmp)
if S[i] == 'W':
w_c += 1
else:
c['E'] -= 1
print(ans)
if __name__ == '__main__':
main()
|
p02553 | s296247267 | Accepted | a, b, c, d = map(int, input().split())
print(max(a*c, a*d, b*c, b*d)) |
p02836 | s310345997 | Accepted | S=input()
if len(S)%2==0:
S_mae=S[:len(S)//2]
S_ushiro=S[len(S)//2:]
else:
S_mae=S[:len(S)//2+1]
S_ushiro=S[len(S)//2:]
ans=0
for i in range(len(S_mae)):
if S_mae[-i-1]!=S_ushiro[i]:
ans += 1
print(ans)
|
p03854 | s930694590 | Wrong Answer | S = input()
while len(S)>0:
if S[-7:] == "deamer":
S = S[:-7]
elif S[-6:] == "eraser":
S = S[:-6]
elif S[-5:] == "dream":
S = S[:-5]
elif S[-5:] == "erase":
S = S[:-5]
else:
break
print("NO" if len(S)>0 else "YES") |
p03817 | s654359025 | Wrong Answer | x=int(input())
ans=2*(x//11)+((x%11)//6)+(x%11)%6
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.