problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03254 | s731245439 | Wrong Answer | N, x = [int(z) for z in input().split()]
children = [int(z) for z in input().split()]
children.sort()
sum = 0
for i in range(N):
sum += children[i]
if sum >= x:
print(i + 1)
break
elif i == N - 1:
print(N - 1)
|
p02953 | s806671248 | Wrong Answer | N=int(input())
H=list(map(int, input().split()))
no = False
for i in range(N-1):
# print(H[i],H[i+1])
if H[i]>H[i+1]+1:
no = True
break
elif H[i]==H[i+1]+1:
H[i] -= 1
#print(H)
if H != H.sort():
no = True
print(['Yes','No'][no]) |
p02595 | s561120206 | Accepted | from math import sqrt
n,d = map(int,input().strip().split())
cnt = 0
for i in range(n):
x,y = map(int,input().strip().split())
# print(x,y)
if x*x+y*y <= d*d:
# print(x,y)
cnt+=1
print(cnt) |
p03592 | s734507497 | Accepted | n,m,k = map(int,input().split())
for i in range(0,n+1):
for j in range(0,m+1):
if n*j+m*i-2*i*j == k:
print("Yes")
exit(0)
print("No")
|
p03107 | s482302984 | Wrong Answer | s = input()
blk = len(s)
while len(s) > 2:
s = s.replace("01","")
s = s.replace("10","")
print(blk - len(s))
|
p03438 | s069244587 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# print(N, A, B)
d1 = 0
d2 = 0
for i in range(N):
a = A[i]
b = B[i]
if a > b:
d1 += a - b
elif a < b:
d2 += b - a
# print(d1, d2)
if d1 * 2 > d2:
print('No')
else:
print('Yes')
|
p02866 | s367557405 | Wrong Answer | n = int(input())
d = map(int, input().split())
dist = [0] * n
mod = 998244353
dp = [0] * n
if next(d) == 0:
dp[0] = 1
dist[0] += 1
for i in d:
dist[i] += 1
for i in range(n-1):
dp[i+1] = (dp[i] * pow(dist[i], dist[i + 1], mod)) % mod
print(max(dp))
|
p02780 | s982997591 | Accepted | N,K=map(int,input().split())
P=[0]+list(map(int,input().split()))
S=[0]*(N+1)
for i in range(1,N+1):
S[i]=S[i-1]+P[i]
M=-1
for j in range(N-K+1):
M=max(M,S[j+K]-S[j])
print((M+K)/2)
|
p03665 | s223166744 | Accepted | N, P = map(int, input().split())
A = list(map(int, input().split()))
dp = [[0,0] for i in range(N+1)]
dp[0][0] = 1
for i in range(N):
rem = A[i] % 2
if rem == 0:
dp[i+1][0] = dp[i][0] * 2
dp[i+1][1] = dp[i][1] * 2
else:
dp[i+1][0] = dp[i][0] + dp[i][1]
dp[i+1][1] = dp[i][1] + dp[i][0]
print(dp[N][P])
|
p02705 | s318847490 | Wrong Answer | n = int(input())
print(n*3.14) |
p02970 | s747103600 | Accepted | n,d=map(int,input().split())
hitori=2*d+1
if n%hitori==0:
print(n//hitori)
else:
print(n//hitori+1) |
p03637 | s076487498 | Accepted | n = int(input())
a = list(map(int, input().split()))
even = sum([1 for i in a if i % 2 == 0])
odd = sum([1 for i in a if i % 2 != 0])
multiple4 = sum([1 for i in a if i % 4 == 0])
flag = False
if even - multiple4 == 0:
if multiple4 >= odd - 1:
flag = True
else:
if multiple4 >= odd:
flag = True
print('Yes') if flag else print('No')
|
p02633 | s195829807 | Wrong Answer | import math
X = 1
t = 360 - (180 - X)
g = math.gcd(t, 360)
print(360 * t // g // t)
|
p03037 | s648248608 | Wrong Answer | N_ID, M_gate = map(int, input().split())
mini = float('inf')
MAX = 0
for i in range(M_gate):
L, R = map(int, input().split())
MAX = max(MAX, L)
mini = min(mini, R)
answer = mini - MAX + 1
print(answer) |
p03261 | s110946957 | Accepted | N = int(input())
words = []
words.append(input())
for i in range(N-1):
word = input()
if word in words:
print('No')
break
else:
if word[0] != words[-1][-1]:
print('No')
break
else:
words.append(word)
if len(words) == N:
print('Yes') |
p04045 | s936786148 | Accepted | N,K = map(int,input().split())
D = set(input().split())
while len(set(str(N))&D)>0:
N+=1
print(N) |
p02789 | s227506293 | Wrong Answer | #input
a, b= map(int, input().split())
if a > b:
B = ""
for i in range(a):
B += str(b)
print(B)
elif a < b:
A = ""
for i in range(b):
A += str(a)
print(A)
else:
C = ""
for i in range(a):
C += str(a)
print(C) |
p03986 | s156281382 | Accepted | x = str(input())
cnt = 0
tmp = 0
for i in x:
if i == 'T':
if tmp > 0:
tmp -= 1
else:
cnt += 1
else:
tmp += 1
else:
print(cnt + tmp)
|
p02711 | s372628628 | Accepted | x = input()
if "7" in x:
print("Yes")
else:
print("No") |
p02624 | s688640614 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1):
for j in range(i, N+1, i):
ans += j
print(ans)
|
p03324 | s392357651 | Accepted | D, N = map(int, input().split())
if D > 0:
if N < 100:
print( N * 100**D )
else:
print( 101 * 100**D )
if D == 0:
if N < 100:
print(N)
else:
print(101)
|
p03627 | s114384338 | Accepted | from collections import defaultdict
N = int(input())
arr = list(map(int, input().split()))
a_set = sorted(set(arr), reverse=True)
a_dict = defaultdict(int)
for num in arr:
a_dict[num] += 1
a, b = 0, 0
for num in a_set:
if a_dict[num] > 3 and a == 0:
a, b = num, num
break
elif a_dict[num] > 1 and a == 0:
a = num
elif a_dict[num] > 1:
b = num
break
print(a * b)
|
p03331 | s944140510 | Accepted | def dig_sum(N):
ans=0
while N>0:
ans+=N%10
N=N//10
return ans
N=int(input())
ans=100
for i in range(1,N):
tmp=dig_sum(i)+dig_sum(N-i)
if tmp<ans:
ans=tmp
print(ans)
|
p02747 | s264845215 | Accepted | S = input()
HI = "hi"
if S == "hi" or S == "hihi" or S == "hihihi" or S == "hihihihi" or S == "hihihihihi":
print("Yes")
else:
print("No") |
p03387 | s460671840 | Wrong Answer | a=[int(i) for i in input().split()]
a.sort()
print(a)
ans=0
while a[1]!=a[2]:
a[1]+=1
a[0]+=1
ans+=1
if a[1]%2==a[0]%2:
ans+=(a[1]-a[0])//2
else:
ans+=(a[1]-a[0])+1
print(ans)
|
p02683 | s609144345 | Accepted | N,M,X = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in range(1<<N):
tmp = [0]*(M+1)
for j in range(N):
if i&(1<<j)==0: continue
for k,l in enumerate(A[j]):
tmp[k] += l
if all(e>=X for e in tmp[1:]):
ans = min(ans, tmp[0])
if ans==float('inf'):
ans = -1
print(ans) |
p02957 | s292910280 | Wrong Answer | A,B = map(int,input().split())
print((A+B)/2) if (A+B) % 2 == 0 else print('IMPOSSIBLE') |
p02911 | s288408049 | Wrong Answer | n, k, q = map(int, input().split())
answers = []
for _ in range(q):
answers.append(int(input()))
cnt_list = [(k-q)]*n
if q < k:
for _ in range(n):
print('Yes')
else:
for i in answers:
cnt_list[i-1] += 1
for i in cnt_list:
print('Yes') if i > 0 else print('No') |
p03095 | s473242118 | Wrong Answer | from collections import Counter
n = int(input())
c = Counter(input())
ans = 1
for k,v in c.items():
ans *= (v+1)
print(ans-1) |
p03239 | s929143816 | Wrong Answer | N, T=map(int, input().split())
aux, j, k=[0, 0], 0, 0
for i in range(N):
c, t = map(int, input().split())
if(T==t):
aux[0],aux[1]=c, t
k+=1
elif(k==0):
if (j == 0 and t<=T):
aux[0],aux[1]=c, t
j+=1
elif(aux[1]>t):
aux[0],aux[1]=c, t
if (aux[1]==0):
print("TLE")
else:
print(aux[0]) |
p03281 | s437725956 | Accepted | def yaku(n):
A = []
for i in range(1,int(n**0.5)+1):
if n%i==0:
A.append(i)
A.append(n//i)
return len(A)
N = int(input())
cnt = 0
for i in range(1,N+1,2):
if yaku(i)==8:
cnt += 1
print(cnt) |
p03282 | s220805136 | Accepted | n = input()
k = int(input())
ans = 1
for i in range(k):
if n[i] != "1":
ans = n[i]
break
print(ans)
|
p04020 | s611686752 | Accepted | n=int(input())
ab = []
for _ in range(n):
a=int(input())
ab.append(a)
ans = 0
for i in range(n):
ans += ab[i]//2
if i == n-1:
break
elif ab[i]%2 == 1 and ab[i+1] > 0:
ans += 1
ab[i+1] -= 1
print(ans) |
p02607 | s736938448 | Wrong Answer | #! python3
# coding:utf-8
n = int(input())
numlist = list(map(int,input().split()))
cnt=0
for i in range(len(numlist)):
if (i%2==1) and (numlist[i]%2==1):
cnt+=1
print(cnt)
|
p02727 | s640975669 | Accepted | x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
eat = p[:x] + q[:y] + r
eat.sort(reverse=True)
ans = eat[:x+y]
print(sum(ans)) |
p02681 | s759488811 | Wrong Answer | s= str(input())
t= str(input())
if len(t) == len(s) + 1 and len(s) >=1 and len(s) <= 10 and s.islower() and t.islower():
for i in range(len(s)):
if s[i]!=t[i]:
print("No")
break
print("Yes")
else:
print("No") |
p03359 | s690558166 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b = map(int, readline().split())
print(a if a <= b else a-1)
|
p02582 | s894111984 | Accepted | s = input()
cnt = 0
if 'RRR' in s:
print(3)
elif 'RR' in s:
print(2)
elif 'R' in s:
print(1)
else:
print(0)
|
p02802 | s040839981 | Wrong Answer | N, M = map(int, input().split())
AC = [False for _ in range(N)]
n_AC = 0
n_WA = 0
for _ in range(M):
p, S = input().split()
p = int(p) - 1
if not AC[p]:
if S == "AC":
AC[p] = True
n_AC += 1
elif S == "WA":
n_WA += 1
else:
raise ValueError
print(n_AC, n_WA) |
p03145 | s504488802 | Wrong Answer | x,y,z= map(int,input().split())
print(x*y/2) |
p03385 | s173155111 | Wrong Answer | s = str(input())
if s[0] != s[1] and s[0] != s[2]:
print('Yes')
else:
print('No') |
p02711 | s560450193 | Accepted | N=input()
if '7' in N:
print('Yes')
else:
print('No') |
p02939 | s872454743 | Accepted | S = input()
check = now = ''
ans = 0
for s in S:
now += s
if check != now:
ans += 1
now, check = '', now
print(ans) |
p02909 | s492922792 | Wrong Answer | # 今日の天気を入力
today_weather = input()
# 今日の天気から明日の天気をSunny,Cloudy,Rainyの周期で予測して出力
if today_weather == "Sunny":
print("Cloudy")
elif today_weather == "Cloudy":
print("Rainy")
else:
print("Rainy") |
p02779 | s596838651 | Accepted | n = int(input())
nums = set(input().split())
if n == len(nums):
print("YES")
else:
print("NO") |
p02700 | s346538437 | Wrong Answer | a,b,c,d = map(int,input().split())
import math
if math.ceil(c/b)>=math.ceil(a/d):
print('Yes')
else:
print('None') |
p02829 | s123802087 | Accepted | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
a = int(input())
b = int(input())
print(6-a-b) |
p02603 | s201498580 | Accepted |
# D Road to Millionaire
N = int(input())
A = list(map(int, input().split()))
i = 0
M =1000
while i in range(N - 1):
if A[i] >= A[i+1]:
i = i + 1
else:
m = (A[i+1] - A[i]) * (M // A[i])
M = M + int(m)
i = i + 1
print(M) |
p02664 | s766834911 | Accepted | t = list(input())
for i in range(len(t)):
if t[i] == "?":
t[i] = "D"
t = "".join(t)
print(t)
|
p02935 | s610403453 | Wrong Answer | N = int(input())
D = sorted([int(i) for i in input().split()])
D = [D[i]*2**max(0,i-1) for i in range(N)]
print(D)
print(sum(D)/2**(N-1)) |
p02761 | s195649863 | Wrong Answer | n,m = map(int,input().split())
s = []
c = []
ans = [0]*n
for _ in range(m):
st,ct = map(int,input().split())
s.append(st)
c.append(ct)
f = 1
for i in range(m):
if s[i] == 1 and c[i] == 0:
f = 0
break
if ans[s[i]-1] != 0 and ans[s[i]-1] != c[i]:
f = 0
break
ans[s[i]-1] = c[i]
if f == 0:
print(-1)
else:
print(''.join(map(str,ans))) |
p03836 | s117028675 | Wrong Answer | sx, sy, tx, ty = map(int, input().split())
ans = []
for _ in range(tx-sx):
ans.append("R")
for _ in range(ty-sy):
ans.append("D")
for _ in range(tx-sx):
ans.append("L")
for _ in range(ty-sy):
ans.append("U")
ans.append("U")
for _ in range(tx-sx+1):
ans.append("R")
for _ in range(ty-sy+1):
ans.append("D")
ans.append("L")
ans.append("D")
for _ in range(tx-sx+1):
ans.append("L")
for _ in range(ty-sy+1):
ans.append("U")
ans.append("R")
print("".join(ans)) |
p02772 | s943625385 | Accepted | n = int(input())
ls = list(map(int, input().split()))
for i in range(n):
if ls[i] % 2 == 1:
if i == n - 1:
print("APPROVED")
elif ls[i] % 2 == 0:
if ls[i] % 3 == 0 or ls[i] % 5 == 0:
if i == n - 1:
print("APPROVED")
else:
print("DENIED")
break |
p03211 | s874386246 | Accepted | s=input();print(min(abs(int(s[i:i+3])-753)for i in range(len(s)-2))) |
p04034 | s195754537 | Accepted | # B - Box and Ball
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,m=nm()
rb=[False]*n
rb[0]=True
ball=[1]*n
for i in range(m):
x,y=nm()
x-=1
y-=1
ball[x]-=1
ball[y]+=1
if rb[x]==True:
rb[y]=True
if ball[x]==0:
rb[x]=False
ans=0
for r in rb:
if r:
ans+=1
print(ans)
|
p02688 | s990206934 | Accepted | x=input()
x_list=x.split()
N=int(x_list[0])
K=int(x_list[1])
Z=set()
for i in range(K):
s=int(input())
c=input()
c_list=c.split()
for r in c_list:
Z.add(r)
print(N-len(Z))
|
p03696 | s523565347 | Accepted | n = int(input())
x = list(input())
sta = 0
left = 0
for i in range(n):
if x[i] == '(':
sta += 1
else:
if sta == 0:
left += 1
else:
sta -= 1
s = []
for i in range(left):
s.append('(')
for i in range(n):
s.append(x[i])
for i in range(sta):
s.append(')')
print(''.join(s)) |
p03673 | s297965224 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
a1 = []
a2 = []
for i in range(n):
if i % 2 == 0:
a1.append(a[i])
else:
a2.append(a[i])
if n % 2 == 0:
a2.reverse()
print(*a2+a1)
else:
a1.reverse()
print(*a1+a2)
|
p02790 | s126196482 | Accepted | n,m=map(int, input().split())
if n>=m:
for i in range(n):
print(m, end="")
else:
for i in range(m):
print(n, end="") |
p03105 | s749195969 | Accepted | A,B,C=map(int,input().split())
print(min(C,B//A)) |
p03137 | s052852893 | Accepted | import numpy as np
n,m = map(int, input().split())
X = sorted(np.array(input().split(), dtype = np.int64))
X = sorted(np.diff(X))
if m-n >= 0:
ans = sum(X[:m-n])
else:
ans = 0
print(ans) |
p03838 | s860759514 | Accepted | x, y = map(int, input().split())
res = 99999999999999
# そのまま
c = y - x
if c >= 0:
res = min(res, c)
# 最初に1かい押す
c = y - (-x)
if c >= 0:
res = min(res, c + 1)
# 最後に1かい押す
c = (-y) - (x)
if c >= 0:
res = min(res, c + 1)
# 2回押す
c = (-y) - (-x)
if c >= 0:
res = min(res, c + 2)
print(res) |
p03076 | s481259361 | Wrong Answer | import itertools
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
def time(n):
t = 0
if n % 10 == 0:
t = 0
else:
t = 10 - n % 10
return t
dic = {a: time(a), b:time(b), c:time(c), d:time(d), e:time(e)}
dic = sorted(dic.items(), key=lambda x:x[1])
dic = list(itertools.chain.from_iterable(dic))
print(sum(dic[:-1])) |
p03131 | s220628838 | Accepted | k, a, b = (int(x) for x in input().split())
if b - a <= 1 or k <= a: print(1+k)
else:
k -= a - 1
div_2 = k // 2
m = k % 2
print((b - a) * div_2 + m + a) |
p02778 | s918602072 | Wrong Answer | S = input()
print(S)
print("x"*len(S))
|
p03817 | s375467525 | Accepted | N = int(input())
def solve(N):
if 6 >= N:
return 1
ans = 0
a = (N // 11) * 2
b = N % 11
if b == 0:
ans = a
elif 0 < b <= 6:
ans = a + 1
else:
ans = a + 2
return ans
print(solve(N)) |
p03657 | s812527535 | Wrong Answer | A,B = map(int,input().split())
if A >= 3 or B >= 3 or A + B >= 3 :
print('Possible')
else:
print('Impossible') |
p02719 | s967028708 | Accepted | a,b = map(int, input().split())
if abs(a-b) > a:
print(a)
else:
if a%b == 0:
print(0)
else:
print(abs(a%b-b)) |
p02723 | s600852992 | Wrong Answer | def main():
s = input().strip()
if s[2] == s[3] and s[4] == s[5]:
print('True')
else:
print('False')
if __name__ == '__main__':
main()
|
p03379 | s412583378 | Accepted | n=int(input())
x=list(map(int,input().split()))
s=sorted(x)
b1=s[n//2-1]
b2=s[n//2]
for v in x:
print(b2 if v<b2 else b1)
|
p02802 | s293907487 | Wrong Answer | N,M = map(int,input().split())
P = [input().split() for m in range(M)]
S = []
a = 0
for p,s in P:
if p not in S:
if s=="AC":
S.append(p)
else:
a+=1
print(len(S),a) |
p02854 | s579825103 | Accepted | N = int(input())
a = list(map(int, input().split()))
right = sum(a)
left = 0
ans = float("inf")
for i in a:
left += i
right -= i
# print(right-left)
ans = min(ans, abs(right-left))
print(ans) |
p02711 | s950909165 | Wrong Answer | string=input()
t=False
for i in range (3):
if string[i]=="7":
t=True
if t==True:
print("YES")
else:
print("NO") |
p03379 | s433876350 | Accepted | n = int(input())
s = list(map(int, input().split()))
sx = sorted(s)
a = sx[(n//2)-1]
b = sx[n//2]
for i in s:
if i <= a:
print(b)
else:
print(a) |
p03252 | s430673408 | Accepted | s=input()
t=input()
import sys
m=[-1]*26
mrev=[-1]*26
for i,j in enumerate(s):
x=ord(j)-ord('a')
y=ord(t[i])-ord('a')
if m[x]==-1:
m[x]=y
elif m[x]!=y:
print('No')
sys.exit()
for i,j in enumerate(t):
x=ord(j)-ord('a')
y=ord(s[i])-ord('a')
if mrev[x]==-1:
mrev[x]=y
elif mrev[x]!=y:
print('No')
sys.exit()
print('Yes')
|
p04012 | s105747315 | Wrong Answer | s = input()
d = {}
for letter in s:
if letter in d:
d[letter] += 1
else:
d[letter] = 1
flag = 1
for key in d:
if d[key] % 2 != 0:
print("No")
flag = 0
if(flag == 1):
print("Yes")
|
p02778 | s931078830 | Accepted | S, a = input(), ""
for x in range(len(S)):
a += "x"
print(a) |
p03162 | s838683451 | Accepted | n = int(input())
dp = [[0 for _ in range(3)] for _ in range(n+1)]
ls = [[1,2],[0,2],[0,1]]
for i in range(1,n+1):
day = list(map(int,input().split()))
dp[i][0] = day[0] + max(dp[i-1][1],dp[i-1][2])
dp[i][1] = day[1] + max(dp[i-1][0],dp[i-1][2])
dp[i][2] = day[2] + max(dp[i-1][0],dp[i-1][1])
print(max(dp[n]))
|
p03951 | s622320670 | Accepted | n = int(input())
s = list(input())
t = list(input())
ans = 0
for i in range(n):
ans = 0
if t[n - i - 1] == s[-1]:
for j in range(n - i - 1):
if s[n - 1 - j] == t[n - i - 1 - j]:
continue
else:
ans = 1
if ans == 0:
print(len(s + t[n - i :]))
break
else:
ans = 1
if ans == 1:
print(len(s + t)) |
p02712 | s865356039 | Wrong Answer | N = int(input())
Sum = (1+N)*N/2
Fizz = ((1+N//3)*N//3)/2*3
Buzz = ((1+N//5)*N//5)/2*5
FizzBuzz = ((1+N//15)*N//15)/2*15
print (int(Sum-Fizz-Buzz+FizzBuzz)) |
p02720 | s017360617 | Wrong Answer | K = int(input())
a = []
def dfs(x):
if x > 3234566667:
return
a.append(x)
for i in range(10):
if abs(x%10-i) <= 1:
dfs(x*10+i)
for i in range(1,11):
dfs(i)
a = sorted(a)
print(a[K-1]) |
p03632 | s925751844 | Wrong Answer | s = input().split()
a = int(s[0])
b = int(s[1])
c = int(s[2])
d = int(s[3])
answer = 0
if a < c and d < b:
answer = d - c
elif c < a and b < d:
answer = b - a
elif c > b or a > d:
answer = 0
elif b > c:
answer = b - c
elif d > a:
answer = d - a
print(answer) |
p02753 | s787459114 | Wrong Answer | if len(set(input())) >= 2:
print('yes')
else:
print('No') |
p03427 | s485054612 | Wrong Answer | n = input()
if len(n) == 1:
print(n)
exit()
ok = False
ans = ""
for i, c in enumerate(n):
x = int(c)
if x == 9:
ans += "9"
else:
if ok:
ans += "9"
else:
if i == len(n)-1:
ans = ans[:-1]
ans += str(int(n[i-1])-1)
ans += "9"
else:
ans += str(x-1)
ok = True
t = 0
for c in ans:
x = int(c)
t += x
print(t) |
p03827 | s554244066 | Accepted | n = int(input())
s = input()
ans = 0
mx = 0
for i in range(n):
if s[i] == 'I':
ans += 1
if ans >= mx:
mx = ans
else:
ans -= 1
print(mx)
|
p03556 | s970028887 | Wrong Answer | n=int(input())
a=0
for i in range(n):
if i**2>=n:
break
else:
a=i**2
print(a) |
p03997 | s074744356 | Accepted | a = int(input())
b = int(input())
c = int(input())
print(int((a+b)*c/2)) |
p02939 | s462073223 | Accepted | s=list(input())
a=0
t='?'
ch=0
l=len(s)
for i in range(l):
if ch==1:
ch=0
continue
if s[i]!=t:
a+=1
t=s[i]
else:
if i<l-1:
t=s[i]+s[i+1]
a+=1
ch=1
print(a)
|
p03494 | s278147121 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 1000000
for i in range(n):
counter = 0
while(a[i] % 2 == 0):
a[i] //= 2
counter += 1
ans = min(ans,counter)
print(ans) |
p03657 | s746003254 | 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') |
p02664 | s230435170 | Accepted | T = input()
print(T.replace("?", "D")) |
p03730 | s849294206 | 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) |
p02717 | s991682444 | Accepted | x, y, z = map(int, input().split())
X = z
Y = x
Z = y
print(X,Y,Z) |
p02708 | s515166147 | Accepted | def solve():
N, K = map(int, input().split())
mod = 10**9+7
ans = 0
for k in range(K,N+2):
ans += (N+N-k+1)*k//2-k*(k-1)//2+1
ans %= mod
return ans
print(solve()) |
p02939 | s399771019 | Accepted | c = 0
s = f = ""
for i in input():
s += i
if s != f:
c += 1
s, f = "", s
print(c) |
p03836 | s099025153 | Wrong Answer | sx,sy,tx,ty = map(int,input().rstrip().split(" "))
dx = tx - sx
dy = ty-sy
ans = ""
ans += "U"*dx + "U" * dy
ans += "L" * dx + "D" * dy
ans += "D" + "R" * (dx + 1) + "U" * (dy + 1) + "L"
ans += "U" + "L" * (dx + 1) + "D" * (dy + 1) + "R"
print(ans) |
p02693 | s068690142 | Accepted | k = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
if i % k == 0:
print('OK')
break
else:
print('NG')
|
p02640 | s302640946 | Wrong Answer | a, b = map(int, input().split())
c = 0
for i in range(a):
if (i*2) + (a-i)*4 == b:
c+=1
if c>0:
print("Yes")
elif a==1 and ((b==2) or (b==4)):
print("Yes")
else:
print("No") |
p03486 | s614691461 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-07-29 16:31:41 +0900
# LastModified: 2020-07-29 16:38:58 +0900
#
import os
import sys
# import numpy as np
# import pandas as pd
def main():
S = sorted(input())
T = sorted(input(), reverse=True)
for s, t in zip(S, T):
if s < t:
print("Yes")
return
if len(S) < len(T):
print("Yes")
return
print("No")
if __name__ == "__main__":
main()
|
p02761 | s052290860 | Wrong Answer | n, m = map(int, input().split())
ans = ["#"]*n
for i in range(m):
s, c = map(int, input().split())
if ans[s-1] == "#" or ans[s-1] == c:
ans[s-1] = c
else:
print(-1)
exit()
if ans[0] == "#":
ans[0] = 1
elif ans[0] == 0:
print(-1)
exit()
print("".join(map(str, ans)).replace("#", "0")) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.