code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
from math import sin, cos, pi
def koch_curve(d, p1, p2):
if d == 0:
return
s = [None, None]
u = [None, None]
t = [None, None]
s[0] = (2*p1[0] + p2[0])/3
s[1] = (2*p1[1] + p2[1])/3
t[0] = (p1[0] + 2*p2[0])/3
t[1] = (p1[1] + 2*p2[1])/3
u[0] = (t[0] - s[0])*cos(1/3*pi) - (t[1] - s[1])*sin(1/3*pi) + s[0]
u[1] = (t[0] - s[0])*sin(1/3*pi) + (t[1] - s[1])*cos(1/3*pi) + s[1]
koch_curve(d-1, p1, s)
print(s[0], s[1])
koch_curve(d-1, s, u)
print(u[0], u[1])
koch_curve(d-1, u, t)
print(t[0],t[1])
koch_curve(d-1, t, p2)
num = int(input())
print(0.0, 0.0)
koch_curve(num, [0.0, 0.0], [100.0, 0.0])
print(100.0, 0.0)
|
def mpow(a,b,m):
ans=1
while b >0 :
if b&1:
ans = (ans*a)%m
a=(a*a)%m
b=b>>1
return ans
def calcmod(X,m,N):
mod=0
X=X[::-1]
# print(X)
for i in range(N):
if X[i] == '1':
# if X & (1<<i) >0:
mod += mpow(2,i,m)
mod%=m
return mod
def popcount(m):
return bin(m).count("1")
def findsteps(mm):
cnt=0
while mm !=0:
cnt+=1
mm=mm%popcount(mm)
return cnt
N=int(input())
x=input()
X=int(x,2)
##we need to find X%(m-1) and X%(m+1)
m=popcount(X)
m1=m+1
m2=m-1
firstmod=calcmod(x,m1,N)
if m2 !=0:
secondmod=calcmod(x,m2,N)
fans=[0 for i in range(N)]
k=0
for i in range(N-1,-1,-1):
if X & (1<<i) >0:
##the bit was set
##we need to find X%(m-1) - (2^i)%(m-1)
if m2 == 0:
ans=0
else:
mm=secondmod - mpow(2,i,m2)
if mm < 0:
mm+=m2
mm=mm%m2
ans=1+findsteps(mm)
else:
mm = firstmod + mpow(2,i,m1)
mm=mm%m1
ans=1+findsteps(mm)
fans[k] = ans
k+=1
##the bit was not set
for i in fans:
print(i)
| 0 | null | 4,191,297,931,822 | 27 | 107 |
import sys
def input(): return sys.stdin.readline().rstrip()
N, X, M = map(int, input().split())
numlist = [-1] * M
num = X
ans = num
roop_start = -1
for i in range(N-1):
new_num = (num * num) % M
if numlist[num] == -1:
numlist[num] = new_num
ans += new_num
num = new_num
else:
roop_start = num
break
num = roop_start
if roop_start == -1:
print(ans)
else:
roop_sum = [num]
for i in range(N-1):
new_num = numlist[num]
numlist[num] = -1
if numlist[new_num] == -1:
break
else:
roop_sum.append(roop_sum[-1] + new_num)
num = new_num
if numlist[X] != -1:
count = 0
ans = 0
for i in range(M):
if numlist[i] != -1:
ans += i
count += 1
N -= count
else:
ans = 0
size = len(roop_sum)
div = N // size
rest = N % size
ans += div * roop_sum[-1]
if rest != 0:
ans += roop_sum[rest-1]
print(ans)
|
import sys
import math
def MI(): return map(int,sys.stdin.readline().rstrip().split())
N,X,M = MI()
if M == 1:
print(0)
exit()
flag = [-1]*M
Z = [X]
flag[X] = 1
r = X
for i in range(2,M+2):
r = r ** 2
r %= M
if flag[r] != -1:
a,b = flag[r],i # [a,b) = 循環節
break
else:
flag[r] = i
Z.append(r)
z = len(Z)
ans = 0
for i in range(a-1):
ans += Z[i]
n = N-a+1
q = n//(b-a)
r = n % (b-a)
for i in range(a-1,a+r-1):
ans += (q+1)*Z[i]
for i in range(a+r-1,b-1):
ans += q*Z[i]
print(ans)
| 1 | 2,857,552,804,708 | null | 75 | 75 |
n,m = map(int,input().split())
A=[[] for i in range(n)]
for i in range(n):
A[i] = list(map(int,input().split()))
b = []
c = list(map(int,'0'*n))
for i in range(m):
b.append(int(input()))
for i in range(n):
for j in range(m):
c[i] += A[i][j]*b[j]
for i in range(n):
print(c[i])
|
n,m=list(map(int,input().split(' ')))
am=[[0 for j in range(m)] for i in range(n)]
bm=[0 for l in range(m)]
cm=[0 for i in range(n)]
for i in range(n):
am[i]=list(map(int,input().split(' ')))
for j in range(m):
bm[j]=int(input())
for i in range(n):
for j in range(m):
cm[i]=cm[i]+am[i][j]*bm[j]
for i in range(n):
print(cm[i])
| 1 | 1,163,978,790,546 | null | 56 | 56 |
#!/usr/bin/env python3
from functools import reduce
x, y = map(int, input().split())
mod = 10**9 + 7
def cmb(n, r, m):
def mul(a, b):
return a * b % m
r = min(n - r, r)
if r == 0:
return 1
over = reduce(mul, range(n, n - r, -1))
under = reduce(mul, range(1, r + 1))
return (over * pow(under, m - 2, m))%m
r = abs(x - y)
l = (min(x, y) - r) // 3
r += l
if (x+y)%3 < 1 and l >= 0:
print(cmb(r + l, l, mod))
else:
print(0)
|
t1,t2 = map(int,input().split())
a1,a2 = map(int,input().split())
b1,b2 = map(int,input().split())
import math
f = (a1-b1)*t1
s = (a2-b2)*t2
if f == -s:
print("infinity")
elif (f>0 and f+s>0) or (f<0 and f+s<0):
print(0)
elif f//(-(f+s)) == math.ceil(f/(-(f+s))):
print(f//(-(f+s))*2)
else:
print(f//(-(f+s))*2+1)
| 0 | null | 140,629,850,788,970 | 281 | 269 |
x = input()
x = x.split(" ")
width = int(x[0])
height = int(x[1])
area = width * height
perimeter = width * 2 + height * 2
print("{0} {1}".format(area, perimeter))
|
a = input().split(' ')
print(int(a[0])*int(a[1]), int(a[0])*2+int(a[1])*2)
| 1 | 307,555,602,340 | null | 36 | 36 |
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import bisect
if __name__ == "__main__":
n,x,y = map(int,input().split())
x-=1
y-=1
ans = [0]*(n)
for i in range(n):
for j in range(i+1,n):
d = min(abs(i-j),abs(x-i) + abs(y-j) + 1)
ans[d] += 1
for i in range(1,n):
print(ans[i])
|
x = []
try:
while True:
a, b = map(int, raw_input().split())
x.append(len(list(str(a + b))))
except EOFError:
for i in x:
print(i)
| 0 | null | 22,034,498,122,780 | 187 | 3 |
import sys
input = sys.stdin.readline
def main():
n = int(input())
a = []
b = []
for _ in range(n):
A,B = map(int,input().split())
a.append(A)
b.append(B)
a.sort()
b.sort()
if n%2:
print(b[n//2]-a[n//2]+1)
else:
print((b[n//2]+b[n//2-1]) - (a[n//2]+a[n//2-1])+1)
if __name__ == "__main__":
main()
|
import sys
N=int(sys.stdin.readline().strip())
A=[]
B=[]
for _ in range(N):
a,b=map(int, sys.stdin.readline().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2==0:
A_med=float(A[N/2]+A[N/2-1])/2
B_med=float(B[N/2]+B[N/2-1])/2
print int((B_med-A_med)*2+1)
else:
A_med=A[N/2]
B_med=B[N/2]
print B_med-A_med+1
| 1 | 17,246,701,863,090 | null | 137 | 137 |
X=int(input())
DP=[0 for i in range(X+1)]
DP[0]=1
L=[100,101,102,103,104,105]
for s in range(6):
for x in range(X+1):
if DP[x]==1 and x+L[s]<=X:
DP[x+L[s]]=1
print(DP[X])
|
#-*-coding:utf-8-*-
from collections import deque
import sys
input=sys.stdin.readline
def main():
commands=[]
number = int(input())
commands=list(input().split() for _ in range(number))
q=deque()
for command in commands:
if command[0] == "insert":
q.appendleft(command[1])
elif command[0] == "delete":
if command[1] in q:
q.remove(command[1])
else:
continue
elif command[0] == "deleteFirst":
q.popleft()
elif command[0] == "deleteLast":
q.pop()
print(*q)
if __name__=="__main__":
main()
| 0 | null | 63,672,214,485,964 | 266 | 20 |
n = input()
arr = [map(int,raw_input().split()) for _ in range(n)]
tou = [[[0 for i in range(10)] for j in range(3)] for k in range(4)]
for line in arr:
b,f,r,v = line
tou[b-1][f-1][r-1] = tou[b-1][f-1][r-1] + v
for i in range(4):
for j in range(3):
print ' '+' '.join(map(str,tou[i][j]))
if i < 3 :
print '#'*20
|
line = int(input())
nums = [[[0 for x in range(0, 10)] for x in range(0, 3)] for x in range(0, 4)]
input1 = []
for i in range(line):
input1.append(input())
for e in input1:
efbv = e.split(" ")
e_b, e_f, e_r, e_v = map(int, efbv)
nums[e_b - 1][e_f - 1][e_r -1] += e_v
for b in range(4):
for f in range (3):
print(" " + " ".join(map(str, nums[b][f])))
if b != 3: print("#" * 20)
| 1 | 1,123,032,504,000 | null | 55 | 55 |
N = int(input())
ans = []
while N > 0:
N -= 1
a = N%26
ans.append(chr(97+a))
N = N//26
#print(ans)
ret = ""
for i in range(len(ans)):
ret += ans[-1-i]
#print(ret)
print(ret)
|
num = int(input())
def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(122)
else:
return num2alpha(num//26)+chr(96+num%26)
print(num2alpha(num))
| 1 | 11,878,476,612,582 | null | 121 | 121 |
from collections import deque
def bfs(i, j):
dist = [[0] * w for _ in range(h)]
q = deque()
q.append((i, j))
dist[i][j] = 1
while q:
nx, ny = q.pop()
for dx, dy in D:
X, Y = nx + dx, ny + dy
if X < 0 or Y < 0 or X >= h or Y >= w:
continue
if m[X][Y] == "#":
continue
if dist[X][Y] != 0:
continue
q.appendleft((X, Y))
dist[X][Y] = 1 + dist[nx][ny]
mx = 0
for i in dist:
mx = max(mx, max(i))
return mx
h, w = map(int, input().split())
m = [input() for _ in range(h)]
D = [(-1, 0), (0, -1), (1, 0), (0, 1)]
ans = 0
for i in range(h):
for j in range(w):
if m[i][j] == ".":
ans = max(ans, bfs(i, j))
print(ans - 1)
|
def resolve():
s, w = map(int, input().split())
if s <= w:
print("unsafe")
else:
print("safe")
resolve()
| 0 | null | 62,027,367,581,930 | 241 | 163 |
n=int(input())
r="ACL"*n
print(r)
|
C=input()
table=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for i in range(26):
if(C==table[i]):
print(table[i+1])
| 0 | null | 47,077,350,954,620 | 69 | 239 |
a,b = input().split()
aaa = a * int(b)
bbb = b * int(a)
print(min(aaa, bbb))
|
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 = 1
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
a,b = I()
A = str(a)*b
B = str(b)*a
print(min(A,B))
| 1 | 84,313,827,290,180 | null | 232 | 232 |
# 25
import itertools
n = int(input())
a = tuple(list(map(int,input().split())))
b = tuple(list(map(int,input().split())))
list = [num for num in range(1, n + 1)]
count = 1
aidx = bidx = 0
for i in itertools.permutations(list, n):
if i == a: aidx = count
if i == b: bidx = count
if aidx != 0 and bidx != 0: break
count += 1
print(abs(aidx - bidx))
|
from itertools import permutations
from math import factorial
n = int(input())
p = tuple(map(int, input().split(' ')))
q = tuple(map(int, input().split(' ')))
l = [i for i in range(1, n+1)]
ls = list(permutations(l))
for i in range(factorial(n)):
if p==ls[i]:
a = i
if q==ls[i]:
b = i
print(abs(a-b))
| 1 | 100,144,162,589,568 | null | 246 | 246 |
n,m = map(int,input().split())
if(n % 2 == 0):
d = n // 2 - 1
c = 0
i = 1
while(d > 0):
print(i,i+d)
d -= 2
i += 1
c += 1
if(c == m):exit()
d = n // 2 - 2
i = n // 2 + 1
while(d > 0):
print(i,i+d)
d -= 2
i += 1
c += 1
if(c == m):exit()
else:
for i in range(m):
print(i+1,n-i)
|
n,k=map(int,input().split())
ans=[]
if n%2==1:
a=1
b=n
for _ in range(k):
ans.append([a,b])
a+=1
b-=1
else:
a=1
b=n
s=set()
for _ in range(k):
s.add(abs(a-b))
s.add(abs(n+a-b)%n)
ans.append([a,b])
a+=1
b-=1
if abs(a-b) in s or abs(n+a-b)%n in s or abs(a-b)==abs(n+a-b):
b-=1
for i in range(k):
print(*ans[i])
| 1 | 28,743,902,164,828 | null | 162 | 162 |
import sys
readline = sys.stdin.readline
N,M = map(int,readline().split())
A = list(map(int,readline().split()))
MAX_VAL = 10 ** 5 + 1
hand = [0] * MAX_VAL
for a in A:
hand[a] += 1
import numpy as np
def convolve(f, g):
fft_len = 1
while 2 * fft_len < len(f) + len(g) - 1:
fft_len *= 2
fft_len *= 2
Ff = np.fft.rfft(f, fft_len)
Fg = np.fft.rfft(g, fft_len)
Fh = Ff * Fg
h = np.fft.irfft(Fh, fft_len)
h = np.rint(h).astype(np.int64)
return h[:len(f) + len(g) - 1]
right_hand = np.array(hand, dtype = int)
left_hand = np.array(hand, dtype = int)
H = convolve(left_hand, right_hand)
# Hを大きいほうから見ていくと、
# 幸福度iの握手をH[i]種類できることが分かる
# 上から順に足していって、最後H[i]種類の握手を足せないときは、残りの握手回数だけ足す
ans = 0
for i in range(len(H) - 1, -1, -1):
if H[i] == 0:
continue
if H[i] <= M: # H[i]回の握手ができる
ans += i * H[i]
M -= H[i]
else: # H[i]回の握手ができないので、残った回数だけ握手する
ans += M * i
break
print(ans)
|
import numpy as np
from numpy.fft import rfft, irfft
N, M = map(int, input().split())
*A, = map(int, input().split())
B = np.zeros(5*10**5)
for a in A:
B[a] += 1
L = 5*10**5
FB = rfft(B, L)
C = np.rint(irfft(FB*FB)).astype(int)
ans = 0
for i in range(2*10**5, -1, -1):
c = C[i]
if not c:
continue
if M - c > 0:
ans += i*c
M -= c
else:
ans += i*M
break
print(ans)
| 1 | 108,063,219,404,540 | null | 252 | 252 |
X, Y = map(int, input().split())
print(400000*(X==1)*(Y==1) + max(0, 400000-100000*X) + max(0, 400000-100000*Y))
|
N = int(input())
X = input()
val = int(X,2)
C = X.count("1")
if C==1:
for i in range(N):
if X[i]=='1':
print(0)
elif i==N-1:
print(2)
else:
print(1)
exit()
# xをpopcountで割ったあまりに置き換える
def f(x):
if x==0: return 0
return 1 + f(x % bin(x).count("1"))
# 初回のpopcountでの割り方は、(C+1) or (C-1)
Y = val%(C+1)
if C-1 != 0:
Z = val%(C-1)
else:
Z = 0
for i in range(N):
if X[i] == "1":
if Z - 1 == 0:
print(0)
continue
k = (Z - pow(2,N-i-1,C-1)) % (C-1)
else:
k = (Y + pow(2,N-i-1,C+1)) % (C+1)
print(f(k)+1)
| 0 | null | 74,258,905,760,200 | 275 | 107 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
while y: x,y = y,x%y
return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
"""Return a tuple list of divisor of n"""
return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
"""Return a list of prime numbers n or less"""
is_prime = [True]*(MAX_NUM+1)
is_prime[0] = is_prime[1] = False
for i in range(2, int(MAX_NUM**0.5)+1):
if not is_prime[i]: continue
for j in range(i*2, MAX_NUM+1, i):
is_prime[j] = False
return [i for i in range(MAX_NUM+1) if is_prime[i]]
## libs ##
from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#
def main():
a, b, m = MII()
aa = MII()
bb = MII()
q = [MII() for _ in range(m)]
minv = min(aa) + min(bb)
for x,y,c in q:
minv = min(minv, aa[x-1]+bb[y-1]-c)
print(minv)
if __name__ == '__main__':
main()
|
n,m=map(int,input().split())
h=list(map(int,input().split()))
l=[1]*n
for i in range(m):
a,b=map(int,input().split())
if h[a-1]==h[b-1]:
l[a-1]=0
l[b-1]=0
if h[a-1]>h[b-1]:
l[b-1]=0
if h[a-1]<h[b-1]:
l[a-1]=0
print(l.count(1))
| 0 | null | 39,648,186,934,592 | 200 | 155 |
while True:
H, W = map(int, input().split())
if H == W == 0:
break
for i in range(H):
for j in range(W):
if (i + j) % 2 == 0:
print('#', end = '')
else:
print('.', end = '')
print()
print()
|
import sys
while 1:
H, W = map(int, raw_input().split())
if H==0 and W==0:
break
for i in range(H):
for j in range(W):
if (i+j)%2==0:
sys.stdout.write('#')
else:
sys.stdout.write('.')
sys.stdout.write('\n')
print ''
| 1 | 871,272,014,458 | null | 51 | 51 |
n,k=map(int, input().split())
w=[0]*n
for i in range(n):
w[i]=int(input())
def delivable(m):
loading=0
track_num=1
for i in range(n):
if w[i] > m:
return False
break
else:
loading += w[i]
if loading > m:
loading=w[i]
track_num += 1
if track_num <= k:
return True
else:
return False
r=1000000000
l=min(w)-1
while r-l > 1:
m=(r+l)//2
if delivable(m):
r=m
else:
l=m
print(r)
|
from functools import reduce
n, a, b = map(int, input().split())
mod = 10**9 + 7
def f(A):
bunsi = reduce(lambda x, y: x*y%mod, range(n, n-A, -1))
bunbo = reduce(lambda x, y: x*y%mod, range(1, A+1))
return bunsi * pow(bunbo, mod-2, mod) % mod
ans = pow(2, n, mod) - f(a) -f(b) - 1
ans %= mod
print(ans)
| 0 | null | 33,197,302,316,900 | 24 | 214 |
N = int(raw_input())
A = map(int, raw_input().split())
count = 0
for i in xrange(N):
minj = i
for j in xrange(i, N):
if A[j] < A[minj]:
minj = j
if minj != i:
A[i], A[minj] = A[minj], A[i]
count += 1
print ' '.join(map(str, A))
print count
|
import sys
import heapq
from decimal import Decimal
input = sys.stdin.readline
n = int(input())
alpha_list = [chr(i) for i in range(97, 97+26)]
def dfs(s,used_count):
if len(s) == n:
print(s)
return
for i in range(used_count+1):
if i == used_count:
dfs(s+alpha_list[i],used_count+1)
else:
dfs(s+alpha_list[i],used_count)
dfs("a",1)
| 0 | null | 26,271,559,361,246 | 15 | 198 |
def main():
a, b, c = [int(x) for x in input().split()]
count = int(input())
while a >= b:
b *= 2
count -= 1
while b >= c:
c *= 2
count -= 1
print('Yes' if count >= 0 else 'No')
if __name__ == '__main__':
main()
|
def cmb(n,r,mod):
a=1
b=1
r = min(r,n-r)
for i in range(r):
a = a*(n-i)%mod
b = b*(i+1)%mod
return a*pow(b,mod-2,mod)%mod
mod = 10**9+7
n,a,b = list(map(int,input().split()))
ans = pow(2,n,mod)+mod - cmb(n,a,mod) - cmb(n,b,mod)
ans = (ans -1)%mod
print(ans)
| 0 | null | 36,715,467,268,388 | 101 | 214 |
n = int(input())
answer = 0
for i in range(1, n + 1):
if i % 3 == 0 or i % 5 == 0:
i = 0
else:
answer = answer + i
print(answer)
|
def main():
N = int(input())
total = 0
for i in range(N):
i = i + 1
if i % 3 == 0 and i % 5 == 0:
continue
elif i % 3 == 0:
continue
elif i % 5 == 0:
continue
total = total + i
print(total)
main()
| 1 | 35,042,607,346,748 | null | 173 | 173 |
n = list(map(int, input().split(' ')))
m = list(map(int, input().split(' ')))
if n[0] >= sum(m):
print(n[0] - sum(m))
else:
print(-1)
|
def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n,m=sep()
ar=lis()
k=sum(ar)
if k>n:
print(-1)
else:
print(n-k)
| 1 | 31,962,218,321,318 | null | 168 | 168 |
n, k = map(int, input().split())
mod = 1000000007
def pow(x, n):
ret = 1
while n > 0:
if (n & 1) == 1:
ret = (ret * x) % mod
x = (x * x) % mod
n //= 2
return ret
fac = [1]
inv = [1]
for i in range(n * 2):
fac.append(fac[-1] * (i + 1) % mod)
inv.append(pow(fac[-1], mod - 2))
def cmb(n, k):
if k < 0 or k > n:
return 0
return (fac[n] * inv[k] * inv[n - k]) % mod
x = max(0, n - k - 1)
ret = cmb(n * 2 - 1, n - 1)
for i in range(x):
ret = (ret - cmb(n, i + 1) * cmb(n - 1, i)) % mod
print(ret)
|
N=int(input())
S=input()
x="Yes"
if N%2==1:
print("No")
else:
for i in range(0,N//2):
if S[i]!=S[i+N//2]:
x="No"
break
print(x)
| 0 | null | 107,201,979,518,842 | 215 | 279 |
a, b, c = map(int, input().split())
d = abs(a)
count = min(d//c, b)
d -= c*count
b -= count
if b % 2 == 1:
d -= c
print(abs(d))
|
n, k = map(int, input().split())
ans = 0
for i in range(k, n + 2):
l = int(i * (i - 1) / 2)
r = n * i - l
ans += r - l + 1
ans %= 10 ** 9 + 7
print(ans)
| 0 | null | 19,046,573,929,600 | 92 | 170 |
n,a,b= list(map(int, input().strip().split()))
c=a+b
s=n//c
t=n%c
t=min(a,t)
print(a*s+t)
|
from collections import deque
h,w=map(int,input().split())
s=[input() for _ in range(h)] #マップ
vi=[ [-1 for _ in range(w)] for _ in range(h)]#visit
st=deque()
d=[[0,1],[-1,0],[1,0],[0,-1]]
mx=0
for i in range(h):
for j in range(w):
vi=[ [-1 for _ in range(w)] for _ in range(h)]
st.append([i,j,0])
while st:
h1,w1,k=st.popleft()
if 0<=h1<h and 0<=w1<w and vi[h1][w1]==-1 and s[h1][w1]==".":
vi[h1][w1]=k
for m in d:
st.append([h1+m[0],w1+m[1],k+1])
for m in vi:
mx=max(mx,max(m))
print(mx)
| 0 | null | 75,506,862,286,272 | 202 | 241 |
def main(S, T):
ans = len(T)
for w in range(len(S)-len(T)+1):
tmp = len(T)
for s, t in zip(S[w:w+len(T)], T):
if s == t:
tmp -= 1
if tmp < ans:
ans = tmp
return ans
if __name__ == '__main__':
S = input()
T = input()
ans = main(S, T)
print(ans)
|
n=int(input())
l = [list(map(int,input().split())) for i in range(n)]
ans='No'
for i in range(n-2):
if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] and l[i+2][0]==l[i+2][1]:
ans='Yes'
print(ans)
| 0 | null | 3,053,548,458,324 | 82 | 72 |
S = input()
N = len(S)
flag = True
if S!="".join(reversed(list(S))):
flag=False
if S[:int((N-1)/2)]!="".join(reversed(list(S[:int((N-1)/2)]))):
flag=False
print("Yes" if flag else "No")
|
from math import sqrt, ceil
def divisors(n):
out = []
nn = ceil(sqrt(n))
for i in range(1, nn):
if n % i == 0:
out.append(i)
out.append(n//i)
if nn ** 2 == n:
out.append(nn)
out.sort()
return out
n = int(input())
a = len(divisors(n-1)[1:])
d = divisors(n)
for dd in d[1:]:
nn = n
while nn % dd == 0:
nn = nn // dd
if nn % dd == 1:
a += 1
print(a)
| 0 | null | 43,838,595,124,258 | 190 | 183 |
#!/usr/bin/env python
d, t, s = [int(i) for i in input().split(' ')]
if s*t >= d:
print('Yes')
else:
print('No')
|
from collections import deque
process = deque(maxlen=100000)
n, q = [int(x) for x in input().split(' ')]
for i in range(n):
name, time = input().split(' ')
process.append([name, int(time)])
total_time = 0
while process:
p_q = process.popleft()
if p_q[1] > q:
total_time += q
p_q[1] -= q
process.append(p_q)
else:
total_time += p_q[1]
print('{} {}'.format(p_q[0], total_time))
| 0 | null | 1,763,274,158,240 | 81 | 19 |
lis=list(input().split())
num=list(map(int,input().split()))
num[lis.index(input())]-=1
print(str(num[0])+" "+str(num[1]))
|
def resolve():
s, t = input().split()
a, b = list(map(int, input().split()))
u = input()
if u == s:
a -= 1
elif u == t:
b -= 1
print(a, b)
resolve()
| 1 | 71,632,570,184,462 | null | 220 | 220 |
d=set()
for _ in[0]*int(input()):
c,g=input().split()
if'i'==c[0]:d|=set([g])
else:print(['no','yes'][g in d])
|
n = int( raw_input( ) )
dic = {}
for i in range( n ):
cmd, word = raw_input( ).split( " " )
if "insert" == cmd:
dic[ word ] = True
elif "find" == cmd:
if not dic.get( word ):
print( "no" )
else:
print( "yes" )
| 1 | 74,770,222,410 | null | 23 | 23 |
import sys
input = sys.stdin.readline
def main():
N = int( input())
U = []
V = []
for _ in range(N):
x, y = map( int, input().split())
u, v = x+y, x-y
U.append(u)
V.append(v)
U.sort()
V.sort()
print( max(U[-1]-U[0], V[-1]-V[0]))
if __name__ == '__main__':
main()
|
n = int(input())
print(n//2-1 + n % 2)
| 0 | null | 78,600,158,831,260 | 80 | 283 |
a = input()
a = a.split()
b = input()
b = b.split()
c = input()
c = c.split()
d = [a[0],b[0],c[0]]
e = [a[1],b[1],c[1]]
f = [a[2],b[2],c[2]]
g = [a[0],b[1],c[2]]
h = [a[2],b[1],c[0]]
n = int(input())
for i in range(n):
j = int(input())
for k in range(3):
if int(a[k])==j:
a.pop(k)
a.insert(k,0)
if int(b[k])==j:
b.pop(k)
b.insert(k,0)
if int(c[k])==j:
c.pop(k)
c.insert(k,0)
if int(d[k])==j:
d.pop(k)
d.insert(k,0)
if int(e[k])==j:
e.pop(k)
e.insert(k,0)
if int(f[k])==j:
f.pop(k)
f.insert(k,0)
if int(g[k])==j:
g.pop(k)
g.insert(k,0)
if int(h[k])==j:
h.pop(k)
h.insert(k,0)
if a == [0,0,0] or b == [0,0,0] or c == [0,0,0] or d == [0,0,0] or e == [0,0,0] or f == [0,0,0] or g == [0,0,0] or h == [0,0,0]:
print("Yes")
else:
print("No")
|
def main():
bingo = []
for ss in range(3):
s = list(map(int,input().strip().split()))
bingo.append(s)
n = int(input())
nl = []
for nn in range(n):
nl.append(int(input()))
for i in range(3):
for j in range(3):
for n in nl:
if bingo[i][j] == n:
bingo[i][j] = -1
for i in range(3):
if bingo[0][i] == bingo[1][i] == bingo[2][i] == -1:
print("Yes")
return
if bingo[i][0] == bingo[i][1] == bingo[i][2] == -1:
print("Yes")
return
if bingo[0][0] == bingo[1][1] == bingo[2][2] == -1:
print("Yes")
return
if bingo[0][2] == bingo[1][1] == bingo[2][0] == -1:
print("Yes")
return
print("No")
return
main()
| 1 | 60,259,183,368,388 | null | 207 | 207 |
cards = list()
pattern = ["S", "H", "C","D"]
n = int(input())
for i in range(n) :
s, r = input().split() #文字列として読み込み
r = int(r) #sは文字列、rは数値
if(s == "S") :
cards.append(0 + r)
elif(s == "H") :
cards.append(13 + r)
elif(s == "C") :
cards.append(26 + r)
else :
cards.append(39 + r)
for i in range(1, 53) :
if not(i in cards) :
print(pattern[(i - 1) // 13], (i - 1) % 13 + 1)
|
def readInt():
return list(map(int, input().split()))
h, w = readInt()
if h == 1 or w == 1:
print(1)
elif h*w%2 == 0:
print(h*w//2)
else:
print(h*w//2+1)
| 0 | null | 26,042,781,278,308 | 54 | 196 |
import sys
n=int(input())
a=input()
a=[int(s)for s in a.split()]
M=1
Q=1
m=sum(a)
if a[0]>=1:
if a[0]==1 and n==0:
print(1)
sys.exit()
else:
print(-1)
sys.exit()
for i in range(n):
M=2*M-a[i+1]
if M<0:
print(-1)
sys.exit()
M1=M+a[i+1]
m=m-a[i]
Q=Q+min(M1,m)
print(Q)
|
def main():
n = int(input())
xym, xyM, x_ym, x_yM = 10**9, -10**9, 10**9, -10**9
for _ in range(n):
x, y = map(int, input().split())
xy, x_y = x+y, x-y
xym, xyM, x_ym, x_yM = min(xym, xy), max(xyM, xy), min(x_ym, x_y), max(x_yM, x_y)
print(max(xyM-xym, x_yM-x_ym))
if __name__ == "__main__":
main()
| 0 | null | 11,176,008,779,222 | 141 | 80 |
from collections import deque
n=int(input())
arr=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
arr[a-1].append([b-1,i])
arr[b-1].append([a-1,i])
que=deque([0])
ans=[0]*(n-1)
par=[0]*n
par[0]=-1
while que:
x=que.popleft()
p=par[x]
color=1
for tup in arr[x]:
if p==color:
color+=1
if ans[tup[1]]==0:
ans[tup[1]]=color
par[tup[0]]=color
color+=1
que.append(tup[0])
print(max(ans))
print(*ans,sep='\n')
|
N = int(input())
aaa = [int(i) for i in input().split()]
sumxor = 0
for a in aaa:
sumxor = sumxor^a
bbb = [a^sumxor for a in aaa]
print(" ".join([str(b) for b in bbb]))
| 0 | null | 73,976,392,523,450 | 272 | 123 |
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
c=[0]*60
for aa in a:
for i in range(60):
if aa&(1<<i):c[i]+=1
ans=0
for i,cc in enumerate(c):
ans+=cc*(n-cc)*2**i
ans%=mod
print(ans)
|
import sys
import math
from heapq import *
import fractions
from collections import defaultdict
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
N=int(input())
A=nl()
A.sort(reverse=True)
mod=10**9+7
keta=[0]*60
for i in range(N):
for j in range(60):
keta[j]+=((A[i]>>j)&1)
ans=0
mod_div2=[0]*60
mod_div2[0]=1
for i in range(1,60):
mod_div2[i]=(2*mod_div2[i-1])%mod
for i in range(len(A)):
keta_max=0
for j in range(60):
if((A[i]>>j)&1):
keta_max=j+1
for j in range(keta_max):
if((A[i]>>j)&1):
keta[j]-=1
ans+=mod_div2[j]*(len(A)-i-1-keta[j])
else:
ans+=mod_div2[j]*keta[j]
ans%=mod
print(ans%mod)
| 1 | 123,129,376,146,348 | null | 263 | 263 |
from math import *
a, b, C = map(float, input().split())
c = sqrt(a ** 2 + b ** 2 - 2 * a * b * cos(radians(C)))
s = (a + b + c) / 2
S = sqrt(s * (s - a) * (s - b) * (s - c))
L = a + b + c
h = b * sin(radians(C))
print(S)
print(L)
print(h)
|
import math
a, b, C = map(int, input().split())
print('{0}'.format(0.5 * a * b * math.sin(C * math.pi / 180)))
print('{0}'.format(a + b + (a ** 2 + b ** 2 - 2 * a * b * math.cos(C * math.pi / 180)) ** 0.5))
print('{0}'.format(b * math.sin(C * math.pi / 180)))
| 1 | 180,077,016,132 | null | 30 | 30 |
N, K = map(int, input().split())
A = list()
for i in range(K):
input()
A.extend(list(map(int, input().split())))
print(N - len(set(A)))
|
n,k=map(int,input().split())
L=[1]*n
for i in range(k):
d=int(input())
A=list(map(int,input().split()))
for a in A:
L[a-1] = 0
print(sum(L))
| 1 | 24,451,629,280,932 | null | 154 | 154 |
s, t = map(str, input().split())
a, b = map(int, input().split())
u = input()
st = {}
st[s] = a
st[t] = b
st[u] -= 1
print('{} {}'.format(st[s], st[t]))
|
s, t = input().split()
a, b =map(int, input().split())
x = input()
if x == s:
print(a - 1, b)
else:
print(a, b - 1)
| 1 | 71,998,222,510,606 | null | 220 | 220 |
n = int(input())
s = input().split()
s.reverse()
print(' '.join(map(str,s)))
|
K = int(input())
A, B = map(int, input().split())
exist = False
for i in range(A, B+1):
if i % K == 0:
exist = True
print('OK' if exist else 'NG')
| 0 | null | 13,738,095,926,798 | 53 | 158 |
#!/usr/bin/env python3
def main():
n = int(input())
a = list(map(int, input().split()))
ans = [None] * n
allxor = 0
for i in range(n):
allxor ^= a[i]
for i in range(n):
ans[i] = allxor ^ a[i]
print(*ans)
if __name__ == "__main__":
main()
|
N = int(input())
a = list(map(int, input().split()))
x = 0
for r in a:
x ^= r
print(' '.join([str(x^r) for r in a]))
| 1 | 12,461,040,500,858 | null | 123 | 123 |
def main():
n = int(input())
ans = 0
m = n - 1
num = 1
while num * num <= m:
if m % num == 0:
if num > 1:
ans += 1
if m // num != num:
ans += 1
num += 1
num = 1
while num * num <= n:
if n % num == 0:
tmp = n
while num > 1 and tmp % num == 0:
tmp = tmp // num
if tmp == 1 or tmp % num == 1:
ans += 1
rest = n // num
if rest != num:
tmp = n
while tmp % rest == 0:
tmp = tmp // rest
if tmp == 1 or tmp % num == 1:
ans += 1
num += 1
print(ans)
if __name__ == "__main__":
main()
|
N = int(input())
divs = set()
n = 1
while n*n <= N:
if N%n==0:
divs.add(n)
divs.add(N//n)
n += 1
divs2 = set()
n = 1
while n*n <= (N-1):
if (N-1)%n==0:
divs2.add(n)
divs2.add((N-1)//n)
n += 1
ans = len(divs2) - 1
for d in divs:
if d==1: continue
n = N
while n >= 1:
if n==1:
ans += 1
break
if n%d == 0:
n //= d
else:
if n%d == 1:
ans += 1
break
print(ans)
| 1 | 41,067,376,805,614 | null | 183 | 183 |
N = int(input())
res = 0
cnt = 0
for i in range(N):
D = input().split()
if D[0] == D[1]:
cnt += 1
if cnt == 3:
res += 1
cnt = 0
else:
cnt = 0
if res > 0:
print('Yes')
else:
print('No')
|
n=int(input())
alist=[0]*n
for i in range(n):
a,b=map(int, input().split())
if a==b:
alist[i]=alist[max(i-1,0)]+1
if max(alist)>=3:
print('Yes')
else:
print('No')
| 1 | 2,487,422,568,320 | null | 72 | 72 |
num = int(raw_input())
line = raw_input()
A = line.strip().split(" ")
print " ".join(A)
#A = map(int, item_str)
for i in range(1, num):
v = int(A[i])
j = i - 1
for j in range(j, -1, -1):
if int(A[j]) > v:
A[j+1] = A[j]
j -= 1
else:
break
A[j+1] = str(v)
#A_str = map(str, A)
print " ".join(A)
|
def insertSort(a, n):
for i in range(1, n):
v = a[i]
j = i - 1
while j >= 0 and a[j] > v:
a[j+1] = a[j]
j -= 1
a[j+1] = v
print(' '.join(map(str, a)))
if __name__ == '__main__':
n = int(input())
a = [int(i) for i in input().split()]
print(' '.join(map(str, a)))
insertSort(a, n)
| 1 | 5,348,297,120 | null | 10 | 10 |
A1, A2, A3 = map(int, input().split())
print("bust") if (A1+A2+A3)>=22 else print("win")
|
def main():
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
tmp = i
for j in range(i, n):
if a[j] < a[tmp]:
tmp = j
if i != tmp:
a[i], a[tmp] = a[tmp], a[i]
ans += 1
print(*a)
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 59,493,539,464,602 | 260 | 15 |
from collections import deque
n, q = map(int, input().split())
t = 0
queue = deque([])
for _ in range(n):
name, time = input().split()
time = int(time)
queue.append([name, time])
while len(queue):
if queue[0][1] > q:
queue[0][1] -= q
t += q
queue.rotate(-1)
else:
t += queue[0][1]
queue[0][1] = t
print(" ".join(list(map(str, queue.popleft()))))
|
import sys
sys.setrecursionlimit(10**7)
n = int(input())
def dfs(s):
if len(s) == n:
print(s)
return 0
for x in map(chr, range(97, ord(max(s))+2)):
dfs(s+x)
dfs('a')
| 0 | null | 26,126,747,638,720 | 19 | 198 |
import sys
input = sys.stdin.readline
mod = 998244353
n, k = map(int, input().split())
lr = [list(map(int, input().split())) for _ in range(k)]
dp = [0] * (n+1)
dp[1] = 1
for i in range(1, n):
dp[i+1] += dp[i]
for l, r in lr:
dp[i+1] += dp[max(i-l+1, 0)] - dp[max(i-r, 0)]
dp[i+1] %= mod
print((dp[n]-dp[n-1])%mod)
|
i = 0
while True:
x = int(input()); i += 1
if x == 0:
break
print("Case {}: {}".format(i, x))
| 0 | null | 1,577,252,710,098 | 74 | 42 |
import sys
input = sys.stdin.readline
N = int(input())
musics = []
for _ in range(N):
s, t = input().split()
musics.append((s.strip(), int(t)))
X = input().strip()
ans = 0
flag = False
for s, t in musics:
if flag:
ans += t
if s == X:
flag = True
print(ans)
|
N,K=map(int, input().split())
def change(N,shinsu):
keta=0
for i in range(10**9):
if N<shinsu**i:
keta+=i
break
ans=[0]*keta
check=0
for i in range(1,keta+1):
j=N//(shinsu**(keta-i))
ans[check]=j
check+=1
N-=(j)*(shinsu**(keta-i))
return ans
print(len(change(N,K)))
| 0 | null | 80,338,106,736,208 | 243 | 212 |
def solve(n, k, a):
for i in range(k, n):
print("Yes" if a[i-k] < a[i] else "No")
n, k = map(int, input().split())
a = list(map(int, input().split()))
solve(n, k, a)
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
answers = ["Yes" if A[i] > A[i-K] else "No" for i in range(K, N)]
print("\n".join(answers))
| 1 | 7,132,375,653,248 | null | 102 | 102 |
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
MD2 = lambda d1,d2: [[INIT_VAL]*d2 for _ in range(d1)]
MD3 = lambda d1,d2,d3: [MD2(d2,d3) for _ in range(d1)]
## math
DIVC = lambda x,y: -(-x//y)
DIVF = lambda x,y: x//y
def main():
n, p = MII()
s = list(map(int, IS()))
if 10%p == 0: # pが2または5の場合
cnt = 0
for i, si in enumerate(s):
if si%p == 0:
cnt += i+1
print(cnt)
return None
d = [0]*p
d[0] = 1 # 0(mod p)はそれ単体で割り切れるため+1しておく
ss = 0
x = 1
for si in s[::-1]:
ss += x*si
ss %= p
d[ss] += 1
x = (10*x)%p # %p無しだとTLE
cnt = 0
for di in d:
cnt += di*(di-1)//2 # calc combination(n_C_2)
print(cnt)
if __name__ == "__main__":
main()
|
while True:
H, W = [int(i) for i in input().split()]
if W == 0 and H == 0:
break
for i in range(0, H):
if i == 0:
print('#' * W)
elif i == (H - 1):
print('#' * W)
elif H == 1:
break
else:
print('#', '.' * (W - 2), '#', sep='')
print()
| 0 | null | 29,599,177,998,752 | 205 | 50 |
def solve(n, m, s):
if s.find("1"*m) >= 0:
return -1
s = s[::-1]
i = 0
path = []
while i < n:
for j in range(min(m, n-i), 0, -1):
ni = i+j
if s[ni] == "0":
i = ni
path.append(j)
break
return " ".join(map(str, path[::-1]))
n, m = map(int, input().split())
s = input()
print(solve(n, m, s))
|
# -*- coding: utf-8 -*-
n,m = list(map(int,input().split()))
s = input()
inf=float("inf")
#i番目のマスに行くための最小手数と、なんマス移動してきたか
dp = [(0,0)] + [(inf,None) for _ in range(n)]
for i in range(1,n+1):
if s[i]=="0":
for j in range(min(m,i),0,-1):
if dp[i-j][0]<inf:
dp[i]=(dp[i-j][0]+1,j)
break
if dp[-1][1]:
i = n
ret = []
ra = ret.append
while dp[i][1]:
ra(dp[i][1])
i-=dp[i][1]
print(" ".join(map(str,ret[::-1])))
else:
print(-1)
| 1 | 139,543,567,647,008 | null | 274 | 274 |
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)]
print(*S,sep="")
"""
import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限
n = int(input())
s,t = input().split()
ans=""
for _ in range(n):
ans+=s[_]+t[_]
print(ans)
|
N = int(input())
S,T=input().split()
retsu = ""
for i in range(0,N):
mozi = S[i]+T[i]
retsu += mozi
print(retsu)
| 1 | 111,862,876,988,252 | null | 255 | 255 |
from itertools import accumulate
n = int(input())
song= []
time = []
for i in range(n):
s, t = input().split()
song.append(s)
time.append(int(t))
time_acc = list(accumulate(time))
x = input()
print(time_acc[n - 1] - time_acc[song.index(x)])
|
n = int(input())
d = {}
t = [0]*n
for i in range(n):
S,T = input().split()
d[S] = i
t[i] = int(T)
x = input()
idx = d[x]
print(sum(t[idx+1:]))
| 1 | 97,015,085,229,440 | null | 243 | 243 |
t = input()
leng = len(t)
print('x' * leng)
|
s = input()
t = len(s)
print('x'*t)
| 1 | 73,195,455,085,578 | null | 221 | 221 |
str = input()
print(str[0]+str[1]+str[2])
|
a=input()
print(a[0:3])
| 1 | 14,794,459,344,658 | null | 130 | 130 |
import math
def main():
H = {int(input()): 1}
ans = 0
while True:
new_H = {}
for h, freq in H.items():
ans += freq
if h > 1:
new_H[h // 2] = 2 * freq
if len(new_H) == 0:
break
else:
H = new_H
print(ans)
if __name__ == '__main__':
main()
|
def main():
n,a,b=map(int,input().split())
di = 0
if (b-a)%2==1:
w = a-1
l = n-b
di = (w - l)
if di < 0:
di = -w-1
else:
di = l+1
a += di
if a < 1:
a = 1
b += di
if b > n:
b = n
#print(a,b,di)
print((b-a)//2 + abs(di))
if __name__ == "__main__":
main()
| 0 | null | 94,815,690,664,220 | 228 | 253 |
import sys
while True:
try:
a,b = map(int,raw_input().split())
tempa = a
tempb = b
while tempa % tempb != 0 :
tempa , tempb = (tempb,tempa%tempb)
gcd = tempb
lcm = a * b / gcd
print "%d %d" % ( gcd, lcm)
except EOFError:
break
|
def gcd(a,b):
while a%b :
a,b=b,a%b
return b
def lcm(a,b):
return a*b/gcd(a,b)
while True :
try:
a,b = map(int,raw_input().split())
a,b = max(a,b), min(a,b)
print "%d" % gcd(a,b),
print "%d" % lcm(a,b)
except EOFError:
break
| 1 | 543,359,976 | null | 5 | 5 |
a=list(map(int,input().split()))
if a[0]+a[1]+a[2]>=22:
print("bust")
else:
print("win")
|
a,b,c = map(int,input().split())
if a + b + c >= 22:
print('bust')
if a + b + c <= 21:
print('win')
| 1 | 118,898,399,739,924 | null | 260 | 260 |
import sys
#import time
from collections import deque, Counter, defaultdict
#from fractions import gcd
import bisect
#import heapq
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**18
MOD = 1000000007
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
a,b,x = rl()
if x<=a*a*b/2:
print(180*math.atan(b**2*a/x/2)/math.pi)
else:
t = 2*(a*a*b-x)/a/a
print(180/math.pi*math.atan(t/a))
|
import math
a, b, x = map(int, input().split(" "))
cap = a * a * b
h = (x / cap) * b
if h / b >= 0.5:
gap = b - h
print(math.degrees(math.atan((gap / (a / 2)))))
else:
vol = h * a
gap = (vol / b) * 2
print(math.degrees(math.atan(b / gap)))
| 1 | 163,019,044,297,340 | null | 289 | 289 |
x = int(input())
if x < 30:
print("No")
elif x >= 30:
print("Yes")
|
#-*- coding: utf-8 -*-
X=int(input())
if X>=30:
print("Yes")
if X<30:
print("No")
| 1 | 5,764,897,158,520 | null | 95 | 95 |
import sys
lines = [list(map(int,line.split())) for line in sys.stdin]
n,m,l = lines[0]
A = lines[1:n+1]
B = [i for i in zip(*lines[n+1:])]
for a in A:
row = []
for b in B:
row.append(sum([i*j for i,j in zip(a,b)]))
print (" ".join(map(str,row)))
|
import sys
s=input().split()
n=int(s[0]);m=int(s[1]);l=int(s[2])
a=[[0 for j in range(m)]for i in range(n)]
b=[[0 for j in range(l)]for i in range(m)]
c=[[0 for j in range(l)]for i in range(n)]
for i in range(n):
t=input().split()
for j in range(m):
a[i][j]=int(t[j])
for i in range(m):
t=input().split()
for j in range(l):
b[i][j]=int(t[j])
for i in range(n):
for j in range(l):
for k in range(m):
c[i][j]+=a[i][k]*b[k][j]
sys.stdout.write("{0}".format(c[i][j]))
if j==l-1:
sys.stdout.write("\n")
else:
sys.stdout.write(" ")
| 1 | 1,445,036,272,722 | null | 60 | 60 |
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
def main():
l, r = tuple(map(int, input().split(' ')))
print(gcd(l, r))
main()
|
K,N=map(int,input().split())
lis=list(map(int,input().split()))
dt=[lis[i+1]-lis[i] for i in range(N-1)]+[lis[0]+(K-lis[-1])]
print(K-max(dt))
| 0 | null | 21,714,379,632,100 | 11 | 186 |
X, Y = map(int, input().split())
if Y % 2 == 0 and 2 * X <= Y <= 4 * X:
print("Yes")
else:
print("No")
|
a=int(input())
d=0
for i in range(2,int(a**0.5)+1):
c=0
while a%i==0:
c+=1
a//=i
for i in range(1,60):
if c>=i:
c-=i
d+=1
else:
break
if a==1:
break
if a!=1:
d+=1
print(d)
| 0 | null | 15,423,657,087,460 | 127 | 136 |
A=int(input())
B=int(input())
if 1 not in [A,B]:
print(1)
if 2 not in [A,B]:
print(2)
if 3 not in [A,B]:
print(3)
|
ab = set([input() for _ in range(2)])
s = {'1', '2', '3'}
print(''.join(s-ab))
| 1 | 110,891,991,415,400 | null | 254 | 254 |
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
print(1 if m1!=m2 else 0)
|
m1, d1 = input().split()
m2, d2 = input().split()
print('1' if m1 != m2 else '0')
| 1 | 124,268,917,343,910 | null | 264 | 264 |
k = int(input())
a,b = map(int,input().split())
for i in range(1000):
if a <= k*i <= b:
print("OK")
exit()
elif b < k*i:
print("NG")
exit()
|
N = int(input())
Ali = list(map(int,input().split()))
s = 1
res = 0
for i in range(N):
if Ali[i] == s:
s += 1
else:
res += 1
if s == 1:
print(-1)
else:
print(res)
| 0 | null | 70,673,598,471,340 | 158 | 257 |
'''
l = input().split()
l = list(map(int, l))
a,b,c = l[0],l[1],l[2]
'''
a,b,c = map(int, input().split())
if a > b:
a,b = b,a
if b > c:
b,c = c,b
if a > b:
a,b = b,a
print(a,b,c)
|
a,b,c = input().split()
a = int(a)
b = int(b)
c = int(c)
tmp = 0
if c < b:
tmp = b
b = c
c = tmp
if b < a:
tmp = a
a = b
b = tmp
if c < b:
tmp = b
b = c
c = tmp
print (str(a) + " " + str(b) + " " + str(c))
| 1 | 419,959,931,748 | null | 40 | 40 |
a = input()
if a == '1':
print('0')
else:
print('1')
|
import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
print(1-r())
| 1 | 2,909,291,876,488 | null | 76 | 76 |
# -*- coding: utf-8 -*-
def linearSearch(l, key):
m = len(l)
l.append(key)
i = 0
while l[i] != key:
i += 1
l.pop()
if i == m:
return "NOT_FOUND"
return i
if __name__ == '__main__':
n = int(input())
S = [int(s) for s in input().split(" ")]
q = int(input())
T = [int(t) for t in input().split(" ")]
count = 0
for t in T:
if linearSearch(S, t) != "NOT_FOUND":
count += 1
print(count)
|
s=list(input())
t=list(input())
t.pop(-1)
if s==t:
print('Yes')
else:
print('No')
| 0 | null | 10,690,781,899,420 | 22 | 147 |
x = int(input())
m = divmod(x, 500)
print(m[0] * 1000 + m[1] // 5 * 5)
|
N = int(input())
S = input()
count = 1
check = S[0]
for c in S:
if c != check:
count += 1
check = c
print(count)
| 0 | null | 106,331,685,057,178 | 185 | 293 |
# C - Count Order
N = int(input())
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
L = []
def rec(l,s):
if len(l)==N:
L.append(l)
else:
for x in s:
tmp_l = l[:]
tmp_l.append(x)
tmp_s = s[:]
tmp_s.remove(x)
rec(tmp_l,tmp_s)
rec(list(),[i+1 for i in range(N)])
a = 0
while P!=L[a]:
a += 1
b = 0
while Q!=L[b]:
b += 1
print(abs(a-b))
|
from itertools import permutations
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
perm = list(permutations(p))
perm.sort()
a = perm.index(p)
b = perm.index(q)
print(abs(a- b))
| 1 | 100,720,000,825,374 | null | 246 | 246 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
def main():
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
l = sorted(list(itertools.permutations(range(1,n+1), n)))
ans = []
for i in range(len(l)):
if l[i] == p:
ans.append(i)
elif l[i] == q:
ans.append(i)
if len(ans) == 1:
print(0)
else:
print(abs(ans[0]-ans[1]))
if __name__=="__main__":
main()
|
from itertools import permutations
n = int( input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
a = [i for i in range(1,n+1)]
x = list(permutations(a,n))
y = x.index(p)
z = x.index(q)
print(abs(y-z))
| 1 | 100,854,989,959,140 | null | 246 | 246 |
from collections import deque
K = int(input())
lunlun = deque([i for i in range(1,10)])
for i in range(K):
x = lunlun.popleft()
if x % 10 != 0:
lunlun.append(x * 10 + (x % 10) - 1)
lunlun.append(x * 10 + (x % 10))
if x % 10 != 9:
lunlun.append(x * 10 + (x % 10) + 1)
print(x)
|
H,W = map(int,input().split())
grid = [[0] for _ in range(H)]
for i in range(H):
grid[i] = input()
dp = [[float('inf')]*W for _ in range(H)]
if grid[0][0] == '.':
dp[0][0] = 0
else:
dp[0][0] = 1
for y in range(H):
for x in range(W):
if x > 0:
if grid[y][x-1] == '.' and grid[y][x] == '#':
dp[y][x] = min(dp[y][x],dp[y][x-1]+1)
else:
dp[y][x] = min(dp[y][x],dp[y][x-1])
if y > 0:
if grid[y-1][x] == '.' and grid[y][x] == '#':
dp[y][x] = min(dp[y][x],dp[y-1][x]+1)
else:
dp[y][x] = min(dp[y][x],dp[y-1][x])
print(dp[-1][-1])
| 0 | null | 44,615,162,667,590 | 181 | 194 |
#coding:utf-8
#1_2_B
def selection_sort(ary, n):
count = 0
for i in range(n):
minj = i
for j in range(i, n):
if ary[minj] > ary[j]:
minj = j
if ary[minj] != ary[i]:
ary[minj], ary[i] = ary[i], ary[minj]
count += 1
print(*ary)
print(count)
n = int(input())
selection_sort(list(map(int, input().split())), n)
|
a = list(map(int, input().rstrip().split()))
resto=a[0]%a[-1]
if resto >0:
o = a[0]+a[-1]- resto
else:
o= a[0]
print((a[1]-o)//a[-1]+1)
| 0 | null | 3,793,982,412,782 | 15 | 104 |
A, B, N = map(int, input().split())
if N >= B - 1:
x = B - 1
c = (A * x) // B - A * (x // B)
else:
x = N
c = (A * x) // B - A * (x // B)
print(c)
|
N,X,M=map(int,input().split())
a=[0]*(M)
A=X%M
a[A]=1
ans=A
Ans=[A]
flag=0
for i in range(N-1):
A=A*A%M
if A==0:
break
if a[A]==1:
flag=1
break
a[A]=1
ans+=A
Ans.append(A)
if flag==1:
for num in range(len(Ans)):
if A==Ans[num]:
break
n=len(Ans)-num
b=sum(Ans[:num])
x=(N-num)//n
y=(N-num)%n
Sum=b+(ans-b)*(x)+sum(Ans[num:y+num])
else:
Sum=sum(Ans)
print(Sum)
| 0 | null | 15,466,474,403,568 | 161 | 75 |
h1,m1,h2,m2,k = list(map(int, input().split()))
h = h2 -h1
m = m2 - m1
print(h*60+m-k)
|
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
import math
#from math import gcd
#inf = 10**17
#mod = 10**9 + 7
a,b,c,d,e = map(int, input().split())
if d >= b:
res = (c-a)*60 + d-b
print(res-e)
else:
res = (c-a-1)*60 + d-b+60
print(res-e)
if __name__ == '__main__':
main()
| 1 | 18,049,815,261,960 | null | 139 | 139 |
from collections import Counter
a = map(int, input().split())
c = Counter(a)
d = {1: 300000, 2: 200000, 3: 100000}
ret = sum(c[rank] * d[rank] for rank in range(1, 3 + 1))
if c[1] == 2:
ret += 400000
print(ret)
|
x,y = map(int,input().split())
if(x+y==2):
print(1000000)
else:
answer = 0
if(x==2):
answer+=200000
elif(x==3):
answer+=100000
elif(x==1):
answer+=300000
if(y==2):
answer+=200000
elif(y==3):
answer+=100000
elif(y==1):
answer+=300000
print(answer)
| 1 | 140,327,914,148,860 | null | 275 | 275 |
A, B, C = map(int, input().split())
K = int(input())
while A >= B:
B *= 2
K -= 1
while B >= C:
C *= 2
K -= 1
if K >= 0:
print('Yes')
else:
print('No')
|
A, B, C = [int(v) for v in input().strip().split(" ")]
K = int(input().strip())
while K > 0:
if B <= A:
B *= 2
K -= 1
elif C <= B:
C *= 2
K -= 1
else:
break
if C > B > A:
print("Yes")
else:
print("No")
| 1 | 6,861,998,692,770 | null | 101 | 101 |
c = ord(input())
c += 1
n = chr(c)
print(n)
|
in1 = input().split()
A = int(in1[0])
B = int(in1[1])
if A>=1 and B>=1 and A<=9 and B<=9:
print (A*B)
else:
print(-1)
| 0 | null | 124,996,700,377,504 | 239 | 286 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
def main():
x = int(input())
cnt = 0
a = 100
while True:
if a >= x:
print(cnt)
exit()
a = a*101//100
cnt += 1
if __name__=="__main__":
main()
|
x = int(input())
if(x==0):
print("1")
elif(x==1):
print("0")
| 0 | null | 14,988,180,579,626 | 159 | 76 |
import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win')
if __name__ == '__main__':
main()
|
N, K = map(int, input().split())
A = [-1] * (N+1)
for i in range(K):
d_list = int(input())
B = input().split()
B = [int(x) for x in B]
for i in range(1, N+1):
if i in B:
A[i] = 1
count = 0
for i in range(1, N+1):
if A[i] == -1:
count += 1
print(count)
| 0 | null | 71,734,732,405,160 | 260 | 154 |
from collections import Counter
n=int(input())
a=list(map(int,input().split()))
i_l=[]
j_l=[]
for i in range(n):
i_l.append(i+a[i])
j_l.append(i-a[i])
ci=Counter(i_l)
cl=Counter(j_l)
ans=0
for k,v in ci.items():
ans+=v*cl[k]
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
L = [i+A[i] for i in range(N)]
R = [i-A[i] for i in range(N)]
p = {}
m = {}
for i in range(N):
if L[i] not in p:
p[L[i]] = 1
else:
p[L[i]] += 1
for i in range(N):
if R[i] not in m:
m[R[i]] = 1
else:
m[R[i]] += 1
lower = max(min(p), min(m))
upper = min(max(p), max(m))
ans = 0
for x in range(lower, upper + 1):
if x in p and x in m:
ans += p[x] * m[x]
print(ans)
| 1 | 26,110,616,367,490 | null | 157 | 157 |
S,T = input().split()
a,b = map(int,input().split())
u = input()
if u == S:
a -= 1
elif u ==T:
b -= 1
print("{} {}".format(a,b))
|
# ABC154A
def f(s, t, a, b, u):
if u == s:
print(a - 1, b)
else:
print(a, b - 1)
s, t = input().split()
a, b = map(int, input().split())
u = input()
f(s, t, a, b, u)
| 1 | 72,132,651,947,018 | null | 220 | 220 |
import sys
input = lambda: sys.stdin.readline().rstrip()
def solve():
N, M = map(int, input().split())
ans = N * (N - 1) // 2 + M * (M - 1) // 2
print(ans)
if __name__ == '__main__':
solve()
|
import math
Num = input()
N = [input() for _ in range(Num)]
pnum_count = Num
for n in N:
if n == 2:
continue
if n % 2 == 0:
pnum_count -= 1
continue
i = 2
while i <= math.sqrt(n):
if n % i == 0:
pnum_count -= 1
break
i += 1
print pnum_count
| 0 | null | 22,930,528,086,798 | 189 | 12 |
import math
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort()
return divisors
n = int(input())
d2 = make_divisors(n - 1)
ans = len(d2)
for k in make_divisors(n):
if k == 1:
continue
tmp = n
while tmp % k == 0:
tmp //= k
if tmp % k == 1:
d2.append(k)
print(len(d2) - 1)
|
N = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
ans = len(make_divisors(N-1)) - 1
#print(ans)
divisors = make_divisors(N)
def dfs(x,N):
while N % x == 0:
N //= x
# print(N)
N %= x
# print(N)
return N == 1
counta = 0
for i in range(1,len(divisors)):
if dfs(divisors[i],N):
counta += 1
#print(counta)
ans += counta
print(ans)
| 1 | 41,596,030,767,718 | null | 183 | 183 |
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if DBG:
print(x)
s = ins()
t = ins()
ls = len(s)
lt = len(t)
mn = BIG
for i in range(ls-lt+1):
x = 0
for j in range(lt):
if s[i+j]!=t[j]:
x += 1
mn = min(mn,x)
print(mn)
|
S = input()
T = input()
max_count = 0
for i in range(max(1, len(S) - len(T))):
count = 0
for j in range(len(T)):
if S[i+j] == T[j]:
count += 1
max_count = max(max_count, count)
print(len(T) - max_count)
| 1 | 3,660,900,422,340 | null | 82 | 82 |
def gcd(a,b):
if b == 0:return a
return gcd(b,a%b)
a = int(input())
print(360//gcd(360,a))
|
x = int(input())
for i in range(1, 100000):
if x * i % 360 == 0:
print(i)
exit()
| 1 | 13,089,277,084,380 | null | 125 | 125 |
h = int(raw_input())
w = int(raw_input())
n = int(raw_input())
h,w = max(h,w),min(h,w)
print (n + h-1)/h
|
import sys,math,copy,queue,itertools,bisect
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
MOD = 10**9 + 7
INF = 10**15
N = NI()
A = LI()
ans = 0
if N % 2 == 0:
for i in range(1,N,2):
ans += A[i]
x = ans
for i in range(0,N,2):
x = x + A[i] - A[i+1]
ans = max(ans,x)
else:
dp = [0 for _ in range(3)]
for i in range(N):
ai = A[i]
if i % 2 == 0:
dp[1] = max(dp[0],dp[1])
dp[0] = dp[0] + ai
if i % 2 == 1:
dp[2] = max(dp[1],dp[2])
dp[1] += ai
if i % 2 == 0 and i > 0:
dp[2] += ai
ans = max(dp[1],dp[2])
print (ans)
| 0 | null | 63,182,588,488,828 | 236 | 177 |
from collections import Counter as C
n=int(input())
S=list(input())
a=1
L=C(S).most_common(3)
for l in L:
a*=l[1]
for i in range(1,n):
for j in range(n-2*i):
if len(set((S[j],S[j+i],S[j+2*i])))==3:
a-=1
print(a if len(L)>2 else 0)
|
N = int(input())
S = input()
r = [0 for _ in range(N + 1)]
g = [0 for _ in range(N + 1)]
b = [0 for _ in range(N + 1)]
for i in reversed(range(N)):
r[i] = r[i + 1]
g[i] = g[i + 1]
b[i] = b[i + 1]
if S[i] == "R":
r[i] += 1
if S[i] == "G":
g[i] += 1
if S[i] == "B":
b[i] += 1
ans = 0
for i in range(N):
if S[i] == "R":
for j in range(i + 1, N):
if S[j] == "G":
if 2 * j - i < N:
if S[2 * j - i] == "B":
ans += (b[j + 1] - 1)
else:
ans += b[j + 1]
else:
ans += b[j + 1]
for i in range(N):
if S[i] == "R":
for j in range(i + 1, N):
if S[j] == "B":
if 2 * j - i < N:
if S[2 * j - i] == "G":
ans += (g[j + 1] - 1)
else:
ans += g[j + 1]
else:
ans += g[j + 1]
for i in range(N):
if S[i] == "B":
for j in range(i + 1, N):
if S[j] == "R":
if 2 * j - i < N:
if S[2 * j - i] == "G":
ans += (g[j + 1] - 1)
else:
ans += g[j + 1]
else:
ans += g[j + 1]
for i in range(N):
if S[i] == "B":
for j in range(i + 1, N):
if S[j] == "G":
if 2 * j - i < N:
if S[2 * j - i] == "R":
ans += (r[j + 1] - 1)
else:
ans += r[j + 1]
else:
ans += r[j + 1]
for i in range(N):
if S[i] == "G":
for j in range(i + 1, N):
if S[j] == "R":
if 2 * j - i < N:
if S[2 * j - i] == "B":
ans += (b[j + 1] - 1)
else:
ans += b[j + 1]
else:
ans += b[j + 1]
for i in range(N):
if S[i] == "G":
for j in range(i + 1, N):
if S[j] == "B":
if 2 * j - i < N:
if S[2 * j - i] == "R":
ans += (r[j + 1] - 1)
else:
ans += r[j + 1]
else:
ans += r[j + 1]
print(ans)
| 1 | 36,056,394,575,890 | null | 175 | 175 |
a = int(input())
print(a+pow(a,2)+pow(a,3))
|
n=int(input())
I=list(map(int,input().split()))
for i in range(n):
if (I[i]%2==0):
if (I[i]%3!=0) and (I[i]%5!=0):
print("DENIED")
exit()
print("APPROVED")
| 0 | null | 39,444,212,229,536 | 115 | 217 |
n = int(input())
r_min = int(input())
r_t = int(input())
g_max = r_t - r_min
r_min = min(r_t,r_min)
for _ in range(n-2):
r_t = int(input())
g_max = max(g_max, r_t-r_min)
r_min = min(r_t,r_min)
print(g_max)
|
lis = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
S = input()
x = lis.index(S)
print(7-x)
| 0 | null | 66,334,155,545,280 | 13 | 270 |
n=int(input())
print(n+n*n+n*n*n)
|
def lcm(x, y):
from fractions import gcd
return (x * y) // gcd(x, y)
a,b = map(int,input().split())
print(lcm(a,b))
| 0 | null | 61,638,992,380,580 | 115 | 256 |
import sys
from typing import List
COMP_NUM = 0
def merge(elements: List[int], left: int, mid: int, right: int) -> None:
global COMP_NUM
n1 = mid - left
n2 = right - mid
left_array = [0] * (n1 + 1)
right_array = [0] * (n2 + 1)
left_array[0:n1] = elements[left:left + n1]
left_array[n1] = sys.maxsize
right_array[0:n2] = elements[mid:mid + n2]
right_array[n2] = sys.maxsize
i = 0
j = 0
for k in range(left, right):
COMP_NUM += 1
if left_array[i] <= right_array[j]:
elements[k] = left_array[i]
i += 1
else:
elements[k] = right_array[j]
j += 1
def merge_sort(elements: List[int], left: int, right: int) -> None:
if left + 1 < right:
mid = (left + right) // 2
merge_sort(elements, left, mid)
merge_sort(elements, mid, right)
merge(elements, left, mid, right)
if __name__ == "__main__":
n = int(input())
elements = list(map(lambda x: int(x), input().split()))
merge_sort(elements, 0, len(elements))
print(" ".join([str(elem) for elem in elements]))
print(f"{COMP_NUM}")
|
INFTY=1000000000
n=int(input())
A=list(map(int,input().split()))
def merge(A,left,mid,right):
cnt=0
n1=mid-left
n2=right-mid
L=[A[left+i] for i in range(n1)]
R=[A[mid+i] for i in range(n2)]
L.append(INFTY)
R.append(INFTY)
i=0
j=0
for k in range(left,right):
cnt+=1
if L[i]<=R[j]:
A[k]=L[i]
i+=1
else:
A[k]=R[j]
j+=1
return cnt
def mergeSort(A,left,right):
if left+1<right:
mid=(left+right)//2
cnt1=mergeSort(A,left,mid)
cnt2=mergeSort(A,mid,right)
return merge(A,left,mid,right)+cnt1+cnt2
return 0
cnt=mergeSort(A,0,n)
print(' '.join(map(str,A)))
print(cnt)
| 1 | 114,670,499,200 | null | 26 | 26 |
n, k = map(int, input().split())
*a, = map(int, input().split())
for i, j in zip(a, a[k:]):
print('Yes' if i < j else 'No')
|
while True:
[n, m] = [int(x) for x in raw_input().split()]
if [n, m] == [0, 0]:
break
data = []
for x in range(n, 2, -1):
for y in range(x - 1, 1, -1):
for z in range(y - 1, 0, -1):
s = x + y + z
if s < m:
break
if s == m:
data.append(s)
print(len(data))
| 0 | null | 4,246,698,985,220 | 102 | 58 |
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**5)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
a, b, c = geta(int)
print("win" if sum([a, b, c]) <= 21 else "bust")
if __name__ == "__main__":
main()
|
#!/usr/bin/python3
import sys
def input():
return sys.stdin.readline().rstrip('\n')
#S = input()
A1,A2,A3 = list(map(int,input().split()))
if A1+A2+A3 < 22:
print('win')
else:
print('bust')
| 1 | 118,428,227,944,378 | null | 260 | 260 |
n=int(input())
num=[1,1]
for i in range(43):
b=(num[-2])+(num[-1])
num.append(b)
print(num[(n)])
|
# -*- coding: utf-8 -*-
A, B=map(int,input().split())
if(A<=B):
print("unsafe")
else:
print("safe")
| 0 | null | 14,688,863,637,658 | 7 | 163 |
def main():
s=input()
ans=0
for i in range(0,int(len(s)/2)):
if s[i]!=s[-1*(i+1)]:
ans+=1
print(ans)
main()
|
S=input();N=len(S);print(sum(S[i]!=S[N-i-1] for i in range(N//2)))
| 1 | 119,856,336,151,042 | null | 261 | 261 |
N = int(input())
A,B=map(int,input().split())
Na = N
while N <= 1000:
if A <= N and N <= B:
print("OK")
break
N = N+Na
if N>1000:
print("NG")
|
k = int(input())
a, b = map(int, input().split())
f = False
for i in range(a, b+1):
if i%k == 0:
print('OK')
f = True
break
if f is False:
print('NG')
| 1 | 26,644,335,562,944 | null | 158 | 158 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.