problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03035 | s018398956 | Accepted | A,B=map(int,input().split())
if A>=13:
print(B)
elif 6<=A<=12:
print(int(B/2))
else:
print(0) |
p03095 | s347578822 | Accepted | from collections import Counter
n = int(input())
s = list(input())
mod = 10**9+7
c = Counter(s)
ans = 1
for v in c.values():
ans *= v+1
ans %= mod
print((ans-1)%mod) |
p02862 | s763771155 | Accepted | def mod_inv(a, m):
return pow(a, m-2, m)
X, Y = map(int, input().split())
MOD = 10 ** 9 + 7
if (X + Y) % 3:
print(0)
exit()
n = (X + Y) // 3
nx, ny = X - n, Y - n
if nx < 0 or ny < 0:
print(0)
exit()
ans = 1
for i in range(nx + 1, nx + ny + 1):
ans = ans * i % MOD
for i in range(1, ny + 1):
ans = ans * mod_inv(i, MOD) % MOD
print(ans)
|
p02597 | s893508459 | Wrong Answer | N=int(input())
c=list(input())
c1=c[::-1]
ans=0
w_index=[i for i, x in enumerate(c) if x=="W"]
r_index=[i for i, x in enumerate(c1) if x=="R"]
for i in range(len(r_index)):
r_index[i]=N-1-r_index[i]
if "R" in c and "W" in c:
for i in range(min(len(r_index),len(w_index))):
w=w_index[ans]
r=r_index[ans]
if w-r==1:
ans=ans-1
break
ans+=1
print(ans) |
p03037 | s081278232 | Accepted | N,M = map(int,input().split())
L=[]
R=[]
for i in range(M):
l,r = map(int,input().split())
L.append(l)
R.append(r)
Rm=min(R)
LM=max(L)
if Rm-LM >= 0:
print(Rm-LM+1)
else:
print(0) |
p02832 | s423002372 | Accepted | import sys
N = int(input())
A = list(map(int,input().split()))
if A.count(1) == 0:
print(-1)
sys.exit()
else:
cnt = 0
for a in range(len(A)):
if A[a] == cnt+1:
cnt += 1
print(len(A)-cnt)
|
p02595 | s884271774 | Accepted | n, d = map(int, input().split())
xy = []
for i in range(n):
x, y = map(int, input().split())
xy.append([x, y])
count = 0
for pq in xy:
if (pq[0]**2 + pq[1]**2) <= d**2:
count+=1
print(count) |
p03107 | s920865481 | Accepted | s = input()
a = s.count('1')
b = s.count('0')
print(2*min(a,b)) |
p03544 | s978988584 | Accepted | N=int(input())
a,b=2,1
for i in range(N):
a,b=b,a+b
print(a) |
p03745 | s999810869 | Wrong Answer | from sys import stdin
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
#長さが2以下の数列に関しては絶対答えは1になる
if n <= 2:
print(1)
exit()
#そうでない場合
count = 1
flag = 0
for i in range(1,n-1):
if flag == 1:
flag = 0
continue
else:
if li[i-1] > li[i] < li[i+1] or li[i-1] < li[i] > li[i+1]:
flag = 1
count += 1
print(count) |
p02783 | s070165673 | Wrong Answer | H, A = map(int, input().split())
a = round(H/A)
if a != 0: a += 1
print(a) |
p03281 | s242664543 | Wrong Answer | n=int(input())
if n<105:
print(0)
elif 105<=n and n<135:
print(1)
elif 135<=n and n<189:
print(2)
else:
print(3)
|
p03795 | s822559347 | Wrong Answer | n = int(input())
k = n/15
x = 800*n - 200*k
print(x) |
p03293 | s916785069 | Accepted | S = input()
T = input()
N = len(S)
ans = "No"
for i in range(N):
if S == T:
ans = "Yes"
break
S = S[1:] + S[0]
print(ans) |
p02951 | s148803689 | Wrong Answer | a = list(map(int, input().split()))
print(a[2]-(a[0]-a[1])) |
p03407 | s291063858 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print("Yes")
else:
print("No") |
p02935 | s370022095 | Wrong Answer | N = int(input())
v = list(map(int, input().split()))
v.sort()
ans = 0
for i in range(N - 1):
v1 = v.pop(0)
v2 = v.pop(0)
vv = (v1 + v2) / 2
v.insert(0, vv)
print(int(v[0])) |
p03730 | s847519749 | Wrong Answer | a, b, c = list(map(int, input().split()))
i = 1
while(True):
if (a * i) % b == 0:
print('No')
break
elif (a * i) % b == c:
print('Yes')
break
i += 1
|
p03672 | s463192976 | Wrong Answer | N = str(input())
cnt = 0
while True:
N = N[0:-1]
cnt += 1
if len(N) % 2 == 0:
if N[0:int(len(N)/2)] == N[int(len(N)/2):]:
break
print(cnt)
|
p02548 | s135824903 | Wrong Answer | n = int(input())
s = 0
for i in range(1, n):
for j in range(1, n-i+1):
if (n-1) % j == 0:
s += 1
print(s) |
p02700 | s250637352 | Accepted | inp = input()
inlist = inp.split()
tD = int(inlist[0])
tA = int(inlist[1])
aD = int(inlist[2])
aA = int(inlist[3])
tlife = tD
alife = aD
while(True):
alife -= tA
if( alife <= 0):
print("Yes")
break
tlife -= aA
if( tlife <= 0):
print("No")
break |
p02772 | s854015571 | Accepted | N = int(input())
A = list(map(int, input().split()))
flag = False
el = []
for i in range(N):
if A[i]%2 == 0:
el.append(A[i])
flag = True
for val in el:
if val%3 != 0 and val%5 != 0:
flag = False
if flag:
print("APPROVED")
else:
print("DENIED") |
p03455 | s365445750 | Wrong Answer | a,b=map(int,input().split())
def keisan(a,b):
if a * b % 2 == 0:
print("Even")
else:
print("odd")
keisan(a,b) |
p02583 | s766908515 | Wrong Answer | N = int(input())
Klist = (input().strip()).split(" ")
Llist = list(map(int, Klist))
#print(Llist)
cnt = 0
for i in range (0, N):
for j in range (i+1, N):
for k in range (j+1, N):
if abs(Llist[j] - Llist[k]) < Llist[i] < Llist[j] + Llist[k]:
cnt += 1
print(cnt)
|
p02633 | s515848941 | Accepted | from math import gcd
X = int(input())
lcm = X * 360 // gcd(X, 360)
print(lcm//X) |
p02601 | s951629494 | Accepted | import sys
input = sys.stdin.readline
a,b,c = map(int,input().split())
k = int(input())
while a >= b:
b *= 2
k -= 1
if k < 0:
print("No")
else:
for i in range(k):
c *= 2
if b < c:
print("Yes")
else:
print("No") |
p03852 | s177520412 | Accepted | c = input()
vowels = 'aeiou'
if c in vowels:
print('vowel')
else:
print('consonant') |
p03481 | s138302458 | Accepted | X, Y = map(int, input().split())
ans = 1
while X * 2**ans <= Y:
ans += 1
print(ans) |
p03105 | s173247176 | Accepted | a,b,c=map(int,input().split())
sound = b//a
print(sound if sound <= c else c)
|
p03241 | s713543716 | Wrong Answer | n, m = map(int,input().split())
if m//n == m/n:
print(m//n)
else:
ans = 1
for i in range(2,min(m,10**5+1)):
if m-i*(n-1) < i:
break
if m%i == 0:#from (M-i*(N-1))%i==0
ans = i
print(ans) |
p02831 | s193067371 | Accepted | import fractions
a,b=map(int,input().split())
g=fractions.gcd(a,b)
print((a*b)//g) |
p02696 | s965813645 | Accepted | # coding: utf-8
A,B,N=map(int,input().split())
min_x = 1
max_x = N
def f(x):
y = (A*x)//B - A*(x//B)
return y
ans=f(min(B-1,N))
print(ans) |
p02823 | s989027463 | Accepted | n,a,b = map(int,input().split())
if abs(a-b)%2:
print(abs(a-b)//2+1+min((abs(1-a),abs(n-a),abs(1-b),abs(n-b))))
else:
print(abs(a-b)//2)
|
p02677 | s880531395 | Accepted | import math
a,b,h,m = map(int,input().split())
ans = 0
m_r = m/5
# print(m_r)
h_r = h + m/60
# print(h_r)
# print((h_r - m_r)/12*360)
reg = (h_r - m_r)/12*360
ans = math.sqrt(a**2 + b**2 -2*a*b*math.cos(math.radians(reg)))
print(ans) |
p04045 | s138382228 | Accepted | #C - こだわり者いろはちゃん
#input N K
N,K = list(map(int,input().split()))
#input D1 ~ Dk as set D
D = set(map(int,input().split()))
while True:
#整数Nの桁に含まれる整数の集合 set digit_set
digit_set = set(map(int,str(N)))
#共通部分が空
if len(D & digit_set) == 0 :
break
N += 1
print(N)
|
p03627 | s552468556 | Wrong Answer | import heapq
n=int(input())
s=set()
q=[0,0]
for a in map(int,input().split()):
if a>q[0]:
heapq.heapreplace(q,a)
print(q[0]*q[1]) |
p02633 | s646227459 | Accepted |
X = int(input())
ans = 0
x = 0
while((360-x) % X != 0):
ans += (360 - x) // X + 1
x = X - (360-x) % X
ans += (360-x) // X
print(ans)
|
p02988 | s195517303 | Accepted | n = int(input())
P = list(map(int,input().split()))
ans = 0
for i in range(1, n - 1):
now = P[i]
tmp = [P[i - 1], P[i], P[i + 1]]
tmp.sort()
if now == tmp[1]:
ans += 1
print(ans) |
p02773 | s042684999 | Accepted | N = int(input())
s = [None for _ in range(N)]
for i in range(N):
s[i] = input()
s.sort()
max_list = []
max_v = 1
count = 1
prev = s[0]
for i in range(1, N):
# print(s[i], prev, count)
if s[i] == prev:
count += 1
else:
if max_v == count:
max_list.append(prev)
elif max_v < count:
max_list = [prev]
max_v = count
count = 1
prev = s[i]
if max_v == count:
max_list.append(prev)
elif max_v < count:
max_list = [prev]
max_v = count
for k in max_list:
print(k)
|
p02958 | s486814376 | Accepted | n = int(input())
p = list(map(int, input().split()))
q = sorted(p)
cnt = 0
for i in range(n):
if p[i] != q[i]:
cnt += 1
if cnt == 0 or cnt == 2:
print("YES")
else:
print("NO") |
p04043 | s116342801 | Accepted | i = list(map(int, input().split()))
li = [i[0], i[1], i[2]]
yn = "NO"
if li.count(5) == 2:
if li.count(7) == 1:
yn = "YES"
print(yn) |
p02753 | s535590600 | Wrong Answer | x = input()
if x[0]==x[1]==x[2]:
print("Yes")
else:
print("No")
|
p02628 | s847499559 | Accepted | N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
print(sum(A[:K])) |
p03239 | s983744288 | Wrong Answer | n,t=map(int,input().split())
c=0
for _ in range(n):
a,b=map(int,input().split())
if b<=t:
c=min(c,a)
print("TLE" if c==0 else c) |
p03693 | s192259665 | Accepted | r,g,b=map(int,input().split())
x=(g*10)+b
if x%4==0:
print("YES")
else:
print("NO") |
p03699 | s399492635 | Accepted | N = int(input())
L = list(int(input()) for i in range(N))
m = 10**9
sum = sum(L)
for l in L:
if (l%10) != 0:
m = min(l,m)
if (sum%10) != 0:
print(sum)
elif (m%10) == 0:
print(0)
else:
print(sum-m) |
p03611 | s560752960 | Wrong Answer | N=int(input())
a=list(map(int,input().strip().split()))
dp=[0 for n in range(max(a)+1)]
for n in range(N):
dp[a[n]]+=1
ans=0
for n in range(1,len(dp)-1):
ans=max(ans,dp[n-1]+dp[n]+dp[n+1])
print(ans) |
p02690 | s718638289 | Accepted | N = int(input())
array = [_**5 for _ in range(0,120)]
for x in array[:]:
for y in array[:]:
if x - y == N:
print(array.index(x),array.index(y))
exit()
elif x + y == N:
print(array.index(x),-array.index(y))
exit() |
p03612 | s919788850 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
a = []
ans = 0
for i in range(n):
if i+1 == p[i]:
a.append(i+1)
ans += 1
m = len(a)
for i in range(m-1):
if a[i] + 1 == a[i+1]:
ans -= 1
print(ans)
|
p03617 | s596944251 | Accepted | q,h,s,d = map(int,input().split())
lis = [1, 2, 4, 8]
score = [q,h,s,d]
n = int(input())
all_s = 4*n
tmp_li = [8*q,4*h,2*s,d]
tmp_2 = tmp_li[:]
tmp_2.sort()
jun = []
for t in tmp_2:
jun.append(tmp_li.index(t))
#print('tmp_li',tmp_li,'tmp_2',tmp_2,'jun',jun,'lis',lis)
#[3, 1, 2, 0]
ans = 0
for j in jun:
a = all_s // lis[j]
b = all_s % lis[j]
#print(all_s,a,b,lis[j])
all_s -= a*lis[j]
ans += score[j]*a
print(ans) |
p03773 | s416456716 | Accepted | a,b=map(int,input().split())
print((a+b)%24)
|
p02598 | s991827291 | Wrong Answer | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
# N, K = 2*10**5, 1
# A = [10**9]*N
def solve(x):
m = 0
for a in A:
m += a//x - (a%x == 0)
# print(x, m)
return m <= K
ok, ng = max(A), 0
while abs(ok-ng > 0.1**5):
mid = (ok+ng)/2
# print(mid)
if solve(mid):
ok = mid
else:
ng = mid
print(ceil(mid)) |
p02995 | s262263297 | Accepted | from fractions import gcd
a,b,c,d = map(int,input().split())
a = a-1
l = int(c*d/gcd(d,c))
cn = b//c-a//c
dn = b//d-a//d
ln = b//l-a//l
ans = b-a-cn-dn+ln
print(ans) |
p02787 | s915735182 | Accepted |
import sys
input = sys.stdin.buffer.readline
H, N = map(int, input().split())
INF = 1 << 40
dp = [INF]*(H+1)
dp[H] = 0
for i in range(N):
a, b = map(int, input().split())
for j in range(H, -1, -1):
x = max(0, j-a)
dp[x] = min(dp[x], dp[j]+b)
print(dp[0])
|
p02628 | s248568129 | Accepted | N, K = map(int,input().split())
p = list(map(int,input().split()))
list.sort(p)
total = 0
for i in range(K):
total += p[i]
print(total) |
p02658 | s876549781 | Accepted | N = int(input())
A = list(map(int, input().split()))
MAX = 10**18
A.sort()
ans = 1
for i in range(len(A)):
ans = ans * A[i]
if ans > MAX:
print(-1)
exit()
print(ans)
|
p02767 | s160641227 | Wrong Answer | N=int(input())
X=list(map(int,input().split()))
max=max(X)
ans = 100*5*N
for i in range(max+1):
tmp=0
for x in X:
tmp+=(x-i)**2
ans=min(ans,tmp)
print(ans) |
p03075 | s417990096 | Accepted | a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
if int(e)-int(a)<=int(k):
print('Yay!')
else :
print(':(') |
p02640 | s519231756 | Accepted | a, b = map(int, input().split())
print("Yes" if b%2==0 and 2*a<=b<=4*a else "No")
|
p02802 | s584940678 | Wrong Answer | def solve(n, m, PS):
d = {}
scores = [0, 0]
for p, s in PS:
if not p in d:
d[p] = s
if d[p] == 'WA':
scores[0 if s == 'AC' else 1] += 1
d[p] = s
return scores
_n, _m = map(int, input().split())
_PS = [input().split() for _ in range(_m)]
_scores = solve(_n, _m, _PS)
print(_scores[0], _scores[1])
|
p03360 | s492727712 | Accepted | abc = list(map(int,input().split()))
k = int(input())
abc.sort()
print(abc[0] + abc[1] + abc[2] * (2**k))
|
p02785 | s627747153 | Accepted | n,k=map(int,input().split())
arr=sorted([int(x) for x in input().split()],reverse=True)
print(sum(arr[k:])) |
p03146 | s161658240 | Accepted | s = int(input())
a = []
while s not in a:
a.append(s)
if s % 2 ==0:
s = s // 2
else:
s = 3 * s + 1
print(len(a) + 1) |
p03624 | s146141890 | Wrong Answer | s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
print('None')
else:
for i in range(len(s)):
if s[i]!=ro[i]:
print(ro[i])
break
if s[len(s)-1]=='y':
print('z')
break |
p02661 | s626814931 | Wrong Answer | def main():
n = int(input())
A,B = [],[]
for i in range(n):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A = sorted(A)
B = sorted(B)
if n%2==0:
print(B[n//2]-A[n//2-1]+1)
else:
print(B[n-(n+1)//2]-A[(n+1)//2-1]+1)
if __name__ == "__main__":
main()
|
p03632 | s060998341 | Wrong Answer | a, b, c, d = map(int, input().split())
ans = 0
if b < c or d < a:
ans = 0
elif a <= c and c <= b and b<= d:
ans = b- c
elif a <= c and c <= d and d <=b:
ans = d - c
elif c <= a and a<= b and b <= d:
ans = b = a
else:
ans = d - a
print(ans) |
p02768 | s504666887 | Accepted | import math
n,a,b=map(int,input().split())
mod=10**9+7
c1=1
c2=1
for i in range(n-a+1,n+1):
c1*=i
c1%=mod
for j in range(1,a+1):
c1*=pow(j,mod-2,mod)
c1%=mod
for i in range(n-b+1,n+1):
c2*=i
c2%=mod
for j in range(1,b+1):
c2*=pow(j,mod-2,mod)
c2%=mod
ans=pow(2,n,mod)-1
print((ans-c1-c2)%mod)
|
p03495 | s962545676 | Wrong Answer | import collections
import sys
n,k = map(int,input().split())
ls = list(map(int,input().split()))
a = list(set(ls))
c = collections.Counter(ls)
p = 0
if len(a) > k:
di = [0]*(len(a))
new = c.most_common()[::-1]
for i in range(len(a)):
di[i] = new[i][1]
import numpy
new_ls = numpy.cumsum(numpy.array(di))
for j in range(len(a)):
if len(a) - k <=new_ls[j]:
print(new_ls[j])
sys.exit()
else:
print(0) |
p02706 | s254860639 | Wrong Answer | n, m = map(int, input().split())
a = list(map(int, input().split()))
if n - sum(a) > 0:
print(n - sum(a))
else:
print(-1) |
p02606 | s540127511 | Accepted | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
l,r,d=MI()
print(r//d-(l-1)//d) |
p03827 | s754046787 | Accepted | def main():
N = int(input())
S = input()
ans = 0
cur = 0
for s in S:
if s == "I":
cur += 1
else:
cur -= 1
ans = max(cur, ans)
print(ans)
if __name__ == '__main__':
main()
|
p02555 | s845837568 | Accepted | s=int(input())
mod = 10**9 + 7
ans = 0
m = 10**5 +1
fac = [1]*m
ninv = [1]*m
finv = [1]*m
for i in range(2,m):
fac[i] = fac[i-1]*i%mod
ninv[i] = (-(mod//i)*ninv[mod%i])%mod
finv[i] = finv[i-1]*ninv[i]%mod
def comb(n,k):
return (fac[n]*finv[k]%mod)*finv[n-k]%mod
for i in range(s//3):
ans += comb(s-3*(i+1)+i,i)
ans %= mod
print(ans) |
p03319 | s949151832 | Wrong Answer | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if n == k:
print(1)
if (n-k) % (k-1) == 0:
ans = 1 + (n-k) // (k-1)
else:
ans = 2 + (n-k) // (k-1)
print(ans) |
p02771 | s346131698 | Accepted | A,B,C = map(int,input().split())
if A==B and B==C:
print('No')
elif A != B and B != C and C != A:
print('No')
else:
print('Yes') |
p03565 | s163790332 | Accepted | s = input()
t = input()
s = s[::-1]
t = t[::-1]
ans = ""
for i in range(len(s) - len(t)+1):
for j in range(len(t)):
if s[i+j] != t[j] and s[i+j] != "?":
break
else:
ans = s[:i] + t + s[i+j+1:]
ans = ans[::-1]
print(ans.replace("?", "a"))
exit()
print("UNRESTORABLE")
|
p03071 | s521257429 | Accepted | A, B = map(int, input().split())
res = 0
if A > B:
res += A
A -= 1
else:
res += B
B -= 1
if A > B:
res += A
A -= 1
else:
res += B
B -= 1
print(res)
|
p02633 | s096294623 | Accepted | from math import gcd
x = int(input())
print(360 // gcd(360, x))
|
p02724 | s082500164 | Accepted | import numpy as np
X = int(input())
A = int(X / 500)
B = int(int(X % 500) / 5)
print(A * 1000 + B * 5) |
p04020 | s575798402 | Accepted | N = int(input())
A = [int(input()) for i in range(N)]
ans = 0
for i in range(N):
tmp = A[i]
ans += (tmp // 2)
if i < N -1 and tmp % 2 and A[i + 1] > 0:
ans += 1
A[i + 1] -= 1
print(ans) |
p02690 | s420175045 | Accepted | x = int(input())
a,b = 0,0
for i in range(-100,300):
for j in range(-100,300):
if i**5-j**5==x:
a,b = i,j
break
print(a,b) |
p03665 | s742404631 | Wrong Answer | import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
if __name__ == '__main__':
N, P = map(int, input().split())
A = list(map(int, input().split()))
odd = 0
for a in A:
if a%2==1:
odd += 1
ans = 0
if P == 0:
for i in range(0, odd+1, 2):
ans += comb(N, i)
else:
for i in range(1, odd+1, 2):
ans += comb(N, i)
print(ans)
|
p03797 | s740124493 | Wrong Answer | n,m=map(int,input().split())
if n<m:
print((2*n+m)//4)
else:
print(n+(n-m)//4) |
p03037 | s483293368 | Accepted | n,m = map(int, input().split())
ls = []
rs = []
for _ in range(m):
l,r = map(int, input().split())
ls.append(l)
rs.append(r)
ans = min(rs) - max(ls) + 1
if ans > 0: print(ans)
else: print(0) |
p02759 | s765869889 | Accepted | n = int(input())
if n%2 == 0:
print(n//2)
else:
print((n//2)+1) |
p03161 | s057438882 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [10 ** 10] * N
dp[0] = 0
for i in range(1, N):
for j in range(1, K + 1):
if i - j < 0:
break
dp[i] = min(dp[i], dp[i - j] + abs(H[i - j] - H[i]))
print(dp[-1]) |
p03371 | s796524359 | Accepted | A, B, C, X, Y = map(int, input().split())
if (A+B) <= 2*C:
print(A*X + B*Y)
else:
Z = 2 * min(X, Y)
X_rem = X - Z // 2
Y_rem = Y - Z // 2
if (X_rem != 0) and (A > 2*C):
print(C*(2*X))
elif (Y_rem != 0) and (B > 2*C):
print(C*(2*Y))
else:
print(A*X_rem + B*Y_rem + C*Z)
|
p02663 | s931144554 | Wrong Answer | H1,M1,H2,M2,K = map(int,input().split())
print(max(0, 60*H2 + M2 - (60*H1 + M2) - K)) |
p02860 | s792465901 | Wrong Answer | def main():
_len = int(input())
_str = input()
if _len > 0 or _len < 100 or _len % 2 :
print("No")
return
print(_len/2)
a, b = _str[:_len/2], _str[_len/2:]
print("Yes" if a == b else "No")
if __name__ == '__main__':
main() |
p03943 | s905188286 | Wrong Answer | a,b,c = map(int,input().split())
print("Yes" if (a+b+c)//3 == (a+b+c)/3 else "No") |
p03210 | s427415353 | Wrong Answer | print('YES'if int(input()) in [3,5,7] else 'No') |
p02993 | s810709376 | Accepted | s = input()
for i in range(3):
if s[i] == s[i+1]:
print('Bad')
exit()
print('Good') |
p02792 | s008909405 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
lis=[[0]*9 for _ in range(9)]
for i in range(1,n+1):
si=str(i)
if int(si[-1])>0:
lis[int(si[0])-1][int(si[-1])-1]+=1
cunt=0
for i in range(9):
for j in range(9):
cunt+=lis[i][j]*lis[j][i]
print(cunt)
if __name__=='__main__':
main() |
p02958 | s495530629 | Wrong Answer | a = int(input())
b=list(map(int,input().split()))
c=b
c.sort()
d=[]
print(c)
for i in range(a):
for j in range(a):
b[i],b[j]=b[j],b[i]
print(b)
if b==c:
d.append(b)
else:
continue
if len(d)!=0:
print('Yes')
else:
print('No') |
p03592 | s576883433 | Accepted | n,m,k = map(int,input().split())
ans = 0
for i in range(n+1):
for j in range(m+1):
a = i*m + j*n - 2*i*j
if a == k:
ans = 1
break
print(["No","Yes"][ans]) |
p02754 | s825844196 | Wrong Answer | N, A, B = map(int, input().split())
r = N // (A + B)
m = N % (A + B)
if A != 0:
if A > N:
print(N - A)
else:
print(A * r + m)
else:
print(0) |
p02912 | s546136267 | Accepted | import heapq
n, m = map(int, input().split())
a = list(map(lambda x: int(x)*(-1), input().split()))
heapq.heapify(a) # aを優先度付きキューに
for _ in range(m):
tmp_min = heapq.heappop(a)
heapq.heappush(a, (-1)*(-tmp_min//2)) # 計算誤差の関係で-1を2回かけてます
print(-sum(a)) |
p02791 | s900233304 | Wrong Answer | n = int(input())
p = [int(x) for x in input().split()]
min_p = 1000000000000
count = 0
for i in p:
# 最小値更新
print(i)
if (min_p >= i):
min_p = i
if (min_p >= i):
count += 1
print(count) |
p03329 | s837133248 | Accepted | # ボトムアップ 貰う DP
N = int(input())
INF = 1<<60
dp = [INF]*(N+1)
dp[0] = 0
# 貰う DP --- dp[n] に遷移を集める
for i in range(1, N+1):
pow6 = 1
while pow6 <= i:
dp[i] = min(dp[i], dp[i-pow6] + 1)
pow6 *= 6
pow9 = 1
while pow9 <= i:
dp[i] = min(dp[i], dp[i-pow9] + 1)
pow9 *= 9
print(dp[N]) |
p02996 | s819512333 | Accepted | #template
def inputlist(): return [int(k) for k in input().split()]
#template
N = int(input())
li = [0]*N
for i in range(N):
A,B = inputlist()
li[i] = [B,A]
li.sort()
suma = li[0][1]
if suma > li[0][0]:
print("No")
exit()
for i in range(1,N):
suma += li[i][1]
if suma > li[i][0]:
print("No")
exit()
print("Yes") |
p03861 | s100204561 | Accepted | def warikire(n,r):
if r==1:
return n+1
else:
return n//r+1
a,b,x=map(int,input().split())
if a==0:
print(warikire(b,x))
else:
print(warikire(b,x)-warikire(a-1,x)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.