problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03673
|
s251568512
|
Accepted
|
from collections import deque
def solve():
n = int(input())
A = list(map(int,input().split()))
q = deque()
for i in range(n):
if i % 2 == 0:
q.append(A[i])
else:
q.appendleft(A[i])
ans = list(q)
if n % 2 != 0:
ans.reverse()
print(*ans)
if __name__ == '__main__':
solve()
|
p02924
|
s349998699
|
Accepted
|
n = int(input())
print(n * (n - 1) // 2)
|
p02603
|
s988736381
|
Accepted
|
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
p = 1000
kabu = 0
uri = False
for i in range(n):
if i == n-1 or (uri and a[i+1] < a[i]):
#uri
p += kabu * a[i]
kabu = 0
uri = False
elif (not uri) and a[i+1] > a[i]:
#kai
kabu = p // a[i]
p -= a[i] * kabu
uri = True
#print(p, kabu)
print(p)
|
p02888
|
s797616956
|
Wrong Answer
|
from sys import stdin
from itertools import groupby, permutations
import numpy as np
def main():
N = int(input())
L = np.sort(np.array([int(x) for x in input().split()]))
ret = 0
# print(L)
for i in range(N-2):
for j in range(i + 1, N-1):
k = np.searchsorted(L, L[i] + L[j], side='right')
# print(L[i], L[j], k, ret)
ret += k - j - 1
return ret
if __name__ == "__main__":
print(main())
|
p02953
|
s088696094
|
Accepted
|
n = int(input())
h = list(map(int, input().split()))
now = 0
for i in h:
if now < i:
now = i - 1
elif now == i:
pass
else:
print('No')
break
else:
print('Yes')
|
p03077
|
s435827084
|
Accepted
|
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
X = min(A, B, C, D, E)
if(N % X == 0):
print(N//X + 4)
else:
print(N//X + 5)
|
p03243
|
s229955666
|
Accepted
|
n = int(input())
for i in range(1,10):
if int(str(i)*3) >= n:
print(str(i)*3)
break
|
p03543
|
s414961378
|
Wrong Answer
|
k = list(input())
ans = "No"
for i in k:
if sum(x == i for x in k) >= 3:
ans = "Yes"
print(ans)
|
p03239
|
s878821080
|
Accepted
|
N,T = map(int, input().split())
tl = []
for i in range(N):
c,t = map(int, input().split())
if t <= T:
tl.append(c)
if len(tl) == 0:
print('TLE')
else:
print(min(tl))
|
p03075
|
s323728371
|
Wrong Answer
|
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
x = e - a
if x <= k:
print('Yey!')
else:
print(':(')
|
p02630
|
s142861058
|
Wrong Answer
|
from collections import Counter
n = int(input())
L = list(map(int,input().split()))
sum_all = sum(L)
L = Counter(L)
#print(L)
q = int(input())
sum1 = sum_all
for i in range(q):
a,b = map(int,input().split())
#print(L)
if a not in L:
L[b] = 0
else:
L[b] +=L[a]
#print(L)
sum1 = sum1 + b*L[a] - a*L[a]
L[a] =0
#print(L)
print(sum1)
|
p02633
|
s189817261
|
Wrong Answer
|
def times(X):
if X == int(X):
if 1<= X <= 179:
K = 360/X
if int(K) < K :
K = int(int(K) + 1)
print(K)
else:
K = int(K)
print(K)
|
p03997
|
s776587252
|
Accepted
|
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h//2)
|
p03220
|
s035020980
|
Accepted
|
n = int(input())
t,a = map(int, input().split())
h = list(map(int, input().split()))
ans = float('INF')
pos = 0
for i in range(n):
temp = t - h[i] * 0.006
if abs(temp - a) < ans:
ans = abs(temp - a)
pos = i + 1
print(pos)
|
p03160
|
s838524652
|
Wrong Answer
|
n = int(input())
h = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
dp[i] = min(dp[i-2] + abs(h[i] - h[i-2]), dp[i-1] + abs(h[i]- h[i-1]))
print(dp)
|
p03665
|
s289978283
|
Wrong Answer
|
import math
n, p, *a = map(int, open(0).read().split())
def c(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
memo = [0, 0]
for i in range(n):
memo[a[i] % 2] += 1
# p == 0
ans = 0
if p == 0:
for i in range(0, memo[1], 2):
ans += c(memo[1], i) * pow(2, memo[0])
else:
for i in range(1, memo[1], 2):
ans += c(memo[1], i) * pow(2, memo[0])
# p == 1
print(ans)
|
p02994
|
s420418084
|
Accepted
|
n,l = [int(i) for i in input().split(' ')]
a = sorted([l+i-1 for i in range(1,n+1)])
x = 0
ab = 101
for i in a:
if abs(i) < ab:
ab = abs(i)
x = sum(a) - i
print(x)
|
p02640
|
s994981174
|
Wrong Answer
|
#Take the value of X
#Take the value of Y
#Do double equation
X, Y = map(int, input().split(" "))
C = (Y-4*X)/-2
T = X - ((Y-4*X)/-2)
total = int(T + C)
if (T<0) or (C<0):
print("No")
elif (T+C) == X and (4*T + 2*C) == Y:
print("Yes")
else:
print("No")
|
p02582
|
s943626486
|
Wrong Answer
|
sr_list = list(input().split())
r_count = sr_list.count('R')
if r_count == 0:
print('0')
elif r_count == 1:
print('1')
elif r_count ==3:
print('3')
else:
if sr_list[1] == 'S':
print('1')
else:
print('2')
|
p02952
|
s689354256
|
Accepted
|
N = int(input())
cnt = 0
for i in range(1, N+1):
k = 0
while True:
k += 1
if 10 ** k > i: break
if k % 2 == 1:
cnt += 1
print(cnt)
|
p03493
|
s149268027
|
Accepted
|
a=input()
a=list(a)
count=0
for i in a:
if i=='1':
count+=1
print(count)
|
p03711
|
s472355924
|
Wrong Answer
|
a,b = map(int, input().split())
if a == (1 or 3 or 5 or 7 or 8 or 10 or 12) and b == (1 or 3 or 5 or 7 or 8 or 10 or 12):
print('Yes')
elif a == (4 or 6 or 9 or 11) and b == (4 or 6 or 9 or 11):
print('Yes')
else:
print('No')
|
p03385
|
s916427026
|
Accepted
|
S = input()
if S.count("a") == 1 and S.count("b") == 1:
print("Yes")
else:
print("No")
|
p02720
|
s430322725
|
Accepted
|
k = int(input())
from collections import deque
q = deque() # FIFOキューの作成
for i in range(1,10):
q.append(str(i))
for i in range(k-1):
a = q.popleft()
last = int(a[-1:])
if last == 0:
q.append(a+"0")
q.append(a + "1")
elif last ==9:
q.append(a+"8")
q.append(a + "9")
else:
q.append(a + str(last - 1))
q.append(a + str(last ))
q.append(a + str(last + 1))
print(q.popleft())
|
p03557
|
s705843375
|
Accepted
|
import bisect
N = int(input())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
C.sort()
cnt = 0
for b in B:
a_index = bisect.bisect_left(A,b)
c_index = bisect.bisect_right(C,b)
cnt += a_index*(len(C)-c_index)
print(cnt)
|
p02989
|
s565800422
|
Accepted
|
N=int(input())
D=list(map(int,input().split()))
D.sort()
n_1=int(N/2)-1
n_2=int(N/2)
print(D[n_2]-D[n_1])
|
p02996
|
s762761669
|
Wrong Answer
|
import heapq
n = int(input())
abs = [tuple(map(int, input().split())) for _ in range(n)]
pq = []
for ab in abs:
a,b = ab[0],ab[1]
heapq.heappush(pq, tuple([b,a]))
dl = 0
tc = 0
ans = "Yes"
for i in range(n):
ba = pq.pop()
dl += ba[0]
tc += ba[1]
if dl < tc:
ans = "No"
break
print(ans)
|
p03282
|
s108565666
|
Accepted
|
s=input()
k =int(input())
for i in range(k):
if s[i] != '1':
ans = s[i]
break
elif i < k-1:
ans = s[i+1]
else:
ans = s[i]
print(ans)
|
p03329
|
s526971087
|
Wrong Answer
|
N=int(input())
g = []
a = 6
while a <= 100000:
g.append(a)
a *= 6
a = 9
while a <= 100000:
g.append(a)
a *= 9
g.sort(reverse=True)
ans = 0
for a in g:
while N > a:
N -= a
ans += 1
print(ans+N)
|
p02596
|
s074408414
|
Wrong Answer
|
K=int(input())
x=0
if K%2==0:
print(-1)
exit()
for i in range(K+1):
x=(x*10+7)%K
if x==0:
print(i+1)
break
|
p03986
|
s659467160
|
Wrong Answer
|
X = str(input())
tmorethans = 0
totalts = 0
Nagasa = len(X)
for i in range (0, len(X)+1):
if 2*totalts == Nagasa:
print(2*tmorethans)
exit()
elif X[i] == 'T':
tmorethans+=1
totalts+=1
else:
tmorethans-=1
|
p02994
|
s905869538
|
Wrong Answer
|
def main():
n,l = list(map(int,input().split()))
ans=0
if l>=0:
for i in range(2,n+1):
ans+= l+i-1
elif n+l<0:
for i in range(1,n):
ans+=l+i-1
else:
for i in range(1,n+1):
ans+=l+i-1
print(ans)
main()
|
p02899
|
s201945525
|
Accepted
|
N=int(input())
A=list(map(int,input().split()))
ANS=[]
ANS2=[]
for i in range(N):
ANS+=[[A[i],i+1]]
ANS.sort()
for i in range(N):
print(ANS[i][1])
|
p03448
|
s634364673
|
Accepted
|
a = int(input())
b = int(input())
c = int(input())
x = int(input())
count=0
for c1 in range(0,c+1):
for b1 in range(0,b+1):
for a1 in range(0,a+1):
if a1*500+b1*100+c1*50==x:
count=count+1
print(count)
|
p03795
|
s774590446
|
Wrong Answer
|
N = int(input())
# L = 800 / N
B = 0
for i in range(N):
if i % 15 == 0:
B += 1
L = 800 * N
C = B * 200
print(L - C)
|
p02787
|
s509313488
|
Wrong Answer
|
h,n = map(int, input().split())
ab,e = [],[]
for i in range(n):
a,b = map(int, input().split())
ab.append([a/b,a,b])
ab.sort(reverse=True)
ans = (h//ab[0][1])*ab[0][2]
o = h-(h//ab[0][1])*ab[0][1]
f = [i[2] for i in ab if i[1] >= o]
add = 0
if f != []:
add = min(f)
print(ans+add)
|
p03557
|
s507261030
|
Accepted
|
import bisect
n = int(input())
a,b,c = [sorted(list(map(int,input().split()))) for i in range(3)]
ans = sum([bisect.bisect_left(a,i)*(n-bisect.bisect(c,i)) for i in b])
print(ans)
|
p04044
|
s271716440
|
Accepted
|
first = input()
first = first.split()
N = int(first[0])
L = []
for i in range(N):
s = input()
L.append(s)
L.sort()
for i in L:
print(i,end="")
|
p03127
|
s248049453
|
Accepted
|
import functools
import fractions
N=int(input())
A=list(map(int,input().split()))
print(functools.reduce(fractions.gcd,A))
|
p03011
|
s306683051
|
Accepted
|
def main():
A = sorted(list(map(int, input().split())))
print(sum(A[:2]))
if __name__ == '__main__':
main()
|
p03161
|
s510844586
|
Accepted
|
import sys
n,k = map(int,input().split())
a = list(map(int,input().split()))
dp = [sys.maxsize]*n
dp[0]=0
#print(dp)
for i in range(n):
for j in range(i+1,i+k+1):
if j<n:
dp[j] = min(dp[j],dp[i]+abs(a[i]-a[j]))
#print(dp)
print(dp[n-1])
|
p03672
|
s879835570
|
Accepted
|
s = input()
l = len(s)
for i in range(l)[::2]:
if s[:-i-2] == s[:len(s[:-i-2])//2]*2:
print(len(s[:-i-2]))
exit()
|
p02577
|
s257284339
|
Accepted
|
n=input()
a=0
for i in range(len(n)):
a+=int(n[i])
if a%9==0:
print("Yes")
else:
print("No")
|
p03417
|
s712558061
|
Accepted
|
N, M = map(int, input().split())
if(N == 1 and M == 1):
print(1)
elif(N == 1 or M == 1):
print(N*M-2)
else:
print((N-2)*(M-2))
|
p03761
|
s939198514
|
Accepted
|
from collections import defaultdict
N=int(input())
S=[input() for _ in range(N)]
cnt=defaultdict(int)
for i in range(len(S[0])):
cnt[S[0][i]]+=1
for i in range(1,N):
tmp=defaultdict(int)
for j in range(len(S[i])):
tmp[S[i][j]]+=1
for key,count in cnt.items():
if count>tmp[key]:
cnt[key]=tmp[key]
ans=[]
for key,count in cnt.items():
for _ in range(count):
ans.append(key)
ans.sort()
print("".join(ans))
|
p02989
|
s880400602
|
Accepted
|
n = int(input())
d = [int(i) for i in input().split()]
d.sort()
mn = n//2-1
mx = n//2
ans = d[mx]-d[mn]
print(ans)
|
p02689
|
s237259001
|
Accepted
|
N, M = map(int, input().split())
H = list(map(int, input().split()))
OK = [True] * N
for _ in range(M):
A, B = map(lambda x: int(x)-1, input().split())
if H[A] < H[B]:
OK[A] = False
elif H[A] > H[B]:
OK[B] = False
else:
OK[A] = False
OK[B] = False
ans = sum(OK)
print(ans)
|
p02787
|
s460441535
|
Wrong Answer
|
import numpy as np
|
p03220
|
s842187260
|
Wrong Answer
|
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
rT = T - (H[0]*0.006)
dif = A - rT
ans = 1
for i in range(1, N):
rTi = T - (H[i]*0.006)
e_dif = A - rTi
if e_dif<dif:
dif = e_dif
ans = i+1
print(ans)
|
p04043
|
s646920313
|
Accepted
|
a, b, c = map(int, input().split())
count_5 = 0
count_7 = 0
if a == 5:
count_5 += 1
elif a == 7:
count_7 += 1
if b == 5:
count_5 += 1
elif b == 7:
count_7 += 1
if c == 5:
count_5 += 1
elif c == 7:
count_7 += 1
if count_5 == 2 and count_7 == 1:
print("YES")
else:
print("NO")
|
p02607
|
s783807402
|
Accepted
|
M = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(len(A)):
if i%2==0:
if A[i]%2==1:
ans=ans+1
print(ans)
|
p03487
|
s668330507
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
dic = {}
for i in a:
if i not in dic:
dic[i] = 1
else:
dic[i] += 1
ans = 0
for k, v in dic.items():
if k > v:
ans += v
elif k < v:
ans += k - v
print(ans)
|
p03109
|
s731249345
|
Wrong Answer
|
s = input()
if s <= '2019/04/30':
print('Heisei')
print('TBD')
|
p02947
|
s692079142
|
Accepted
|
N = int(input())
S = [None] * N
for i in range(N):
S[i] = input()
C = []
for s in S:
T = tuple(sorted(s))
C.append(T)
dic = {}
for i in range(N):
if C[i] in dic:
dic[C[i]] += 1
else:
dic[C[i]] = 1
ans = 0
for x in dic.values():
ans += x * (x - 1) // 2
print(ans)
|
p03254
|
s377861662
|
Wrong Answer
|
N, X = map(int, input().split())
lists = list(map(int, input().split()))
if X - sum(lists) > 1:
print(len(lists) - 1)
exit()
count = 0
for num in sorted(lists):
X -= num
if X >= 0:
count += 1
if num == lists[-1]:
break
continue
break
print(count)
|
p04044
|
s024025214
|
Accepted
|
N, L = map(int, input().split())
lst = []
for i in range(N):
lst.append(input())
slst = sorted(lst)
print("".join(slst))
|
p03761
|
s944818335
|
Accepted
|
N = int(input())
S = [list(input()) for _ in range(N)]
result = S[0]
for i in range(1,N):
temp = []
for j in S[i]:
if j in result:
temp.append(j)
result.remove(j)
result = temp
result.sort()
print("".join(result))
|
p03105
|
s492866110
|
Wrong Answer
|
A, B, C = map(int,input().split())
print(A//B)
|
p02572
|
s618639696
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
MOD = 10**9 + 7
S1, S2 = 0, 0
for a in A:
S1 += a
S2 += a * a % MOD
S1 %= MOD
S2 %= MOD
print(((S1*S1%MOD-S2+MOD) % MOD) * pow(2,MOD-2,MOD) % MOD)
|
p02708
|
s314550091
|
Accepted
|
n, k = map(int, input().split())
min = [0] * (n + 1)
max = [0] * (n + 1)
min[0] = 0
max[0] = n
for i in range(1, n + 1):
min[i] = min[i - 1] + i
max[i] = max[i - 1] + n - i
# print(min)
# print(max)
sum = 0
for i in range(k - 1, n + 1):
sum = sum + max[i] - min[i] + 1
print(sum % (pow(10, 9) + 7))
|
p03545
|
s644523138
|
Accepted
|
a,b,c,d = list(str(input()))
op = ('+', '-')
for i in range(2):
for j in range(2):
for k in range(2):
result = eval(a + op[i] + b + op[j] + c + op[k] + d)
if result == 7:
print(a + op[i] + b + op[j] + c + op[k] + d + '=7')
exit()
|
p03317
|
s774149963
|
Accepted
|
#全部1にしたい
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
#端っこから区間をあらかじめ区切っておく
ans=0
i=0
while i<n-1:
ans=ans+1
i=i+k-1
print(ans)
|
p04044
|
s055074704
|
Wrong Answer
|
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections
import bisect
def main():
n,l = map(int, input().split())
array = [input() for _ in range(n)]
array.sort()
print('a'.join(array))
if __name__ == '__main__':
main()
|
p03721
|
s546650254
|
Wrong Answer
|
n, k = map(int, input().split())
s = 0
for _ in range(n):
a, b = map(int, input().split())
s += b
if k <= s:
print(a)
exit()
|
p03385
|
s798921065
|
Wrong Answer
|
def main():
s = sorted(input())
print('Yes' if s=='abc' else 'No')
if __name__ == '__main__':
main()
|
p03351
|
s329691060
|
Wrong Answer
|
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
a,b,c,d=I()
if abs(a-b)<=d and abs(b-c)<=d:
print("Yes")
else:
print("No")
|
p02727
|
s238651602
|
Wrong Answer
|
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()))
point = 0
all_taste = p + q + r
all_taste.sort(reverse=True)
for i in range(0, X + Y):
point += all_taste[i]
print(point)
|
p02693
|
s695342025
|
Accepted
|
k = int(input())
A,B = map(int,input().split())
t = (A//k)+1 if A%k != 0 else A//k
s = B//k
print('OK'if t<=s else 'NG')
|
p02718
|
s088404709
|
Accepted
|
def main():
N, M = map(int, input().split())
A = list(map(int, input().split()))
threshold = sum(A) / (4 * M)
if sorted(A, reverse=True)[M-1] >= threshold:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p03605
|
s177946628
|
Accepted
|
N=input()
if "9" in N:
print("Yes")
else:
print("No")
|
p02796
|
s185713905
|
Accepted
|
N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i))
Range = sorted(Range, key = lambda x:x[1])
a = 1
for i in range(N-1):
if Range[a][0] >= Range[a-1][1]:
a += 1
else:
Range.pop(a)
print(a)
|
p03161
|
s583476346
|
Accepted
|
def main():
import sys
import numpy as np
n, k = map(int, input().split())
h = list(map(int, sys.stdin.readline().split()))
h = np.array(h, dtype=np.int32)
ans = np.full(n, 10**9, dtype=np.int32)
ans[0] = 0
for i in range(n):
ans[i:i+k+1] = np.minimum(ans[i:i+k+1], ans[i]+np.abs(h[i:i+k+1]-h[i]))
print(ans[n-1])
if __name__ == '__main__':
main()
|
p02691
|
s329925019
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
c = [0]*n
d = [0]*n
for i, j in enumerate(a):
c[i] = i + j
for i, j in enumerate(a):
d[i] = i - j
x = {}
for i, j in enumerate(c):
if j not in x:
x[j]=[i]
else:
x[j].append(i)
ans = 0
for i in d:
if i not in x:
continue
else:
ans += len(x[i])
print(ans)
|
p03150
|
s241149976
|
Accepted
|
s = input()
end = len(s)
flg = False
for i in range(end):
for j in range(i,end):
string = s[:i] + s[j:]
if string == 'keyence':
flg = True
break
print('YES' if flg else 'NO')
|
p02831
|
s759998848
|
Wrong Answer
|
import math
a, b= map(int,input().split())
d= math.gcd(a,b)
print(a*b/d)
|
p02570
|
s764841457
|
Accepted
|
d,t,s = map(int,input().split())
if (d/s) <= t:
print("Yes")
else:
print("No")
|
p02577
|
s203839450
|
Wrong Answer
|
num = int(input())
ans = num%9
if ans == 0:
print("YES")
else:
print("NO")
|
p02783
|
s464552520
|
Accepted
|
def solve(string):
h, a = map(int, string.split())
return str((h - 1) // a + 1)
if __name__ == '__main__':
import sys
print(solve(sys.stdin.read().strip()))
|
p03681
|
s374786976
|
Wrong Answer
|
a,b = map(int,input().split())
div = 1000000007
if abs(a-b)>1:
print(0)
else:
print(a*b*2%div)
|
p03075
|
s615761091
|
Accepted
|
def ip():return int(input())
a=[]
for i in range(5):
a.append(ip())
k=ip()
for i in range(4):
for j in range(i+1,5):
if a[j]-a[i]>k:
print(":(")
exit()
print("Yay!")
|
p03951
|
s547625581
|
Wrong Answer
|
n=int(input())
s=str(input())
t=str(input())
cnt=0
if s==t:
print(n)
else:
for i in range(n):
if s[-i-1]==t[i]:
cnt+=1
else:
break
print(n*2-cnt)
|
p02729
|
s766247847
|
Accepted
|
import math
def A():
N, M = map(int, input().split())
if N == 1 == M:
print(0)
return
ans = 0
if N > 1:
ans += math.factorial(N)//(2*(math.factorial(N-2)))
if M > 1:
ans += math.factorial(M)//(2*(math.factorial(M-2)))
print(ans)
A()
|
p02882
|
s200487501
|
Wrong Answer
|
from math import atan, degrees
a,b,x = map(int, input().split())
if x >= a*b/2:
print(degrees(atan((b-x/(a**2))*2/a)))
else:
print(90 - degrees(atan(2*x/(a*(b**2)))))
|
p03994
|
s373640639
|
Wrong Answer
|
x=input()
x=list(x)
y=int(input())
a=(len(x))
for i in range(a):
if ord(x[i])+y>=123:
y=y-(123-ord(x[i]))
x[i]='a'
while (ord(x[a-1])+y)>123:
y=y-26
x[a-1]=chr(ord(x[a-1])+y)
print(*x,sep='')
|
p03962
|
s763623853
|
Accepted
|
S=input().split()
print(len(set(S)))
|
p03293
|
s917244005
|
Accepted
|
import sys
s=input()
t=input()
s=list(s)
t=list(t)
u=s[:]
for i in range(len(s)):
u.append(s[i])
u.remove(u[0])
if u==t:
print('Yes')
sys.exit()
print('No')
|
p02753
|
s087569174
|
Accepted
|
S = input()
if "A" in S and "B" in S:
print("Yes")
exit(0)
print("No")
|
p02755
|
s501279041
|
Accepted
|
a,b=map(int,input().split())
for x in range(10000):
if int(x*0.08)==a and int(x*0.1)==b:
print(x)
exit()
print(-1)
|
p02689
|
s356628052
|
Wrong Answer
|
n, m = map(int,input().split())
h = list(map(int,input().split()))
temp_h = h.copy()
for _ in range(m):
x1, x2 = map(int,input().split())
temp_h[x1 - 1] = max([temp_h[x1 - 1], h[x2 - 1]])
temp_h[x2 - 1] = max([h[x1 - 1], temp_h[x2 - 1]])
res = [1 if x - y else 0 for x, y in zip(h, temp_h)]
print(sum(res))
|
p02873
|
s040964339
|
Accepted
|
S = input()
N = len(S)
A = [-1 for i in range(N+1)]
if S[0] == "<":
A[0] = 0
if S[-1] == ">":
A[-1] = 0
for i in range(N):
if S[i:i+2] == "><":
A[i+1] = 0
#print(A)
for i in range(N):
if S[i] == "<":
A[i+1] = max(A[i]+1, A[i+1])
for i in range(N):
if S[N-i-1] == ">":
A[N-i-1] = max(A[N-i]+1, A[N-i-1])
#print(A)
print(sum(A))
|
p02838
|
s129218028
|
Accepted
|
def main():
n = int(input())
A = [int(x) for x in input().split()]
ans = 0
mod = 10 ** 9 + 7
for d in range(60):
# d桁目ごとに考える
x = 0
for a in A:
if (a >> d) & 1:
x += 1
ans += x * (n-x) * 2**d
ans %= mod
print(ans)
if __name__ == '__main__':
main()
|
p02880
|
s124141046
|
Wrong Answer
|
N=int(input())
A=[]
B=list(range(2,10))
B=B[::-1]
for i in B:
while N%i==0:
A.append(i)
N//=i
if 1<=len(A)<=2:
print('Yes')
else:
print('No')
|
p02897
|
s272239316
|
Wrong Answer
|
n = int(input())
ans = 0
for i in range(1, n + 1):
if i % 2 == 0:
continue
else:
ans += 1
print(ans)
|
p03219
|
s871990539
|
Accepted
|
x, y = map(int, input().split())
print(x + (y//2))
|
p02814
|
s981603925
|
Accepted
|
import numpy as np
import sys
def main():
N,M=map(int,input().split())
A=list(map(int,input().split()))
A_double=list(map(lambda x:x//2,A))
mini_multi=int(np.lcm.reduce(A_double))
res=M//mini_multi
for i in A_double:
if (mini_multi//i)%2==0:
print(0)
sys.exit()
if res%2!=0:
res+=1
print(res//2)
if __name__=="__main__":
main()
|
p03013
|
s499214821
|
Accepted
|
n, m = map(int, input().split())
a = [int(input()) for i in range(m)]
l = [1] * (n+1)
for j in a:
l[j] = 0
x = 10 ** 9 + 7
if m > n // 2:
print(0)
else:
dp = [0] * (n+1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
for i in range(2, n+1):
if l[i]:
dp[i] = (dp[i-1] + dp[i-2]) % x
print(dp[-1])
|
p03160
|
s516712835
|
Wrong Answer
|
def cmin(a,b):
if a>b:
return b
else:
return a
N = int(input())
h = list(map(int,input().split()))
dp = [0] + [float("inf")]*(N-1)
for i in range(1,N):
dp[i] = cmin(dp[i],dp[i-1]+abs(h[i]-h[i-1]))
print(dp[-1])
|
p02602
|
s786177750
|
Accepted
|
n,k = map(int,input().split())
a = list(map(int,input().split()))
b = [0]*n
for i in range(n):
if i>=k:
if a[i]-a[i-k]>0:
print("Yes")
else:
print("No")
|
p04031
|
s117921770
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
mi=min(a)
ma=max(a)
i=mi
ans=10**10
while i<=ma:
x=sum((a[j]-i)**2 for j in range(n))
ans=min(ans,x)
i+=1
print(ans)
|
p02881
|
s911238720
|
Accepted
|
n=int(input())
result = 10**12
for i in range(1,int(n**0.5)+1):
if n % i == 0:
result = min(result, i + n//i)
print(int(result-2))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.