code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 2
178,025B
⌀ | question_pair_id
float64 27.1M
177,113B
⌀ | code1_group
int64 1
297
| code2_group
int64 1
297
|
|---|---|---|---|---|---|---|
N=int(input())
K=set(input().split())
i=len(K)
if i==N:
print('YES')
else:
print('NO')
|
N = int(input())
ls = input().split(' ')
dic = { i for i in ls }
if len(dic) == N:
print('YES')
else:
print('NO')
| 1 | 73,722,560,905,950 | null | 222 | 222 |
s = input()
day = ['SAT','FRI','THU','WED','TUE','MON','SUN']
for i in range(7):
if s == day[i]:
print(i + 1)
exit()
|
# 参考 : https://atcoder.jp/contests/abc165/submissions/16921279
# 参考 : https://atcoder.jp/contests/abc165/submissions/16832189
from collections import deque
n,m,q = map(int,input().split())
l = [list(map(int,input().split())) for i in range(q)]
a,b,c,d = [list(i) for i in zip(*l)]
# 数列 A の基(最初は1を入れておく)
queue = deque([[1]])
ans = 0
# 数列 A の候補がなくなる(キューが空になる)まで探索
while queue:
# 数列 A を前から一つ取り出す
x = queue.popleft()
# 数列 A が長さ N か
if len(x) == n:
s = 0
# 実際に何点取得できるか
for i in range(q):
if x[b[i]-1] - x[a[i]-1] == c[i]:
s += d[i]
ans = max(ans,s)
else:
# 違う場合、後ろに数字を付け足す
# 付け足す数字は取り出した数列 A の一番後ろの値から M まで
# 最終的に長さが 1 , 2 ... N となり、if の条件を満たすようになる
for j in range(x[-1],m+1):
y = x + [j]
queue.append(y)
print(ans)
# 制約
# 2 <= N <= 10
# 1 <= M <= 50
# 1 <= Q <= 50
# なのでこの探索は間に合う
# 入力例 1 は A[1,3,4]
# 入力例 2 は A[1,1,1,4]
# 入力例 3 は A[1,1,1,1,1,1,1,1,1,10]
# が最大得点となる
| 0 | null | 80,489,730,881,848 | 270 | 160 |
X, Y, A, B, C = map(int, input().split())
P = sorted(list(map(int, input().split())), reverse=True)
Q = sorted(list(map(int, input().split())), reverse=True)
R = sorted(list(map(int, input().split())), reverse=True)
pq = sorted(P[:X] + Q[:Y])
cnt = 0
for i in range(min(C, X+Y)):
if R[i] <= pq[i]:
break
cnt += 1
ans = sum(pq[cnt:]) + sum(R[:cnt])
print(ans)
|
list=[0 for i in range(10**4+1)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
var=x**2 +y**2 +z**2 +x*y +y*z +z*x
if var<=10**4:
list[var]+=1
n=int(input())
for i in range(1,n+1):
print(list[i])
| 0 | null | 26,289,548,481,858 | 188 | 106 |
import math
import string
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
def has_duplicates2(seq):
seen = []
for item in seq:
if not(item in seen):
seen.append(item)
return len(seq) != len(seen)
def divisor(n):
divisor = []
for i in range(1, n+1):
if n % i == 0:
divisor.append(i)
return divisor
l = [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())
print(l[k-1])
|
N = int(input())
ans = set()
for i in range(1, N + 1):
j = N - i
if i == j or i == 0 or j == 0:
continue
ans.add((min(i, j), max(i, j)))
print(len(ans))
| 0 | null | 101,667,673,899,890 | 195 | 283 |
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque
from operator import mul
from functools import reduce
n = int(input())
m = 0
for i in range(1,n+1):
a = n // i
m += a*(a+1)*i//2
print(m)
|
from sys import stdin
r = int(stdin.readline())
if r < 1:
print(0)
else:
circle = r * r
print(circle)
| 0 | null | 78,250,968,887,950 | 118 | 278 |
n, k = map(int, input().split())
MOD = 10 ** 9 + 7
a = [0] *(k+1)
for x in range(1, k + 1):
a[x] = pow(k // x, n, MOD)
for x in range(k, 0, -1):
for i in range(2, k // x + 1):
a[x] -= a[x * i]
answer = sum([i * x for i,x in enumerate(a)])
print(answer % MOD)
|
#factorial
MOD = 998244353
N = 1000000
modinv_t = [0, 1]
modfact_t = [1, 1]
modfactinv_t = [1, 1]
for i in range(2,N+1):
modfact_t.append(modfact_t[-1] * i % MOD)
modinv_t.append(modinv_t[MOD%i] * (MOD-(MOD//i)) % MOD)
modfactinv_t.append(modfactinv_t[-1] * modinv_t[-1] % MOD)
# permutation
def nPr(n, r):
return modfact_t[n] * modfactinv_t[n-r] % MOD
# combination
def nCr(n, r):
return modfact_t[n] * modfactinv_t[n-r] * modfactinv_t[r] % MOD
#
def nHr(n, r):
return nCr(n+r-1,r)
#
N, M, K = map(int, input().split())
t = M*pow(M-1,N-1,MOD) % MOD
for i in range(1,K+1):
t += M*pow(M-1,N-1-i,MOD)*nCr((N-1),i)
t %= MOD
#
print(t)
| 0 | null | 29,943,909,251,190 | 176 | 151 |
s=input()
n=len(s)
x=s[0:(n-1)//2]
y=s[(n+3)//2-1:n]
if x==x[::-1] and y==y[::-1] and s==s[::-1]:
print('Yes')
else:
print('No')
|
input()
ls = input().split()
ls.reverse()
print(' '.join(ls))
| 0 | null | 23,732,248,065,632 | 190 | 53 |
for i in range(int(input())):
a,b,c=map(lambda x:int(x)**2,input().split())
if a+b==c or b+c==a or c+a==b:
print("YES")
else:
print("NO")
|
K = input()
NUM = list(map(int,input().split()))
count = 0
for num in range(NUM[1]-NUM[0]+1):
if ((NUM[0]+num )% int(K) == 0):
print("OK")
count += 1
break
if (count == 0):
print("NG")
| 0 | null | 13,386,544,483,998 | 4 | 158 |
n, m, ll = map(int, input().split())
a = []
b = []
for i in range(n):
a.append(list(map(int, input().split())))
for i in range(m):
b.append(list(map(int, input().split())))
for i in range(n):
prt = []
for j in range(ll):
s = 0
for k in range(m):
s += a[i][k] * b[k][j]
prt.append(s)
print(*prt)
|
n, m, l = map(int, input().split())
alst = []
for i in range(n):
a = list(map(int, input().split()))
alst.append(a)
blst = []
for i in range(m):
b = list(map(int, input().split()))
blst.append(b)
for i in range(n):
clst = []
for j in range(l):
c = 0
for k in range(m):
c += alst[i][k]*blst[k][j]
clst.append(c)
print(*clst)
| 1 | 1,448,071,021,868 | null | 60 | 60 |
# -*- 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]))
|
#!/usr/bin/env python3
e, o = map(int, input().split())
print(e*(e-1)//2 + o*(o-1)//2)
| 0 | null | 47,904,657,238,240 | 195 | 189 |
h,w = list(map(int, input().split()))
board = []
dp = []
INF=10**18
for _ in range(h):
board.append(input())
dp.append([INF]*w)
dxy=[(0,1), (0,-1), (1,0), (-1,0)]
dp[0][0]=1 if board[0][0] == '#' else 0
for y in range(h):
for x in range(w):
dp_list=[dp[y][x]]
if x>0:
dp_left = dp[y][x-1]
if board[y][x-1] != board[y][x] and board[y][x] == '#':
dp_left += 1
dp_list.append(dp_left)
if y>0:
dp_up=dp[y-1][x]
if board[y-1][x] != board[y][x] and board[y][x] == '#':
dp_up += 1
dp_list.append(dp_up)
dp[y][x]=min(dp_list)
print(dp[h-1][w-1])
|
h,w=map(int,input().split())
s=['*'+'.'+'*'*w]+['*'+input()+'*' for i in range(h)]+['*'*(w+2)]
b=10**9
d=[[b]*(w+2)]+[[b]+[0]*w+[b] for _ in range(h)]+[[b]*(w+2)]
d[0][1]=0
for i in range(1,h+1):
for j in range(1,w+1):
d[i][j]=min(d[i-1][j]+(s[i][j]=='#')*(s[i-1][j]=='.'),d[i][j-1]+(s[i][j]=='#')*(s[i][j-1]=='.'))
print(d[h][w])
| 1 | 49,162,781,089,704 | null | 194 | 194 |
import sys
A, B = [int(x) for x in input().split()]
ans_A = 0
ans_B = 0
for i in range(1500):
ans_A = (i*8//100)
ans_B = (i//10)
if(ans_A==A)and(ans_B==B):
print(i)
sys.exit()
print(-1)
|
import math
A, B = map(int, input().split())
r = -1
for i in range(1, 1111):
if A == math.floor(i*0.08) and B == math.floor(i*0.10):
r = i
break
print(r)
| 1 | 56,205,579,358,318 | null | 203 | 203 |
n,k=map(int,input().split())
mod=10**9+7
U = 4*10**5+1
MOD = 10**9+7
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U],MOD-2,MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n,k):
if k < 0 or k > n:
return 0
x = fact[n]
x *= fact_inv[k]
x %= MOD
x *= fact_inv[n-k]
x %= MOD
return x
if n-1<=k:
print(comb(2*n-1,n-1))
else:
ans=0
for i in range(1+k):
ans+=comb(n,i)*comb(n-1,n-i-1)
ans%=mod
print(ans)
|
S = str(input())
if S == "ABC":
print("ARC")
elif S == "ARC":
print("ABC")
| 0 | null | 45,673,063,596,838 | 215 | 153 |
exp = input().split()
stk = []
for i in exp :
if i in ('+', '-', '*') :
num1 = stk.pop()
num2 = stk.pop()
if i == '+' :
stk.append(str(int(num1) + int(num2)))
elif i == '-' :
stk.append(str(int(num2) - int(num1)))
else :
stk.append(str(int(num2) * int(num1)))
else :
stk.append(i)
print(stk.pop())
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
if N % 2 == 1:
print(0)
exit()
count = []
i = 0
while True:
q = N // (10 * 5 ** i)
if q == 0:
break
else:
count.append((q, i + 1))
i += 1
ans = 0
prev_c = 0
for c, n_zero in count[::-1]:
ans += n_zero * (c - prev_c)
prev_c = c
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 58,351,144,804,360 | 18 | 258 |
N=int(input())
A=0
B=0
C=0
D=0
for i in range(N+1):
A+=i
for i in range(N+1):
if i % 3 == 0:
B+=i
for i in range(N+1):
if i % 5 == 0:
C+=i
for i in range(N+1):
if i % 15 == 0:
D+=i
print(A-B-C+D)
|
def to_fizzbuzz(number):
if number % 15 == 0:
return 'FizzBuzz'
if number % 3 == 0:
return 'Fizz'
if number % 5 == 0:
return 'Buzz'
else:
return str(number)
# return i
def main():
N = int(input())
# this list concludes "FizzBuzz", "Fizz" or "Buzz"
fblist = []
for number in range(1, 10**6):
result = to_fizzbuzz(number)
fblist.append(result)
# the list up to N
n_list = fblist[0:N]
# this list contains only numbers and up to N
n_numlist = []
for s in n_list:
if s.isdigit() == True:
n_numlist.append(int(s))
print(sum(n_numlist))
main()
| 1 | 35,052,940,829,820 | null | 173 | 173 |
N = int(input())
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N-1) :
if A[i] > A[i+1] :
money += stock * A[i]
stock = 0
elif A[i] < A[i+1] :
temp = int(money / A[i])
stock += temp
money -= temp * A[i]
money += stock * A[N-1]
stock = 0
print(money)
|
nums = input().split()
a = int(nums[0])
b = int(nums[1])
if a < b:
print('a < b')
elif a > b:
print('a > b')
else:
print('a == b')
| 0 | null | 3,818,562,334,674 | 103 | 38 |
n,x,t=[int(i) for i in input().split()]
k=n//x
if n%x:
print((k+1)*t)
else:
print(k*t)
|
# #
# author : samars_diary #
# 13-09-2020 │ 12:41:59 #
# #
import sys, os.path
#if(os.path.exists('input.txt')):
#sys.stdin = open('input.txt',"r")
#sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10 ** 5)
def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))
#print=sys.stdout.write
def solve():
n,x,t=mii()
print(t*(n//x)+t*(bool(n%x)))
solve()
| 1 | 4,183,009,238,518 | null | 86 | 86 |
wd = ['SUN','MON','TUE','WED','THU','FRI','SAT']
s = input()
print(str(7 - wd.index(s) % 7))
|
s = input()
res = 0
if s == "SUN":
res = 7
elif s == "MON":
res = 6
elif s == "TUE":
res = 5
elif s == "WED":
res = 4
elif s == "THU":
res = 3
elif s == "FRI":
res = 2
elif s == "SAT":
res = 1
print(res)
| 1 | 132,934,076,519,640 | null | 270 | 270 |
import math
#入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n,x,t=input2()
ans=(math.ceil(n/x))*t
print(ans)
|
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
def get_head(x):
while x:
b = x%10
x //= 10
return b
dp = [[0] * 10 for i in range(10)]
for i in range(1,n+1):
h = get_head(i)
t = i%10
dp[h][t] += 1
for i in range(10):
dp[0][i] = 0
dp[i][0] = 0
ans = 0
for i in range(1,n+1):
h = get_head(i)
t = i%10
ans += dp[t][h]
print(ans)
| 0 | null | 45,427,970,455,110 | 86 | 234 |
from itertools import accumulate
from bisect import bisect_left
n, m = map(int, input().split())
a = sorted(map(int, input().split()))
cs = [0] + list(accumulate(a))
c = 0
s = 0
def f(x):
global c, s
c = 0
s = 0
for i in range(n):
left = bisect_left(a, x - a[i])
c += n - left
s += cs[n] - cs[left] + (n - left) * a[i]
return c
ok = 0
ng = 2 * 10 ** 5 + 1
while abs(ok - ng) > 1:
x = (ok + ng) // 2
if f(x) >= m:
ok = x
else:
ng = x
print(s - (c - m) * ok)
|
from bisect import bisect_left
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def count(x):
ret = 0
for a in A:
ret += N - bisect_left(A, x - a)
return ret
overEq = 0
less = 10**7
while less - overEq > 1:
mid = (less + overEq) // 2
if count(mid) >= M:
overEq = mid
else:
less = mid
ans = 0
cnt = [0] * N
for a in A:
i = (N - bisect_left(A, overEq - a))
ans += i * a
if i > 0:
cnt[-i] += 1
for i in range(1, N):
cnt[i] += cnt[i - 1]
for a, c in zip(A, cnt):
ans += a * c
ans -= overEq * (count(overEq) - M)
print(ans)
| 1 | 108,393,730,180,044 | null | 252 | 252 |
N,K=map(int,input().split())
A=[int(x)-1 for x in input().split()]
seen={0}
town=0
while K>0:
town=A[town]
K-=1
if town in seen:
break
seen.add(town)
start=town
i=0
while K>0:
town=A[town]
i+=1
K-=1
if town is start:
break
K=K%i if i>0 else 0
while K>0:
town=A[town]
i+=1
K-=1
print(town+1)
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
B=[1]
C=["#"]*N
roop=False
for i in range(K):
if C[B[i]-1]=="#":
C[B[i]-1]="$"
else:
roop=True
break
B.append(A[B[i]-1])
if roop==True:
f=B.index(B[i])
T=i-f
if T==0:
print(B[f])
else:
r=(K-f)%T
print(B[f+r])
else:
print(B[K])
| 1 | 22,734,237,949,702 | null | 150 | 150 |
n=int(input())
dept=100000
for i in range(n):
dept*=1.05
if dept%1000!=0:
dept=dept-dept%1000+1000
print(int(dept))
|
n=int(input())
a=list(map(int,input().split()))
b=[(v,s) for s,v in enumerate(a)]
b.sort(reverse=True)
dp=[[0 for i in range(n+1)] for i in range(n+1)]
for i in range(n+1):
for j in range(n+1-i):
if i+j==0:
continue
v=b[i+j-1][0]
pos=b[i+j-1][1]
if i==0:
dp[0][j]=dp[0][j-1]+v*abs(n-j-pos)
elif j==0:
dp[i][0]=dp[i-1][0]+v*abs(i-1-pos)
else:
dp[i][j]=max(dp[i-1][j]+v*abs(i-1-pos),dp[i][j-1]+v*abs(n-j-pos))
ans=0
for i in range(n):
happy=dp[i][n-i]
if happy>ans:
ans=happy
print(ans)
| 0 | null | 16,862,354,305,728 | 6 | 171 |
S, T = input().split()
A, B = input().split()
U = input()
if S==U:
print(int(A)-1,end=" ")
print(int(B))
else:
print(int(A),end=" ")
print(int(B)-1)
|
s,t = input().split()
d={}
d[s], d[t] = map(int,input().split())
d[input()] -= 1
print(d[s],d[t])
| 1 | 71,877,812,861,270 | null | 220 | 220 |
while True:
try:
n,x = map(int,raw_input().split())
if n == x == 0:
break
except EOFError:
break
total = 0
for k in range(1,n+1):
for j in range(1,n+1):
for l in range(1,n+1):
if k!=j!=l and k + j + l == x and k<j<l:
total +=1
print total
|
results = []
while True:
n,x = map(int ,raw_input().split())
if n is x is 0:
break
s = 0
for i in xrange(1,n+1):
for j in xrange(1,n+1):
for k in xrange(1,n+1):
if i+j+k == x:
if i != j and j != k and k != i :
s+=1
results.append(s/6)
for i in results:
print i
| 1 | 1,310,913,418,620 | null | 58 | 58 |
n, k = map(int, input().split())
ans = 0
while n != 0:
n //= k
ans += 1
print(ans)
|
N, K = map(int, input().split())
for i in range(1000000):
if K ** (i - 1) <= N < K ** i:
print(i)
break
| 1 | 64,682,668,283,618 | null | 212 | 212 |
s = input()
a = input()
print("Yes" if a[:-1]==s else "No")
|
import bisect
n = int(input())
a = list(map(int,input().split()))
# ni - nj = ai + aj (i>j)
# ai - ni = - aj - nj
a1 = sorted([a[i] - (i+1) for i in range(n)])
a2 = sorted([- a[i] - (i+1) for i in range(n)])
ans = 0
for i in range(n):
left = bisect.bisect_left(a2, a1[i])
right = bisect.bisect_right(a2, a1[i])
ans += (right - left)
print(ans)
| 0 | null | 23,761,941,889,550 | 147 | 157 |
n=int(input())
a=list(map(int,input().split()))
q=int(input())
s=sum(a)
data=[0]*10**5
for i in a:
data[i-1]+=1
for i in range(q):
b,c=map(int,input().split())
s+=(c-b)*data[b-1]
print(s)
data[c-1]+=data[b-1]
data[b-1]=0
|
n = int(input())
sum = 0
a_list = list(map(int, input().split()))
num = [0] * (10 ** 5 + 1)
for i in range(n):
num[a_list[i]] += 1
sum += a_list[i]
q = int(input())
for i in range(q):
b, c = map(int, input().split())
sum += (c - b) * num[b]
num[c] += num[b]
num[b] = 0
print(sum)
| 1 | 12,309,296,524,448 | null | 122 | 122 |
from collections import Counter
N = int(input())
arr = list(map(int, input().split()))
summ = sum(arr)
val = Counter(arr)
Q = int(input())
for q in range(Q):
B, C = list(map(int, input().split()))
summ = summ + C * val[B] - B * val[B]
val[C] += val[B]
val[B] = 0
print(summ)
|
n = int(input())
a = list(map(int, input().split()))
q = int(input())
d = dict()
for i in range(n):
if a[i] not in d.keys():
d[a[i]] = 1
else:
d[a[i]] += 1
s = sum([k * v for k, v in d.items()])
for i in range(q):
b, c = list(map(int, input().split()))
if b in d.keys():
s += (c - b) * d[b]
if c in d.keys():
d[c] += d[b]
d[b] = 0
else:
d[c] = d[b]
d[b] = 0
print(s)
| 1 | 12,309,295,095,020 | null | 122 | 122 |
number=list(map(int,input().split()))
n,m,q=number[0],number[1],number[2]
nums=[]
for i in range(q):
tmp=list(map(int,input().split()))
nums.append(tmp)
answer=0
mid=0
List1=[]
for i in range(m):
List1.append(i)
import itertools
for i in list(itertools.combinations_with_replacement(List1,n)):
mid=0
for j in range(q):
if i[nums[j][1]-1]-i[nums[j][0]-1]==nums[j][2]:
mid+=nums[j][3]
answer=max(mid,answer)
print(answer)
|
import sys
d={}
for e in sys.stdin.readlines()[1:]:
c,g=e.split()
if'i'==c[0]:d[g]=0
else:print(['no','yes'][g in d])
| 0 | null | 13,903,773,316,400 | 160 | 23 |
import sys
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
n, m=ISI()
if(n==m):print("Yes")
else:print("No")
|
a, b= map(int, input().split())
if a<b:print( "a < b")
if a>b:print ("a > b")
if a==b:print ("a == b")
| 0 | null | 41,667,815,744,830 | 231 | 38 |
n,a,b = map(int,input().split())
if (a - b) % 2 == 0:
print(min(abs(a-b) // 2, max(a-1, b-1), max(n-a, n-b)))
else:
print(min(max(a-1, b-1), max(n-a, n-b), (a+b-1)//2, (2 * n - a - b + 1)//2))
|
n = int(raw_input())
print ' '.join(raw_input().split()[::-1])
| 0 | null | 54,922,513,986,824 | 253 | 53 |
S = list(input())
T = list(input())
count = 0
for i,j in zip(S,T):
if i != j:
count += 1
print(count)
|
n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(60):
cnt = 0
digit = 1 << i
for j in a:
if digit & j:
cnt += 1
ans += digit*cnt*(n - cnt)%mod
print(ans%mod)
| 0 | null | 66,584,125,369,180 | 116 | 263 |
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(1, N):
if A[i] < A[i-1]:
step = A[i-1] - A[i]
A[i] += step
ans += step
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
p = list(range(N))
p.sort(key=lambda i: A[i], reverse=True)
dp = [[0]*(N + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(i + 1):
pi = p[i]
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + A[pi]*(N - i + j - 1 - pi))
dp[i+1][j+1] = dp[i][j] + A[pi]*(pi - j)
print(max(dp[N]))
| 0 | null | 19,267,983,658,582 | 88 | 171 |
s=input()
n=len(s)
if n%2==1:
print('No')
else:
fail=0
for i in range(n):
if (s[i]!='h' and i%2==0) or (s[i]!='i' and i%2==1):
fail=1
if fail==0:
print('Yes')
else:
print('No')
|
s = input()
if len(s) % 2 == 1:
print('No')
else:
ans = "Yes"
for i in range(len(s)):
if i % 2 == 0 and s[i] != 'h':
ans = "No"
break
if i % 2 == 1 and s[i] != 'i':
ans = "No"
break
print(ans)
| 1 | 53,333,325,256,904 | null | 199 | 199 |
import numpy as np
N = int(input())
N_List = list(map(int,input().split()))
ans = (100**2)*100
for i in range(1,101):
ca = sum(map(lambda x:(x-i)**2,N_List))
if ca < ans:
ans = ca
print(ans)
|
import sys
n=int(input())
x=list(map(int,input().split()))
if n==1:
print('0')
sys.exit()
if x.count(x[0])==n:
print('0')
sys.exit()
a=sum(x)/len(x)
d=[]
for i in range(min(x),max(x)):
c=0
for j in x:
c+=(i-j)**2
d.append(c)
print(min(d))
| 1 | 64,935,737,040,252 | null | 213 | 213 |
d,t,s=[int(i) for i in input().split()]
if d<=t*s:
print("Yes")
else:
print("No")
|
list =input().split()
list = [int(i) for i in list]
D=list[0]
S=list[1]
T=list[2]
if(D/S<=T):
print("Yes")
else:
print("No")
| 1 | 3,580,234,802,560 | null | 81 | 81 |
#左からn個目でendが特定の色の場合に
N,M,K = list(map(int,input().split()))
def xgcd(a, b):
x0, y0, x1, y1 = 1, 0, 0, 1
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
return a, x0, y0
def modinv(a, m):
g, x, y = xgcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
def combination(n, k, mod=1e9+7) -> int:
ret = 1
for i in range(1, k+1):
ret = (ret * (n-k+i) * modinv(i, mod))%mod
return int(ret)
def pow(base, exponent, mod=1e9+7) -> int:
if exponent == 0:
return 1
if exponent > 1:
d,m = divmod(exponent, 2)
return (base**m * pow(base, d, mod)**2 ) % mod
else:
return base
m = 998244353
res = 0
B = 1
if M != 1:
mi = modinv(M-1,m)
A = M * pow(M-1,N-1,m)
for k in range(K+1):
if k>0:
B = (B*(N-k)*modinv(k,m))%m
res = (res+ A*B)%m
A = (A*mi)%m
print (res)
else:
if K == N-1:
print(1)
else:
print(0)
|
# coding: utf-8
# Your code here!
n,M,K=map(int,input().split())
mod=998244353
fac = [1] * (n + 1)
inv = [1] * (n + 1)
for j in range(1, n + 1):
fac[j] = fac[j-1] * j % mod
inv[n] = pow(fac[n], mod-2, mod)
for j in range(n-1, -1, -1):
inv[j] = inv[j+1] * (j+1) % mod
def comb(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
ans=0
temp=(M*(M-1)**(n-K-1))%mod#1乗
for k in range(K+1)[::-1]:
ans=(ans+temp*comb(n-1,k))%mod
temp=(temp*(M-1))%mod
print(ans)
| 1 | 23,247,667,163,890 | null | 151 | 151 |
n = list(map(int, list(input())))
ln = len(n)
ans = 0
for i in range(-1, -ln, -1):
if n[i] == 10:
n[i-1] += 1
continue
elif n[i] < 5:
ans += n[i]
elif n[i] > 5:
ans += 10 - n[i]
n[i-1] += 1
else:
if n[i-1] < 5:
ans += 5
else:
ans += 5
n[i-1] += 1
if n[0] == 10:
ans += 1
elif n[0] <= 5:
ans += n[0]
else:
ans += 11 - n[0]
print(ans)
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
コンテスト後に解説記事を見てAC
Python 3だとTLE
"""
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def solve(N_str):
"""
https://betrue12.hateblo.jp/ の通り実装
上の桁から順番に見ていく
dp[i][j] =
上から i 桁目までの硬貨の支払いとお釣りを処理し終わって、
N の i 桁目までの金額よりも j 枚分多く支払っているときの、
これまでの支払い・お釣り硬貨の最小合計枚数
"""
N_str = '0' + N_str
dp = [[0] * 2 for _ in range(len(N_str))]
# 0376円のとき
# dp[1][0] = 0 0円払う(0)
# dp[1][1] = 1 1000円払う(1)
#
# dp[2][0] = 3 0円の状態から300円払う(3) vs 1000円の状態から700円お釣りをもらう(8)
# dp[2][1] = 4 0円の状態から400円払う(4) vs 1000円の状態から600円お釣りをもらう(7)
#
# dp[3][0] = 7 300円の状態から追加で70円払う(3+7) vs 400円の状態から30円もらう(4+3)
# dp[3][1] = 6 300円の状態から追加で80円払う(3+8) vs 400円の状態から20円もらう(4+2)
#
# dp[4][0] = 10 370円の状態から追加で6円払う(7+6) vs 380円の状態から4円もらう(6+4)
# dp[4][1] = 9 370円の状態から追加で7円払う(7+7) vs 380円の状態から3円もらう(6+3)
for i, ch in enumerate(N_str):
if i == 0:
dp[0][0] = 0
dp[0][1] = 1
else:
dp[i][0] = min(dp[i - 1][0] + int(ch),
dp[i - 1][1] + 10 - int(ch))
dp[i][1] = min(dp[i - 1][0] + int(ch) + 1,
dp[i - 1][1] + 9 - int(ch))
return dp[len(N_str) - 1][0]
def wrong(N_str):
"""最初に間違って書いた貪欲
1の位から見ていき、0~4なら支払い、5~9なら10払ってお釣りをもらう
N = 65のとき、
この関数だと70払って5お釣りをもらうことになるが
実際は100払って35お釣りをもらうべきなので誤り
"""
N_str = N_str[::-1]
ans = 0
prev = 0
for ch in N_str:
n = int(ch)
n += prev
if n <= 5:
ans += n
prev = 0
else:
ans += 10 - n
prev = 1
ans += prev
return ans
# for n in range(1, 101):
# print()
# n_str = str(n)
# w = wrong(n_str)
# gt = solve(n_str)
# if w != gt:
# print("n, gt, wrong = ", n, gt, w)
N_str = input()
print(solve(N_str))
| 1 | 70,575,104,262,400 | null | 219 | 219 |
def input_num():
ls = input().strip().split(" ")
return [int(e) for e in ls]
n,r = input_num()
if n >= 10:
print(r)
else:
print(r+100*(10-n))
|
n,r = [int(x) for x in input().split()]
if n > 10:
print(r)
else:
print(r + 100 * (10 - n))
| 1 | 63,406,050,129,418 | null | 211 | 211 |
num1, num2 = map(int, input().split())
print(num1*num2)
|
from itertools import product
H, W, K = map(int, input().split())
choco = [list(input()) for _ in range(H)]
def cnt(array):
count = [0] * H
split_cnt = 0
for w in range(W):
for h in range(H):
if choco[h][w] == "1":
count[array[h]] += 1
if any(i > K for i in count):
split_cnt += 1
count = [0] * H
for h in range(H):
if choco[h][w] == "1":
count[array[h]] += 1
if any(i > K for i in count):
return 10 ** 20
return split_cnt
def get_array(array):
l = len(array)
ret = [0] * l
for i in range(1, l):
ret[i] = ret[i-1] + array[i]
return ret
ans = 10 ** 20
for p in product(range(2), repeat=H-1):
p = get_array([0]+list(p))
ans = min(ans, cnt(p)+max(p))
print(ans)
| 0 | null | 32,223,209,961,810 | 133 | 193 |
import sys
def main():
input = sys.stdin.buffer.readline
N, M = map(int, input().split())
skip = (N // 2) // 2 + 1 if N % 2 == 0 else None
count = 0
left, right = 0, N + 1
while count < M:
left += 1
if left == skip:
continue
right -= 1
print(left, right)
count += 1
if __name__ == '__main__':
main()
|
n,m=map(int,input().split())
if n%2==1:
x=[f"{i+1} {n-i}" for i in range(m)]
print(" ".join(x))
else:
x=[f"{i+1} {n-i}" if i<m/2 else f"{i+1} {n-i-1}" for i in range(m)]
print(" ".join(x))
| 1 | 28,480,523,999,070 | null | 162 | 162 |
import sys
input = sys.stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
ans = 0
for i in range(1, N):
ans += A[N - (i // 2) -1]
print(ans)
main()
|
n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
ans=a[0]
ch=1
for i in range(1,n):
if ch==n-1:
break
else:
ans+=a[i]
ch+=1
if ch==n-1:
break
else:
ans+=a[i]
ch+=1
print(ans)
| 1 | 9,180,377,280,452 | null | 111 | 111 |
def a():
a = "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"
list_a = a.split(sep=",")
k = int(input())
print(list_a[k-1])
if __name__ == '__main__':
a()
|
n=list(map(str,input().split()));print(n[2]+' '+n[0]+' '+n[1])
| 0 | null | 43,955,621,765,148 | 195 | 178 |
a,b = [int(x) for x in input().split()]
print(a * b)
|
num1, num2 = map(int, input().split())
print(num1*num2)
| 1 | 15,806,516,447,702 | null | 133 | 133 |
mod = 998244353
N, S, *A = map(int, open(0).read().split())
dp = [1] + [0] * S
for i, a in enumerate(A, 1):
dp = [(2 * dp[j] + (dp[j - a] if j >= a else 0)) % mod for j in range(S + 1)]
print(dp[S])
|
import sys
input = sys.stdin.buffer.readline
n, s = map(int, input().split())
A = list(map(int, input().split()))
mod = 998244353
dp = [[0] * (s + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
ni = i + 1
for j in range(s + 1):
nj = j
dp[ni][nj] += 2 * dp[i][j]
dp[ni][nj] %= mod
nj = j + A[i]
if nj <= s:
dp[ni][nj] += dp[i][j]
dp[ni][nj] %= mod
print(dp[n][s] % mod)
| 1 | 17,633,009,541,338 | null | 138 | 138 |
A, B=input().split()
a=int(A)
R,E=B.split('.')
while len(E)<2:
E=E+0
c=int(R+E)
p=str(a*c)
if len(p)<=2:
print(0)
else:
print(p[0:len(p)-2])
|
import math
a,b = map(str, input().split())
b = b.replace(".","")
a = int(a)
b = int(b)
print(a * b // 100)
| 1 | 16,633,407,831,222 | null | 135 | 135 |
#coding: utf-8
nums=list(map(int,input().split()))
a=nums[0]
b=nums[1]
if a>b:
print("a > b")
elif a<b:
print("a < b")
else:
print("a == b")
|
n = list(str(input()))
flag = False
for i in range(len(n)):
if n[i] == '7':
flag = True
if flag:
print('Yes')
else:
print('No')
| 0 | null | 17,238,973,383,830 | 38 | 172 |
data = input()
#data = '\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\'
diff = {'\\':-1, '_':0, '/':1}
height = [0]
[height.append(height[-1]+diff[i]) for i in data]
bottom = min(height)
height = [h-bottom for h in height]
m = max(height)
water = [m for h in height]
height00 = [0] + height + [0]
water00 = [0] + water + [0]
idx = list(range(1,len(water00)-1))
for i in idx + idx[::-1]:
water00[i] = max(height00[i],min(water00[i-1:i+2]))
water = water00[1:-1]
depth = [w-h for w,h in zip(water,height)]
paddles = [0]
for d1,d2 in zip(depth[:-1],depth[1:]):
if d1==0 and d2>0:
paddles.append(0)
paddles[-1] += min(d1,d2) + 0.5*abs(d1-d2)
paddles = [int(p) for p in paddles[1:]]
print(sum(paddles))
print(len(paddles), *paddles)
|
import sys
n,m=map(int,input().split())
if n==3:
ans=["1","0","0"]
elif n==2:
ans=["1","0"]
else:
ans=["0"]
cnt=[0,0,0]
for i in range(m):
s,c=map(int,input().split())
if s==1 and c==0 and n!=1:
print(-1)
sys.exit()
elif ans[s-1]!=str(c):
if cnt[s-1]==0:
ans[s-1]=str(c)
cnt[s-1]=1
else:
print(-1)
sys.exit()
print("".join(ans))
| 0 | null | 30,389,381,629,022 | 21 | 208 |
import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
s = stdin.readline()[:-1]
print(s[:3])
|
a = list(input())
print("Yes" if len(set(a)) == 2 else "No")
| 0 | null | 34,694,636,313,580 | 130 | 201 |
A,B=map(int,input().split())
ma,mi=0,0
ma=max(A,B)
mi=min(A,B)
if A%B==0 or B%A==0:
print(ma)
else :
for i in range(2,ma+1):
if (ma*i)%mi==0:
print(ma*i)
break
i+=(mi-1)
|
def gcd(a, b):
for i in range(min(a, b), 0, -1):
if a%i == 0 and b%i == 0:
return i
A, B = map(int, input().split())
print((A*B) // gcd(A, B))
| 1 | 113,622,716,132,090 | null | 256 | 256 |
n = int(input())
for i in range(1000):
for j in range(-1000,1000):
if (i**5-j**5)==n:
print(i,j)
exit()
|
# coding:utf-8
n,m,l = map(int, raw_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 i in range(n):
a[i] = map(int, raw_input().split())
for i in range(m):
b[i] = map(int, raw_input().split())
for i in range(len(a)):
for j in range(len(b[0])):
for k in range(len(b)):
c[i][j] += a[i][k] * b[k][j]
else:
print c[i][j],
else:
print
| 0 | null | 13,551,566,106,134 | 156 | 60 |
import sys
n = int(input())
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
multi = 1
if 0 in a:
print('0')
sys.exit()
for i in a:
multi *= i
if multi > 10**18:
print('-1')
sys.exit()
print(multi)
|
import bisect
n=int(input())
l=sorted(list(map(int,input().split())))
ans=0
for i in range(n-1):
for j in range(i+1,n):
index=bisect.bisect_left(l,l[i]+l[j])
if j<index:
ans+=index-j-1
print(ans)
| 0 | null | 94,016,522,014,142 | 134 | 294 |
from copy import copy
import random
D = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for _ in range(D)]
last = [0]*26
ans = [0]*D
score = 0
for i in range(D):
ps = [0]*26
for j in range(26):
pl = copy(last)
pl[j] = i+1
ps[j] += s[i][j]
for k in range(26):
ps[j] -= c[k]*(i+1-pl[k])
idx = ps.index(max(ps))
last[idx] = i+1
ans[i] = idx+1
score += max(ps)
for i in range(40000):
na = copy(ans)
x = random.randint(1,365)
y = random.randint(1,365)
if x == y:
continue
na[x-1],na[y-1] = na[y-1],na[x-1]
last = [0]*26
ns = 0
for i in range(D):
last[na[i]-1] = i+1
ns += s[i][na[i]-1]
for j in range(26):
ns -= c[j]*(i+1-last[j])
if ns > score:
ans = na
score = ns
for a in ans:
print(a)
|
from copy import copy
import random
import math
import sys
input = sys.stdin.readline
D = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for _ in range(D)]
last = [0]*26
ans = [0]*D
score = 0
for i in range(D):
ps = [0]*26
for j in range(26):
pl = copy(last)
pl[j] = i+1
ps[j] += s[i][j]
for k in range(26):
ps[j] -= c[k]*(i+1-pl[k])
idx = ps.index(max(ps))
last[idx] = i+1
ans[i] = idx+1
score += max(ps)
for k in range(1,37001):
na = copy(ans)
x = random.randint(1,365)
y = random.randint(1,365)
z = random.randint(min(x,y),max(x,y))
if x == y:
continue
na[x-1],na[y-1] = na[y-1],na[x-1]
na[x-1],na[z-1] = na[z-1],na[z-1]
last = [0]*26
ns = 0
for i in range(D):
last[na[i]-1] = i+1
ns += s[i][na[i]-1]
for j in range(26):
ns -= c[j]*(i+1-last[j])
if k%100 == 1:
T = 300-(298*k/37000)
p = pow(math.e,-abs(ns-score)/T)
if ns > score or random.random() < p:
ans = na
score = ns
for a in ans:
print(a)
| 1 | 9,635,640,062,302 | null | 113 | 113 |
a, b, c = list(map(int, input().split()))
frag1 = ((a+b-c)**2 -4*a*b) > 0
frag2 = a+b-c < 0
if frag1 and frag2:
print("Yes")
else:
print("No")
|
from decimal import Decimal
a,b,c = input().split()
if Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt():
print('Yes')
else:
print('No')
| 1 | 51,664,381,959,050 | null | 197 | 197 |
c = input()
s = list('abcdefghijklmnopqrstuvwxyz')
for i in range(25):
if c == s[i]:
print(s[i+1])
exit()
|
asd=input()
dfg=["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"]
print(dfg[dfg.index(asd)+1])
| 1 | 92,266,466,346,090 | null | 239 | 239 |
from collections import Counter
class UnionFind:
from collections import deque
def __init__(self, v):
self.v = v
self._tree = list(range(v + 1))
def _root(self, a):
queue = self.deque()
while self._tree[a] != a:
queue.append(a)
a = self._tree[a]
while queue:
index = queue.popleft()
self._tree[index] = a
return a
def union(self, a, b):
root_a = self._root(a)
root_b = self._root(b)
self._tree[root_b] = root_a
def find(self, a, b):
return self._root(a) == self._root(b)
N, M, K = map(int, input().split(' '))
n_friends = Counter()
n_groups = Counter()
uf = UnionFind(N)
for _ in range(M):
a, b = map(int, input().split(' '))
a -= 1
b -= 1
uf.union(a, b)
n_friends[a] -= 1
n_friends[b] -= 1
for _ in range(K):
c, d = map(int, input().split(' '))
c -= 1
d -= 1
if uf.find(c, d):
n_friends[c] -= 1
n_friends[d] -= 1
for n in range(N):
n_groups[uf._root(n)] += 1
print(*[n_friends[n] + n_groups[uf._root(n)] - 1 for n in range(N)])
|
s = input()
n = len(s) // 2
j = -1
t = 0
for i in range(n):
if s[i] != s[j]:
t += 1
j -= 1
print(t)
| 0 | null | 90,757,452,564,452 | 209 | 261 |
import sys, math
for line in sys.stdin:
print int(math.log10(sum(map(int, line.split())))) + 1
|
import sys
from math import log10
for line in sys.stdin:
a, b = map(int, line.split())
digitNumber = int(log10((a + b))) + 1
print(digitNumber)
| 1 | 92,253,662 | null | 3 | 3 |
a = int(input())
ans = a + (a ** 2) + (a ** 3)
print(ans)
|
numz = input()
count = 0
numz_pair = numz.split(" ")
numz_pair = list(map(int, numz_pair))
for i in range(len(numz_pair)):
if numz_pair[i] <= 9:
count = count + 1
else:
print(-1)
break
if count == len(numz_pair):
print(numz_pair[0]*numz_pair[1])
| 0 | null | 83,845,031,152,630 | 115 | 286 |
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
s = input()
l = [ 'SUN','MON','TUE','WED','THU','FRI','SAT']
print(7 - l.index(s))
|
L, R = input().split()
huga = list(map(int, input().split()))
i=0
gou=0
huga.sort()
for a in range(int(R)):
gou=gou+huga[i]
i+=1
print(gou)
| 0 | null | 72,632,029,037,600 | 270 | 120 |
N,P = map(int,input().split())
S = input()
def solve(S,N,P):
if P == 2:
ans = 0
for i in range(N):
if int(S[i])%P == 0:
ans += i+1
return ans
if P == 5:
ans = 0
for i in range(N):
if int(S[i])%P == 0:
ans += i+1
return ans
S = S[::-1]
mod_list = [0]*P
mod_list[0] = 1
mod = P
tmp = 0
for i in range(N):
tmp = (tmp + int(S[i])*pow(10,i,mod))%mod
mod_list[tmp] += 1
ans = 0
for i in mod_list:
ans += i*(i-1)//2
return ans
print(solve(S,N,P))
|
N = int(input())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N % 2 == 1:
A_median = A[N // 2]
B_median = B[N // 2]
print(B_median - A_median + 1)
else:
A_median2 = A[(N - 1) // 2] + A[N // 2]
B_median2 = B[(N - 1) // 2] + B[N // 2]
print(B_median2 - A_median2 + 1)
| 0 | null | 37,648,010,761,504 | 205 | 137 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
n, k, *a = map(int, read().split())
cur_town = 0
tran_time = defaultdict(int)
cnt = 0
while True:
if k == 0:
print(cur_town + 1)
sys.exit()
if cur_town in tran_time:
break
else:
tran_time[cur_town] = cnt
cur_town = a[cur_town] - 1
cnt += 1
k -= 1
k2 = k % (cnt - tran_time[cur_town])
while k2 > 0:
k2 -= 1
cur_town = a[cur_town] - 1
print(cur_town + 1)
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
a = list(map(int, input().split()))
# See:
# https://www.youtube.com/watch?v=ENSOy8u9K9I&feature=youtu.be
# KeyInsight:
# 移動: 周期的ではない + 周期的に繰り返すの合計
# 実装上のポイント
# 経路と順番を別々に管理する
path = list()
order = [-1 for _ in range(n + 1)] # -1: 到達していない
place = 1
# 到達していない点がある限り、ループを繰り返す
# = 同じ点を2回通るまで繰り返す
while order[place] == -1:
order[place] = len(path) # ある場所を通った順番を管理
path.append(place) # 経路を更新
place = a[place - 1] # 次の行き先
# 周期: 同じ点を2回通るまでに要した移動回数 - 周期に入るまでの移動回数
cycle = len(path) - order[place]
before_cycle_count = order[place]
if (k < before_cycle_count):
print(path[k])
else:
k -= before_cycle_count
k %= cycle # 周期: 途中の繰り返し部分を省いて、途中の部分だけ計算するようにする
print(path[before_cycle_count + k])
if __name__ == '__main__':
main()
| 1 | 22,829,885,153,608 | null | 150 | 150 |
N = int(input())
A = list(map(int, input().split()))
S = sum(A)
ans = float("INF")
LS = [0]*(N+1)
LS[0] = 0
for i in range(N-1):
LS[i+1] = A[i] + LS[i]
ans = min(ans, abs(LS[i+1] - (S - LS[i+1])))
print(ans)
|
import sys,collections
input = sys.stdin.readline
N=input().rstrip()
A=list(map(int,input().split()))
Ac = collections.Counter(A)
Q = int(input())
for i in range(Q):
B,C = list(map(int,input().split()))
nb = Ac[B]
Ac[C] += Ac[B]
Ac[B] = 0
if i==0:
ans = 0
for key,val in Ac.items():
ans += key*val
else:
ans +=nb*C - nb*B
print(ans)
| 0 | null | 76,989,784,893,924 | 276 | 122 |
# -*- coding: utf-8 -*-
import sys
from sys import stdin
import math
n, k = map(int, stdin.readline().split())
w = list([int(stdin.readline().rstrip()) for i in range(n)])
def main2():
def is_ok():
cnt_track = w_tmp = 0
for w_i in w:
w_tmp += w_i
if w_tmp > m:
w_tmp = w_i
cnt_track += 1
if cnt_track >= k:
return 0
return 1
r = sum(w)
l = max(math.ceil(r/k),max(w))
while l < r:
m = (l + r) // 2
# print("%d %d %d " % (l, r, m))
if is_ok():
r = m
else:
l = m + 1
print(r)
if __name__ == '__main__':
main2()
|
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()
| 1 | 86,821,069,302 | null | 24 | 24 |
n,a,b=map(int,input().split())
i=n%(a+b)
if i>a:
print(a*(n//(a+b))+a)
else:
print(a*(n//(a+b))+i)
|
MOD = 998244353
factorial = None
inverse_factorial = None
def modpow(a, p):
ans = 1
while p:
if p&1 == 1:
ans = (ans*a)%MOD
a = (a*a)%MOD
p >>= 1
return ans
def nCr(n, r):
if r == 0 or r == n:
return 1
return (((factorial[n]*inverse_factorial[n-r])%MOD)*inverse_factorial[r])%MOD
def init_nCr(max_n):
global factorial, inverse_factorial
factorial = [1]*(max_n+1)
inverse_factorial = [0]*(max_n+1)
for i in range(1, max_n+1):
factorial[i] = (factorial[i-1]*i)%MOD
inverse_factorial[i] = modpow(factorial[i], MOD-2)
init_nCr(2*10**5+1)
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N, M, K = read_ints()
answer = 0
for k in range(0, K+1):
answer = (answer+M*modpow(M-1, N-1-k)*nCr(N-1, k))%MOD
return answer
if __name__ == '__main__':
print(solve())
| 0 | null | 39,562,579,492,000 | 202 | 151 |
num = input().split()
a = int(num[0])
b = int(num[1])
c = int(num[2])
ans = 0
for i in range(a,b+1):
if c % i == 0:
ans += 1
print(ans)
|
data = input().split()
a = int(data[0])
b = int(data[1])
c = int(data[2])
if a > b or a < 1 or c > 10000:
exit()
cnt = 0
for num in range(a,b+1):
if (c%num) == 0:
cnt += 1
print(cnt)
| 1 | 547,100,270,386 | null | 44 | 44 |
# D - Sum of Divisors
N = int(input())
ans = (1 + N) * N
for i in range(2, N//2 + 1):
j = 2
while True:
if i * j <= N:
ans += i * j
j += 1
else:
break
print(ans - 1)
|
num = list(map(int,input().split()))
sum = 500*num[0]
if num[1] <= sum:
print("Yes")
else:
print("No")
| 0 | null | 54,363,842,088,360 | 118 | 244 |
s = input()
if s == "ABC" :
print("ARC")
elif s == "ARC" :
print("ABC")
|
s = str(input())
if s == 'ABC':
print('ARC')
elif s == 'ARC':
print('ABC')
| 1 | 24,008,619,034,372 | null | 153 | 153 |
w = int(input())
h = w // 3600
m = (w % 3600) // 60
s = w % 60
print(f"{h}:{m}:{s}")
|
num =raw_input()
num = int(num)
h = num/3600
m = (num-h*3600)/60
s = num-h*3600-m*60
h,m,s = map(str,(h,m,s))
print h+':'+m+':'+s
| 1 | 325,776,664,930 | null | 37 | 37 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
F = list( map(int, input().split()))
A.sort()
F.sort(reverse=True)
la = 10**12+1
sm = -1
while sm+1<la:
mi = (sm+la)//2
y=0
for i in range(N):
y += max(0, A[i]-(mi//F[i]))
if y<=K:
la = mi
else:
sm = mi
print(la)
|
N,K = map(int,input().split())
A = sorted(list(map(int,input().split())))
F = sorted(list(map(int,input().split())),reverse=True)
if K>=sum(A):
ans = 0
else:
low = 0
high = 10**12
while high-low>1:
mid = (high+low)//2
B = A[:]
cnt = 0
for i in range(N):
if B[i]*F[i]>mid:
cnt += (B[i]-mid//F[i])
if cnt<=K:
high = mid
else:
low = mid
ans = high
print(ans)
| 1 | 165,291,035,727,120 | null | 290 | 290 |
MOD = 10**9 + 7
N, K = map(int, input().split())
A = sorted([int(i) for i in input().split()])
B = []
plus, zero, minus = 0, 0, 0
for i in range(N):
if A[i] >= 0:
B.append((A[i], 1))
plus += 1
elif A[i] == 0:
B.append((0, 0))
zero += 1
else:
B.append((-A[i], -1))
minus += 1
if plus >= K-(min(K, minus)//2*2):
B = sorted(B, key=lambda x: x[0], reverse=True)
c = 1
for i in range(K):
c *= B[i][1]
if c == 1:
ans = 1
for i in range(K):
ans *= B[i][0]
ans %= MOD
else:
ap, an = 1, 1
skip = []
for i in range(K-1, -1, -1):
if B[i][1] == 1:
ap *= B[i][0]
skip.append(i)
break
else:
skip.append(K-1)
an = 0
for i in range(K-1, -1, -1):
if B[i][1] == -1:
an *= B[i][0]
skip.append(i)
break
else:
skip.append(K-1)
ap = 0
for i in range(K, N):
if B[i][1] == 1:
ap *= B[i][0]
break
for i in range(K, N):
if B[i][1] == -1:
an *= B[i][0]
break
a = max(ap, an)
ans = 1
for i in range(K):
if i not in skip:
ans *= B[i][0]
ans %= MOD
ans *= a
ans %= MOD
elif zero >= K-(min(K, minus)//2*2):
print(0)
exit()
else:
B = sorted(B, key=lambda x: x[0], reverse=False)
ans = 1
for i in range(K):
ans *= B[i][0]*B[i][1]
ans %= MOD
print(ans)
|
l, r, d = map(int, input().split())
print(r//d-l//d+int(l%d==0 and r%d==0))
| 0 | null | 8,515,467,574,390 | 112 | 104 |
flg = len(set(input())) == 2
print('Yes' if flg else 'No')
|
a,b,c=map(int,input().split());print('YNeos'[a/b>c::2])
| 0 | null | 29,236,182,575,236 | 201 | 81 |
K = int(input())
[A, B] = [int(i) for i in input().split()]
for num in range(A, B+1):
if num % K == 0:
print("OK")
exit()
print("NG")
|
n, k =map(int, input().split())
for i in range(100):
if n//(k**i) == 0:
if n%(k**i)>=1:
print(i)
break
else:
print(i-1)
break
| 0 | null | 45,700,277,723,100 | 158 | 212 |
import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
def get_primenumber(number): # エラトステネスの篩
prime_list = []
search_list = list(range(2, number + 1))
# search_listの先頭の値が√nの値を超えたら終了
while search_list[0] <= math.sqrt(number):
# search_listの先頭の値が√nの値を超えたら終了
# search_listの先頭をprime_listに入れて、先頭をリストに追加して削除
head_num = search_list.pop(0)
prime_list.append(head_num)
# head_numの倍数を除去
search_list = [num for num in search_list if num % head_num != 0]
# prime_listにsearch_listを結合
prime_list.extend(search_list)
return prime_list
def prime_factor_table(n):
table = [0] * (n + 1)
for i in range(2, n + 1):
if table[i] == 0:
for j in range(i + i, n + 1, i):
table[j] = i
return table
def prime_factor(n, prime_factor_table):
prime_count = collections.Counter()
while prime_factor_table[n] != 0:
prime_count[prime_factor_table[n]] += 1
n //= prime_factor_table[n]
prime_count[n] += 1
return prime_count
table = prime_factor_table(10**6+10)
numset = set()
for i in A:
thedic = prime_factor(i, table)
for l in thedic.keys():
flag = True
if l in numset and l != 1:
flag = False
break
if flag:
tmpset = set(thedic.keys())
numset |= tmpset
else:
break
if flag:
print('pairwise coprime')
sys.exit()
else:
flag = True
theset = set(prime_factor(A[0], table).keys())
for i in A[1:]:
thedic = prime_factor(i, table)
theset = theset & set(thedic.keys())
if len(theset) == 0:
print('setwise coprime')
flag = False
break
if flag:
print('not coprime')
if __name__ == '__main__':
solve()
|
def main():
N, X, Y = (int(i) for i in input().split())
cnt = [0]*N
for i in range(1, N+1):
for j in range(i+1, N+1):
d = min(abs(i-j), abs(i-X)+1+abs(j-Y), abs(i-X)+abs(X-Y)+abs(j-Y))
cnt[d] += 1
for d in cnt[1:]:
print(d)
if __name__ == '__main__':
main()
| 0 | null | 24,244,312,660,400 | 85 | 187 |
x=int(input())
if x==2:
print(2)
else:
while True:
cnt=0
if x%2==0:
x+=1
continue
for i in range(2,x):
if x%i==0:
cnt=1
continue
if cnt==1:
x+=1
else:
print(x)
break
|
while 1:
c=list(raw_input())
o=""
if c[0]=="-" and len(c)==1:
break
m=int(raw_input())
for i in range(m):
h=int(raw_input())
c=list(c[h:]+c[:h])
for i in range(len(c)):
o+=c[i]
print o
| 0 | null | 53,925,940,093,792 | 250 | 66 |
from collections import defaultdict
from collections import deque
n,m,k = map(int,input().split())
f_set = {tuple(map(int,input().split())) for _ in range(m)}
b_set = {tuple(map(int,input().split())) for _ in range(k)}
friends_counts = {key:[] for key in range(1,n+1)}
blocks_counts = {key:[] for key in range(1,n+1)}
for f in f_set:
friends_counts[f[0]].append(f[1])
friends_counts[f[1]].append(f[0])
for b in b_set:
blocks_counts[b[0]].append(b[1])
blocks_counts[b[1]].append(b[0])
friends_groups_list = [set() for _ in range(n+1)]
#dfs
que = deque()
groups_count = 0
checked_dict = {key:0 for key in range(1,n+1)}
#que.appendleft(1)
for i in range(1,n+1):
if checked_dict[i] == 1:
continue
que.appendleft(i)
checked_dict[i] = 1
while que:
x = que.popleft()
friends_groups_list[groups_count].add(x)
for i in range(len(friends_counts[x])):
if checked_dict[friends_counts[x][i]] == 0:
que.appendleft(friends_counts[x][i])
checked_dict[friends_counts[x][i]] = 1
groups_count += 1
result_list=[0]*n
#print(blocks_counts)
#print(friends_groups_list)
for i in range(len(friends_groups_list)):
mini_set = friends_groups_list[i]
for ms in mini_set:
result_list[ms-1] = len(mini_set) - 1 - len(friends_counts[ms])
block_counter_in_minilist = 0
for k in blocks_counts[ms]:
if k in mini_set:
block_counter_in_minilist += 1
result_list[ms-1] -= block_counter_in_minilist
print(" ".join(map(str,result_list)))
#cの配列の解釈が違ったらしい。。。
#f_set = {tuple(map(int,input().split())) for _ in range(m)}
#
#b_set = {tuple(map(int,input().split())) for _ in range(k)}
#
#c_list = [0] * (n-1)
#
#result_dict = {key:0 for key in range(1,n+1)}
#
#for f in f_set:
# if abs(f[0]-f[1]) == 1:
# c_list[min(f[0],f[1]) - 1] = 1
# #ここでelseで飛び石での友達のsetを作ってもよいが、そもそもsetなのでinでの探索にそんなに時間かからないし、いったんこのままやってみる。
#
#for start in range(0,n-2):
# if c_list[start] == 0:
# #c[start]が1になるまで飛ばす
# continue
#
# for end in range(start+1,n-1):
# if c_list[end] == 0:
# #友人同士ではないペアまできたらstartをインクリメント
# break
#
# #もし「友人候補」の候補者が、「友人関係でない」かつ「ブロック関係でない」ことをチェックしている。
# if not (start+1,end+2) in f_set and not (end+2,start+1) in f_set and not (start+1,end+2) in b_set and not (end+2,start+1) in b_set:
# result_dict[start+1] += 1
# result_dict[end+2] += 1
#
#for i in range(1,n+1):
# print(result_dict[i])
#
#print(c_list)
|
from collections import deque
K = int(input())
queue = deque([9, 8, 7, 6, 5, 4, 3, 2, 1])
count = 0
while queue:
number = queue.pop()
count += 1
if count == K:
print(number)
break
last_number = int(str(number)[-1])
add_center = number * 10 + last_number
if last_number > 0:
queue.appendleft(add_center - 1)
queue.appendleft(add_center)
if last_number < 9:
queue.appendleft(add_center + 1)
| 0 | null | 51,056,916,823,338 | 209 | 181 |
H,W = (int(x) for x in input().split())
lines = [input() for i in range(H)]
dp = [[0] * W for _ in range(H)]
if lines[0][0] == "#":
dp[0][0] = 1
q = r = dp[0][0]
for i in range(H):
for j in range(W):
if i == j == 0: continue
if j > 0:
q = dp[i][j-1]
if lines[i][j] == "#" and lines[i][j-1] == ".":
q = dp[i][j-1] + 1
if i > 0:
r = dp[i-1][j]
if lines[i][j] == "#" and lines[i-1][j] == ".":
r = dp[i-1][j] + 1
if j == 0:
dp[i][j] = r
elif i == 0:
dp[i][j] = q
else:
dp[i][j] = min(q,r)
print(dp[H-1][W-1])
|
N=int(input())
for i in range(10):
for j in range(10):
if N==i*j:
print('Yes')
exit()
print('No')
| 0 | null | 104,304,115,342,020 | 194 | 287 |
n = int(input())
a = [i for i in range(1,n+1) if (i%3==0 or "3" in list(str(i)))]
print(" ",end="")
print(*a,sep=" ")
|
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, T, AB):
dpL = [[0] * (T + 1) for _ in range(N + 2)]
for i in range(1, N + 1):
a, b = AB[i - 1]
for t in range(T):
dpL[i][t] = dpL[i - 1][t]
if t >= a:
dpL[i][t] = max(dpL[i][t], dpL[i - 1][t - a] + b)
dpR = [[0] * (T + 1) for _ in range(N + 2)]
for i in range(N, 0, -1):
a, b = AB[i - 1]
for t in range(T):
dpR[i][t] = dpR[i + 1][t]
if t >= a:
dpR[i][t] = max(dpR[i][t], dpR[i + 1][t - a] + b)
ans = 0
for i in range(1, N + 1):
a, b = AB[i - 1]
for t in range(T):
ans = max(ans, dpL[i - 1][t] + dpR[i + 1][T - 1 - t] + b)
print(ans)
if __name__ == '__main__':
input = sys.stdin.readline
N, T = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
main(N, T, AB)
| 0 | null | 75,976,684,598,948 | 52 | 282 |
N = int(input())
c = list(input())
ans = 0
left = 0
right = N-1
while left < right:
if c[left] != c[right]:
if c[left] == 'W' and c[right] == 'R':
ans += 1
left += 1
right -=1
if c[left] == 'R' and c[right] == 'R':
left += 1
if c[left] == 'W' and c[right] == 'W':
right -=1
print(ans)
|
S, T = input().split()
A, B = (int(x) for x in input().split())
U = input()
if S == U or T == U:
print(A - int(S==U), B - int(T==U))
| 0 | null | 39,256,100,740,750 | 98 | 220 |
import random
S = input()
rand = random.randrange(0, len(S) - 2)
print(S[rand] + S[rand + 1] + S[rand + 2])
|
s = str(input())
print(s[0:3])
| 1 | 14,758,100,474,448 | null | 130 | 130 |
x,y=map(int,input().split())
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 = 10**9+7
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 )
if (-x+2*y)%3!=0:
ans=0
else:
a=(-x+2*y)//3
b=(2*x-y)//3
ans=cmb(a+b,a,mod)
print(ans)
|
MOD = 1000000007
def mod_inv(mod, a):
old_t, t = 0, 1
old_r, r = mod, a
while r != 0:
quotient = old_r // r
old_r, r = r, old_r - quotient * r
old_t, t = t, old_t - quotient * t
return old_t % mod
def combine(n, k, mod):
if k > n // 2:
k = n - k
u = 1
for i in range(n - k + 1, n + 1):
u = u * i % mod
v = 1
for i in range(1, k + 1):
v = v * i % mod
return u * mod_inv(mod, v) % MOD
def main():
X, Y = map(int, input().split())
m1 = X + Y
if m1 % 3 == 0:
m = m1 // 3
if X < m or Y < m:
print(0)
else:
print(combine(m, X - m, MOD))
else:
print(0)
if __name__ == '__main__':
main()
| 1 | 150,661,175,335,690 | null | 281 | 281 |
import sys
def input():
return sys.stdin.readline()[:-1]
n, p = map(int, input().split())
snacks = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: x[0])
dp = [0 for _ in range(p)]
ans = snacks[0][1]
for i in range(1, n):
x, y = snacks[i-1]
z = snacks[i][1]
for j in range(p-1, 0, -1):
if j >= x:
dp[j] = max(dp[j], dp[j-x]+y)
ans = max(ans, dp[j]+z)
print(ans)
|
from collections import Counter
N = int(input())
X = list(map(int, input().split()))
ctr = Counter(X)
ans = 0
for v in ctr.values():
ans += v * (v - 1) // 2
for i in range(N):
val = ctr[X[i]]
print(ans - val * (val - 1) // 2 + (val - 1) * (val - 2) // 2)
| 0 | null | 99,675,067,231,010 | 282 | 192 |
# -*- coding utf-8 -*-
MOD = 10 ** 9 + 7
r = int(input())
ans = r * r
print(ans)
|
import sys
sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()
r = int(input())
print(r ** 2)
| 1 | 144,882,623,150,646 | null | 278 | 278 |
X, N = list(map(int, input().split()))
p = set(map(int, input().split()))
dist = 0
if N == 0:
print(X)
dist_max = -2
else:
dist_max = max(abs(max(p) - X), abs(min(p) - X))
while dist <= dist_max+1:
if (X - dist in p) and (X + dist in p):
dist += 1
continue
if not (X - dist in p):
print(X - dist)
break
elif not (X + dist in p):
print(X + dist)
break
|
from math import gcd
n = int(input())
ab = [map(int, input().split()) for _ in range(n)]
mod = 1000000007
pair = []
d = {}
d[0] = {}
d[0][0] = 0
for a, b in ab:
x = gcd(a, b)
if x != 0:
a //= x
b //= x
pair.append((a, b))
d.setdefault(a, {})
d[a].setdefault(b, 0)
d[a][b] += 1
used = set()
ans = 1
for a, b in pair:
if (a, b) in used:
continue
used.add((a, b))
if a == 0 and b == 0:
continue
i = d[a][b]
j, k, l = 0, 0, 0
if -a in d and -b in d[-a]:
j = d[-a][-b]
used.add((-a, -b))
if -b in d and a in d[-b]:
k = d[-b][a]
used.add((-b, a))
if b in d and -a in d[b]:
l = d[b][-a]
used.add((b, -a))
ans *= pow(2, i+j, mod) + pow(2, k+l, mod) - 1
ans %= mod
ans += d[0][0] - 1
ans %= mod
print(ans)
| 0 | null | 17,632,958,338,820 | 128 | 146 |
h,n=map(int,input().split())
inf=100000000000
dp=[inf]*(h+1)
dp[h]=0
for i in range(n):
a,b=map(int,input().split())
for j in range(h,-1,-1):
dp[max(j-a,0)]=min(dp[max(j-a,0)],dp[j]+b)
print(dp[0])
|
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
x = 1
ans = 0
for i in range(60):
ones = 0
zeros = 0
for a in A:
if a & (1 << i) > 0:
ones += 1
else:
zeros += 1
ans += (ones * zeros * x) % MOD
x *= 2
print(ans % MOD)
| 0 | null | 102,457,747,142,608 | 229 | 263 |
def mod_pow(a, n):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
n = int(input())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
cnt = [0] * 60
for v in a:
for i in range(60):
if (v >> i) & 1:
cnt[i] += 1
pow_2 = [1]
for i in range(60):
pow_2.append(pow_2[-1] * 2 % mod)
res = 0
for v in a:
for i in range(60):
if (v >> i) & 1:
res = (res + (n - cnt[i]) * pow_2[i] % mod) % mod
else:
res = (res + cnt[i] * pow_2[i] % mod) % mod
print(res * mod_pow(2, mod - 2) % mod)
|
from sys import stdin
input = stdin.readline
def check(min_, max_, x):
if x < min_:
return 0
else:
return int((min(max_, x) - min_)/10) + 1
def main():
N = int(input())
if len(str(N)) == 1:
print(N)
return
sum_ = 0
for l in range(1, 10):
for r in range(l, 10):
temp = sum_
min_ = int(str(l) + '0'*(len(str(N))-2) + str(r))
max_ = int(str(l) + '9'*(len(str(N))-2) + str(r))
A = check(min_, max_, N)
# max_ = int(str(l) + '9'*(len(str(N))-3) + str(r))
for gap in range(len(str(N))-2):
A += (10**gap)
min_ = int(str(r) + '0'*(len(str(N))-2) + str(l))
max_ = int(str(r) + '9'*(len(str(N))-2) + str(l))
B = check(min_, max_, N)
for gap in range(len(str(N))-2):
B += (10**gap)
if l == r:
A += 1
B += 1
sum_ += A*B
else:
sum_ += 2*A*B
# print(l, r, sum_ - temp)
print(sum_)
if(__name__ == '__main__'):
main()
| 0 | null | 104,838,266,199,400 | 263 | 234 |
from math import gcd
n = int(input())
ab = [list(map(int, input().split())) for _ in range(n)]
mod = 1000000007
#%%
kai = [1]*(n+1)
gyaku = [1]*(n+1)
for i in range(2, n+1):
kai[i] = kai[i-1]*i % mod
gyaku[i] = gyaku[i-1]*pow(i, mod-2, mod) %mod
azero = 0
bzero = 0
zerozero = 0
dict_patterns = {}
dict_patterns_minus = {}
all_effective = 0
answer = 0
dict_patterns["1,0"] = 0
dict_patterns["0,-1"] = 0
for i in range(n):
minus = False
a, b = ab[i]
if a == 0 and b == 0:
zerozero += 1
continue
elif b == 0:
dict_patterns["1,0"] += 1
continue
elif a == 0:
dict_patterns["0,-1"] += 1
continue
common = gcd(a,b)
a = a//common
b = b//common
#%%
if a < 0 and b < 0:
a = -a
b = -b
elif a < 0:
a = -a
b = -b
to_str = str(a)+","+str(b)
if to_str not in dict_patterns:
dict_patterns[to_str] = 1
else:
dict_patterns[to_str] += 1
keys = list(dict_patterns.keys())
patterns = []
test = []
for i in range(len(keys)):
pattern_A = dict_patterns[keys[i]]
dict_patterns[keys[i]] = 0
pattern_B = 0
a, b = map(int, keys[i].split(","))
if str(b)+","+str(-a) in dict_patterns:
pattern_B += dict_patterns[str(b)+","+str(-a)]
dict_patterns[str(b)+","+str(-a)] = 0
if str(-b)+","+str(a) in dict_patterns:
pattern_B += dict_patterns[str(-b)+","+str(a)]
dict_patterns[str(-b)+","+str(a)] = 0
if pattern_A != 0 or pattern_B != 0:
patterns.append(max(2**pattern_A-1,0) + max(2**pattern_B-1,0)+1)
test.append([pattern_A, pattern_B])
answer = 1
for i in range(len(patterns)):
answer = answer*patterns[i] % mod
print((answer-1+zerozero)%mod)
|
Rad=int(input())
print(Rad**2)
| 0 | null | 82,795,254,169,628 | 146 | 278 |
N = int(input())
A = [int(i) for i in input().split()]
if N == 0 and A[0] != 1:
print(-1)
exit()
nodes = [0] * (N+1)
nodes[0] = 1
for i in range(1, N+1):
node = (nodes[i-1]-A[i-1])*2
if node < A[i]:
print(-1)
exit()
nodes[i] = node
#print(nodes)
nodes[-1] = A[-1]
for i in range(N-1, -1, -1):
nodes[i] = min(nodes[i], nodes[i+1]+A[i])
#print(nodes)
print(sum(nodes))
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
n=I()
lis=LI()
nleaf=[0 for i in range(n+1)]
nleaf[0]=1-lis[0]
if nleaf[0]<0:
print(-1)
sys.exit()
for i in range(n):
nleaf[i+1]=nleaf[i]*2-lis[i+1]
if nleaf[i+1]<0:
print(-1)
sys.exit()
#print(lis)
#print(nleaf)
u=list(reversed(lis))
sup=[0 for i in range(n+1)]
for i in range(n):
sup[i+1]=min(sup[i]+u[i],nleaf[n-i-1])
#print(sup[i]+u[i],nleaf[n-i-1])
#print(min(sup[i]+u[i],nleaf[n-i-1]))
#print(sup)
print(sum(lis)+sum(sup))
| 1 | 18,877,561,430,160 | null | 141 | 141 |
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
N,A,B = MI()
q = N // (A+B)
r = N % (A+B)
print(q*A+min(r,A))
|
c = 0
def merge(A, l, m, r):
global c
L = A[l:m]
L.append(1e10)
R = A[m:r]
R.append(1e10)
i, j = 0, 0
for k in range(l, r):
c += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
def sort(A, l, r):
if r-l > 1:
m = (l+r)//2
sort(A, l, m)
sort(A, m, r)
merge(A, l, m, r)
N = int(input())
A = list(map(int, input().split()))
sort(A, 0, N)
print(" ".join(map(str, A)))
print(c)
| 0 | null | 28,036,952,936,850 | 202 | 26 |
H,W = map(int, input().split())
L = []
while H != 0 or W != 0:
L.append([H, W])
H,W = map(int, input().split())
def draw(H,W):
if W == 1:
for i in range(H // 2):
print("#")
print(".")
if H % 2 == 1:
print("#")
print("")
elif W % 2 == 1:
for i in range(H // 2):
print("#." * (W // 2) +"#")
print(".#" * (W // 2) + ".")
if H % 2 == 1:
print("#." * (W // 2) +"#")
print("")
else:
for i in range(H // 2):
print("#." * (W // 2))
print(".#" * (W // 2))
if H % 2 == 1:
print("#." * (W // 2))
print("")
for (H, W) in L:
draw(H,W)
|
def print_chessboard(h, w):
"""
h: int
w: int
outputs chessboard using '#' and '.'
>>> print_chessboard(3, 4)
#.#.
.#.#
#.#.
>>> print_chessboard(5, 6)
#.#.#.
.#.#.#
#.#.#.
.#.#.#
#.#.#.
>>> print_chessboard(2, 2)
#.
.#
"""
for i in range(h):
line = ''
for j in range(w):
if (i+j) % 2 == 0:
line += '#'
else:
line += '.'
print(line)
if __name__ == '__main__':
while True:
(h, w) = [int(i) for i in input().split(' ')]
if h == 0 and w == 0:
break
print_chessboard(h, w)
print()
| 1 | 857,842,155,910 | null | 51 | 51 |
N = str(input())
K = int(input())
dp = [[[0]*2 for _ in range(K+1)] for _ in range(len(N)+1)]
dp[0][0][0] = 1
for i in range(len(N)):
n = int(N[i])
for j in range(K+1):
for k in range(2): # smaller(未満なら1)
for l in range(10):
nj, nk = j, 0
if k == 0 and l == n:
nk = 0
elif k == 0 and l < n:
nk = 1
elif k == 0 and l > n:
continue
if k == 1:
nk = 1
if l != 0:
if j < K:
nj += 1
else:
continue
dp[i+1][nj][nk] += dp[i][j][k]
print(dp[-1][K][0] + dp[-1][K][1])
|
#coding:utf-8
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
input = lambda: given().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(input())
XLMIIS = lambda x: [LMIIS() for _ in range(x)]
YN = lambda c : print('Yes') if c else print('No')
MOD = 10**9+7
list_N = list(map(int,list(input())))
len_N = len(list_N)
list_N = [0] + list_N
K = II()
dp0 = []
dp1 = []
for i in range(len_N+1):
dp0.append([0]*(K+1))
dp1.append([0]*(K+1))
for i in range(1,len_N+1):
dp0[i][0] = 1
dp0[1][1] = max(list_N[1]-1,0)
dp1[1][1] = 1
for i in range(2,len_N+1):
dp1[i][0] = dp1[i-1][0]
for j in range(1,K+1):
num = list_N[i]
if num > 0:
dp0[i][j] = dp0[i-1][j-1] * 9 + dp0[i-1][j] + dp1[i-1][j-1] * (num-1) + dp1[i-1][j]
dp1[i][j] = dp1[i-1][j-1]
else:
dp0[i][j] = dp0[i-1][j-1] * 9 + dp0[i-1][j]
dp1[i][j] = dp1[i-1][j]
print(dp0[len_N][K]+dp1[len_N][K])
dbg(dp0[len_N][K],dp1[len_N][K])
if __name__ == '__main__':
main()
| 1 | 76,269,913,443,178 | null | 224 | 224 |
import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
D = int(input())
c = [0] + list(map(int, input().split()))
s = [[0]*27]
t = [0]
satisfy = 0
last = [0] * 27
for _ in range(D):
s.append([0] + list(map(int, input().split())))
for _ in range(D):
t += [int(input())]
for i in range(1, D+1):
decrease = 0
last[t[i]] = i
for j in range(1, 27):
decrease += (c[j] * (i - last[j]))
satisfy += (s[i][t[i]] - decrease)
print(satisfy)
if __name__ == '__main__':
main()
|
d = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(d)]
t = [int(input()) for i in range(d)]
ans = 0
l = [0 for i in range(26)]
for i in range(d):
ans += s[i][t[i] - 1]
l = list(map(lambda x:x+1, l))
l[t[i] - 1] = 0
for j in range(26):
ans -= c[j] * l[j]
print(ans)
| 1 | 9,876,384,227,890 | null | 114 | 114 |
s = int(input())
h = s // 3600
m = s % 3600 // 60
s = s % 60
print(f'{h}:{m}:{s}')
|
import math
a, b, h, m = map(int, input().split())
min = h * 60 + m
short = 0.5 * min
long = 6 * m
if abs(short - long) >= 180:
deg = 360 - abs(short - long)
else:
deg = abs(short - long)
coss = math.cos(math.radians(deg))
c = (a ** 2 + b ** 2 - 2 * a * b * coss) ** 0.5
#print(c)
print('{:.20f}'.format(c))
| 0 | null | 10,166,948,059,260 | 37 | 144 |
codePlace, implePlace = map(int, input().split(" "))
priceDict = {
1:300000,
2:200000,
3:100000
}
totalPrice = priceDict[codePlace] if codePlace in priceDict.keys() else 0
totalPrice += priceDict[implePlace] if implePlace in priceDict.keys() else 0
totalPrice += 400000 if codePlace == 1 and implePlace == 1 else 0
print(totalPrice)
|
#!/usr/bin/env python3
x, y = map(int, input().split())
ans = (x == y == 1) * 400000
ans += 100000 * max(0, 4 - x)
ans += 100000 * max(0, 4 - y)
print(ans)
| 1 | 141,156,261,420,448 | null | 275 | 275 |
n,m=map(int,input().split())
a=list(map(int,input().split()))
cnt=0
a.sort(reverse=True)
ALL=0
for i in a:
ALL+=i
for i in range(m):
if a[i]>=ALL/(4*m):
cnt+=1
if cnt==m:
print("Yes")
else:
print("No")
break
|
N,M = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort(reverse=True)
if a[M-1]<sum(a)/(4*M):
print("No")
else:
print("Yes")
| 1 | 38,644,525,701,920 | null | 179 | 179 |
"RPN using stack for AOJ ALDS1_3_A: Stack"
# coding: utf-8
def rpn(exp):
"""
rpn calculation
>>> rpn(['1', '2', '+', '3', '4', '-', '*'])
-3
"""
stack = []
for elem in exp:
if elem == '+':
stack.append(int(stack.pop()) + int(stack.pop()))
elif elem == '-':
stack.append(-int(stack.pop()) + int(stack.pop()))
elif elem == '*':
stack.append(int(stack.pop()) * int(stack.pop()))
elif elem == '/':
stack.append(int(stack.pop()) / int(stack.pop()))
else:
stack.append(elem)
print(stack.pop())
def main():
"main function"
exp = list(input().split(' '))
rpn(exp)
if __name__ == '__main__':
# import doctest
# doctest.testmod()
main()
|
N = int(input())
A = sorted(list(map(int,input().split())))
ans = "YES"
for i in range(1,N,2):
boollist = [ A[i-1] == A[i] ]
if i < N-1 :
boollist.append(A[i] == A[i+1])
if any(boollist):
ans = "NO"
break
print(ans)
| 0 | null | 36,773,571,567,498 | 18 | 222 |
import bisect
a, b, k = [int(i) for i in input().split()]
print(max(a-k,0), max(0,min(b,a+b-k)))
|
n, m = map(int, raw_input().split())
l = map(int, raw_input().split())
INF = 1<<31
dp = [INF]*(n+1)
dp[0] = 0
for c in l:
for i in range(n-c+1):
if dp[i] != INF:
dp[i + c] = min(dp[i] + 1, dp[i + c])
print dp[n]
| 0 | null | 52,217,064,609,710 | 249 | 28 |
S=input()
S+=input()
print(*[a for a in '123' if a not in S])
|
s = input()
q = int(input())
for i in range(q):
inp = input().split()
com = inp[0]
a = int(inp[1])
b = int(inp[2])+1
if com =="print":
print(s[a:b])
elif com =="reverse":
s_rev = s[a:b]
s = s[:a] + s_rev[::-1] + s[b:]
elif com =="replace":
s = s[:a] + inp[3] + s[b:]
| 0 | null | 56,716,778,927,816 | 254 | 68 |
L, R, d = map(int, input().split())
print(R // d - L // d + (L % d == 0))
|
# -*- coding: utf-8 -*-
modelmap = list(input())
S1 = []
S2 = []
A = 0
for i, l in enumerate(modelmap):
if l == "\\":
S1.append(i)
elif l == "/" and len(S1) > 0:
ip = S1.pop()
A += i - ip
L = i - ip
while len(S2) > 0 and S2[-1][0] > ip:
L += S2.pop()[1]
S2.append([ip, L])
print(A)
text2 = "{}".format(len(S2))
for s in S2:
text2 += " " + str(s[1])
print(text2)
| 0 | null | 3,815,036,299,990 | 104 | 21 |
s = list(input())
t = list(input())
lt = len(t)
ans = lt
for i in range(len(s) - lt + 1):
s_ = s[i: i + lt]
diff = 0
for x, y in zip(s_, t):
if x != y:
diff += 1
ans = min(ans, diff)
print(ans)
|
def count(s1, s2):
dst = 0
for c1, c2 in zip(s1, s2):
if c1 != c2: dst+=1
return dst
def execute(S, T):
dst = len(T)
for i in range(len(S) - len(T)+1):
s = S[i:i+len(T)]
c = count(s, T)
if c < dst:
dst = c
return dst
if __name__ == '__main__':
S = input()
T = input()
print(execute(S, T))
| 1 | 3,688,272,414,692 | null | 82 | 82 |
n, m = map(int, input().split())
def check_ans(list_pairs):
dict_people = {i: i for i in range(1, n+1)}
for i in range(n):
for k in range(m):
val1 = dict_people[list_pairs[k][0]]
val2 = dict_people[list_pairs[k][1]]
if val1>val2:
print(val2, val1, end=" / ")
else:
print(val1, val2, end=" / ")
print("")
for j in range(1, n+1):
dict_people[j] = (dict_people[j]+1)%n
if dict_people[j] == 0: dict_people[j] = n
ans = list()
if n%2 == 1:
for i in range(m):
node1 = (1-i)%n
if node1 == 0: node1 = n
node2 = 2+i
ans.append((node1, node2))
else:
distance = -1
node2 = 1
for i in range(m):
node1 = (1-i)%n
if node1 == 0: node1 = n
node2 = node2+1
distance += 2
if distance == n//2 or distance == n//2 + 1:
node2 += 1
ans.append((node1, node2))
[print(str(values[0])+" "+str(values[1])) for values in ans]
# check_ans(ans)
|
n, m = map(int, input().split())
if n % 2 or m < n//4:
for i in range(m):
print(i+1, n-i)
else:
for i in range(n//4):
print(i+1, n-i)
for i in range(n//4, m):
print(i+1, n-i-1)
| 1 | 28,749,319,788,322 | null | 162 | 162 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.