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
|
|---|---|---|---|---|---|---|
import sys
input = sys.stdin.readline
import math
cos60 = math.cos(math.radians(60))
sin60 = math.sin(math.radians(60))
n = int(input())
def koch(d, p, q):#p,qはリストでp[0]がx座標、p[1]がy座標
if d == 0:
return
s=[0,0]
t=[0,0]
u=[0,0]
s[0] = (2 * p[0] + q[0]) / 3
s[1] = (2 * p[1] + q[1]) / 3
t[0] = (p[0] + 2 * q[0]) / 3
t[1] = (p[1] + 2 * q[1]) / 3
u[0] = (t[0] - s[0]) * cos60 - (t[1] - s[1]) * sin60 + s[0]
u[1] = (t[0] - s[0]) * sin60 + (t[1] - s[1]) * cos60 + s[1]
koch(d-1, p, s)
print(s[0], s[1])
koch(d-1, s, u)
print(u[0], u[1])
koch(d-1, u, t)
print(t[0], t[1])
koch(d-1, t, q)
a = [0, 0]
b = [100, 0]
print(a[0], a[1])
koch(n, a, b)
print(b[0], b[1])
|
from collections import defaultdict
import math
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
def C(n, r):
return P(n, r)//math.factorial(r)
S = input()[::-1]
N = len(S)
cnt = [0]*N
tmp = 0
d = defaultdict(int)
d[0] += 1
for i in range(N):
tmp += int(S[i])*pow(10,i,2019)
tmp %= 2019
d[tmp] += 1
ans = 0
for v in d.values():
if v >= 2:
ans += C(v,2)
print(ans)
| 0 | null | 15,491,367,796,078 | 27 | 166 |
N = int(input())
X = input()
mod0 = X.count("1") + 1
mod1 = X.count("1") - 1
full0 = 0
full1 = 0
for i in range(N):
if X[i] == "1":
full0 = (full0 + pow(2, N - i - 1, mod0)) % mod0
if mod1 > 0:
full1 = (full1 + pow(2, N - i - 1, mod1)) % mod1
ans = [0] * N
for i in range(N):
if X[i] == "0":
cur = (full0 + pow(2, N - i - 1, mod0)) % mod0
res = 1
else:
if mod1 > 0:
cur = (full1 - pow(2, N - i - 1, mod1)) % mod1
res = 1
else:
cur = 0
res = 0
while cur > 0:
cur %= bin(cur).count("1")
res += 1
ans[i] = res
print(*ans, sep="\n")
|
n=int(input())
X=input()
x=X.count('1')
x_plus=int(X,2)%(x+1)
keta=n-1
if x==1:
for i in range(n):
tmp=0
ans=1
if X[i]=='0':
tmp+=x_plus
tmp+=pow(2,keta,(x+1))
tmp%=(x+1)
while tmp:
tmp=tmp%(bin(tmp).count('1'))
ans+=1
print(ans)
else:
print(0)
keta-=1
else:
x_minus=int(X,2)%(x-1)
for i in range(n):
tmp=0
ans=1
if X[i]=='0':
tmp+=x_plus
tmp+=pow(2,keta,(x+1))
tmp%=(x+1)
while tmp:
tmp=tmp%(bin(tmp).count('1'))
ans+=1
print(ans)
else:
tmp+=x_minus
tmp-=pow(2,keta,(x-1))
tmp%=(x-1)
while tmp:
tmp=tmp%(bin(tmp).count('1'))
ans+=1
print(ans)
keta-=1
| 1 | 8,179,756,555,760 | null | 107 | 107 |
N = list(map(int, input().split()))
if sum(N) % 9: print('No')
else: print('Yes')
|
# 176 B
N = int(input())
print('Yes') if N % 9 == 0 else print('No')
| 1 | 4,449,040,887,232 | null | 87 | 87 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
#from decimal import *
H, W = MAP()
S = [input() for _ in range(H)]
dy = (1, 0, -1, 0)
dx = (0, -1, 0, 1)
def diff_max(start_y, start_x):
check = [[-1]*W for _ in range(H)]
check[start_y][start_x] = 0
q = deque([(start_y, start_x)])
while q:
y, x = q.popleft()
for i in range(4):
ny = y + dy[i]
nx = x + dx[i]
if 0 <= ny < H and 0 <= nx < W:
if check[ny][nx] == -1 and S[ny][nx] == ".":
check[ny][nx] = check[y][x] + 1
q.append((ny, nx))
return max([max(x) for x in check])
ans = -INF
for i in range(H):
for j in range(W):
if S[i][j] == ".":
ans = max(ans, diff_max(i, j))
print(ans)
|
inf=float("inf")
h,w=map(int,input().split())
s=[["#"]*(w+2) for i in range(h+2)]
for i in range(h):
s[i+1]=["#"]+list(input())+["#"]
#h,w=3,5
#s=[['#', '#', '#', '#', '#', '#', '#'], ['#', '.', '.', '.', '#', '.', '#'], ['#', '.', '#', '.', '#', '.', '#'], ['#', '.', '#', '.', '.', '.', '#'], ['#', '#', '#', '#', '#', '#', '#']]
nv=h*w
dp=[[inf]*nv for i in range(nv)]
def nhw(hi,wi):
return (hi-1)*w+wi-1
for i in range(1,h+1):
for j in range(1,w+1):
if s[i][j]=="#":
continue
vij=nhw(i,j)
if s[i-1][j]==".":
vij2=nhw(i-1,j)
dp[vij][vij2]=1
dp[vij2][vij]=1
if s[i+1][j]==".":
vij2=nhw(i+1,j)
dp[vij][vij2]=1
dp[vij2][vij]=1
if s[i][j-1]==".":
vij2=nhw(i,j-1)
dp[vij][vij2]=1
dp[vij2][vij]=1
if s[i][j+1]==".":
vij2=nhw(i,j+1)
dp[vij][vij2]=1
dp[vij2][vij]=1
for i in range(nv):
dp[i][i]=0
#print(dp)
for k in range(nv):
for i in range(nv):
for j in range(nv):
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j])
# print(dp)
#print(dp)
dpmax=0
for i in range(nv):
for j in range(nv):
if dp[i][j]!=inf:
if dpmax<dp[i][j]:
dpmax=dp[i][j]
print(dpmax)
| 1 | 94,612,792,503,672 | null | 241 | 241 |
def insertionSort(lst, n):
for i in range(1, n):
v = lst[i]
j = i - 1
while j >= 0 and lst[j] > v:
lst[j+1] = lst[j]
j = j - 1
lst[j+1] = v
print(" ".join([str(n) for n in lst]))
if __name__ == "__main__":
n = int(input())
lst = [int(n) for n in input().split()]
print(" ".join([str(n) for n in lst]))
insertionSort(lst, n)
|
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False):
inds=sorted(range(len(s)), key=lambda k: s[k])
if return_sorted: return inds, [s[i] for i in inds]
return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
K,N,M=len(B),len(A),len(B[0])
return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
N,size=len(v),len(M)
return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
n,m=len(M),len(M[0])
return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
mod = 10**9+7
#w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え
#N = int(input())
N, K = map(int, input().split())
#A = tuple(map(int, input().split())) #1行ベクトル
#L = tuple(int(input()) for i in range(N)) #改行ベクトル
#S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
#2n-1Cn
fac1=1
fac2=1
facs=[1,1]
for i in range(2,2*N):
facs.append(facs[-1]*i%mod)
# fac1=pow(facs[N],mod-2,mod)
# fac2=pow(facs[N-1],mod-2,mod)
# tot=facs[2*N-1]*fac1%mod
# tot*=fac2
# tot%=mod
def comb(N,r):
fac1=pow(facs[r],mod-2,mod)
fac2=pow(facs[N-r],mod-2,mod)
tot=(facs[N]*fac1%mod)*fac2%mod
return tot
tot=comb(2*N-1,N)
if N-1<=K:
print(tot)
else:#0のへやがk+1より多くあるとボツ
r=0
for i in range(1,N-(K+1)+1):
n=N-i
r+=comb(N,i)*comb(n+i-1,i-1)%mod
r%=mod
print((tot-r)%mod)
if __name__ == "__main__":
main()
| 0 | null | 33,657,392,050,372 | 10 | 215 |
h1,m1,h2,m2,k = list(map(int,input().split()))
h_m = (h2 - h1)*60
m = m2 - m1
tz = h_m + m
print(tz-k)
|
import itertools
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
num = [i+1 for i in range(N)]
p_ord = 0
q_ord = 0
cnt = 0
for pre in itertools.permutations(num, N):
if P == list(pre):
p_ord = cnt
if Q == list(pre):
q_ord = cnt
cnt += 1
print(abs(p_ord-q_ord))
| 0 | null | 59,555,691,038,310 | 139 | 246 |
import math
def gcd(a,b):
if a == 0:
return b
if b == 0:
return a
if a >= b:
return gcd(b, a%b)
else:
return gcd(a, b%a)
a,b = map(int, input().split())
print(gcd(a,b))
|
x,y=map(int,input().split())
a=1
while a!=0:
if x>y:
a=x%y
else:
a=y%x
x=y
y=a
print(x)
| 1 | 8,041,830,482 | null | 11 | 11 |
N = int(input())
A = []
for _ in range(N):
a = int(input())
b = []
for _ in range(a):
b.append(list(map(int, input().split())))
A.append(b)
# 証言リスト A[i人目][j個目の証言] -> [誰が, bit(1は正、0は誤)]
# bitが1であれば正しい証言、0であれば間違った証言とする
# 正しい証言だけ確認して、[i, 1]と証言した i も1かどうか、[j,0]と証言したjが0かどうか
def F(i):
cnt = 0
B = [-1]*N #B = [-1,-1,-1]
r = 0
for j in range(N): # i=1, j=0,1,2
if (i>>j)&1: # 001 -> 1,0,0 j=0
r += 1 # r = 1
if B[j] == 0: #B[0] == -1
return 0
B[j]=1 # B = [1,-1,-1]
for p,q in A[j]: # A[0] = [[2, 1], [3, 0]]
if q == 0:
if B[p-1]==1: # B[2] == -1
return 0
B[p-1] = 0 # B = [1,1,0]
else:
if B[p-1]==0: # B[1] == -1
return 0
B[p-1] = 1 # B = [1,1,-1]
else:
cnt += 1 # cnt = 1
else: # j=1
if B[j]==1: #B[1] ==1
return 0
B[j]=0
if cnt == r:
return cnt
ans = 0
for i in range(1<<N):
ans = max(ans,F(i))
print(ans)
|
from collections import defaultdict,deque
n = int(input())
d = defaultdict(list)
for i in range(n):
a = int(input())
for j in range(a):
x,y = map(int,input().split())
d[i].append((x-1,bool(y)))
maxi = 0
for i in range(2 ** n):
honest = [-1]*n
que = deque([])
for j in range(n):
if ((i >> j) & 1):
que.append(n-1-j)
honest[n-1-j] = True
flag = True
while que and flag:
v = que.popleft()
for x,y in d[v]:
if honest[x] == -1:
honest[x] = y
if y:
que.append(x)
elif honest[x] != y:
flag = False
break
if flag:
maxi = max(maxi,str(bin(i)).count('1'))
print(maxi)
| 1 | 121,536,130,702,020 | null | 262 | 262 |
def ex_euclid(a, b):
x0, x1 = 1, 0
y0, y1 = 0, 1
z0, z1 = a, b
while z1 != 0:
q = z0 // z1
z0, z1 = z1, z0 % z1
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return z0, x0, y0
def mod_inv(a, n):
g, x, _ = ex_euclid(a, n)
if g != 1:
print("modular inverse does not exist")
else:
return x % n
def mod_factorial(x, modulo):
ans = 1
for i in range(1, x+1):
ans *= i
ans %= modulo
return ans
X, Y = map(int, input().split())
M = 10 ** 9 + 7
a, b = (2*X-Y)/3, (2*Y-X)/3
if a < 0 or b < 0:
print(0)
elif a == 0 and b == 0:
print(0)
elif a%1 != 0 or b%1!= 0:
print(0)
else:
a, b = int(a), int(b)
answer = 1
answer *= mod_factorial(a+b, M)
answer *= mod_inv(mod_factorial(a, M), M)
answer %= M
answer *= mod_inv(mod_factorial(b, M), M)
answer %= M
print(answer)
|
X=int(input())
x=100
ans=0
while x<X:
x=101*x//100
ans+=1
print(ans)
| 0 | null | 88,290,845,638,126 | 281 | 159 |
ret = [3,14,39,84,155,258,399,584,819,1110]
s = int(input())
print(ret[s-1])
|
n = int(input())
strs = []
for _ in range(n):
strs.append(input())
print("AC x ", strs.count("AC"))
print("WA x ", strs.count("WA"))
print("TLE x ", strs.count("TLE"))
print("RE x ", strs.count("RE"))
| 0 | null | 9,389,818,531,000 | 115 | 109 |
def resolve():
n=int(input())
print((n-1)//2)
resolve()
|
n=int(input())
n=int(n/2+0.5-1)
print(n)
| 1 | 152,633,536,147,098 | null | 283 | 283 |
class mod_comb_k():
def __init__(self, MAX_N = 10**6, mod = 10**9+7):
self.fact = [1]
self.fact_inv = [0] * (MAX_N + 4)
self.mod = mod
for i in range(MAX_N + 3):
self.fact.append(self.fact[-1] * (i + 1) % self.mod)
self.fact_inv[-1] = pow(self.fact[-1], self.mod - 2, self.mod)
for i in range(MAX_N + 2, -1, -1):
self.fact_inv[i] = self.fact_inv[i + 1] * (i + 1) % self.mod
def comb(self, n, k):
if n < k:return 0
else:return self.fact[n] * self.fact_inv[k] % self.mod * self.fact_inv[n - k] % self.mod
c=mod_comb_k()
n,k=map(int,input().split())
a=sorted(list(map(int,input().split())))
ans=0
mod=10**9+7
for i,j in enumerate(a,1):
ans-=j*c.comb(n-i,k-1)
ans%=mod
for i,j in enumerate(a[::-1],1):
ans+=j*c.comb(n-i,k-1)
ans%=mod
print(ans)
|
MAX = 600000
MOD = 10 ** 9 + 7
fac = [0] * MAX
ifac = [0] * MAX
fac[0] = 1
for i in range(1,MAX):
fac[i] = (fac[i-1] * i) % MOD
ifac[MAX-1] = pow(fac[MAX-1],MOD-2,MOD)
for i in reversed(range(1,MAX)):
ifac[i-1] = (ifac[i] * i) % MOD
def combinations(n, k):
if k < 0 or n < k:
return 0
else:
return (fac[n] * ifac[k] * ifac[n-k]) % MOD
N,K = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
def f(A):
ans = 0
for i in range(K-1,N):
ans += A[i]*combinations(i,K-1)
ans %= MOD
#print(A[i],combinations(i,K-1))
return ans
print((f(A) - f(list(reversed(A)))) % MOD )
#print(f(A))
| 1 | 95,846,306,325,308 | null | 242 | 242 |
from itertools import combinations
while True:
n, x = map(int, input().split())
if n == x == 0:
break
print(sum(1 for li in combinations(range(1, n + 1), 3) if sum(li) == x))
|
from math import atan, pi
a, b, x = map(int, input().split())
if a * a * b > 2 * x:
ans = atan(a * b * b / 2 / x)
else:
ans = atan((2 * a * a * b - 2 * x) / a / a / a)
ans *= 180 / pi
print(ans)
| 0 | null | 82,504,318,361,178 | 58 | 289 |
# coding: utf-8
a = int(input())
b = int(input())
if a + b == 3:
print("3")
elif a + b == 4:
print("2")
else:
print("1")
|
a = int(input())
b = int(input())
ans = list(filter(lambda x: x != a and x != b, [1, 2, 3]))
print(ans[0])
| 1 | 110,939,872,699,350 | null | 254 | 254 |
import sys
import math
input = sys.stdin.readline
a, b = list(map(int, input().split()))
print(a * b // math.gcd(a, b))
|
import math
def lcm(A, B):
return int((A * B) / math.gcd(A, B))
A, B = map(int, input().split())
print(lcm(A,B))
| 1 | 113,614,112,345,710 | null | 256 | 256 |
while True:
word = input()
if word == '-':
break
n = int(input())
for nc in range(n):
h = int(input())
word = word[h:] + word[:h]
print(word)
|
while True:
n = raw_input()
if n == "-":
break
m = int(raw_input())
for i in range(0,m):
h = int(raw_input())
under = n[0:h]
n = n[h:]+under
print n
| 1 | 1,914,613,162,328 | null | 66 | 66 |
l,r,d = map(int,input().split())
count = 0
for i in range(l,r + 1):
if i % d == 0:
count += 1
else:
pass
print(count)
|
n, m, l = [int (x) for x in input().split(' ')]
a = [[0 for i in range(m)] for j in range(n)]
b = [[0 for i in range(l)] for j in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for s in range(0,n):
a[s] = [int (x) for x in input().split(' ')]
for s in range(0,m):
b[s] = [int (x) for x in input().split(' ')]
for i in range(0,n):
for k in range(0,l):
result = 0
for j in range(0,m):
result += a[i][j] * b[j][k]
c[i][k] = result
for i in range(0,n):
c[i] = [str(c[i][j]) for j in range(0,l)]
print(' '.join(c[i]))
| 0 | null | 4,474,519,687,598 | 104 | 60 |
a,b = map(int,input().split())
# 8% -> [a,a+1)
# 10% -> [b,b+1)
# max(a*100/8, b*10) <= 元の価格 < min((a+1)*100/8, (b+1)*10)
min8 = a*(100/8)
max8 = (a+1)*(100/8)
min10 = b*10
max10 = (b+1)*10
mi = int(max(min8, min10) - 0.001) + 1
ma = int(min(max8, max10) - 0.001)
if mi > ma:
ans = -1
else:
ans = mi
print(ans)
|
#C
A, B =map(int,input().split())
import math
price=[]
for i in range(10100):
if math.floor(i*0.08)==A and math.floor(i*0.1)==B:
price.append(i)
if len(price)==0:
print(-1)
else:
print(sorted(price)[0])
| 1 | 56,467,579,427,700 | null | 203 | 203 |
#coding:utf-8
#1_6_A 2015.4.1
n = int(input())
numbers = list(map(int,input().split()))
for i in range(n):
if i == n - 1:
print(numbers[-i-1])
else:
print(numbers[-i-1], end = ' ')
|
input()
a=list(map(int, input().split()))
a.reverse()
print(*a)
| 1 | 976,680,566,098 | null | 53 | 53 |
N = int(input())
A = [0 for _ in range(N)]
B = [0 for _ in range(N)]
import statistics
for k in range(N):
A[k], B[k] = map(int, input().split())
if N%2 == 1:
print(statistics.median(B) - statistics.median(A) +1)
else:
print(int((statistics.median(B) - statistics.median(A))*2 +1))
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
"""
"""
def warshall_floyd(d):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
n,m,l = LI()
dist = [[inf]*n for _ in range(n)]
dist2 = [[inf]*n for _ in range(n)]
for i in range(n):
dist[i][i] = 0
dist2[i][i] = 0
for _ in range(m):
a,b,c = LI()
dist[a-1][b-1] = c
dist[b-1][a-1] = c
dist = warshall_floyd(dist)
for i in range(n):
for j in range(n):
if dist[i][j] > l:
dist2[i][j] = inf
else:
dist2[i][j] = 1
dist2 = warshall_floyd(dist2)
q = I()
ans = []
for _ in range(q):
s,t = LI()
if dist2[s-1][t-1] == inf:
print(-1)
else:
print(dist2[s-1][t-1]-1)
| 0 | null | 95,086,195,256,920 | 137 | 295 |
N=int(input())
st=[]
for i in range(N):
s,t=input().split()
t=int(t)
st.append((s,t))
X=input()
#st = sorted(st,key=lambda x:x[1])
flag=0
ans=0
for i in range(N):
if flag: ans += st[i][1]
if st[i][0]==X:flag=1
print(ans)
|
n = int(input())
strList = []
timeList = []
for x in range(n):
s, t = map(str, input().split())
strList.append(s)
timeList.append(int(t))
x = input()
id = strList.index(x)
if timeList.count == id: print(0)
else: print(sum(timeList[id + 1:]))
| 1 | 96,918,917,115,668 | null | 243 | 243 |
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
while True:
M,F,R = map(int,input().split())
if M == -1 and F == -1 and R == -1:
break
if M == -1 or F == -1:
print("F")
elif M+F >= 80:
print("A")
elif M+F >= 65:
print("B")
elif M+F >= 50:
print("C")
elif M+F >= 30:
if R >= 50:
print("C")
else:
print("D")
else:
print("F")
|
str = input() *2
pattern = input()
if pattern in str:
print("Yes")
else:
print("No")
| 0 | null | 1,477,184,804,722 | 57 | 64 |
n = int(input())
A = [0] + [*map(int, input().split())]
dp_stock = [0]*(n+1)
dp_yen = [0]*(n+1)
dp_yen[0] = 1000
for day in range(1, n+1):
dp_stock[day] = max(dp_stock[day-1], dp_yen[day-1] // A[day])
remain = dp_yen[day-1] - dp_stock[day-1]*A[day-1]
dp_yen[day] = max(dp_yen[day-1], remain + dp_stock[day-1] * A[day])
print(dp_yen[n])
|
def main():
while True:
m, f, r = tuple(map(int, input().split()))
if m == f == r == -1:
break
elif m == -1 or f == -1:
print('F')
elif m + f >= 80:
print('A')
elif m + f >= 65:
print('B')
elif m + f >= 50:
print('C')
elif m + f >= 30:
if r >= 50:
print('C')
else:
print('D')
else:
print('F')
if __name__ == '__main__':
main()
| 0 | null | 4,284,464,578,812 | 103 | 57 |
def main():
def check(p):
# 積めた荷物の数
i = 0
# トラックの数だけ試行
for _ in range(k):
# 現在のトラックの重量
s = 0
while s + w[i] <= p:
# 積める場合は積んで次の荷物へ
# 積めない場合は次のトラックへ
s += w[i]
i += 1
if i == n:
return n
return i
def solve():
left, right = 0, 100000 * 10000 + 1
while left < right:
mid = (left + right) // 2
if n <= check(mid):
right = mid
else:
left = mid + 1
return left
n, k = [int(i) for i in input().split()]
w = [int(input()) for _ in range(n)]
ans = solve()
print(ans)
if __name__ == '__main__':
main()
|
from sys import stdin
from math import ceil
def is_stackable(k,p,w):
if max(w) > p:
return False
s = w[0]
count = len(w)
for i in range(1, len(w)):
if s + w[i] <= p:
s += w[i]
count -= 1
else:
s = w[i]
return k >= count
def main():
n,k = map(int, stdin.readline().split())
w = [int(line) for line in stdin.readlines()]
left = max(max(w), ceil(sum(w)/k))
right = (max(w) * ceil(n/k)) + 1
while True:
mid = int((left + right) / 2)
if is_stackable(k, mid, w):
if not is_stackable(k, mid - 1, w):
print(mid)
break
right = mid
else:
if is_stackable(k, mid + 1, w):
print(mid + 1)
break
left = mid + 1
main()
| 1 | 90,580,086,432 | null | 24 | 24 |
A, B = [int(n) for n in input().split()]
print(max(0, int(A-2*B)))
|
import sys
input=sys.stdin.readline
from itertools import accumulate
def main():
n,k=map(int,input().split())
a=list(map(int,input().split()))
k=k if k<50 else 50
for _ in range(k):
b=[0]*(n+1)
for i in range(n):
ai=a[i]
l,r=i-ai,i+ai+1
l=0 if l<0 else l
r=n if r>n else r
b[l]+=1
b[r]-=1
b=tuple(accumulate(b))[:-1]
a=b
if min(set(b))==n:
break
print(*a)
if __name__ == '__main__':
main()
| 0 | null | 91,382,544,693,092 | 291 | 132 |
while True:
h, w = map(int, input().split())
if h == 0 and w == 0:
break
width = ''
for i in range(h):
if i % 2 == 0:
for j in range(w):
if j % 2 == 0:
width += '#'
else:
width += '.'
else:
for j in range(w):
if j % 2 != 0:
width += '#'
else:
width += '.'
print(width)
width = ''
print('')
|
def is_prime(x):
for i in range(2, int(x ** 0.5) + 1):
if x % i == 0:
return False
else:
return True
def main():
x = int(input())
while True:
if is_prime(x):
ans = x
break
x += 1
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 53,102,632,665,042 | 51 | 250 |
def check(p):
global k, wlist
loadage = 0
num = 1
for w in wlist:
loadage += w
if loadage > p:
num += 1
if num > k:
return False
loadage = w
return True
n, k = map(int, input().split())
wlist = []
for _ in range(n):
wlist.append(int(input()))
maxw = max(wlist)
sumw = sum(wlist)
p = 0
while maxw < sumw:
p = (maxw + sumw) // 2
if check(p):
sumw = p
else:
maxw = p = p+1
print(p)
|
# -*- coding: utf-8 -*-
import sys
index = int(input())
array = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(int(array[index-1]))
| 0 | null | 25,219,965,551,506 | 24 | 195 |
a=list(map(str,input().split()))
print(a[0][0]+a[0][1]+a[0][2])
|
def main():
n = int(input())
dictionary = set()
for _ in range(n):
order, code = input().split()
if order == 'insert':
dictionary.add(code)
elif order == 'find':
if code in dictionary:
print('yes')
else:
print('no')
else:
raise Exception('InputError')
if __name__ == '__main__':
main()
| 0 | null | 7,497,681,452,620 | 130 | 23 |
s = input()
a = s.replace('hi', '')
if len(a)==0:
print('Yes')
else:
print('No')
|
from sys import stdin
import math
import re
import queue
input = stdin.readline
MOD = 1000000007
INF = 122337203685477580
def solve():
str = (input().rstrip())
str = str.replace("hi","")
if(len(str) == 0):
print("Yes")
else:
print("No")
if __name__ == '__main__':
solve()
| 1 | 53,279,834,478,100 | null | 199 | 199 |
N, A, B = map(int, input().split())
h = N//(A+B)
i = N%(A+B)
ans = h*A + min(i, A)
print(ans)
|
a,b,c,d=input().split()
a = int(a)
b = int(b)
c = int(c)
d = int(d)
z1 = a*c
z2 = a*d
z3 = b*c
z4 = b*d
l = [z1, z2, z3, z4]
max_value = max(l)
print(max_value)
| 0 | null | 29,201,781,234,510 | 202 | 77 |
_str = ""
_k = int(input())
for _i in range(_k):
_str += "ACL"
print(_str)
|
N = int(input())
purchase_price = int(input())
profit = -2000000000
for _ in range(N-1):
price = int(input())
profit = max(profit, (price-purchase_price))
purchase_price = min(price, purchase_price)
print(profit)
| 0 | null | 1,086,176,096,632 | 69 | 13 |
import sys
sys.setrecursionlimit(10**7+1)
N,M = map(int,input().split())
V = [i for i in range(N)]
E =[[] for i in range(N)]
for _ in range(M):
a,b = map(int,input().split())
E[a-1].append(b-1)
E[b-1].append(a-1)
visited = [False for _ in range(N)]
def dfs(v,parent,origin):
visited[v] = True
for e in E[v]:
if e == parent:
continue
if visited[e]:
continue
V[e] = origin
dfs(e,v,origin)
for i in range(N):
if visited[i]:
continue
dfs(i,-1,i)
count = 0
for i,v in enumerate(V):
if i==v:
count+=1
print(count-1)
|
from collections import Counter
N=int(input())
A = list(map(int,input().split()))
ans = [0] * N
B = Counter(A)
for i in range(N):
ans[i] = B[A[i]]-1
total=sum(ans)
C=[]
for i in range(N):
c = (total-2*ans[i])//2
C.append(c)
for num in C:
print(num)
| 0 | null | 24,920,665,267,518 | 70 | 192 |
import sys
from collections import deque, defaultdict, Counter
from itertools import accumulate, product, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right
from heapq import heappop, heappush
from math import ceil, floor, sqrt, gcd, inf
from copy import deepcopy
import numpy as np
import scipy as sp
INF = inf
MOD = 1000000007
s = input()
t = input()
tmp = 0
res = "No"
if s == t[:-1]:
res = "Yes"
print(res)
|
def attacks(HP, times=1):
if HP==0: return times-1
HP //= 2
times *= 2
return attacks(HP,times)
h=int(input())
print(attacks(h))
| 0 | null | 50,918,449,733,228 | 147 | 228 |
k = int(input())
a,b = map(int, input().split())
ct = 0
for i in range(a, (b+1)):
if i % k == 0:
ct += 1
if ct != 0:
print('OK')
else:
print('NG')
|
k=int(input())
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
if i%k==0:
print("OK")
c=0
break
if c==1:
print("NG")
| 1 | 26,590,706,698,880 | null | 158 | 158 |
number_list = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k = int(input())
out = number_list[k-1]
print(out)
|
from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
print( int(M))
else :
print(':(')
| 0 | null | 87,938,710,587,322 | 195 | 265 |
N = int(input())
A = [int(a) for a in input().split(" ")]
swapnum = 0
for i in range(N):
mini = i
swap = False
for j in range(i, N):
if A[j] < A[mini]:
mini = j
swap = True
if swap:
tmp = A[i]
A[i] = A[mini]
A[mini] = tmp
swapnum += 1
print(" ".join([str(a) for a in A]))
print(swapnum)
|
from typing import List
def selection_sort(A: List[int]) -> int:
cnt = 0
for i in range(len(A)):
min_j = i
for j in range(i, len(A)):
if A[j] < A[min_j]:
min_j = j
if min_j != i:
cnt += 1
A[i], A[min_j] = A[min_j], A[i]
return cnt
N = int(input())
A = [int(i) for i in input().split()]
cnt = selection_sort(A)
print(' '.join(map(str, A)))
print(cnt)
| 1 | 20,410,146,032 | null | 15 | 15 |
S=list(str(input()))
A=''
B=''
while len(S)>0:
A+=S.pop()
if len(S)>0:
B+=S.pop()
if (len(A)+len(B))%2!=0:
print('No')
elif len(set(A))==len(set(B))==1:
if 'h' in A or 'i' in A:
if 'h' in B or 'i' in B:
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No')
|
n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
ans=0
for i in range(k):
R=0
S=0
P=0
cnt=0
while i+cnt*k<n:
if i+cnt*k-k<0:
if t[i+cnt*k]=='r':
ans+=p
P=1
elif t[i+cnt*k]=='s':
ans+=r
R=1
else:
ans+=s
S=1
elif i+cnt*k-k>=0 and t[i+cnt*k]==t[i+cnt*k-k]:
if t[i+cnt*k]=='r' and P==0:
ans+=p
P=1
elif t[i+cnt*k]=='r' and P==1:
P=0
elif t[i+cnt*k]=='s' and R==0:
ans+=r
R=1
elif t[i+cnt*k]=='s' and R==1:
R=0
elif t[i+cnt*k]=='p' and S==0:
ans+=s
S=1
elif t[i+cnt*k]=='p' and S==1:
S=0
elif i+cnt*k-k>=0 and t[i+cnt*k]!=t[i+cnt*k-k]:
if t[i+cnt*k]=='r':
ans+=p
P=1
elif t[i+cnt*k]=='s':
ans+=r
R=1
else:
ans+=s
S=1
cnt+=1
print(ans)
| 0 | null | 80,448,262,921,598 | 199 | 251 |
data = []
while 1:
H, W = map(int, raw_input().split())
if H == 0 and W == 0:
break
data.append([H, W])
for h, w in data:
for i in xrange(h):
print '#' * w
print
|
n = int(input())
count_ac, count_wa, count_tle, count_re = 0, 0, 0, 0
for i in range(n):
s = input()
if s == "AC":
count_ac += 1
if s == "WA":
count_wa += 1
if s == "TLE":
count_tle += 1
if s == "RE":
count_re += 1
print("AC x", count_ac)
print("WA x", count_wa)
print("TLE x", count_tle)
print("RE x", count_re)
| 0 | null | 4,759,495,963,168 | 49 | 109 |
import math
X=list()
Y=list()
s=0
N=int(input())
for i in range(N):
x,y=map(int,input().split())
X.append(x)
Y.append(y)
for i in range(N):
for j in range(N):
s+=math.sqrt(((X[i]-X[j])**2)+((Y[i]-Y[j])**2))
print(s*(1/N))
|
s=input()
p=input()
s=s+s
if s.find(p)==-1:
print('No')
else:
print('Yes')
| 0 | null | 74,919,049,625,392 | 280 | 64 |
def func(N):
strN = str(N)
sum = 0
for s in strN:
sum += int(s)
return "Yes" if sum % 9 == 0 else "No"
if __name__ == "__main__":
N = str(input())
print(func(N))
|
def main():
N = input()
acc = 0
for idx in range(len(N)):
acc += (ord(N[idx]) - ord('0'))
print('Yes') if not acc % 9 else print('No')
if __name__ == '__main__':
main()
| 1 | 4,349,560,050,008 | null | 87 | 87 |
print('10'[int(input())])
|
import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
n = int(input().rstrip())
ans = [0 for _ in range(n)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = pow(x, 2) + pow(y, 2) + pow(z, 2) + x * y + y * z + z * x
if tmp > n:
break
# if x == y == z:
# ans[tmp - 1] = 1
# elif x == y or y == z or z == x:
# ans[tmp - 1] = 3
# else:
# ans[tmp - 1] = 6
ans[tmp - 1] += 1
for v in ans:
print(v)
if __name__ == '__main__':
main()
| 0 | null | 5,422,830,070,560 | 76 | 106 |
x=list(input().split())
print(x[1]+x[0])
|
s,t=[str(i)for i in input().split()]
print(t+s)
| 1 | 103,215,348,652,900 | null | 248 | 248 |
n = int(input())
p = n // 500 * 1000
n %= 500
p += n // 5 * 5
print(p)
|
i = int(input())
a = 0
a += (i // 500) * 1000
i = i % 500
a += (i // 5) * 5
print(a)
| 1 | 42,523,993,190,910 | null | 185 | 185 |
import sys
sys.setrecursionlimit(1000000)
def II(): return int(input())
def MI(): return map(int, input().split())
N=II()
edge=[[] for i in range(N)]
a=[0]*N
b=[0]*N
for i in range(N-1):
a[i],b[i]=MI()
a[i]-=1
b[i]-=1
edge[a[i]].append(b[i])
edge[b[i]].append(a[i])
k=0
color_dict={}
def dfs(to,fm=-1,ban_color=-1):
global k
color=1
for nxt in edge[to]:
if nxt==fm:
continue
if color==ban_color:
color+=1
color_dict[(to,nxt)]=color
dfs(nxt,to,color)
color+=1
k=max(k,color-1)
dfs(0)
print(k)
for i in range(N-1):
print(color_dict[(a[i],b[i])])
|
from collections import deque
N=int(input())
G=[{} for i in range(N+1)]
colors = []
for i in range(N-1):
a,b=map(int,input().split())
G[a][b]=[i,-1]
G[b][a]=[i,-1]
def bfs(s):
seen = [0 for i in range(N+1)]
prev = [0 for i in range(N+1)]
todo = deque([])
cmax = 0
now = s
seen[now]=1
todo.append(now)
while 1:
if len(todo)==0:break
a = todo.popleft()
if len(G[a])<50:
if prev[a] == 0:
a_color=set([])
else:
a_color=set([G[a][prev[a]][1]])
for b in G[a]:
if seen[b] == 0:
seen[b] = 1
todo.append(b)
prev[b] = a
for c in range(1,N+1):
if c not in a_color:
a_color.add(c)
colors.append((G[a][b][0],c))
G[a][b][1]=G[b][a][1]=c
if c > cmax: cmax = c
break
else:
temp = list(range(1,N))
if prev[a] != 0:
del temp[G[a][prev[a]][1]-1]
temp = deque(temp)
for i,b in enumerate(G[a]):
if seen[b] == 0:
seen[b] = 1
todo.append(b)
prev[b] = a
c = temp.popleft()
colors.append((G[a][b][0],c))
G[a][b][1]=G[b][a][1]=c
if c > cmax: cmax = c
return colors, cmax
colors,cmax = bfs(1)
colors=sorted(colors)
print(cmax)
for i in range(N-1):
print(colors[i][1])
| 1 | 135,510,285,182,180 | null | 272 | 272 |
N=int(input())
l = [[] for _ in range(9)]
for i in range(0,9):
for j in range(0,9):
l[i].append(0)
for i in range(N+1):
if (int(str(i)[0])!=0 and int(str(i)[-1])!=0):
l[int(str(i)[0])-1][int(str(i)[-1])-1]+=1
t=0
for i in range(9):
for j in range(9):
t+=l[i][j]*l[j][i]
print(t)
|
# !/usr/bin/python3
"""
https://atcoder.jp/contests/abc152/tasks/abc152_d
Low Elements.
"""
def solve(n):
res = 0
for num in range(n+1):
start = int(str(num)[0])
end = int(str(num)[-1])
for i in range(1, 10):
for j in range(1, 10):
if i == start and j == end: dp[i][j] += 1
for i in range(1, 10):
for j in range(1, 10):
res += dp[i][j]*dp[j][i]
# for each in dp: print(each)
return res
if __name__ == "__main__":
n = int(input())
dp = [[0 for _ in range(10)] for _ in range(10)]
print(solve(n))
| 1 | 86,701,892,628,380 | null | 234 | 234 |
D,T,S=map(int,input().split(' '))
if (D/S)<=T:
print("Yes")
else:
print("No")
|
D, T, S = map(int,input().split())
Distance = T * S
if(D <= Distance):
print('Yes')
else:
print('No')
| 1 | 3,570,442,745,660 | null | 81 | 81 |
ans=0
for i,j in zip(input(),input()):
if i!=j:ans+=1
print(ans)
|
a = input().split()
b = str(a[0])
c = str(a[1])
print(c+b)
| 0 | null | 57,042,276,857,752 | 116 | 248 |
from collections import deque
N, M = map(int, input().split())
Graph = [[]for _ in range(N + 1)]
for i in range(M):
a, b = map(int, input().split())
Graph[a].append(b)
Graph[b].append(a)
dist = [-1] * (N + 1)
dist[0] = 0
dist[1] = 0
pre = [-1] * (N + 1)
pre[0] = 0
pre[1] = 1
d = deque()
d.append(1)
while d:
v = d.popleft()
for i in Graph[v]:
if dist[i] != -1:
continue
dist[i] = dist[v] + 1
pre[i] = v
d.append(i)
ans = dist[0:]
print('Yes')
for j in range(2, len(pre)):
print(pre[j])
|
n,m=map(int,input().split())
l=[[] for _ in range(n)]
for i in range(m):
a,b=map(int,input().split())
l[a-1].append(b-1)
l[b-1].append(a-1)
queue=[0]
visit=[0]*n
visit[0]=1
ans=[0]*n
while len(queue)>0:
now=queue.pop(0)
for p in l[now]:
if visit[p]==0:
visit[p]+=1
queue.append(p)
ans[p]=now+1
k=ans[1:]
if not all(kk!=0 for kk in k):
print('No')
exit()
print('Yes')
for kk in k:
print(kk)
| 1 | 20,659,224,046,830 | null | 145 | 145 |
#155_A
a, b, c = map(int, input().split())
if a==b and a!=c and b!=c:
print('Yes')
elif a==c and a!=b and c!=b:
print('Yes')
elif b==c and b!=a and c!=a:
print('Yes')
else:
print('No')
|
A,B,C = map(int,input().split())
if A == B:
if A != C:
print("Yes")
else:
print("No")
else:
if B == C or A == C:
print("Yes")
else:
print("No")
| 1 | 68,027,778,236,792 | null | 216 | 216 |
def main():
N=int(input())
A=[int(_) for _ in input().split()]
left=0
right=sum(A)
ans=right
for i in range(N):
left+=A[i]
right-=A[i]
ans = min(ans, abs(left-right))
print(ans)
main()
|
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
def resolve():
N,=pin()
A=lispin()
temp=0
sumA=[0]*N
sumA[0]=A[0]
for j in range(1,N):
sumA[j]=sumA[j-1]+A[j]
#print(sumA)
ans=2**32-1
t=sumA[-1]
for i in range(N):
ans=min(ans,abs(t-sumA[i]*2))
print(ans)
#%%submit!
resolve()
| 1 | 142,106,469,255,440 | null | 276 | 276 |
n = int(input()) - 1 # n=n-1
print(sum([(n//x - x)*2 + 1 for x in range(1, int(n**0.5) + 1)]))
|
#unionfind木_集合の管理_同じ集合の数を数える場合：
#parには集合の数と親の名前を同時にメモ化する（根なら-size, 子なら親）
def find(k):#要素k
if par[k] < 0:#初期はparがすべて負の値
return k
else:
par[k] = find(par[k])
return par[k]
def unite(i, j):
i = find(i)
j = find(j)
if i==j:#すでに同じ集合
return False
else:
#sizeが大きい方がi
if i > j:#sizeはマイナス管理なので、i>jの時jの方がサイズが大きい
i, j = j, i
par[i] += par[j] #親は負の値で大きくなる
par[j] = i
return True
def size(x):
return -par[find(x)]
n, m = map(int, input().split())
par = [-1]*n#初めは自分自身が親
for i in range(m):
a, b = map(lambda x:int(x)-1, input().split())
unite(a, b)
ans = 0
for i in range(n):
if -par[i]>0:
ans += 1
print(ans-1)
| 0 | null | 2,403,034,812,948 | 73 | 70 |
# Aizu Problem ITP_1_10_A: Distance
#
import sys, math, os
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
x1, y1, x2, y2 = [float(_) for _ in input().split()]
print("%.8f" % math.sqrt((x1 - x2)**2 + (y1 - y2)**2))
|
import math
x1,y1,x2,y2 = map(float,raw_input().split())
r = math.sqrt(abs((x1-x2)**2+(y1-y2)**2))
print r
| 1 | 150,784,757,438 | null | 29 | 29 |
import sys
input = sys.stdin.readline
from collections import defaultdict, deque
n, s, res, MOD = int(input()), list(map(int, input().split())), 0, int(1e9) + 7
for i in range(61):
x, c = int(pow(2, i, MOD)), [0, 0]
for j in range(n): c[1 if s[j] & 1 << i else 0] += 1
x = (x * c[0]) % MOD; x = (x * c[1]) % MOD; res = (res + x) % MOD
print(res)
|
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
ln = len(bin(max(a))) -2
cnt = [0] * ln
for x in a:
for shift in range(ln):
cnt[shift] += (x>>shift)%2
# print(cnt)
res = 0
for i in range(ln):
now = cnt[i] * (n-cnt[i])
res += now*pow(2,i)
res %= mod
print(res)
| 1 | 122,745,644,758,660 | null | 263 | 263 |
from functools import reduce
N = int(input())
A_list = list(map(int, input().split()))
sums = [A_list[0]]
for i in range(1, N):
sums.append(sums[i-1] + A_list[i])
result = 0
for i in range(1, N):
result += sums[i-1] * A_list[i]
result %= 10**9 + 7
print(result)
|
N = int(input())
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
sum = sum(A) ** 2
squ = 0
for i in range(N):
squ += A[i] ** 2
answer = int(((sum - squ) // 2 ) % mod)
print(answer)
| 1 | 3,839,251,496,288 | null | 83 | 83 |
print(int(not(int(input()))))
|
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, M = map(int, readline().split())
C = list(map(int, readline().split()))
# dp[i] := i円払うのに必要な枚数
dp = [INF] * (N+1)
dp[0] = 0
for c in C:
if c<=N:
for i in range(N-c+1):
dp[i+c] = min(dp[i]+1, dp[i+c])
print(dp[N])
if __name__ == '__main__':
main()
| 0 | null | 1,564,219,514,210 | 76 | 28 |
a = int(input())
b, c = map(int, input().split())
ans = int(c/a) * a
if b<=ans<=c:
print('OK')
else:
print('NG')
|
k = int(input())
a, b = map(int, input().split())
x = 0
while True:
x += k
if a <= x <= b:
print('OK')
break
if x > b:
print('NG')
break
| 1 | 26,455,990,623,700 | null | 158 | 158 |
n = int(input())
lst = list(map(int, input().split()))
for i in range(n):
li = lst[i]
j = i-1
while j >= 0 and lst[j] > li:
lst[j:j+2] = lst[j+1], lst[j]
j -= 1
print(*lst)
|
S = input()
if S == "AAA" or S == "BBB":
print("No")
else:
print("Yes")
| 0 | null | 27,431,818,096,360 | 10 | 201 |
N = int(input())
S = input()
if len(S) % 2 != 0:
print("No")
else:
c = len(S) // 2
if S[:c] == S[c:]:
print("Yes")
else:
print("No")
|
N = int(input())
S = input()
print("Yes" if S[:N//2] == S[N//2:] else "No")
| 1 | 146,778,072,828,190 | null | 279 | 279 |
import sys
for i in sys.stdin:
print(len(str(sum(map(int,i.replace("\n", "").split(" "))))))
|
import sys
from collections import deque
sys.setrecursionlimit(10 ** 6)
def input():
return sys.stdin.readline()[:-1]
def dfs(v,prev = -1):
for u in graph[v]:
if u == prev:
continue
sign[u] = v
dfs(u,v)
def bfs(v):
que = deque([])
que.append(v)
while que:
p = que.popleft()
if visited[p] == 0:
visited[p] = 1
for u in graph[v]:
que.append(u)
import heapq
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * (N+1) # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
continue
for u in graph[v]:
tmp = 1 + cost[v]
if tmp < cost[u]:
cost[u] = tmp
path[u] = v
heapq.heappush(hq, (tmp, u))
return path
N,M = map(int,input().split())
graph = [[] for i in range(N+1)]
for i in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
path = [0]*(N+1)
c = dijkstra(1)
print("Yes")
for i in range(2,N+1):
print(c[i])
| 0 | null | 10,239,574,346,078 | 3 | 145 |
T=int(input())
a=T//1000
T=T-1000*a
if T==0:
print(0)
else:
print(1000-T)
|
import math
N = int(input())
A = math.ceil(N/1000)
B = A * 1000
print(B-N)
| 1 | 8,525,126,275,292 | null | 108 | 108 |
z = input()
if z=='hi' or z=='hihi' or z=='hihihi' or z=='hihihihi' or z=='hihihihihi':
print("Yes")
else:
print("No")
|
import re
S = input()
print('Yes' if len(re.sub(r'hi', '', S)) == 0 else 'No')
| 1 | 53,151,827,323,360 | null | 199 | 199 |
def linearSearch(A, n, key):
i = 0
A.append(key)
while (A[i] != key):
i += 1
del A[n]
return i != n
if __name__ == '__main__':
n = int(input())
L = list(map(int, input().split()))
q = int(input())
Key = list(map(int, input().split()))
cnt = 0
for i in range(q):
if (linearSearch(L, n, Key[i])):
cnt += 1
print(cnt)
|
n = input()
S = raw_input().split()
q = input()
T = raw_input().split()
s = 0
for i in T:
if i in S:
s+=1
print s
| 1 | 71,515,635,488 | null | 22 | 22 |
s = input()
s = s[::-1]
n = len(s)
# stmp = s[::-1]
# for i in range(len(s)):
# for j in range(i,len(s)):
# sint = int(stmp[i:j+1])
# if sint % 2019 == 0:
# print(n-j,n-i)
# print(sint)
# print()
rem2019_cnts = [0]*2019
rem2019_cnts[0] = 1
curr_rem = int(s[0])
rem2019_cnts[curr_rem] = 1
curr_10_rem = 1
ans = 0
for i,si in enumerate(s[1:]):
sint = int(si)
next_10_rem = (curr_10_rem*10)%2019
next_rem = (next_10_rem*sint + curr_rem)%2019
ans += rem2019_cnts[next_rem]
rem2019_cnts[next_rem] += 1
curr_10_rem = next_10_rem
curr_rem = next_rem
# print(i+2, curr_rem)
print(ans)
|
def warshall_floyd(v_count: int, matrix: list) -> list:
""" ワーシャルフロイド
v_count: 頂点数
matrix: 隣接行列(到達不能はfloat("inf"))
"""
for i in range(v_count):
for j, c2 in enumerate(row[i] for row in matrix):
for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
if c1 > c2+c3:
matrix[j][k] = c2+c3
return matrix
INF = 10 ** 16
n, m, l = map(int, input().split())
mat = [[INF] * n for _ in range(n)]
for i in range(n):
mat[i][i] = 0
for _ in range(m):
a, b, c = map(int, input().split())
mat[a - 1][b - 1] = c
mat[b - 1][a - 1] = c
mat = warshall_floyd(n, mat)
fuel_mat = [[INF] * n for _ in range(n)]
for i in range(n):
for j in range(n):
if i == j:
fuel_mat[i][j] = 0
elif mat[i][j] <= l:
fuel_mat[i][j] = 1
fuel_mat = warshall_floyd(n, fuel_mat)
q = int(input())
for _ in range(q):
s, t = map(int, input().split())
d = fuel_mat[s - 1][t - 1]
if d == INF:
print(-1)
else:
print(d - 1)
| 0 | null | 102,257,148,826,880 | 166 | 295 |
n=int(input())
arr=list(map(int,input().split()))
xors = 0
for val in arr: #あらかじめすべての要素のxorを求めておく
xors^=val #(ai xor aj = bi xor bj)となるのですべてのxorを合わせると、b0^b1^b2^...^bn
ans=[]
for i in range(n): #各aiについて、ai xor (すべての要素のxor)がi番目に書かれた値に等しい
ans.append(xors^arr[i])
print(*ans)
|
n=int(input())
a=list(map(int,input().split()))
wa=a[0]^a[1]
for i in range(2,n):
wa=wa^a[i]
ans=[]
for i in range(n):
ans.append(wa^a[i])
print(*ans)
| 1 | 12,475,294,258,128 | null | 123 | 123 |
S = input()
num = []
pre = S[0]
cnt = 0
for s in S:
if s == pre:
cnt += 1
else:
num.append(cnt)
pre = s
cnt = 1
num.append(cnt)
if S[0] == '>':
num = [1] + num
if S[-1] == '<':
num += [1]
ans = 0
for i in range(0, len(num), 2):
b = max(num[i], num[i+1])
c = min(num[i], num[i+1])
ans += (b*(b+1))//2 + ((c-1)*c)//2
print(ans)
|
n=int(input())
a1=1
a=1
i=1
while i<n:
a1,a=a,a1+a
i+=1
print(a)
| 0 | null | 78,277,378,666,820 | 285 | 7 |
t=int(input())
if t==0:
print("1")
elif t==1:
print("0")
|
x = input()
if x == "0":
print(1)
elif x == "1":
print(0)
| 1 | 2,909,296,227,400 | null | 76 | 76 |
from math import sqrt
N = int(input())
result = [0] * N
n = int(sqrt(N))
for x in range(1, n+1):
for y in range(1, n+1):
for z in range(1, n+1):
check = x**2 + y**2 + z**2 + x * y + y * z + z * x
if check <= N:
result[check-1] += 1
for i in result:
print(i)
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
import itertools
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
N = int(input())
return N
# メイン処理
def g(x: int, y: int, z: int) -> int:
"""
関数.
Args:\n
x (int): 整数（1 <= x）
y (int): 整数（1 <= y）
z (int): 整数（1 <= z）
Returns:\n
int: 関数値
"""
return x**2 + y**2 + z**2 + x*y + y*z + z*x
def main(N: int) -> None:
"""
メイン処理.
Args:\n
N (int): 整数
"""
# 求解処理
l = [0 for n in range(N)]
ub = int(math.sqrt(N))
for x, y, z in itertools.product(range(1, ub + 1), repeat=3):
v = g(x, y, z)
if v <= N:
l[v - 1] += 1
# 結果出力
for ans in l:
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N = get_input()
# メイン処理
main(N)
| 1 | 7,944,190,052,898 | null | 106 | 106 |
#最大値の最小値を求める問題は二分探索
#求めるものを変数と見て丸太の最大値がxだとすると
#丸太の長さは全てx以下である必要があるため切るべき回数がわかる
#それがk回以下ならokだしそれがk回を超えていたらだめ
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
ng=0
ok=max(a)
def check(x):
num=0
for i in range(n):
if a[i]%x==0:
num=num+a[i]//x-1
else:
num=num+a[i]//x
return num<=k
while ok-ng>1:
mid=(ok+ng)//2
if check(mid):
ok=mid
else:
ng=mid
print(ok)
|
import sys
import heapq
import math
def input(): return sys.stdin.readline().rstrip()
def main():
n, k = map(int,input().split())
A = list(map(int,input().split()))
def is_good(mid, key):
kk = 0
for a in A:
kk += -(-a//mid)-1
if kk <= key:
return True
else:
return False
def bi_search(bad, good, key):
while good - bad > 1:
mid = (bad + good)//2
if is_good(mid, key):
good = mid
else:
bad = mid
return good
print(bi_search(0, 1000000000, k))
if __name__=='__main__':
main()
| 1 | 6,543,628,527,798 | null | 99 | 99 |
X,Y=map(int,input().split())
mod = 10**9+7
if 2*X < Y or 2*Y < X:print(0)
elif (X+Y) % 3 != 0:print(0)
else:
n = (X+Y) // 3
X,Y=X-n,Y-n
factorial=[1 for i in range(X+Y+1)]
for i in range(1,X+Y+1):
if i==1:factorial[i]=1
else:factorial[i] = factorial[i-1]*i % mod
print(factorial[X+Y]*pow(factorial[X]*factorial[Y],-1,mod)%mod)
|
import sys
# import math
# import bisect
# import numpy as np
# from decimal import Decimal
# from numba import njit, i8, u1, b1 #JIT compiler
# from itertools import combinations, product
# from collections import Counter, deque, defaultdict
# sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = 10 ** 9
PI = 3.14159265358979323846
def read_str(): return sys.stdin.readline().strip()
def read_int(): return int(sys.stdin.readline().strip())
def read_ints(): return map(int, sys.stdin.readline().strip().split())
def read_ints2(x): return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)
def LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)
# mod p
class Combination():
def __init__(self, n, p):
self.n = n
self.p = p
self.note = [1, 1]
self.noteinv = [1, 1]
self.inv = [0, 1]
self.calc()
def calc(self):
for i in range(2, self.n + 1):
self.note.append((self.note[-1] * i) % self.p)
self.inv.append((-self.inv[self.p % i] * (self.p // i)) % self.p)
self.noteinv.append((self.noteinv[-1] * self.inv[-1]) % self.p)
def nCr(self, n, r):
n = self.n
if r < 0 or n < r:
return 0
r = min(r, n - r)
return (self.note[n] * self.noteinv[r] * self.noteinv[n - r]) % self.p
def Main():
x, y = read_ints()
if (x + y) % 3 != 0:
print(0)
exit()
# n + 2m = X, 2n + m = Y => 3m = 2X - Y, 3n = 2Y - X
n = (2 * x - y) // 3
m = (2 * y - x) // 3
cmb = Combination(n + m, MOD)
print(cmb.nCr(n + m, min(n, m)))
if __name__ == '__main__':
Main()
| 1 | 150,319,403,348,840 | null | 281 | 281 |
# A - Range Flip Find Route
H,W = map(int,input().split())
INF = 1000000
s = [input() for _ in range(H)]
a = [[INF]*(W+1) for _ in range(H+1)]
for i in range(1,H+1):
for j in range(1,W+1):
if (i,j)==(1,1):
a[i][j] = int(s[0][0]=='#')
elif i==1:
a[i][j] = a[i][j-1]+int(s[i-1][j-2]=='.' and s[i-1][j-1]=='#')
elif j==1:
a[i][j] = a[i-1][j]+int(s[i-2][j-1]=='.' and s[i-1][j-1]=='#')
else:
a[i][j] = min(
a[i][j-1]+int(s[i-1][j-2]=='.' and s[i-1][j-1]=='#'),
a[i-1][j]+int(s[i-2][j-1]=='.' and s[i-1][j-1]=='#')
)
print(a[H][W])
|
n,m=map(int,input().split())
ans=0
ans+=n*(n-1)//2
ans+=m*(m-1)//2
print(ans)
| 0 | null | 47,732,044,807,080 | 194 | 189 |
N = int(input())
if N >=30:
print('Yes')
else :
print('No')
|
x = int(input())
print('Yes' if 30 <= x else 'No')
| 1 | 5,692,200,479,182 | null | 95 | 95 |
n = int(input())
a = list(map(int, input().split()))
if n % 2 == 0:
ans, cnt = 0, 0
for i in range(n):
if i % 2 == 1:
ans += a[i]
cnt += a[i]
for i in range(n):
if i % 2 == 0:
cnt += a[i]
else:
cnt -= a[i]
ans = max(cnt, ans)
else:
a.insert(0, 0)
dp = [[0] * (n + 1) for _ in range(3)]
for i in range(3):
for j in range(1 + i, n + i - 1, 2):
if i == 0:
if j == 1:
dp[i][j] = a[j]
else:
dp[i][j] = dp[i][j - 2] + a[j]
else:
dp[i][j] = max(dp[i - 1][j - 1], dp[i][j - 2] + a[j])
ans = dp[2][n]
print(ans)
|
n = int(input())
A = list(map(int, input().split()))
dp = [0] * (n+1)
dp[2] = max(A[0], A[1])
s = A[0]
for i, a in enumerate(A, 1):
if i <= 2:
continue
if i%2: # 奇数
dp[i] = max(dp[i-1], a+dp[i-2])
s += a
else: # 偶数
dp[i] = max(a+dp[i-2], s)
print(dp[-1])
| 1 | 37,481,156,259,072 | null | 177 | 177 |
N=int(input())
A=list(map(int,input().split()))
c=0
flug = 1
while flug:
flug = 0
for j in range(1,N)[::-1]:
if A[j]<A[j-1]:
A[j],A[j-1]=A[j-1],A[j]
flug=1
c+=1
print(*A)
print(c)
|
#bubble
N=int(input())
A=[int(i) for i in input().split()]
fl=1
C=0
while fl==1:
fl=0
for j in range(N-1):
if A[N-1-j]<A[N-2-j]:
t=A[N-1-j]
A[N-1-j]=A[N-2-j]
A[N-2-j]=t
C+=1
fl=1
for j in range(N):
A[j]=str(A[j])
print(" ".join(A))
print(C)
| 1 | 16,000,112,000 | null | 14 | 14 |
s, t = input().split()
print(f"{t}{s}")
|
import sys
import queue
def solve(k):
q = queue.Queue()
for i in range(1, 10):
q.put(i)
for i in range(k):
n = q.get()
if i == k - 1:
return n
if n % 10 == 0:
q.put(n * 10)
q.put(n * 10 + 1)
elif n % 10 == 9:
q.put(n * 10 + 8)
q.put(n * 10 + 9)
else:
l = n % 10
q.put(n * 10 + l - 1)
q.put(n * 10 + l)
q.put(n * 10 + l + 1)
def main():
input = sys.stdin.buffer.readline
k = int(input())
print(solve(k))
if __name__ == "__main__":
main()
| 0 | null | 71,611,999,629,482 | 248 | 181 |
def main():
while True:
strDeck = input()
if strDeck == "-":
break
else:
intTime = int(input())
intNum = 0
for _ in range(intTime):
intNum += int(input())
intLenDeck = len(strDeck)
intShuffle = intNum % intLenDeck
print(strDeck[intShuffle:]+strDeck[:intShuffle])
if __name__ == '__main__':
main()
|
N = list(input())
num = 0
ans = 0
for i in range(len(N)-1, -1, -1):
n = int(N[i])
if n+num == 5 and i > 0 and int(N[i-1]) >= 5:
ans += 5
num = 1
elif n+num < 6:
ans += n+num
num = 0
else:
ans += 10-(n+num)
num = 1
ans += num
print(ans)
| 0 | null | 36,432,826,286,220 | 66 | 219 |
A,B=input().split()
A=int(A)
B=int(100*float(B)+0.5)
print(int(A*B/100))
|
elements = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K = int(input())
th = K-1
print(elements[th])
| 0 | null | 32,741,486,166,140 | 133 | 195 |
T = int(input())
print('Yes' if T >= 30 else 'No')
|
a=int(input())
if a<30:
print("No")
else:
print("Yes")
| 1 | 5,704,830,671,008 | null | 95 | 95 |
import math
a, b, x = map(int, input().split())
if x/(a*a*b) <= 0.5: #水が水筒の半分以下の場合
h = x/a/b*2
hy2 = (h*h + b*b)
cosa = (hy2 + b*b - h*h )/(2*(hy2**0.5)*b)
d = 180 - math.degrees(math.acos(cosa)) - 90
else:
rest = (a*a*b - x)/a
tan = rest*2/(a*a) #空の部分の面積は、a*atanθ/2 = a*a*b - x
d = math.degrees(math.atan(tan))
print(d)
|
# -*- coding:utf-8 -*-
def solve():
import math
a, b, x = list(map(int, input().split()))
if x > a*a*b/2:
s = x/a
# a*b-s = a*h*(1/2)
h = (a*b-s)*2/a
theta = math.atan2(h, a)
ans = math.degrees(theta)
print(ans)
else:
s = x/a
h = (s*2)/b
theta = math.atan2(h, b)
ans = 180-90-math.degrees(theta)
print(ans)
if __name__ == "__main__":
solve()
| 1 | 163,335,090,243,360 | null | 289 | 289 |
n=int(input())
if n==0 or n==1 or n==2:
print(0)
elif n==3:
print(1)
elif n%2==1:#奇数
print(int(n/2))
elif n%2!=1:#偶数
print(int(n/2)-1)
|
import math
print(int(math.ceil(int(input())/2)-1))
| 1 | 153,406,721,960,650 | null | 283 | 283 |
while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n + 1):
if a >= x:
break
for b in range(a + 1, n + 1):
if sum([a,b]) >= x:
break
for c in range(b + 1, n + 1):
if sum([a,b,c]) == x:
count += 1
print(count)
|
H,W = (int(x) for x in input().split())
if H==1 or W==1:
print(1)
elif (H*W)%2:
print((H*W-1)//2 + 1)
else:
print((H*W)//2)
| 0 | null | 26,003,517,755,040 | 58 | 196 |
from collections import defaultdict
N, X, Y = map(int, input().split())
cnt_dict = defaultdict(int)
for i in range(1,N):
for j in range(i+1, N+1):
if j<=X or i>=Y:
path = j-i
else:
path = min(j-i, abs(X-i)+abs(j-Y)+1)
cnt_dict[path] += 1
for i in range(1,N):
print(cnt_dict[i])
|
while True:
a, b = map(int,raw_input().split())
if a == 0 and b == 0:
break
if a > b:
print str(b) +" "+ str(a)
else:
print str(a) +" "+ str(b)
| 0 | null | 22,326,597,780,228 | 187 | 43 |
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
import subprocess
import sys
if sys.argv[-1] == "ONLINE_JUDGE":
import zlib, base64
exe_bin = "c%1E9eRLDol^=Z=8w`>lCNW<@p(ceSR;(bvB4)8{3C2V?Ua*OiKqg`&V>Plwq!HNJmT)jm859v8&Th-eZduap>85mhmQA;Na_H`2aDa5TJta*~!ZvBvrwy$XH^E&Jz5;0Pee<3?GuAZeZvW)@*!SJvyZ65P?!5PA=FRo9f#7Ph$;7c@;r@(6Zp5MRjTEnU6-5B6=O)A7JGpt>B;c(oIX%5%($b1zKZ;(xncCOUxtx}oRJ4pUE+aFwl;fO5J@mD1o`TlRb82Xg_S;sb)iYB)p6c;bo>2$YW0Z~0N`KoauBU!ZORbc)otMH`AG%H9^)$$7DbxFN(3`}4{z5M=x1RQA6qmEqUq;z=xIY%%vdnXTEL<Cl#?!sEz4gm#mw8;NgzEv~lY`2xY3(5Lc)iUkpQ|W_?QdS#zhiXmUdzC|j?srczAMmo?_YhzOl8=0!w8!|vx?fNIykjC^|f+laze?#?~D@oca3o9Xh8|Q!$5w}R2n~IfPc%tPMv}Lvj+ID4D2j3kpGE+{F4Uwe2&e0ZRs+wf6M@P7}$Bx08bhC(+c*dbF;Wcr=sPc6Yxu%f<Jkef>*PN3G*@~g~faC#kshQ6NIfjiMWuGLP<#wIH9F|oe+*BBU_^>DUxho*Bnd4BkiFrv53-Ey5+If4bfyOus%wviC8LtwGGk|F&Zb3R3A;Gge{>|#M2UwN`7}>I}va%7X+z0nb-ksVIdTYB}8lp$J(~*^xR8ReQ{CP5tX{Z+i)}y*n-aY_6pk~$y6d9ibbV9VSAloc9|d~Qc^M!>Jg&xR3s_2h=97q?od*YlA)-SY7qm0^?)q_<57`Gx3mlGbwXgnGNJ9E4NHU=Sc~uIDK&&<HUy8DNJ|*jt)eKTFsg1&=!ox##>2w;NGjbE!A6mV8zL<}C5YWm30<Km*cU=6^pA03Z%7D9k>038nXV`f?HLHNfM)2G>Ip$$*EBZ^OI&r_nqW&)v+#h+Q>;DUTFNzdcKVuH1h;F60(W+Tu*c<9b2uT)@M9sr7E-su{lg4<3T_?cWDingl&!=BKb@xW`P+7PUnR=@n9eT~$fap}9sE{BqtkFl`#HtZv!j!7XM3+GZy|da+i&0e$EV70NBe-v%g-)0;~ni2%1et6RG>c=y0fu;nB7-KrYp2whaYA4YaM==%2znGIOEUGS19hW7S*~tr^0P2d_;viRCrE>Pgmh%DqOw3uc+|bRJeosg)y6|!rA)A+jEr)XX_vFnJRo6wO`JS-?Omvs&MtqW0wlIs_?xkT>acJsKV9v-GeH;T!kN2;T0<UWfeYIg&$SnQ&jk?D!fvK52^5JD*Sa7Zdc)a|L-dJOxgLFPL3ZKlFWs(eE(||!(3tMT7U`*gYefrzY%K4ccV&vqyS}M6Y?0+{8_@UKpsPxA0qq%$m3MXA0_-f$YV(JhY7y`c?@NKknppS#}MXs5q<{p=x%-+;in*vA<I8Wcr)@Cs(c&auT=q$A<8!r{(q3i(B$g~{{iq_gKXTsM|>OI1z(4+y<-E!pf}8CtP2-mKxBVSw|giz2Xy$XR8z-iSFXApqI0Hf?j1@Db9UP1;pH<qGcw{P5Ip0r;Ym!P(#9&Cq%!c1ys4(qKJY^bP{v>5$+i^+hUE4dkA2U2h+!}ruBi`ZYu|z~1;KDbF#F}2#!<1$WuL!?^cfUSwVW6+ug!YQnMngfcKK5Py}y)dd2yJ}PTkFmr}%8u?u<KQ_MYB3T|Og^$)oa3UVfXG|AUvWn#N?4JX_cG+h|z+O;Em&Yq(h`1m#OOAU9M&us+*~q=C3zpY1Nlv6=?^-g3C4nP5$$oV$GXL~g$KKka{Wa?eToo(nKC?@#R6-vZ?`?KON*9M*We*9(F2p4d4*D8Am5nY(Y`9lP8CW0!~JJJBF0KYu$3?6eCo4fyQR7$GZrfE@b*#{KVa6bknFyD%Q!*T3=>FXl20M+ORZIR}V5Nj{bT;3i7=Ns#LXhIXdW^1zSm`%f{q+#d$q?+3Fn2=7AseD3l&pZ7JtJvfpLn7p8~b2V!4{ijUc6ZZWtpjLM7_sBKOdS>H5dVh>98^P0{IJP$1@QOcE9>6Q|55$Q~`RI3{2k<*T!^!#O-{e9!l-bgN&qy%8&YXs*PRZSaaOTT3JU>v7%5tOE3kCNO0^MPLNduXS_JNPkf&SNeAK&cT<lF3f!Y2%SuiE#Y!>c9!v?*iVhduuqdu}*_p_Z@YFG8dDzwG<JPlVnCp#v!N5(qWPbN8WCUWPV5j$=PmTEwA@XLm5$Fo5G6xMY`)lJPd|UM*W+!EyWLq5NHVZC))XWfkuowtw|$5}y0MLBa!*X!&&<>C{E;pADX|l2y(3pEU8_H`8OvNabKn8!j+X>x6;Z_k098xsN_A6!Pz1$N6F3|0xDWJeTpjIB==2t4X#Vkcab41*P%58#t)5O&QMtXsw0Tee#)n0f+p1`~D%)db%mouzR4;=jWj+dsei7_pX8>afnE~2SIspV5n~sG#`-1MqkCIeofQkvgbu;*@fYb-cW_RPiT@GcFQ+MUxJw$v67j3(n4nH+dz)t(?IUVHO1Zg$yi>`c=my}B6$0ve0p>rw#-zu*yZQR#UZU<#n#K$)vZ5JT4AK4{m|)A(%aH?N~f*ZDLzi;_Fls^T)@~a3c{jw24R_32Z412A?Ovka<&Ng42on>B!eOu6oDmE0iEQ@)c!+ehD@KwOf4~U0nMnD`_;-im1<DQnXj>RArC7{<Lp&H<p0hsf|k+ub58?12m?Pk-AQg=xiM_dtaRIf&(2&y$kK0-*4HZXyP>sf(EVYH{KgZ!{42iy{js+8V7BZUI+C46{K>BT9Y_^szGZWAACvt9AQKqs;Im~{0pz_`c=^0E3vQK1Y|5>2+UCN@`2M_k81ItfJm{aW5l4>M(9B}kiqG>WZd!PGj6acE#hXs^Z`_os!Qj)>;8ZkdWN+8XHym*HN#D=+ubdAGU=sY93d3FtTy7q?pW|T&r^~(rawb$K`{c#pE;1ez-<<CP356fHgm=E)&Afagv&wsUXFH!+SHX+#@h5(5h8xMOj2UM7l*i>U*m%Ge=RLF29TZ1k-Ms`edAfXBHp^qUD^dHn{9ncepXsQ8srpUc^o!A7KzM6Nc$dDUgyfqX+sfa)44xE6*ENXu;}-dCydej(3lB{pp|AZm&<#HMMvHtYxcEGIRylFQl3N4H{J@8j)BR5I{wQCA+m~Oy;44(U%l8k%uJg<E2RH##Tj$_-j~9pOvk!UNQJ&}VWy2+kT%EIFrL)(0_ucTP!5J4&UXNjoV0~EYE6N#_Xk2o3#G{G$YIt8-u_6U;I*R~XY|x%eBqUAy_Cz$S7D&UZ8L@DmlZct-SRTZ)Abdb-yHqF~1nPt^4WaKq@qA$nHkCa<ov`)blUyC_n&*HH0X+;jJ}2eqLo$1|Ha)YRGxa)5bEcM844TRvh~rt@QLuHdYJ8>TIj)Aue^Mx%MFE>*wXJ%sy>dszE^gKA2k%)@vw-R28CWOyu6{1YSGP?#Ch(bDIls;EyxC`~e$L{vIs2`lDYoino1@8A;ji2Xbswp(sVtrsKGPN?9+m%fZKac&!~DYMGxY5W_;nnfLaoPvX|g$9FgMw%_gnlnXV%(eTl9RH&sO)`B%iImzua#-YO?&Td5WzbFrRHvlg$aTO{7B~K4?~B{K0k@?q=ke^dXz$37aw+92>5MY8Xd^)ASW6_QhjgJodHD)|f2S4|&&$ft^OMqkeBG6ijoS(CG{2%jQFs+|MVKy;{kAzY<1vtP-oY%B^y%+$y)qt#YgU{|h^RW#_Hzd{zB@QcXKeT0TuH>}>N2J@jK|b|2G2(pi*e=f86(&(2(DQ_9YJ*>ewjhWg}YA%XNDeOO>;muKnWCOfknqV4RA(N1~x<WNni`fL>oJ1g#_=Zox_#Ho9ZWM`mvP<pOHiyto6`dv@;*;y#-|4vRT2aj50d?pIrq`ZULD^Q;KIY#*rI`FHMSD*F%DGU2PtS@)dKrf?oHKiLV?V@x$rO#3NHA=rt>Az5Vn$ow_hs6Jf!oCNvvZlFtg>zBImULW7JD0nby6S3|qzUKV>8^Lxc@`_^=dq1nK<Z0;sm1Rx?Im#wCzZsl#rdqo%Zl?@i%%-fcP(CCoCjLGqBwuF_~ha|)#6i%^I3~m7T2{FpUOE(Tqg^x{*jWnjT<Y8+l%{z7I$brrWEn%#ry#+K7(^qmBMf1hV%=b;8n%_NQ=)b?n7Gq_LA$s0=og*H?%mcc4sMk{QIvKpFIJ??Ze9bzM#h^lQsvpi^hTNuS+R@nBuG#k>XG4<X_-$ud@~Rf0h>WcSL>`*SEk~^aIN)2LAjTwd0ts#g9|GO^5%C;)iv3j`rKD>-RFLPrNR7niM-DIy?86P=4a|HS)iO$j{*ZwZuFrCI1L<Y~nop60tLJo}`F;)dc_dP+afl*NL5p^Xhx#yJ|I8t(!jy3tsDq^X;EWzQOo9V%x{CL7qe20IxQe&L=s<q5Sx|K2C4U9+01IuAZ<D`^=^7KWc#EzIhkeVc${N_T;vr{KS1@(7?_S13YC>{Ac-L>@4Wt4dmZ2z<)sOOx!0wq;b$+ud4=jHd;#OhxAyK>#o1P&yx8ti`%t8i$7ygaDBheSq$=pXdHIY#t6lKXdwTt0e;a^Iv>VvEiL~=E1f^Ik=^!|TTAD|tTV6^vzG4nFRVCk!9Lv|_E3D#K>mn<{o<jj@YrLm-r@nK2M;&{(SX}42yN>F?d^{Wt2<ho+gl!P#q1o7>{4>p8Hj#9X%8N)8e3iye7MOM6ogcIi_oH^mtb;BuwD?Ni70f$iAgCXrMtRZA~&8OBuG7ih>1WcP7uNgVQVb0B@`3FQX-iWLg`*kO!RDvMWjgBwS1YkzO)eLxI~3eG8yU<B5^6%$8{w`JrN<C?&;|R6%{9-D;iNjSiRo2E+7P2{WuO`O>2h`;3>%a*K>mZ(N^EOmS$+vD2KHG$*U>G;o;S*Hw4;+c3)F409GU6kQCyCmWN5|QCvu;B4NY)rN%~ehRtVYG3mrLNk6oWX7oVtQVF3u6c1~1uJi^}2}N3c|0Awsq{~%0Yf6=Qr0bPrW9bJK-_fJ*SDV>1ZUo!f*EO>%^ruYE(zxLAj^|_PeZ%X=F0rsBm16bMd0l#Kl6WPi(qz7r%sOjqRHa)LbKrD#{!nh6CSeTpXlj?LZ(JnBq`HzGj;Ds{=Z!YUuf&G)8OePm()Y9;aIREej}+PhR7xteo7JLmFu9F$#S>D*1u?3XLR%@fHJ)~DNk?Ph+Gv;~Tz4qd&AGyTaj>UQDXFw<hk%3A8b*M&WF!_sL0a1uldwy;PFQtqO+W=^HT)$3bR`pHExRJ!bYJNXC&xLkE{Z~=SBz|v1c{8_HNHtGHdr0{4E01ss1SoNt2h^IcRjE#mD=$CxPs>yc#C59FQfc#R!lk`KPIYkxb*qePMy5|HPEfoXYZSg)_jIOe%HBFC?uFZdoN{l5yjcLi~cpSl~c}Gm_B=dWt8QU<7=u(rO(boHgejWYWAMXs9pCytdHLloN`9O#Mt{Vqxb3jH|ywAoO0&Ec=q1RC`-6vd4>A%Kf@_8W%}&>no)KRq>mpP{~oH}M0xfe&ZtwRe@6-Z{hT_teEb}aQFdO%ivIe`I(_zD&*)j5yhBI-Qm4<}{~6WCt3pS=q0?vY6O5X51{_+JzORn!v-bi<^~V?b@qdTYuHWLh1N(mkoxD@W|C3JN=>Hsy`aiDIXXhA<9@R~FeLR1p?|-J2>iyNPpLaMVFP5Dzj{n~T^+PAGzka{vlzdF4&)#zz=au$XuYZx#=IoCDUkdGCwSTDfm|q9!nDpnko%0p`<<IE<x=z3No<#{;XL@~B%=F;4IDV>MP4ydf`&Xk*zuctsuRnlf`ipgVsq^_#|2)D|eFt?I??Y~G;{GvN<-59c(vAP8x(TbFKhq8LzgSEA*D2`r{}*)uI*$"
open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)
|
n = int(input())
a = list(map(int, input().split()))
b = a[0]
for v in a[1:]:
b ^= v
print(*map(lambda x: x ^ b, a))
| 0 | null | 8,218,652,529,270 | 84 | 123 |
#ABC161-A
x,y,z=map(int,input().split())
print(z,x,y)
|
nums=[int(i) for i in input().split()]
print(nums[2],nums[0],nums[1])
| 1 | 38,147,607,911,228 | null | 178 | 178 |
def resolve():
n=int(input())
ans=0
for i in range(1,n):
ans+=(n-1)//i
print(ans)
resolve()
|
# coding=utf-8
from math import floor, ceil, sqrt, factorial, log, gcd
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heappushpop, heapify
import copy
import sys
INF = float('inf')
mod = 10**9+7
sys.setrecursionlimit(10 ** 6)
def lcm(a, b): return a * b / gcd(a, b)
# 1 2 3
# a, b, c = LI()
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
# a = I()
def I(): return int(sys.stdin.buffer.readline())
# abc def
# a, b = LS()
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
# a = S()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
# 2
# 1
# 2
# [1, 2]
def IR(n): return [I() for i in range(n)]
# 2
# 1 2 3
# 4 5 6
# [[1,2,3], [4,5,6]]
def LIR(n): return [LI() for i in range(n)]
# 2
# abc
# def
# [abc, def]
def SR(n): return [S() for i in range(n)]
# 2
# abc def
# ghi jkl
# [[abc,def], [ghi,jkl]]
def LSR(n): return [LS() for i in range(n)]
# 2
# abcd
# efgh
# [[a,b,c,d], [e,f,g,h]]
def SRL(n): return [list(S()) for i in range(n)]
n = I()
ans = 0
for a in range(1, n):
ans += (n-1)//a
print(ans)
| 1 | 2,614,481,223,200 | null | 73 | 73 |
x=int(input())
if(x>=400 and x<=599):
print('8')
elif(x>=600 and x<=799):
print('7')
elif(x>=800 and x<=999):
print('6')
elif(x>=1000 and x<=1199):
print('5')
elif(x>=1200 and x<=1399):
print('4')
elif(x>=1400 and x<=1599):
print('3')
elif(x>=1600 and x<=1799):
print('2')
elif(x>=1800 and x<=1999):
print('1')
|
import numpy as np
A=[]
for i in range(3):
A.append(list(map(int,input().split())))
A=np.array(A)
n=int(input())
for i in range(n):
b=int(input())
if b in A:
A=np.where(A==b,0,A)
cross=0
if A[0][0]+A[1][1]+A[2][2]==0 or A[2][0]+A[1][1]+A[0][2]==0:
cross=1
print("NYoe s"[0 in np.sum(A,axis=0) or 0 in np.sum(A,axis=1) or cross ::2])
| 0 | null | 33,422,788,781,600 | 100 | 207 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
res = 1
a.sort(reverse=True)
if a[0]<0 and k%2==1:
for i in range(k):
res = (res*a[i])%mod
else:
right = n-1
left = 0
while k > 1:
if a[right]*a[right-1] < a[left]*a[left+1]:
res = (res*a[left])%mod
left += 1
k -= 1
else:
res = (res*a[right]*a[right-1])%mod
right -= 2
k -= 2
if k == 1:
res = (res*a[left])%mod
print(res)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
ans, num = 1, []
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
ans = ans * i % mod
print(ans)
exit()
for _ in range(k):
if len(mia) > 0 and len(pla) > 0:
if abs(mia[-1]) <= pla[-1]:
tmp = pla.pop()
elif abs(mia[-1]) > pla[-1]:
tmp = mia.pop()
elif len(mia) == 0:
tmp = pla.pop()
elif len(pla) == 0:
tmp = mia.pop()
num.append(tmp)
cnt = sum(i < 0 for i in num)
for i in num:
ans = ans * i % mod
if cnt % 2 == 1:
p, q, r, s = 1, 0, -1, 0
if len(mia) > 0 and cnt != k:
p,q = min(i for i in num if i >= 0), mia[-1]
if len(pla) > 0:
for i in num[::-1]:
if i < 0:
r, s = i, pla[-1]
break
if len(mia) > 0 or (len(pla) > 0 and cnt != k):
if q * r >= p * s:
ans *= q * pow(p, mod - 2, mod)
if q * r < p * s:
ans *= s * pow(r, mod - 2, mod)
ans %= mod
print(ans)
| 1 | 9,419,914,979,100 | null | 112 | 112 |
h,w = map(int, input().split())
sl = []
for _ in range(h):
row = list(input())
sl.append(row)
dp = [ [10000]*w for _ in range(h) ]
dp[0][0] = 0
for h_i in range(h):
for w_i in range(w):
if h_i+1 < h:
if sl[h_i][w_i] == '.' and sl[h_i+1][w_i] == '#':
dp[h_i+1][w_i] = min( dp[h_i+1][w_i], dp[h_i][w_i]+1 )
else:
dp[h_i+1][w_i] = min( dp[h_i+1][w_i], dp[h_i][w_i] )
if w_i+1 < w:
if sl[h_i][w_i] == '.' and sl[h_i][w_i+1] == '#':
dp[h_i][w_i+1] = min( dp[h_i][w_i+1], dp[h_i][w_i]+1 )
else:
dp[h_i][w_i+1] = min( dp[h_i][w_i+1], dp[h_i][w_i] )
ans = dp[h-1][w-1]
if sl[0][0] == '#': ans += 1
print(ans)
|
h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]
# ある経路をきめる.
# そのとき(白マスから黒マスに移動する回数)＝(その経路がいい経路にするための操作回数）
dp = [[float("inf")]*w for _ in range(h)]
if s[0][0] == "#":
dp[0][0] = 1
else:
dp[0][0] = 0
# dp[i][j]は00からijに行くときに白マスから黒マスに移動する回数の最小値
for i in range(h):
for j in range(w):
if i+1 < h:
count1 = dp[i][j]
if s[i][j] == "." and s[i+1][j] == "#":
count1 += 1
dp[i+1][j] = min(dp[i+1][j], count1)
if j+1 < w:
count2 = dp[i][j]
if s[i][j] == "." and s[i][j+1] == "#":
count2 += 1
dp[i][j+1] = min(dp[i][j+1], count2)
print(dp[h-1][w-1])
| 1 | 49,005,492,298,340 | null | 194 | 194 |
abc = set(list(map(int, input().split())))
l = len(list(abc))
print('Yes') if l == 2 else print('No')
|
import math
X = int(input())
def is_prime(x):
a = int(math.sqrt(X)) + 1#ある数が素数かどうかはO(√A)で判定できる
for i in range(2,a):
if x % i == 0:
return False
return True#xは素数
for j in range(X,10**5+4):
if is_prime(j):
ans = j
break
print(ans)
| 0 | null | 87,008,656,570,748 | 216 | 250 |
def inverse(a, p):
a_, p_ = a, p
x, y = 1, 0
while p_:
t = a_ // p_
a_ -= t * p_
a_, p_ = p_, a_
x -= t * y
x, y = y, x
x %= p
return x
def solve():
N, M, K = map(int, input().split())
mod = 998244353
nCi = [1]
for i in range(1, N):
nCi.append(nCi[i - 1] * (N - i) * inverse(i, mod) % mod)
ans = 0
for k in range(K + 1):
n = N - k
ans += M * int(pow((M - 1), n - 1, mod)) * nCi[k]
ans %= mod
print(ans)
if __name__ == '__main__':
solve()
|
# 二項係数のmod (大量のmod計算が必要なとき)
def cmb(n, r, mod):
if (r < 0 or r > n):
return 0
r=min(r,n-r)
return g1[n] * g2[r] * g2[n - r] % mod
mod=998244353
N = 10 ** 6 # 出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
n,m,k= map(int, input().split())
ans=0
# 同じ色で塗る組数で場合分け
for i in range(k,-1,-1):
# 同色の組の色の割り当て
if i==k:
v1 = m * pow(m - 1, n - i - 1, mod)
else:
v1*=m-1
v1%=mod
# グループの分け方
v2=cmb(n-1,i,mod)
ans+=v1*v2
ans%=mod
print(ans)
| 1 | 23,223,082,010,948 | null | 151 | 151 |
n = int(input())
A = [0]+list(map(int,input().split()))
d = {}
ans = 0
for i in range(1,n+1):
if i+A[i] not in d:
d[i+A[i]] = 1
else:
d[i+A[i]] += 1
if i-A[i] in d:
ans += d[i-A[i]]
print(ans)
|
n=int(input())
a=list(map(int,input().split()))
ans=0
tempi=[0]*n
tempj=[0]*n
for i in range(n):
tempi[i]=a[i]+i+1
for i in range(n):
tempj[i]=-a[i]+i+1
import collections
tempid=collections.Counter(tempi)
tempjd=collections.Counter(tempj)
for k in tempid.keys():
a=tempid[k]
b=tempjd[k]
ans=ans+a*b
print(ans)
| 1 | 26,131,763,185,722 | null | 157 | 157 |
A,B,C,K=map(int,input().split())
ans=1*min(A,K)
K=max(0,K-A-B)
print(ans-(1*K))
|
h,n=list(map(int ,input().split()))
l=list(map(int ,input().split()))
ans=0
count=0
for i in range(0,n):
ans+=l[i]
if(ans==h or ans>h):
count+=1
else:
count+=0
if(count>0):
print("Yes")
else:
print("No")
| 0 | null | 50,027,559,684,480 | 148 | 226 |
N = int(input())
S = input()
i = 0
count = 1
con_s = 0
for i in range(N-1):
if S[i] in S[i+1]:
pass
else:
count += 1
print(count)
|
n=int(input())
s=list(input())
for x in range(n-1):
if s[x]==s[x+1]:
s[x]='1'
print(len(s)-s.count('1'))
| 1 | 169,863,902,979,050 | null | 293 | 293 |
n = int(input())
if n in range(400, 600):
print("8")
if n in range(600, 800):
print("7")
if n in range(800, 1000):
print("6")
if n in range(1000, 1200):
print("5")
if n in range(1200, 1400):
print("4")
if n in range(1400, 1600):
print("3")
if n in range(1600, 1800):
print("2")
if n in range(1800, 2000):
print("1")
|
input_line = set([])
input_line.add(int(input()))
input_line.add(int(input()))
for i in range(1,4):
if i not in input_line:
print(i)
| 0 | null | 58,539,897,869,130 | 100 | 254 |
#abc167_e
n = int(input())
pos = []
neg = []
for _ in range(n):
s = input()
low_pos = 0
increase= 0
for v in s:
if v=="(":
increase += 1
else:
increase -= 1
low_pos = min(low_pos, increase)
if increase >= 0:
pos.append((low_pos, increase))
else:
#reverse left from right
low_pos, increase = low_pos - increase, -increase
neg.append((low_pos, increase))
pos.sort()
pos.reverse() #lowが高い順にする.
neg.sort()
neg.reverse() #lowが高い順にする.
now_pos = 0
for low_pos, increase in pos:
if now_pos + low_pos < 0:
print("No") #impossible
exit()
else:
now_pos += increase
right_pos = 0
for low_pos, increase in neg:
if right_pos + low_pos < 0:
print("No") #impossible
exit()
else:
right_pos += increase
if right_pos != now_pos:
print("No")
exit()
else:
print("Yes")
|
n = int(input())
L, R = [], []
for i in range(n):
a, b = 0, 0
for c in input():
if c == '(':
b += 1
if c == ')':
if b > 0:
b -= 1
else:
a += 1
if -a + b > 0:
L.append((a, b))
else:
R.append((a, b))
L.sort(key=lambda x: x[0])
R.sort(key=lambda x: x[1], reverse=True)
x = 0
for a, b in L + R:
x -= a
if x < 0:
print('No')
exit()
x += b
if x == 0:
print('Yes')
else:
print('No')
| 1 | 23,692,772,938,208 | null | 152 | 152 |
#!/usr/bin/env python3
import sys
import math
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 1000000007 # type: int
def solve(N: int, A: "List[int]", B: "List[int]"):
# 直交するイワシは選べない。
# 順にイワシを見て、直行するものをグループにする。
# 先に単純な整数比へ変換しておく（有理数としての扱い）
# aは整数、bは非負整数となるように整理する
d = Counter()
# (a, b) == (0, 0)については、他のイワシと同時に選ぶことができない。
# 個別にカウントする。
kodokunaiwashi = 0
for i, (a, b) in enumerate(zip(A, B)):
if a == 0 and b == 0:
kodokunaiwashi += 1
elif b == 0:
d[1, 0] += 1
elif b > 0:
g = math.gcd(b, a)
aa = a//g
bb = b//g
d[aa, bb] += 1
else:
g = math.gcd(-b, -a)
aa = -a//g
bb = -b//g
d[(aa, bb)] += 1
# 直交するグループを考える。
ans = 1
for a, b in d:
# (a, b)と直交するのは、(-b, a)と(b, -a)である。
# このうち、有理数としてカウントしている方を採用する
x, y = -b, a
if y < 0:
x = -x
y = -y
elif y == 0:
x = abs(x)
# すでに直交するイワシとしてカウントをしたらNoneとしている。
if d[a, b] == None:
continue
if d[x, y] == 0:
# 直交するイワシが存在しない場合、自由に選ぶことができる。
ans *= pow(2, d[a, b], MOD)
ans %= MOD
continue
else:
# 直交するイワシが存在する場合、どちらかのグループから自由に選ぶ。
# ただし、一つも選ばないという場合は、重複するためケア
buf = pow(2, d[a, b], MOD)
buf += pow(2, d[x, y], MOD)
buf -= 1
buf %= MOD
# print(buf)
ans *= buf
ans %= MOD
d[x, y] = None
print((ans-1+kodokunaiwashi) % MOD)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int()] * (N) # type: "List[int]"
B = [int()] * (N) # type: "List[int]"
for i in range(N):
A[i] = int(next(tokens))
B[i] = int(next(tokens))
solve(N, A, B)
if __name__ == '__main__':
main()
|
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
# mod=1000000007
mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def bo(i):
return ord(i)-ord('a')
def solve():
# for _ in range(ii()):
n,k = mi()
seg = []
for i in range(k):
seg.append(li())
dp = [0]*(n+1)
dp[1] = 1
for i in range(2,n+1):
dp[i] += dp[i-1]
dp[i] %= mod
for j in range(k):
if seg[j][0] >= i:
continue
l = max(1,i - seg[j][1])
r = i - seg[j][0]
dp[i] += dp[r] - dp[l-1]
dp[i] += mod
dp[i] %= mod
print((dp[n] - dp[n-1] + mod)%mod)
if __name__ =="__main__":
if path.exists('input.txt'):
sys.stdin=open('input.txt', 'r')
sys.stdout=open('output.txt','w')
else:
input=sys.stdin.readline
solve()
| 0 | null | 11,826,868,210,480 | 146 | 74 |
n,m=map(int,input().split())
diffs=set()
idxs=set()
i=1
diff=n-1
cnt=0
while 1:
if i>m:
break
while (diff in diffs and n-diff in diffs) or (i+diff in idxs) or (diff==n-diff):
diff-=1
diffs.add(n-diff)
diffs.add(diff)
idxs.add(i+diff)
print(i,i+diff)
i+=1
|
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
X = []
Y = []
C = []
for _ in range(M):
x,y,c = map(int,input().split())
X.append(x)
Y.append(y)
C.append(c)
ans = min(a) + min(b)
for i in range(M):
ans = min(ans,a[X[i]-1] + b[Y[i] - 1] - C[i])
print(ans)
| 0 | null | 41,318,696,316,832 | 162 | 200 |
'''
Rjの最小値を保持することで最大利益の更新判定をn回で終わらせる
'''
r = []
n = int(input())
for i in range(n):
i = int(input())
r.append(i)
minv = r[0]
maxv = r[1] - r[0]
for j in range(1,n):
maxv = max(maxv, r[j]-minv)
minv = min(minv, r[j])
print(maxv)
|
s = int(input())
maxv = -100000000000000000
minv = 10000000000000000
for i in range(s):
x = int(input())
maxv = max(maxv,x-minv)
minv = min(minv,x)
if x >= 0:
print(maxv)
else:
print("-1")
| 1 | 12,247,265,758 | null | 13 | 13 |
N = int(input())
ans = ''
while(N > 0):
N -= 1
_i = N % 26
ans = chr(ord('a') + _i) + ans
N //= 26
print(ans)
|
H,W,N = [int(input()) for i in range(3)]
for o in range(1,10000):
if H <= W and N / o <= W:
break
elif H >= W and N / o <= H:
break
print(o)
| 0 | null | 50,422,077,119,988 | 121 | 236 |
# import math
# import statistics
a=int(input())
#b,c=int(input()),int(input())
# c=[]
# for i in a:
# c.append(i)
#e1,e2,e3 = map(int,input().split())
#K = input()
f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
now=1000
buy=0
sell=0
kabu=0
for i in range(a-1):
if f[i]<f[i+1]:
if now>=f[i]:
buy=now//f[i]
now=now-buy*f[i]
kabu=buy
buy=0
if f[i]>f[i+1] :
if kabu>=1:
sell=kabu
now=now+sell*f[i]
kabu=0
sell=0
if f[i]==f[i+1]:
continue
now = now+f[-1]*kabu
print(now)
|
# -*- coding:utf-8 -*-
import sys
import math
array =[]
for line in sys.stdin:
array.append(line)
for i in range(len(array)):
num = array[i].split(' ')
a = int(num[0])
b = int(num[1])
n = a + b
print(int(math.log10(n) + 1))
| 0 | null | 3,614,005,657,382 | 103 | 3 |
N = input ()
P = '0168'
H = '24579'
if N[-1] in P:
print ('pon')
elif N[-1] in H:
print ('hon')
else:
print ('bon')
|
n = input()
n2 = n * 2
x = input()
if x in n2:
print('Yes')
else: print('No')
| 0 | null | 10,489,810,571,940 | 142 | 64 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.