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
|
|---|---|---|---|---|---|---|
import sys
import numpy as np
def S(): return sys.stdin.readline().rstrip().split(' ')
def Ss(): return list(S())
def I(): return _I(Ss())
def Is(): return list(I())
def _I(ss): return map(int, ss) if len(ss) > 1 else int(ss[0])
s = S()[0]
t = S()[0]
ans = 0
for i, j in zip([c for c in s], [c for c in t]):
if i != j:
ans += 1
print(ans)
|
a = list(str(input()))
b = list(str(input()))
count=0
for i in range(len(a)):
if a[i] != b[i]:
count +=1
print(count)
| 1 | 10,431,125,873,792 | null | 116 | 116 |
x,n =map(int,input().split())
if n ==0:
print(x)
exit()
p =list(map(int,input().split()))
l = []
for i in range(51):
if x-i not in p and x+i not in p:
print(min(x-i,x+i))
exit()
elif x-i not in p and x+i in p:
print(x-i)
exit()
elif x-i in p and x+i not in p:
print(x+i)
exit()
|
import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
leaf = sum(A)
ans = 0
node = 1
for i in range(N+1):
if A[i] > node or leaf == 0:
ans = -1
break
ans += node
leaf -= A[i]
node = min(2*(node-A[i]), leaf)
print(ans)
| 0 | null | 16,522,622,641,248 | 128 | 141 |
t = int(raw_input())
a = raw_input().split()
small = int(a[0])
large = int(a[0])
total = 0
for i in a:
v = int(i)
if v < small:
small = v
if v > large:
large = v
total = total + v
print small,large,total
|
n,d=map(int,input().split())
e=d**2
ans=0
for m in range(n):
a,b=map(int,input().split())
c=a**2+b**2
if c<=e:
ans=ans+1
print(ans)
| 0 | null | 3,328,620,055,332 | 48 | 96 |
[n,k] = map(int, input().split(' '))
A = list(map(int, input().split(' ')))
for i in range(k,n):
if A[i-k]<A[i]:
print('Yes')
else:
print('No')
|
nk=list(map(int, input().split()))
a=list(map(int, input().split()))
n=nk[0]
k=nk[1]
for i in range(n-k):
if(a[i]<a[i+k]):
print("Yes")
else:
print("No")
| 1 | 7,175,111,401,690 | null | 102 | 102 |
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
D = int(input())
C = list(map(int,input().split()))
S = [list(map(int,input().split())) for _ in range (D)]
t = [int(input()) for _ in range(D)]
M = 26
last = [0]*M
score = 0
for i in range(D):
score += S[i][t[i]-1]
last[t[i]-1] = i+1
for m in range(M):
score -= C[m]*(i+1-last[m])
print(score)
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline()
def down_pleasure(c_list, day_num, contest_last_day):
"""その日の満足度低下を返す"""
sum_down_pl = 0
for i in range(26):
sum_down_pl += c_list[i] * (day_num - contest_last_day[i])
return sum_down_pl
def calc_pleasure(s_list, t_list, d, c_list, contest_last_day):
pleasure = 0
for day, t_num in zip(range(d), t_list):
pleasure += s_list[day][t_num-1]
contest_last_day[t_num-1] = day + 1
pleasure -= down_pleasure(c_list, day+1, contest_last_day)
print(pleasure)
return pleasure
def resolve():
d = int(input().rstrip())
c_list = list(map(int, input().split()))
s_list = [list(map(int, input().split())) for i in range(d)]
t_list = []
for i in range(d):
t_list.append(int(input().rstrip()))
contest_last_day = []
for i in range(26):
contest_last_day.append(0)
pleasure = calc_pleasure(s_list, t_list, d, c_list, contest_last_day)
if __name__ == "__main__":
resolve()
| 1 | 9,864,202,427,808 | null | 114 | 114 |
r, c = map(int, input().split())
hyou = []
tate_sum = [0] * (c + 1)
for i in range(r):
line = list(map(int, input().split()))
line.append(sum(line))
tate_sum = [tate_sum[j] + line[j] for j in range(len(line))]
line = map(str, line)
hyou.append(" ".join(line))
tate_sum = map(str, tate_sum)
hyou.append(" ".join(tate_sum))
print("\n".join(hyou))
|
#! -*- coding: utf-8 -*-
import random
import math
s = input()
nums = len(s) - 3
index = math.floor(random.random() * nums)
print(s[index: index + 3])
| 0 | null | 8,102,352,644,822 | 59 | 130 |
n,k = map(int,input().split())
a = [int(i) for i in input().split()]
a.sort()
mod = 10**9+7
fac = [0]*(n+1)
finv = [0]*(n+1)
def comb(n,k):
if n < k: return 0
if n < 0 or k < 0: return 0
return fac[n]*finv[k]%mod*finv[n-k]%mod
fac[0] = finv[0] = 1
for i in range(1,n+1):
fac[i] = fac[i-1]*i%mod
finv[i] = pow(fac[i],mod-2,mod)
smin = 0
smax = 0
for i in range(n):
smin += (a[i]*comb(n-i-1,k-1))%mod
smin %= mod
smax += (a[n-1-i]*comb(n-i-1,k-1))%mod
smax %= mod
ans = (smax-smin)%mod
print(ans)
|
# coding: utf-8
import math
N, K = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
A.sort()
p = 10**9 + 7
facts = [1, 1]
for i in range(2, N+1):
facts.append((facts[i-1] * i) % p)
invs = [1 for i in range(N+1)]
invs[N] = pow(facts[N], p-2, p)
for i in range(N, 1, -1):
invs[i-1] = invs[i] * i % p
sum_max_s = 0
for i in range(K, N+1):
sum_max_s += A[i-1] * (facts[i-1] * invs[K-1] * invs[i-K] % p) % p
sum_min_s = 0
for i in range(1, N-K+2):
sum_min_s += A[i-1] * (facts[N-i] * invs[K-1] * invs[N-i-K+1] % p) % p
print(str(int(sum_max_s - sum_min_s) % p))
| 1 | 95,573,431,058,510 | null | 242 | 242 |
s = input()
print("ARC" if s[1] == "B" else "ABC")
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
imos=[0 for i in range(N+1)]
for t in range(K):
for i in range(N):
l=max(0,i-A[i])
r=min(N,i+A[i]+1)
imos[l]+=1
imos[r]-=1
for i in range(0,N):
imos[i+1]+=imos[i]
A[i]=imos[i]
imos=[0 for i in range(N+1)]
if len(set(A))==1 and (N in set(A)):
break
for i in range(N):
A[i]=str(A[i])
ans=" ".join(A)
print(ans)
| 0 | null | 19,793,890,705,248 | 153 | 132 |
import sys
import collections
import bisect
def main():
n = int(input())
a = [str(i + 1)[0] + str(i + 1)[-1] for i in range(n)]
b = [str(i + 1)[-1] + str(i + 1)[0] for i in range(n)]
ac, bc = collections.Counter(a), collections.Counter(b)
print(sum(ac[i] * bc[i] for i in ac.keys()))
if __name__ == '__main__':
main()
|
from decimal import Decimal
def main():
a, b = input().split(" ")
a = int(a)
b = Decimal(b)
print(int(a*b))
if __name__ == "__main__":
main()
| 0 | null | 51,818,939,796,438 | 234 | 135 |
x,y=map(int,input().split())
ans=0
x=max(4-x,0)
y=max(4-y,0)
ans+=x*100000+y*100000
if x==3 and y==3:
ans+=400000
print(ans)
|
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
while True:
N,X = map(int,input().split())
if N == 0 and X == 0:
break
ans = 0
for a in range(1,N+1):
for b in range(1,N+1):
if b <= a:
continue
c = X-(a+b)
if c > b and c <= N:
ans += 1
print("%d"%(ans))
| 0 | null | 70,753,678,604,766 | 275 | 58 |
def connected_components(graph):
seen = set()
def component(n):
nodes = set([n])
while nodes:
n = nodes.pop()
seen.add(n)
nodes |= set(graph[n]) - seen
yield n
for n in graph:
if n not in seen:
yield component(n)
def print_gen(gen):
print(len([list(x) for x in gen]) - 1)
n, m = map(int, input().split())
graph = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
graph[a-1].append(b-1)
graph[b-1].append(a-1) # 有向グラフなら消す
graphA = {}
for i in range(n):
graphA[i] = graph[i]
print_gen(connected_components(graphA))
|
N, K = map(int, input().split())
ans = []
for i in range(K):
d = int(input())
ans += map(int, input().split())
print(N-len(set(ans)))
| 0 | null | 13,577,190,665,082 | 70 | 154 |
nums = input().split(' ')
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
d = int(nums[3])
multi = []
multi.append(a * c)
multi.append(a * d)
multi.append(b * c)
multi.append(b * d)
ans = - 10 ** 18
for i in range(4):
if multi[i] > ans:
ans = multi[i]
print(ans)
|
# -*- coding:utf-8 -*-
a,b = input().split()
a,b = int(a),int(b)
d = int(a//b)
r = int(a%b)
print(d,r,format(a/b,'.6f'))
| 0 | null | 1,807,274,868,420 | 77 | 45 |
week = ['MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
S = input()
print(6 - week.index(S)) if week.index(S) != 6 else print(7)
|
#!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
dp = np.zeros((k.bit_length() + 1, n + 1), dtype=int)
dp[0, :] = warps
for h in range(1, len(dp)):
# dp[h] = dp[h - 1][dp[h - 1]]
dp[h] = np.take(dp[h - 1], dp[h - 1])
node = 1
# for i in reversed(range(k.bit_length())):
for i in range(k.bit_length(), -1, -1):
if k >> i & 1:
node = dp[i][node]
print(node)
main()
| 0 | null | 77,503,823,047,948 | 270 | 150 |
m, d = map(int,input().split())
n, e = map(int,input().split())
print(int(e == 1))
|
# coding: utf-8
stack = []
f = input().split()
for s in f:
if s in ('+', '-', '*'):
stack.append(str(eval("{1}{2}{0}".format(stack.pop(), stack.pop(), s))))
else:
stack.append(s)
print(*stack)
| 0 | null | 62,466,213,914,208 | 264 | 18 |
N = int(input())
S = input()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i+1)
elif S[i] == 'G':
G.append(i+1)
elif S[i] == 'B':
B.append(i+1)
lenb = len(B)
cnt = 0
for r in R:
for g in G:
up = max(r, g)
down = min(r, g)
diff = up - down
chk = 0
if up + diff <= N:
if S[up+diff-1] == 'B':
chk += 1
if down-diff >= 1:
if S[down-diff-1] == 'B':
chk += 1
if diff%2 == 0:
if S[int(up-diff/2-1)] == 'B':
chk += 1
cnt += lenb - chk
print(cnt)
|
for j in range(1,10):
for k in range(1,10):
print str(j)+"x"+str(k)+"="+str(j*k)
| 0 | null | 18,147,905,445,788 | 175 | 1 |
N=int(input())
x=list(map(int,input().split()))
sum=0
for i in range(1,N):
if x[i]<x[i-1]:
t=x[i-1]-x[i]
sum+=t
x[i]=x[i-1]
print(sum)
|
n = int(input())
a = list(map(int, input().split()))
h = 0
for i in range(1, len(a)):
if a[i-1] > a[i]:
h += a[i-1] - a[i]
a[i] += a[i - 1] - a[i]
print(h)
| 1 | 4,556,695,229,918 | null | 88 | 88 |
x,y,a,b,c = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse = True)
q.sort(reverse = True)
r.sort(reverse = True)
p = p[:x]
q = q[:y]
l = p + q + r
l.sort(reverse = True)
print(sum(l[:x+y]))
|
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
@staticmethod
def fact(N):
res = {}
tmp = N
for i in range(2, int(N ** 0.5 + 1) + 1):
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
if cnt > 0:
res[i] = cnt
if tmp != 1:
res[tmp] = 1
if res == {}:
res[N] = 1
return res
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
X, Y, A, B, C = Scanner.map_int()
P = Scanner.map_int()
Q = Scanner.map_int()
R = Scanner.map_int()
P.sort(reverse=True)
P = P[:X]
Q.sort(reverse=True)
Q = Q[:Y]
R.sort(reverse=True)
R = R[:min(X + Y, C)]
ans = P + Q + R
ans.sort(reverse=True)
print(sum(ans[:X + Y]))
def main():
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| 1 | 44,778,159,211,042 | null | 188 | 188 |
from collections import deque
n = int(input())
G = [None for i in range(n)]
for i in range(n):
u,k,*vs = map(int,input().split())
G[u-1] = [e-1 for e in vs]
dist = [-1]*n #全頂点を未訪問に初期化(-1)で未訪問
que = deque([0]) #初期条件 (頂点 0 を初期ノードとする)
dist[0] = 0 #0を訪問済み
while len(que)>0:
now = que.popleft()
for i in G[now]:
if dist[i] != -1:
continue
dist[i] = dist[now] + 1 #新たな頂点wについて距離情報を更新してキューに追加する
que.append(i)
for i in range(n):
print(i+1,dist[i])
|
j=0
N,D=map(int,input().split())
for i in range(N):
X,Y=map(int,input().split())
if (X**2+Y**2)**0.5<=D:
j=j+1
print(j)
| 0 | null | 2,982,309,290,012 | 9 | 96 |
H, W, K = map(int, input().split())
S = []
for _ in range(H):
S.append(input())
hsummation = [[int(S[0][k])]for k in range(W)]
for k in range(W):
for j in range(1, H):
hsummation[k].append(hsummation[k][j-1] + int(S[j][k]))
#print(hsummation)
ans = float('inf')
anskouho = 0
h = 2**(H-1)
for j in range(2**(H-1)):
h -= 1
binh = "0"*(H-len(str(bin(h)))+1)+str(bin(h))[2:]
hlist=[]
for k in range(H-1):
if binh[-k-1] == '1':
hlist.append(k)
hlist.append(-1)
#print(hlist)
anskouho = len(hlist)-1
now = 0
while now < W:
counter = [0 for _ in range(len(hlist))]
while now < W:
for l in range(len(hlist)):
if l == 0:
counter[l] += hsummation[now][int(hlist[l])]
continue
else:
counter[l] += - hsummation[now][hlist[l-1]] + hsummation[now][hlist[l]]
if max(counter) > K:
anskouho += 1
break
else:
now += 1
if anskouho > ans:
break
else:
ans = min(ans, anskouho)
#print(counter)
#print(anskouho)
print(ans)
|
# https://atcoder.jp/contests/abc159/tasks/abc159_e
import sys
ans = sys.maxsize
H, W, K = map(int, input().split())
s = [input() for _ in range(H)]
for h in range(1 << (H - 1)):
g = 0
ids = [-1 for _ in range(H)]
for i in range(H):
ids[i] = g
if (h >> i) & 1:
g += 1
g += 1
num = g - 1
if num >= ans:
continue
c = [[0] * W for _ in range(g)]
for i in range(H):
for j in range(W):
c[ids[i]][j] = c[ids[i]][j] + (s[i][j] == '1')
now = [0 for _ in range(g)]
def add(j):
for i in range(g):
now[i] += c[i][j]
for i in range(g):
if now[i] > K:
return False
return True
for j in range(W):
if not add(j):
num += 1
if num >= ans:
continue
now = [0 for _ in range(g)]
if not add(j):
num = sys.maxsize
break
ans = min(ans, num)
print(ans)
| 1 | 48,440,704,791,868 | null | 193 | 193 |
while True:
try:
a,b = map(int,raw_input().split(' '))
print len(str(a+b))
except: break
|
n=int(input())
a=list(map(int,input().split()))
l=[]
for i,x in enumerate(a):
l.append([x,i])
l.sort(reverse=True)
cnt=1
dp=[[0]*(n+1) for _ in range(n+1)]
for i,j in l:
for x in range(cnt+1):
if x==0:
dp[x][cnt-x]=dp[x][cnt-x-1]+i*(n-1-(cnt-x-1)-j)
elif x==cnt:
dp[x][cnt-x]=dp[x-1][cnt-x]+i*(j-x+1)
else:
dp[x][cnt-x]=max(dp[x-1][cnt-x]+i*(j-x+1),dp[x][cnt-x-1]+i*(n-1-(cnt-x-1)-j))
cnt+=1
ans=0
for i in range(n+1):
ans=max(ans,dp[i][n-i])
print(ans)
| 0 | null | 16,767,443,727,740 | 3 | 171 |
S=input()
i=0
kot=[]
for a in S:
kot.append(a)
tok=list(reversed(kot))
for a in range(len(kot)):
if kot[a]==tok[a]:
i=0
else:
print("No")
i=1
break
if i==0:
for a in range(int((len(kot)-1)/2)):
if kot[a]==tok[int((len(kot)-1)/2)-a-1]:
i=0
else:
print("No")
i=1
break
if i==0:
for a in range(int((len(kot)-1)/2)):
if kot[int((len(kot)+3)/2)+a-1]==tok[-a-1]:
i=0
else:
print("No")
i=1
break
if i==0:
print("Yes")
|
s = input()
n = len(s)
if s != s[::-1]:
print('No')
else:
s_1 = s[0:(n-1)//2]
s_2 = s[(n+1)//2:n]
if s_1 == s_1[::-1] and s_2 == s_2[::-1]:
print('Yes')
else:
print('No')
| 1 | 46,125,468,559,562 | null | 190 | 190 |
k = int(input())
sum = 0
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for a in range(1, k + 1):
for b in range(1, k + 1):
ab_gcd = gcd(a, b)
for c in range(1, k + 1):
abc_gcd = gcd(c, ab_gcd)
sum += abc_gcd
print(sum)
|
#<ABC151>
#<A>
s = input()
s = ord(s)
s = s + 1
print(chr(s))
| 0 | null | 64,032,777,037,630 | 174 | 239 |
a = input()
b = input()
if a == b[:len(a)]:
print("Yes")
else:
print("No")
|
s=input()
print("Yes"if s==input()[:-1]else"No")
| 1 | 21,405,100,352,350 | null | 147 | 147 |
# C - Marks
def main():
N, K, *A = map(int, open(0).read().split())
res = ["Yes" if tail > top else "No" for top, tail in zip(A, A[K:])]
print("\n".join(res))
if __name__ == "__main__":
main()
|
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
# N, K = LI()
# A = LI()
# for i in range(N - K):
# if A[i] < A[i + K]:
# ans = "Yes"
# else:
# ans = "No"
# print(ans)
N, K = LI()
A = LI()
for i in range(N - K):
if A[i] < A[i + K]:
ans = "Yes"
else:
ans = "No"
print(ans)
| 1 | 7,118,310,108,448 | null | 102 | 102 |
y,x = [int(x) for x in input().split()]
while(x > 0 or y > 0):
print('#' * x)
st = '#'
st += '.' * (x-2)
st += '#'
for i in range(1, y-1):
print(st)
print('#' * x)
print()
y,x = [int(x) for x in input().split()]
|
while 1:
H, W=map(int, raw_input().split())
if H==0 and W==0:
break
for i in range(H):
L=list("#"*W)
if i==0 or i==(H-1):
s="".join(L)
print s
else:
for j in range(1, W-1):
L[j]="."
s="".join(L)
print s
print ""
| 1 | 837,377,490,938 | null | 50 | 50 |
s = input()
t = input()
ans = 1000
c = 0
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j] == t[j]:
c += 1
ans = min(len(t) - c , ans)
c = 0
print(ans)
|
import numpy as np
from collections import Counter
N=int(input())
Alist=list(map(int,input().split()))
Q=int(input())
bc=[]
for _ in range(Q):
bc.append(list(map(int,input().split())))
count=Counter(Alist)
result=0
for key,value in count.items():
result+=key*value
for i in range(Q):
if bc[i][0] in count.keys():
result+=(bc[i][1]-bc[i][0])*count[bc[i][0]]
count[bc[i][1]]+=count[bc[i][0]]
count[bc[i][0]]=0
print(result)
| 0 | null | 7,957,360,742,340 | 82 | 122 |
x,n= map(int,input().split())
p = list(map(int,input().split()))
ans,i = 0,0
while True:
if x-i not in p:
ans = x-i
break
if x+i not in p:
ans = x+i
break
i = i+1
print(ans)
|
A, B = map(str, input().split())
if len(A) == 1 and len(B) == 1:
print(int(A)*int(B))
else:
print(-1)
| 0 | null | 86,225,111,218,210 | 128 | 286 |
from math import ceil,floor,comb,factorial,gcd,pow,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from copy import deepcopy
from time import time
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
k = INT()
s = list('00000000000')
for i in range(k):
for j in range(len(s)):
if s[j] != '9' and ( int("".join(s[j+1:])) == 0 or int(s[j]) < int(s[j+1]) + 1 ):
s[j] = str(int(s[j]) + 1)
else:
continue
while j > 0:
j -= 1
s[j] = str(max(0, int(s[j+1])-1))
break
ans = int("".join(reversed(s)))
print(ans)
|
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()
| 1 | 39,776,469,229,994 | null | 181 | 181 |
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 = int(input())
A = list(map(int, input().split()))
maxV = (10 ** 6 + 1)
sieve = [i for i in range(maxV)]
p = 2
while p*p < maxV:
if sieve[p] == p:
for q in range(p*2, maxV, p):
if sieve[q] == q:
sieve[q] = p
p += 1
from math import gcd
g = 0
primes = set()
for a in A:
g = gcd(g, a)
v = a
if g > 1:
print('not coprime')
exit()
for a in A:
temp_prime = set()
while a > 1:
prime = sieve[a]
temp_prime.add(prime)
a = a // prime
for t in temp_prime:
if t in primes:
print('setwise coprime')
exit()
primes.add(t)
print('pairwise coprime')
| 0 | null | 2,807,375,059,008 | 60 | 85 |
p=list(input())
ans=''
for i in p:
if i=='P':
ans+='P'
else:
ans+='D'
print(ans)
|
s = input()
for i in range(len(s)):
if s[i] == '?':
if i == 0 and len(s) == 1:
s = s.replace('?','D',1)
elif i == 0 and s[1] == 'D':
s = s.replace('?','P',1)
elif i == 0 and s[1] == 'P':
s = s.replace('?','D',1)
elif i == 0 and s[1] == '?':
s = s.replace('?','D',1)
elif s[i-1] =='P':
s = s.replace('?','D',1)
elif s[i-1] =='D' and (i ==len(s)-1):
s = s.replace('?','D',1)
elif s[i-1] =='D' and (i <len(s)-1 and(s[i+1] == 'P' or s[i+1] == '?')):
s = s.replace('?','D',1)
else:
s = s.replace('?','P',1)
print(s)
| 1 | 18,391,464,304,620 | null | 140 | 140 |
H,W,K=map(int, input().split())
S=[input()for _ in range(H)]
A=[[0]*W for _ in range(H)]
c=0
for i in range(H):
d=0
for j in range(W):
if S[i][j]=="#":
c+=1
d=c
A[i][j]=d
p=0
for j in range(W-1,-1,-1):
if A[i][j]==0:
A[i][j]=p
p=A[i][j]
if S[i].find("#")<0 and i!=0:
A[i][:]=A[i-1]
for i in range(H-2,-1,-1):
if all(a==0 for a in A[i]):
A[i][:]=A[i+1]
for i in range(H):
print(*A[i])
|
H, W, K = map(int, input().split())
cake = []
ans = [[0 for i in range(W)] for j in range(H)]
for i in range(H):
cake.append(list(input()))
def change(i, j, count, count2, count3):
#print(i, j, count,count2, count3)
for k in range(count2):
for a in range(count):
ans[i-k][j-a] = count3
stflag = 0
count2 = 0
count3 = 1
for i in range(len(cake)):
count = 0
stflag = 0
for j in range(len(cake[i])):
count += 1
if cake[i][j] == "#":
#print(i, j)
change(i, j, count, count2 + 1, count3)
count = 0
count3 += 1
stflag = 1
if j == len(cake[i])-1:
if stflag == 1:
count3 -= 1
change(i, j, count, count2 + 1, count3)
count = 0
count3 += 1
count2 = 0
else:
count2 += 1
if count2 != 0:
for i in range(count2):
for j in range(len(cake[i])):
ans[H - i - 1][j] = ans[H - count2 - 1][j]
for i in range(len(ans)):
for j in range(len(ans[i])):
print(ans[i][j], end=" ")
print()
| 1 | 144,045,083,213,888 | null | 277 | 277 |
from numpy import zeros, maximum
N, T, *AB = map(int, open(0).read().split())
dp = zeros(6010, int)
for w, v in sorted(zip(*[iter(AB)] * 2)):
dp[w:T + w] = maximum(dp[w:T + w], dp[:T] + v)
print(dp.max())
|
import collections
h,w=map(int,input().split())
board=[list(input()) for _ in range(h)]
q=collections.deque()
if board[0][0]=='#':
q.append((0,0,1,1))
else:
q.append((0,0,0,0))
dp=[[10**18]*w for _ in range(h)]
ans=10**18
while len(q)!=0:
x,y,cnt,flag=q.popleft()
if x==w-1 and y==h-1:
ans=min(ans,cnt)
else:
if x!=w-1:
if flag==0:
if board[y][x+1]=='#':
if dp[y][x+1]>cnt+1:
q.append((x+1,y,cnt+1,1))
dp[y][x+1]=cnt+1
else:
if dp[y][x+1]>cnt:
q.append((x+1,y,cnt,0))
dp[y][x+1]=cnt
else:
if board[y][x+1]=='#':
if dp[y][x+1]>cnt:
q.append((x+1,y,cnt,1))
dp[y][x+1]=cnt
else:
if dp[y][x+1]>cnt:
q.append((x+1,y,cnt,0))
dp[y][x+1]=cnt
if y!=h-1:
if flag==0:
if board[y+1][x]=='#':
if dp[y+1][x]>cnt+1:
q.append((x,y+1,cnt+1,1))
dp[y+1][x]=cnt+1
else:
if dp[y+1][x]>cnt:
q.append((x,y+1,cnt,0))
dp[y+1][x]=cnt
else:
if board[y+1][x]=='#':
if dp[y+1][x]>cnt:
q.append((x,y+1,cnt,1))
dp[y+1][x]=cnt
else:
if dp[y+1][x]>cnt:
q.append((x,y+1,cnt,0))
dp[y+1][x]=cnt
print(dp[-1][-1])
| 0 | null | 100,206,992,053,840 | 282 | 194 |
dic = set()
n = int(input())
for i in range(n):
s = input()
if s[0] == 'i':
dic.add(s[7:])
else: print("yes" if s[5:] in dic else "no")
|
size = [int(i) for i in input().split()]
sheet =[ [0 for i in range(size[1])] for j in range(size[0])]
for gyou in range(size[0]):
x = [int(i) for i in input().split()]
sheet[gyou] = x
sheet[gyou].append(sum(sheet[gyou]))
for gyou in range(size[0]):
for retsu in range(size[1]+1):
print(sheet[gyou][retsu],end="")
if retsu != size[1]:
print(" ",end="")
print("")
for retsu in range(size[1]+1):
sum2 = 0
for gyou in range(size[0]):
sum2 += sheet[gyou][retsu]
print(sum2, end="")
if retsu != size[1]:
print(" ",end="")
print("")
| 0 | null | 723,144,809,830 | 23 | 59 |
while True:
H,W = map(int,raw_input().split())
if H == 0 and W == 0:
break
a = "#"
for i in xrange(0,H):
print a * W
print ""
|
while True:
h, w = map(int, input().split())
if h == w == 0:
break
print(('#' * w + '\n') * h)
| 1 | 770,087,107,950 | null | 49 | 49 |
from collections import defaultdict
from itertools import product
H, W, K = map(int, input().split())
S = [input() for _ in range(H)]
C = [[int(s[i]) for s in S] for i in range(W)]#列を一括りにする
total = sum(sum(c) for c in C)#すべての値の合計を算出
if total <= K:
answer = 0
else:
answer = H * W
for X in product([False, True], repeat=H-1):#Hは行数
#あるXについて一回目のfor文が回る
ans = sum(X)#Trueの数を換算
if ans > answer:
continue
M = [[0]]
for i, x in enumerate(X):
if x:#Trueなら実行
M.append([])#Trueの数の配列が作成される
M[-1].append(i+1)#一番最後にその番目をappendする
D = [0] * len(M)#初期値を設定
for c in C:
for k, m in enumerate(M):
D[k] += sum(c[i] for i in m)#k番目の要素に足していく
#Dにどんどん代入することによってどの列まで足すことができるか算出することができる
if any(d > K for d in D):#一つでもKを超えていたら
ans += 1
if ans > answer:
break
D = [sum(c[i] for i in m) for m in M]#Dの更新(1番最初のDに戻る)
if any(d > K for d in D):#一つでもKを超えていたら
ans = answer + 1#ansの更新
break
answer = min(answer, ans)
print(answer)
|
def resolve():
n=int(input())
a=list(map(int,input().split()))
a.sort()
M=int(1e6+1)
f=[0]*M
for x in a:
if f[x]!=0:
f[x]+=1
continue
for nx in range(x,M,x):
f[nx]+=1
ans=0
for x in a:
if f[x]==1:ans+=1
print(ans)
resolve()
| 0 | null | 31,640,245,096,912 | 193 | 129 |
from itertools import combinations_with_replacement as comb_rplc
N,M,Q = map(int,input().split())
array = [ list(map(int,input().split())) for _ in range(Q) ]
ans = 0
for seq in comb_rplc(range(1, M + 1), N):
score = 0
for a,b,c,d in array:
if seq[b-1] - seq [a-1] == c:
score += d
ans = max(score,ans)
print(ans)
|
S = input()
week = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
if S == week[0]:
print(7)
elif S == week[1]:
print(6)
elif S == week[2]:
print(5)
elif S == week[3]:
print(4)
elif S == week[4]:
print(3)
elif S == week[5]:
print(2)
else:
print(1)
| 0 | null | 80,532,779,989,088 | 160 | 270 |
from collections import deque
mod = 10**9+7
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
N,M = MI()
links = [[] for _ in range(N)]
for _ in range(M):
a, b = MI()
a -= 1
b -= 1
links[a].append(b)
links[b].append(a)
ans = [-1] * N
ans[0] = 0
q = deque([(0, 0)])
while q:
room, prev = q.popleft()
for next_ in links[room]:
if ans[next_] < 0:
ans[next_] = room+1
q.append((next_, room))
print("Yes")
for i in range(1,N):
print(ans[i])
|
# import itertools
# import math
import sys
sys.setrecursionlimit(500*500)
# import numpy as np
from collections import deque
# N = int(input())
# S = input()
# n, *a = map(int, open(0))
N, M = map(int, input().split())
# A = list(map(int, input().split()))
# B = list(map(int, input().split()))
# A_B = [list(map(int,input().split())) for _ in range(M)]
# S = input()
# B_C = sorted(B_C, reverse=True, key=lambda x:x[1])
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement(range(1, M + 1), N))
# itertools.product((0,1), repeat=n)
# A = np.array(A)
# cum_A = np.cumsum(A)
# cum_A = np.insert(cum_A, 0, 0)
# edges = [list(map(int,input().split())) for _ in range(M)]
# tree = [[] for _ in range(N + 1)]
# for edge in edges:
# tree[edge[0]].append([edge[1], edge[2]])
# tree[edge[1]].append([edge[0], edge[2]])
# depth = [-1] * (N + 1)
# depth[1] = 0
# def dfs(tree, s):
# for l in tree[s]:
# if depth[l[0]] == -1:
# depth[l[0]] = depth[s] + l[1]
# dfs(tree, l[0])
# dfs(tree, 1)
# def factorization(n):
# arr = []
# temp = n
# for i in range(2, int(-(-n**0.5//1))+1):
# if temp%i==0:
# cnt=0
# while temp%i==0:
# cnt+=1
# temp //= i
# arr.append([i, cnt])
# if temp!=1:
# arr.append([temp, 1])
# if arr==[]:
# arr.append([n, 1])
# return arr
tree = [[] for _ in range(N + 1)]
edges = [list(map(int,input().split())) for _ in range(M)]
for edge in edges:
tree[edge[0]].append(edge[1])
tree[edge[1]].append(edge[0])
depth = [-1] * (N + 1)
depth[1] = 0
d = deque()
d.append(1)
ans = [0] * (N + 1)
while d:
v = d.popleft()
for i in tree[v]:
if depth[i] != -1:
continue
depth[i] = depth[v] + 1
ans[i] = v
d.append(i)
# ans = depth[2:]
print('Yes')
print(*ans[2:], sep="\n")
| 1 | 20,363,259,864,980 | null | 145 | 145 |
N, K, S = map(int, input().split())
A = []
for i in range(K):
A.append(S)
if S != 10 ** 9:
res = S + 1
else:
res = 1
for j in range(N - K):
A.append(res)
print(*A)
|
s = list(map(int,input().split()))
h = 60 * (s[2]-s[0])
m = s[3] - s[1]
k = s[4]
print(h+m-k)
| 0 | null | 54,637,367,067,638 | 238 | 139 |
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
x,y = readInts()
a = [300000,200000,100000] + [0] * 2000
print(a[0] + a[0] + 400000 if x == y == 1 else a[x-1] + a[y-1])
|
X, Y = list(map(int, input().split()))
pX = [0 for _ in range(206)]
pX[1] = 300000
pX[2] = 200000
pX[3] = 100000
point = pX[X] + pX[Y]
if X == 1 and Y == 1:
point += 400000
print(point)
| 1 | 140,471,033,555,076 | null | 275 | 275 |
n=int(input())
syakkin=100000
for i in range(n):
syakkin+=syakkin*0.05
if syakkin%1000!=0:
syakkin=(syakkin//1000)*1000+1000
print(int (syakkin))
|
def main():
n, m = map(int, input().split())
print('Yes') if n <= m else print('No')
if __name__ == '__main__':
main()
| 0 | null | 41,811,293,342,770 | 6 | 231 |
h, w = map(int, input().split())
if h==1 or w == 1:
print(1)
else:
ans = h * w //2 + (h*w)%2
print(ans)
|
H, W = [int(x) for x in input().split()]
if H == 1 or W == 1:
print(1)
else:
print((H * W + 1) // 2)
| 1 | 50,816,850,671,250 | null | 196 | 196 |
S=str(input())
ls = ["SAT","FRI","THU","WED","TUE","MON","SUN"]
for i in range(7):
if S == ls[i]:
print(i+1)
|
# -*- coding: utf-8 -*-
def main():
S = input()
week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
for i, name in enumerate(week):
if name == S:
ans = 7 - i
print(ans)
if __name__ == "__main__":
main()
| 1 | 132,599,671,997,798 | null | 270 | 270 |
s = raw_input().swapcase()
print s
|
n,m,x=map(int,input().split())
c=[]
a=[]
mn=float("inf")
for i in range(n):
aa=list(map(int,input().split()))
c.append(aa.pop(0))
a.append(aa)
for i in range(2**n):
buy=[]
kai=[0]*m
cost=0
for j in range(n):
if((i>>j)&1):
buy.append(j)
for j in buy:
cost+=c[j]
for k in range(m):
kai[k]+=a[j][k]
fl=True
for j in range(m):
if kai[j]<x:
fl=False
break
if fl:
mn=min(mn,cost)
if mn==float("inf"):
print(-1)
else:
print(mn)
| 0 | null | 11,944,526,863,422 | 61 | 149 |
n, k = map(int, input().split())
mod = 10 ** 9 + 7
N = n + 1
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y // 2) ** 2 % mod
else : return power(x, y // 2) ** 2 * x % mod
factorial = [1]
for i in range(1, N):
factorial.append(factorial[i - 1] * i % mod)
inverseFactorial = [0] * N
inverseFactorial[N - 1] = power(factorial[N - 1], mod - 2)
for i in range(N - 2, -1, -1):
inverseFactorial[i] = inverseFactorial[i + 1] * (i + 1) % mod
def comb(x, y):
return factorial[x] * inverseFactorial[y] * inverseFactorial[x - y] % mod
ans = 1
for i in range(1, min(k + 1, n)):
tmp = comb(n - 1, n - i - 1) * comb(n, i)
ans += tmp
ans %= mod
print(ans)
|
import sys
readline = sys.stdin.buffer.readline
n,k = map(int,readline().split())
mod = 10**9+7
def pow(n,p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
return res % mod
def factrial_memo(n=10**6+1,mod=10**9+7):
fact = [1, 1]
for i in range(2, n + 1):
fact.append((fact[-1] * i) % mod)
return fact
def fermat_cmb(n, r, mod=10**9+7): #needs pow,factrial_memo(only fact). return nCk
return fact[n] * pow(fact[r],mod-2) * pow(fact[n-r],mod-2) %mod
fact = factrial_memo()
if k > n-1: #全通りの再現が可能ならば
ans = fermat_cmb(2*n-1,n)
else: #移動回数の制限によって全通りの再現ができないならば
ans = 1
for i in range(1,k+1): #全ての動作を再現する(kはたかだか2*10**5である)
ans += fermat_cmb(n,i)*fermat_cmb(n-1,i)
#n人の中から動かせる人物をi人取り、n-1箇所(それぞれの人物に付き同じ場所には戻れない)
#にi人を入れる組み合わせ。それぞれの事象に付き、0人になる部屋と他の部屋の人数は
#必ず違う組み合わせになるので、これをk回だけ繰り返せば良い
ans %= mod
print(ans)
| 1 | 66,996,747,503,584 | null | 215 | 215 |
n = int(input())
a = list(map(int, input().split()))
ruiseki0 = [0] * (n + 10)
for i in range(n):
ruiseki0[i + 1] = ruiseki0[i]
if i % 2 == 0:
ruiseki0[i + 1] += a[i]
l = [0] * (n + 1)
for i in range(n + 1):
l[i] = ruiseki0[i]
if i % 2 == 0:
if i == 0:
l[i] = 0
else:
l[i] = max(l[i - 2] + a[i - 1], l[i])
a = a[::-1]
ruiseki0 = [0] * (n + 10)
for i in range(n):
ruiseki0[i + 1] = ruiseki0[i]
if i % 2 == 0:
ruiseki0[i + 1] += a[i]
r = [0] * (n + 1)
for i in range(n + 1):
r[i] = ruiseki0[i]
if i % 2 == 0:
if i == 0:
r[i] = 0
else:
r[i] = max(r[i - 2] + a[i - 1], r[i])
ans = - 10 ** 20
for i in range(n):
if n - i - 2 < 0:
break
if n % 2 == 0 and i % 2 == 0:
continue
ans = max(ans, l[i] + r[n - i - 2])
if n % 2 == 0:
ans1 = 0
ans2 = 0
for i in range(n):
if i % 2 == 0:
ans1 += a[i]
else:
ans2 += a[i]
ans = max(ans1, ans2, ans)
if n % 2 == 1:
ans = max(ans, sum(a)- ruiseki0[n])
print(ans)
|
INF=float('inf')
def solve1():
dp=[[-INF]*2 for i in range(N+1)]
dp[0][0]=0;dp[1][0]=A[0];dp[2][1]=A[1]
for i in range(N):
if dp[i+1][0]==-INF:
if i-1>=0:
dp[i+1][0]=max(dp[i+1][0],dp[i-1][0]+A[i])
if dp[i+1][1]==-INF:
if i-1>=0:
dp[i+1][1]=max(dp[i+1][1],dp[i-1][1]+A[i])
if i-2>=0:
dp[i+1][1]=max(dp[i+1][1],dp[i-2][0]+A[i])
print(max(dp[N][1],dp[N-1][0]))
return
def solve2():
dp=[[-INF]*3 for i in range(N+1)]
dp[0][0]=0;dp[1][0]=A[0];dp[2][1]=A[1];dp[3][2]=A[2]
for i in range(N):
if dp[i+1][0]==-INF:
if i-1>=0:
dp[i+1][0]=max(dp[i+1][0],dp[i-1][0]+A[i])
if dp[i+1][1]==-INF:
if i-1>=0:
dp[i+1][1]=max(dp[i+1][1],dp[i-1][1]+A[i])
if i-2>=0:
dp[i+1][1]=max(dp[i+1][1],dp[i-2][0]+A[i])
if dp[i+1][2]==-INF:
if i-1>=0:
dp[i+1][2]=max(dp[i+1][2],dp[i-1][2]+A[i])
if i-2>=0:
dp[i+1][2]=max(dp[i+1][2],dp[i-2][1]+A[i])
if i-3>=0:
dp[i+1][2]=max(dp[i+1][2],dp[i-3][0]+A[i])
print(max(dp[N][2],dp[N-1][1],dp[N-2][0]))
return
N=int(input())
A=list(map(int,input().split()))
if N%2==0:
solve1()
else:
solve2()
| 1 | 37,375,959,790,442 | null | 177 | 177 |
n=input()
if 65<=ord(n)<=90:
print("A")
else:
print("a")
|
a=input()
if a==a.upper():
print("A")
else:
print("a")
| 1 | 11,292,818,258,972 | null | 119 | 119 |
#!/usr/bin/env pypy3
# n,m = map(int,sys.stdin.readline().split())
# a = list(map(int,sys.stdin.readline().split()))
# a = [sys.stdin.readline() for s in range(n)]
# s = sys.stdin.readline().rstrip()
# n = int(sys.stdin.readline())
# d = collections.defaultdict(list)
# h = list() heapify(h)
import math
from functools import reduce
import sys
sys.setrecursionlimit(15000)
n,k = map(int,sys.stdin.readline().split())
dp = [0]*(k+1)
s = 0
#print("nk:",n,k)
l = 0
for x in range(1,k+1)[::-1]:
dp[x] = pow(k//x,n,1000000007)
j = 2
#print(2*x,k+1,x)
for j in range(2*x,k+1,x):
#print("j",x,j,k,n)
dp[x] -= dp[j]
s = (s + (dp[x]*x))%1000000007
#return reduce(math.gcd, numbers)
#sum += gcd(a,b,c)
#print(sum(dp[n-1][j] for j in range(k)))
#print(dp)
print(s)
|
# 解説AC
mod = 10 ** 9 + 7
n, k = map(int, input().split())
dp = [-1] * (k + 1)
ans = 0
for i in range(k, 0, -1):
dp[i] = pow(k // i, n, mod)
t = 0
t += 2 * i
while t <= k:
dp[i] -= dp[t]
dp[i] %= mod
t += i
ans += i * dp[i]
ans %= mod
print(ans)
| 1 | 36,793,543,678,158 | null | 176 | 176 |
while 1:
a=0
n,x=map(int,raw_input().split())
if n==0:break
for i in range(1,n-1):
for j in range(i+1,n):
c=x-i-j
if c>j and c<=n:a+=1
print a
|
import itertools
while True:
n, x = map(int, input().split())
if n == x == 0:
break
i = 0
l = range(1, n+1)
for elem in itertools.combinations(l, 3):
if sum(elem) == x:
i += 1
print(str(i))
| 1 | 1,284,832,211,198 | null | 58 | 58 |
# 配るDP、もらうDP
n, k = map(int, input().split())
mod = 998244353
kukan = []
for _ in range(k):
# 区間の問題は扱いやすいように[ ) の形に直せるなら直す
l, r = map(int, input().split())
l -= 1
kukan.append([l, r])
dp = [0 for i in range(n)]
dp[0] = 1
# 区間のL, Rは数字が大きいため、その差一つ一つを考えると時間がない！
# それゆえにL, Rの端を考えればいいようにするためにそこまでの累和を考える
ruiseki = [0 for i in range(n + 1)]
ruiseki[1] = 1
for i in range(1, n):
for l, r in kukan:
l = i - l
r = i - r
l, r = r, l
# print(l, r)
if r < 0:
continue
elif l >= 0:
dp[i] += (ruiseki[r] - ruiseki[l]) % mod
else:
dp[i] += (ruiseki[r]) % mod
ruiseki[i + 1] = (ruiseki[i] + dp[i])
# print(ruiseki, dp)
print(dp[-1] % mod)
|
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
mod = 998244353
n, k = map(int, input().split())
l = []
r = []
for _ in range(k):
l_, r_ = map(int, input().split())
l.append(l_)
r.append(r_)
dp = [0] * (n + 1)
dp_csum = [0] * (n + 1)
dp[1] = 1
dp_csum[1] = 1
for i in range(2, n + 1):
for j in range(k):
left = i - r[j]
right = i - l[j]
if right >= 1:
dp[i] += dp_csum[right] - dp_csum[max(left, 1) - 1]
dp[i] %= mod
dp_csum[i] = dp_csum[i - 1] + dp[i]
dp_csum[i] %= mod
print(dp[-1])
| 1 | 2,693,804,290,580 | null | 74 | 74 |
from sys import stdin
input = stdin.readline
a,b,n = map(int,input().split())
maxpoint = 0
if b > n :
tmp = int((a * n) / b) - a * int(n/b)
maxpoint = max(tmp,maxpoint)
else:
k = int(n/b)*b -1
maxpoint = int((a * k) / b) - a * int(k/b)
if b == 1:
maxpoint = 0
print(maxpoint)
|
def II(): return int(input())
def MI(): return map(int, input().split())
A,B,N=MI()
def f(x):
return A*x//B-A*(x//B)
if B-1<=N:
ans=f(B-1)
else:
ans=f(N)
print(ans)
| 1 | 27,892,366,234,128 | null | 161 | 161 |
a, b, c, d = map(int, input().split())
if b < 0:
if c <= 0:
print(a * c)
else:
print(b * c)
elif a <= 0:
if d < 0:
print(a*c)
elif a <= 0:
print(max(a*c, b*d))
else:
print(b*d)
else:
if d < 0:
print(a * d)
else:
print(b * d)
|
a,b,c,d=map(int,input().split())
maxxy=max(a*c,a*d,b*c,b*d)
print(maxxy)
| 1 | 3,031,845,927,350 | null | 77 | 77 |
s = input()
partition = s.replace('><','>|<').split('|')
ans=0
for sub in partition:
left = sub.count('<')
right = sub.count('>')
ans += sum(range(1, max(left, right) + 1))
ans += sum(range(1, min(left, right)))
print(ans)
|
S = input()
length = len(S)
print("x"*length)
| 0 | null | 114,773,816,460,926 | 285 | 221 |
from math import floor
a, b = map(int, input().split(' '))
d = False
for p in range(1009):
if floor(p * 0.08) == a and floor(p * 0.1) == b:
print(p)
d = True
break
if not d:
print(-1)
|
#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,837,400,180,512 | null | 203 | 203 |
X,Y = map(int,input().split())
result = 'No'
for x in range(X+1):
if (2*x + 4*(X-x)) == Y:
result = 'Yes'
break
print(result)
|
X,Y=list(map(int, input().split()))
b=(Y-2*X)/2
a=X-b
if int(a)==a and int(b)==b and a>=0 and b>=0:
print('Yes')
else:
print('No')
| 1 | 13,788,518,973,620 | null | 127 | 127 |
n, k = map(int, input().split())
w = [int(input()) for _ in range(n)]
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 True
return False
ng, ok = 0, 10**9
while ok-ng > 1:
mid = (ng+ok)//2
if check(mid):
ok = mid
else:
ng = mid
print(ok)
|
import sys
def value(w,n,P):
tmp_w = 0
k = 1
for i in range(n):
if tmp_w + w[i] <= P:
tmp_w += w[i]
else:
tmp_w = w[i]
k += 1
return k
def test():
inputs = list(map(int,sys.stdin.readline().split()))
n = inputs[0]
k = inputs[1]
w = []
max = 0
sum = 0
for i in range(n):
w.append(int(sys.stdin.readline()))
if w[i] > max:
max = w[i]
sum += w[i]
while max != sum:
mid = (max + sum) // 2
if value(w,n,mid) > k:
max = mid + 1
else:
sum = mid
print(max)
if __name__ == "__main__":
test()
| 1 | 83,711,947,648 | null | 24 | 24 |
from math import *
while True:
n = input()
if n==0:
break
score_li = map(int,raw_input().split())
score_sum = sum(score_li)
ave = score_sum/float(n)
variance = 0
for i in xrange(n):
variance += (score_li[i]-ave)**2
variance /=float(n)
sd = sqrt(variance) #sd:standard deviation
print sd
|
import math
while True:
n = int(input())
if n == 0: break
points = list(map(int, input().split()))
mean = sum(points) / n
s = 0
for point in points:
s += (point - mean) ** 2
std = math.sqrt(s / n)
print(std)
| 1 | 195,090,946,702 | null | 31 | 31 |
from itertools import groupby
from statistics import median
from sys import exit
N = int(input())
line = ([(index, v) for index, v in enumerate(input())])
def types(line): return line[1]
def index(line): return line[0]
gp = groupby(sorted(line, key=types), types)
d = {}
for k, v in gp:
indexes = set([i for i, value in v])
d[k] = indexes
if 'R' not in d or 'G' not in d or 'B' not in d:
print(0)
exit()
delete = 0
for differ in range(1, N):
for start in range(N):
if start + differ*2 > N - 1:
break
i = line[start]
j = line[start + differ]
k = line[start + differ*2]
if len({i[1], j[1], k[1]}) != 3:
continue
upper = max(i[0], j[0], k[0])
lower = min(i[0], j[0], k[0])
median_num = median([i[0], j[0], k[0]])
if upper - median_num == median_num - lower:
delete += 1
print(len(d['R']) * len(d['G']) * len(d['B']) - delete)
|
N, R = map(int, input().split())
if N >= 10: print(R)
else: print(R + 100*(10-N))
| 0 | null | 49,908,407,869,764 | 175 | 211 |
import math
a, b, x = map(int, input().split())
s = x / a
if s >= a * b / 2:
c = (a * b - s) * 2 / a
rad = math.atan2(c, a)
else:
c = s * 2 / b
rad = math.atan2(b, c)
ans = math.degrees(rad)
print(ans)
|
from collections import defaultdict
def main():
n, x, y = map(int, input().split())
x -= 1
y -= 1
klist = defaultdict(int)
for i in range(n):
for j in range(i+1, n):
if (i <= x and j <= x) or (y <= i and y <= j):
k = j - i
klist[k] += 1
elif i <= x and x < j <= y:
k = min(j - i, (x - i + y - j) + 1)
klist[k] += 1
elif i <= x and y <= j:
k = (j - i) - (y - x) + 1
klist[k] += 1
else:
k = min((j - i), ((i - x) + abs(y - j) + 1))
klist[k] += 1
for i1 in range(1, n):
print(klist[i1])
if __name__ == '__main__':
main()
| 0 | null | 103,703,674,021,728 | 289 | 187 |
n = int(input())
x, y = divmod(n, 2)
print(x + y)
|
a = int(input())
if a % 2 == 0:
print(str(int(a//2)))
else:
print(str(int(a//2)+1))
| 1 | 58,849,911,307,120 | null | 206 | 206 |
write = open(1, 'w').write
for i in range(1, int(open(0).read())+1):
if i % 3:
if "3" in str(i):
write(" %d" % i)
else:
write(" %d" % i)
write("\n")
|
import os, sys, re, math
(N, K) = [int(n) for n in input().split()]
H = [int(n) for n in input().split()]
H = sorted(H, reverse=True)[K:]
print(sum(H))
| 0 | null | 39,743,645,554,602 | 52 | 227 |
h,w,k=map(int,input().split())
G=[["."]*w for i in range(h)]
for i in range(h):
G[i]=list(input())
ans=[[0]*w for i in range(h)]
GG=[[0] for i in range(h)]
for i in range(h):
for j in range(w):
if G[i][j]=="#":
GG[i].append(j)
GG[i].append(w)
B=[0]
a=1
for i in range(h):
if len(GG[i])==2:
continue
B.append(i)
ans[i][GG[i][0]:GG[i][2]]=[a]*(GG[i][2]-GG[i][0])
a=a+1
for j in range(len(GG[i])-3):
ans[i][GG[i][j+2]:GG[i][j+3]]=[a]*(GG[i][j+3]-GG[i][j+2])
a=a+1
B.append(h)
for i in range(B[2]-B[0]):
ans[i]=ans[B[1]]
for i in range(B[2],h):
if i not in B:
ans[i]=ans[i-1]
for i in range(h):
for j in range(w):
print(ans[i][j],end=" ")
print()
|
h, w, k = map(int, input().split())
s = [input() for _ in range(h)]
t = [[0] * w for _ in range(h)]
n = 0
rows = []
for i in range(h):
if s[i].count("#") == 0:
rows.append(i)
else:
if s[i][0] == "#":
for j in range(w):
if s[i][j] == "#":
n += 1
t[i][j] = n
else:
n += 1
f = 0
for j in range(w):
if f and s[i][j] == "#":
n += 1
elif s[i][j] == "#":
f = 1
t[i][j] = n
if rows != [] and rows[-1] == h-1:
for k in range(h)[::-1]:
if t[k][j] != 0:
for j in range(w):
t[rows[-1]][j] = t[k][j]
break
for i in rows:
for k in range(i+1, h):
if t[k][j] != 0:
for j in range(w):
t[i][j] = t[k][j]
break
for i in range(h):
print(*t[i])
| 1 | 143,609,386,090,592 | null | 277 | 277 |
a = input()
b = list(a)
if len(a) >= 6:
if b[2] == b[3]:
if b[4] == b[5]:
print("Yes")
else:
print("No")
else:
print("No")
else:
print("No")
|
from decimal import Decimal, getcontext
getcontext().prec = 10000
def f(x):
return Decimal(x).sqrt()
a, b, c = map(int, input().split())
eps = Decimal(10) ** (-1000)
if f(a) + f(b) + eps < f(c):
ans = "Yes"
else:
ans = "No"
print(ans)
| 0 | null | 46,903,872,782,382 | 184 | 197 |
K = int(input())
S = input()
if len(S) >K:
S = S[:K] + '...'
print(S)
|
from math import gcd
from itertools import combinations_with_replacement
k = int(input())
lst = [i for i in range(1,k+1)]
itr = combinations_with_replacement(lst, 3)
ans = 0
for i in itr:
st = set(i)
num = len(st)
if num == 1:
ans += i[0]
elif num == 2:
a,b = st
ans += gcd(a,b) * 3
else:
ans += gcd(gcd(i[0],i[1]), i[2]) * 6
print(ans)
| 0 | null | 27,584,975,728,658 | 143 | 174 |
N = int(input())
S = input()
ans = 0
for i in range(1000):
lucky = str(i)
if 0 <= i <= 9:
lucky = "00" + lucky
elif 10 <= i <= 99:
lucky = "0" + lucky
else:
pass
now = 0
index = 0
while index < N:
if lucky[now] == S[index]:
now += 1
if now == 3:
ans += 1
break
index += 1
print(ans)
|
while True:
x=input()
if x=="0":
break
cnt = 0
for i in x:
num = int(i)
cnt += num
print(cnt)
| 0 | null | 64,802,522,004,320 | 267 | 62 |
import math
def main():
data = []
while 1:
try:
n = input().split()
a = int(n[0])
b = int(n[1])
ans = int(math.log10(a+b)+1)
data.append(ans)
except EOFError:
break
for i in data:
print(i)
if __name__ == "__main__":
main()
|
import sys
def main():
for line in sys.stdin:
A = list(map(int,line.split()))
C = A[0]+A[1]
count = 0
while True:
C/=10
if C < 1:
break
count += 1
print(count+1)
if __name__ == '__main__':
main()
| 1 | 96,462,478 | null | 3 | 3 |
from collections import deque
import sys
INFTY=sys.maxsize
WHITE=0
GRAY=1
BLACK=2
color=[]
d=[]
Q=deque([])
n=0
L=[]
def readinput():
global n
global L
n=int(input())
for i in range(n+1):
L.append([])
for i in range(n):
inp=list(map(int,input().split()))
L[inp[0]]=inp[2:]
def bfs(s):
global color
global d
global Q
for i in range(n+1):
color=[WHITE]*(n+1)
d=[-1]*(n+1)
color[s]=GRAY
d[s]=0
Q.append(s)
while(len(Q)>0):
u = Q.popleft()
for l in L[u]:
if(color[l]==WHITE):
color[l]=GRAY
d[l]=d[u]+1
Q.append(l)
color[u]=BLACK
if __name__=='__main__':
readinput()
bfs(1)
for i in range(1,n+1):
print('{} {}'.format(i, d[i]))
|
from collections import deque
N = int(input())
g = {i: deque() for i in range(1,N+1)} #1-index
for i in range(1, N+1):
u, k, *v = map(int, input().split())
for j in v:
g[u].append(j)
seen = [0]*(N+1) #1-index
que = deque([])
dist = [-1]*(N+1) #1-index
seen[1] = 1
que.append(1)
dist[1] = 0
while que: #queが空になるまで
q_no = que.popleft()
if not g[q_no]: continue #点q-noから他の点に伸びていない
for next_v in g[q_no]:
if seen[next_v] == 1: continue #訪問済
seen[next_v] = 1 #訪問済にする
dist[next_v] = dist[q_no] + 1 #距離情報を格納
que.append(next_v) #queに追加
for i in range(1, N+1):
print(i, dist[i])
| 1 | 4,178,010,030 | null | 9 | 9 |
n = input()
s = list(map(int, input().split()))
print(min(s), max(s), sum(s))
|
n = int(input())
s = input().split()
arr = [int(s[i]) for i in range(n)]
arr.sort()
sum = 0
for i in range(len(arr)):
sum += arr[i]
print(arr[0], arr[len(arr)-1], sum)
| 1 | 737,514,890,428 | null | 48 | 48 |
d,t,s = input().split()
gool = int(d) / int(s)
if gool <= int(t):
print('Yes')
else:
print('No')
|
d,t,s=list(map(int,input().split()))
if(t*s<d):
print("No")
else:
print("Yes")
| 1 | 3,574,935,136,720 | null | 81 | 81 |
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_2_B&lang=jp
sample_input = list(range(3))
sample_input[0] = '''6
5 6 4 2 1 3'''
sample_input[1] = '''6
5 2 4 6 1 3'''
sample_input[2] = ''''''
give_sample_input = None
if give_sample_input is not None:
sample_input_list = sample_input[give_sample_input].split('\n')
def input():
return sample_input_list.pop(0)
# main
def swap_list_item(lst, i, j):
tmp = lst[i]
lst[i] = lst[j]
lst[j] = tmp
num_of_data = int(input())
data_list = list(map(int, input().split()))
swap_count = 0
for i in range(num_of_data):
minj = i
for j in range(i, num_of_data):
if data_list[minj] > data_list[j]:
minj = j
if not minj == i:
swap_list_item(data_list, i, minj)
swap_count += 1
result = ''
for number in data_list:
result += str(number) + ' '
print(result.strip())
print(swap_count)
|
INF = int(1e18)
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = [A[left + i] for i in range(n1)]
R = [A[mid + i] for i in range(n2)]
L.append(INF)
R.append(INF)
i, j = 0, 0
count = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return count
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
c1 = merge_sort(A, left, mid)
c2 = merge_sort(A, mid, right)
c = merge(A, left, mid, right)
return c + c1 + c2
else:
return 0
if __name__ == '__main__':
n = int(input())
A = list(map(int, input().split()))
c = merge_sort(A, 0, n)
print(" ".join(map(str, A)))
print(c)
| 0 | null | 64,958,309,752 | 15 | 26 |
n = int(input())
ns = [int(i) for i in input().split()]
ns.reverse()
if len(ns) > n:
del ns[:(len(ns) - n)]
for i in ns:
if i != ns[-1]:
print(i,end=' ')
else:
print(i,end='')
print()
|
# -*- coding: utf-8 -*-
n = input()
l = map(int, raw_input().split())
for i in range(n-1):
print l[n-i-1],
print l[0]
| 1 | 988,815,467,342 | null | 53 | 53 |
s = input()
a = 0
if(len(s)%2 == 1):
print('No')
else:
for i in range(len(s)//2):
if(s[2*i] != 'h' or s[2*i+1] != 'i'):
a = 1
print('No')
break
if(a == 0):
print('Yes')
|
import math
n = int(input())
f = math.floor(n / 1.08)
c = math.ceil(n / 1.08)
for i in [f, c]:
if math.floor(i*1.08) == n:
print(i)
exit()
print(':(')
| 0 | null | 89,778,864,438,910 | 199 | 265 |
S=input()
N=len(S)
S=list(S)
ct=0
for i in range(N//2):
if S[i]!=S[-i-1]:
ct+=1
print(ct)
|
S = input()
N = len(S)
count = 0
n = N//2
for i in range(n):
if S[i] != S[N-1-i]:
count +=1
print(count)
| 1 | 119,686,087,118,708 | null | 261 | 261 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
#
# This problem can be solved smarter. But this example shows simple method
#
import sys
while True:
s = sys.stdin.readline().strip()
if s == '-':
break
n = int(sys.stdin.readline())
for i in range(n):
h = int(sys.stdin.readline())
s = s[h:] + s[:h]
print(s)
|
N,K = map(int,input().split())
M = list(map(int,input().split()))
M =sorted(M,reverse=True)
print(sum(M[K:]))
| 0 | null | 40,446,735,597,690 | 66 | 227 |
while(1):
sen1=input()
if sen1=="-":
break
suff=int(input())
for i in range(suff):
h=int(input())
sen1=sen1[h:]+sen1[:h]
print(sen1)
|
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')
def solve():
n, k, s = [int(x) for x in input().split()]
ans = [0] * n
for i in range(n):
if i < k:
ans[i] = s
else:
x = n - k
z = s + 1
if s == int(1e9):
z -= 10
ans[i] = z
print(*ans)
t = 1
# t = int(input())
for case in range(1,t+1):
ans = solve()
"""
abc
"""
| 0 | null | 46,225,490,500,288 | 66 | 238 |
from math import factorial
def modpow(a, n, p):
if n == 0:
return 1
elif n == 1:
return a % p
if n % 2 == 1:
return (a * modpow(a, n-1, p)) % p
tmp = modpow(a, n//2, p)
return (tmp * tmp) % p
def main():
mod = 10 ** 9 + 7
n, a, b = map(int, input().split())
# まずは繰り返し2乗法によって全部の組み合わせを求める
# すべての組み合わせは、花を選ぶ/選ばないで組み合わせを決めれる
ans = (modpow(2, n, mod) - 1) % mod
# a本選んだときの数を引く
c_a = 1
for i in range(n, n-a, -1):
c_a *= i
c_a %= mod
c_a *= modpow(factorial(a), mod-2, mod)
ans -= c_a
ans %= mod
# b本選んだときの数を引く
c_b = 1
for i in range(n, n-b, -1):
c_b *= i
c_b %= mod
c_b *= modpow(factorial(b), mod-2, mod)
ans -= c_b
ans %= mod
print(ans)
if __name__ == "__main__":
main()
|
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
MAX = 2 * 10 ** 5 + 5
MOD = 10 ** 9 + 7
fac = [0 for i in range(MAX)]
finv = [0 for i in range(MAX)]
inv = [0 for i in range(MAX)]
def comInit(mod):
fac[0], fac[1] = 1, 1
finv[0], finv[1] = 1, 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i - 1] * i % mod
inv[i] = mod - inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
def com(mod, n, k):
numerator = 1
for i in range(1, k + 1):
numerator *= (n - i + 1)
numerator %= mod
return (numerator * finv[k] % mod)
comInit(MOD)
n, a, b = map(int, readline().split())
nb = n
def my_pow(base, n, mod):
if n == 0:
return 1
x = base
y = 1
while n > 1:
if n % 2 == 0:
x *= x
n //= 2
else:
y *= x
n -= 1
x %= mod
y %= mod
return x * y % mod
ans = (my_pow(2, n, MOD) - 1) % MOD
print((ans - com(MOD, nb, a) - com(MOD, nb, b)) % MOD)
| 1 | 66,174,327,520,730 | null | 214 | 214 |
import string
print raw_input().translate(string.maketrans("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'))
|
s = input()
for c in s:
if c.islower():
print(c.upper(), end="")
else:
print(c.lower(), end="")
print()
| 1 | 1,513,115,703,088 | null | 61 | 61 |
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())
c = [[0 for i in range(10)] for _ in range(10)]
def f(n):
x = 0
while n > 0:
n //= 10
x +=1
return x
for i in range(1, N + 1):
d = f(i)
front = i // (10 ** (d - 1))
back = i % 10
c[front][back] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += c[i][j] * c[j][i]
print(ans)
|
n = int(input())
t = [[0 for j in range(10)] for i in range(10)]
for i in range(1,n+1):
s = str(i)
t[int(s[0])][int(s[-1])] += 1
ans = 0
for i in range(1,10):
for j in range(1,10):
ans += t[i][j]*t[j][i]
print(ans)
| 1 | 86,432,148,530,310 | null | 234 | 234 |
a,b,c,d = map(int, input().split())
if a >=0:
if c > 0:
print(b * d)
elif d < 0:
print(a * d)
else:
print(b*d)
elif a < 0 and b >= 0:
if c >= 0:
print(b * d)
elif d <= 0:
print(a * c)
else:
ac = a * c
bd = b * d
if ac >= bd:
print(ac)
else:
print(bd)
else:
if c >= 0:
print(b * c)
elif d <= 0:
print(a * c)
else:
print(a * c)
|
import math
A,B = map(int,input().split())
flag = True
for i in range(1,1010):
if math.floor(i*0.08) == A and math.floor(i*0.1)==B:
print(i)
flag = False
break
if flag:
print(-1)
| 0 | null | 29,588,100,117,202 | 77 | 203 |
n,m = map(int,input().split())
wa = [0] * 10**6
ac = [0] * 10**6
ans = 0
for i in range(m):
str_p,str_m = map(str,input().split())
p = int(str_p)
if str_m =='WA':
if ac[p] == 0:
wa[p] += 1
else:
if ac[p] == 0:
ac[p] = 1
ans += wa[p]
print(sum(ac),ans)
|
def shuffle(index):
global a
a = a[index:]+a[:index]
while True:
a = input()
if a == '-':
break
for i in range(int(input())):
shuffle(int(input()))
print(a)
| 0 | null | 47,679,749,013,130 | 240 | 66 |
#coding:utf-8
#1_5_B
def merge_sort(array):
if len(array) > 1:
L, countL = merge_sort(array[0:len(array)//2])
R, countR = merge_sort(array[len(array)//2:])
return merge(L, R, countL+countR)
if len(array) == 1:
return [array, 0]
def merge(L, R, count=0):
L.append(10**9+1)
R.append(10**9+1)
response = []
i = 0
j = 0
for k in range(len(L)-1 + len(R)-1):
if L[i] <= R[j]:
response.append(L[i])
i += 1
count += 1
else:
response.append(R[j])
j += 1
count += 1
return [response, count]
n = int(input())
S = list(map(int, input().split()))
numbers, count = merge_sort(S)
print(*numbers)
print(count)
|
li1 = []
li2 = []
ans = 0
for i, s in enumerate(input()):
if s == "\\":
li1.append(i)
elif s == "/" and li1:
j = li1.pop()
c = i - j
ans += c
while li2 and li2[-1][0] > j:
c += li2[-1][1]
li2.pop()
li2.append((j, c))
print(ans)
if li2:
print(len(li2), *list(zip(*li2))[1])
else:
print(0)
| 0 | null | 89,096,837,412 | 26 | 21 |
import sys
sys.setrecursionlimit(300000)
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
X, K, D = MI()
if abs(X) >= K * D:
print(abs(X) - K * D)
else:
a = abs(abs(X) - (abs(X) // D) * D)
K -= (abs(X) // D)
if K % 2 == 0:
print(a)
else:
print(abs(a - D))
|
first_place, K, Distance = map(int, input().split())
first_place = abs(first_place)
test = first_place
if first_place - Distance*K > 0:
print(first_place -Distance*K)
else:
for i in range(1,K+1):
test -= Distance
if test <= 0:
a = i
#print(a)
break
if (K-a)%2 == 0 or K-a == 0:
print(abs(first_place - Distance*a))
else:
print(abs(first_place - Distance*(a-1)))
| 1 | 5,213,420,463,450 | null | 92 | 92 |
S = input()
T = input()
s = len(S)
t = len(T)
T_1 = T[:-1]
if S == T_1:
if t == s+1:
print('Yes')
else:
print('No')
else:
print('No')
|
s = input()
t = input()
flag = True
for i in range(len(s)):
if s[i] is not t[i]:
flag = False
if flag is True:
print("Yes")
else:
print("No")
| 1 | 21,313,640,054,044 | null | 147 | 147 |
a, b = map(int, input().split())
S = a*b
L = 2*(a+b)
print(S,L)
|
input = raw_input()
s = int(input.split()[0])
l = int(input.split()[1])
ans_1 = s*l
ans_2 = 2*(s+l)
print str(ans_1)+" "+str(ans_2)
| 1 | 300,785,195,760 | null | 36 | 36 |
n=int(input())
a=list(map(int,input().split()))
q=int(input())
bc=[list(map(int,input().split())) for i in range(q)]
d=[0 for i in range(pow(10,5)+1)]
s=sum(a)
for i in range(n):
d[a[i]]+=1
for i in range(q):
s+=(bc[i][1]-bc[i][0])*d[bc[i][0]]
print(s)
d[bc[i][1]]+=d[bc[i][0]]
d[bc[i][0]]=0
|
input()
aa = list(map(int, input().split()))
state = {(0,False)}
skipmax = len(aa)%2 + 1
state_all = {(i, True) for i in range(skipmax+1)}.union({(j, False) for j in range(skipmax+1)})
dp_0 = {a:None for a in state_all }
dp_0[(0,False)] = 0
skipcount = 0
def getmax(a, b):
if a is None:
return b
if b is None:
return a
return max(a,b)
for i,a in enumerate(aa):
dp_1 = {}
for s in state_all:
if s[1] & (dp_0[(s[0], False)] is not None):
dp_1[s] = dp_0[(s[0], False)] + a
continue
dp_1[s] = getmax(dp_0[(s[0], True)], dp_0.get((s[0]-1, False), None))
dp_0 = dp_1.copy()
if len(aa)%2:
print(getmax(dp_0[(2,True)], dp_0[(1,False)]))
else:
print(getmax(dp_0[(1,True)], dp_0[(0,False)]))
| 0 | null | 24,822,031,971,648 | 122 | 177 |
a = input()
if "A" <= a <= "Z":
print("A")
else:
print("a")
|
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = map(int, input().split())
ans = sum(a)
a_c = Counter(a)
for i in range(q):
b_num = a_c[b[i]]
ans += (c[i] - b[i]) * b_num
a_c[c[i]] += b_num
a_c[b[i]] = 0
print(ans)
| 0 | null | 11,781,598,106,420 | 119 | 122 |
s=input()
t=input()
ans=len(t)
for i in range(len(s)):
if i+len(t)>len(s):break
anss=0
for j in range(len(t)):
if t[j]!=s[i+j]:anss+=1
ans=min(ans,anss)
print(ans)
|
S =input()
T =input()
min = 1000
for i in range(len(S)-len(T)+1):
count = 0
for j in range(len(T)):
if S[i+j] != T[j]:
count += 1
if count > min:
break
if count < min:
min = count
print(min)
| 1 | 3,659,986,830,932 | null | 82 | 82 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve(N, K, AS):
for i in range(K, N):
# debug("i: i,AS[i-K],AS[K]", i, AS[i-K], AS[K])
if AS[i - K] < AS[i]:
print("Yes")
else:
print("No")
def main():
# parse input
N, K = map(int, input().split())
AS = list(map(int, input().split()))
solve(N, K, AS)
# tests
T1 = """
5 3
96 98 95 100 20
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
Yes
No
"""
T3 = """
15 7
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9
"""
TEST_T3 = """
>>> as_input(T3)
>>> main()
Yes
Yes
No
Yes
Yes
No
Yes
Yes
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
main()
|
def main():
n,k = map(int,input().split())
a = [int(i) for i in input().split()]
"""
ruiseki = [1]
for i in range(n):
ruiseki.append(ruiseki[-1]*a[i])
#ruiseki.pop(0)
ans = [ruiseki[k]/ruiseki[0]]
for i in range(k+1,n+1):
tmp = ruiseki[i]/ruiseki[i-k]
if ans[-1] >= tmp:
print('No')
else:
print('Yes')
ans.append(tmp)
"""
for i in range(k,n):
if a[i]>a[i-k]:
print('Yes')
else:
print('No')
main()
| 1 | 7,149,928,380,922 | null | 102 | 102 |
def main():
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
#main code here!
x,y=MI()
ans=0
if x<=3:
ans+=(4-x)*(10**5)
if y<=3:
ans+=(4-y)*(10**5)
if x==1 and y==1:
ans+=4*10**5
print(ans)
if __name__=="__main__":
main()
|
INF = 10**9 + 7
def main():
N, M, X = (int(i) for i in input().split())
CA = [[int(i) for i in input().split()] for j in range(N)]
ans = INF
for bit in range(1 << N):
wakaru = [0]*M
cur = 0
for i in range(N):
if bit & (1 << i):
c, *A = CA[i]
cur += c
for j in range(M):
wakaru[j] += A[j]
if all(m >= X for m in wakaru):
ans = min(ans, cur)
if ans == INF:
print(-1)
else:
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 81,628,553,393,282 | 275 | 149 |
x=list(map(int,input().split()))
for k in range(5):
if x[k]==0:
print(k+1)
else:
continue
|
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)
| 0 | null | 61,072,736,019,724 | 126 | 252 |
N = int(input())
A = list(map(int,input().split()))
A = sorted(A,reverse=True)
ans = A[0]
for i in range(1,(N-2)//2+1):
ans += A[i]*2
if N % 2 == 1:
ans += A[(N-2)//2 + 1]
print(ans)
|
X, Y = [int(arg) for arg in input().split()]
def f(X, Y):
for i in range(X + 1):
for j in range(X + 1):
kame = i
tsuru = j
if kame + tsuru == X and kame * 4 + tsuru * 2 == Y:
return 'Yes'
return 'No'
print(f(X, Y))
| 0 | null | 11,480,370,410,652 | 111 | 127 |
N=int(input())
A=[int(i) for i in input().split()]
C=0
for i in range(N):
minj=i
for j in range(i,N):
if A[j]<A[minj]:
minj=j
if i!=minj:
t=A[i]
A[i]=A[minj]
A[minj]=t
C+=1
# print(minj)
for i in range(N):
A[i]=str(A[i])
print(" ".join(A))
print(C)
|
def InsertionSort(a, N, Gap):
c = 0
for i in range(Gap, N):
v = a[i]
j = i - Gap
while j >= 0 and a[j] > v:
a[j+Gap] = a[j]
j -= Gap
c += 1
a[j+Gap] = v
return a, c
def ShellSort(a, N):
cnt = 0
G = [1]
for i in range(1, N):
if (3*G[i-1]+1) <= N:
G.append(3*G[i-1]+1)
else:
break
for g in G[::-1]:
a, c = InsertionSort(a, N, g)
cnt += c
return a, cnt, G
N = int(input())
A = []
cnt = 0
for _ in range(N):
A.append(int(input()))
sorted_A, cnt, G = ShellSort(A, N)
print(len(G))
print(*G[::-1])
print(cnt)
print(*sorted_A, sep="\n")
| 0 | null | 25,322,473,504 | 15 | 17 |
import sys
from itertools import accumulate
n = int(sys.stdin.buffer.readline())
a = list(map(int, sys.stdin.buffer.readline().split()))
aa = list(accumulate(a))
MOD = 10**9+7
ans = 0
for i in range(n):
ans += a[i]*(aa[n-1] - aa[i])
print(ans%MOD)
|
n = int(input())
S = list(input())
ans = 0
for i in range(len(S)-2):
if S[i] == "A":
if S[i+1] == "B":
if S[i+2] == "C":
ans += 1
print(ans)
| 0 | null | 51,426,896,405,372 | 83 | 245 |
N,K = map(int, input().split())
LR = list(tuple(map(int, input().split())) for _ in range(K))
S = [0]*(N+1)
S[1] = 1
for k in range(2, N+1):
s = 0
for l,r in LR:
p0,p1 = max(k-r-1, 0), max(k-l, 0)
s += S[p1] - S[p0]
S[k] = (S[k-1] + s)%998244353
print((S[-1] - S[-2])%998244353)
|
N, K = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(K)]
# dpの高速化 => 累積和によって、O(N)で解く
dp = [0] * N
acc = [0]* (N+1)
dp[0], acc[1] = 1, 1
# acc[0] = 0
# acc[1] = dp[0]
# acc[2] = dp[0] + dp[1]
# acc[n] = dp[0] + dp[1] + dp[n-1]
# dp[0] = acc[1] - acc[0]
# dp[1] = acc[2] - acc[1]
# dp[n-1] = acc[n] - acc[n-1]
mod = 998244353
for i in range(1, N):
# acc[i] = dp[0] + ... + dp[i-1] が既知
# 貰うdp
for j in range(K):
r = i - X[j][0]
l = i - X[j][1]
if r < 0: continue
l = max(l, 0)
dp[i] += acc[r+1] - acc[l] # s = dp[L] + ... + dp[R]
dp[i] %= mod
acc[i+1] = acc[i] + dp[i] # acc[i+1] = dp[0] + ... + dp[i]
print(dp[N-1])
| 1 | 2,670,002,004,670 | null | 74 | 74 |
import sys
input = sys.stdin.readline
def main():
n,k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(k,n):
if A[i] > A[i-k]:
print('Yes')
else:
print('No')
main()
|
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
# zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
{
print('Yes' if scores[index] < new else 'No')
for index, new in enumerate(scores[k:])}
if __name__ == '__main__':
main()
| 1 | 7,085,539,388,598 | null | 102 | 102 |
def minkovsky(A,B,n = 0):
C = [abs(a - b) for a , b in zip(A,B)]
if n == 0:
return max(C)
else:
d = 0
for c in C:
d += c ** n
d = d ** (1 / n)
return d
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
print(minkovsky(A,B,1))
print(minkovsky(A,B,2))
print(minkovsky(A,B,3))
print(minkovsky(A,B))
|
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)
| 0 | null | 13,172,983,785,870 | 32 | 157 |
n = int(input())
s = input()
cnt = 0
for i in range(10):
a = s.find(str(i))
if a == -1:
continue
for j in range(10):
b = s.find(str(j), a + 1)
if b == -1:
continue
for k in range(10):
c = s.find(str(k), b + 1)
if c != -1:
cnt += 1
print(cnt)
|
N,K,S = map(int,input().split())
cur = 1 if S==10**9 else S+1
ans = [S]*K +[cur]*(N-K)
print(*ans)
| 0 | null | 109,799,927,368,770 | 267 | 238 |
import math
a, b = map(int, input().split())
if a%b == 0:
ans = a
elif b%a == 0:
ans = b
else:
ans = int(a*b / math.gcd(a, b))
print(ans)
|
import math
A,B=map(int,input().split())
print(A*B//math.gcd(A,B))
| 1 | 113,675,944,171,358 | null | 256 | 256 |
n = list(map(int,input().split()))
m = []
for i in range(2):
m.append(n[0])
n.pop(0)
n.append(m[0])
n.append(m[1])
print(*n)
|
n = int(input())
ans = ""
for i in range(1,n+1):
if (i % 3 == 0 or '3' in str(i)) :
ans += " " + str(i)
print(ans)
| 0 | null | 19,616,789,556,980 | 178 | 52 |
def main():
h1, m1, h2, m2, k = map(int, input().split())
a = h1*60+m1
b = h2*60+m2
print(b-a-k)
if __name__ == "__main__":
main()
|
N=int(input())
L=list(map(int, input().split()))
count=0
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
L2=[L[i],L[j],L[k]]
L2.sort()
if L2[0]+L2[1]>L2[2] and L2[0] != L2[1] and L2[1] != L2[2] and L2[2] != L2[0]:
count+=1
print(count)
| 0 | null | 11,492,349,457,562 | 139 | 91 |
h1,m1,h2,m2,k = map(int,input().split())
a1 = h1*60+m1
a2 = h2*60+m2
print(a2-a1-k)
|
n = int(input())
n1 = n//2
s = input()
s1 = s[n1:]
s2 = s[:n1]
if n % 2 != 0:
print('No')
else:
if s1 == s2:
print('Yes')
else:
print('No')
| 0 | null | 82,671,997,848,508 | 139 | 279 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.