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
|
|---|---|---|---|---|---|---|
input();print(input().count('ABC'))
|
N=int(input())
S=input()
count=0
for i in range(N):
if S[i]=='A' and i!=N-1:
if S[i+1]=='B' and i!=N-2:
if S[i+2]=='C':
count+=1
print(count)
| 1 | 99,437,487,622,158 | null | 245 | 245 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,K = MI()
A = LI()
from itertools import accumulate
for _ in range(min(K,100)):
B = [0]*(N+1)
for i in range(N):
a = A[i]
B[max(i-a,0)] += 1
B[min(N,i+a+1)] -= 1
C = list(accumulate(B))
A = C
print(*[A[i] for i in range(N)])
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
c=[0]*n
cnt=0
while cnt<min(k,101):
cnt+=1
for i in range(n):
b[max(0,i-a[i])]+=1
if i+a[i]<n-1:
b[i+a[i]+1]-=1
c[0]=b[0]
for j in range(n-1):
c[j+1]=c[j]+b[j+1]
a=c
b=[0]*n
c=[0]*n
print(*a)
| 1 | 15,480,177,198,290 | null | 132 | 132 |
from collections import Counter
N = int(input())
*D, = map(int, input().split())
mod = 998244353
c = Counter(D)
v = max(D)
if c[0]!=1 or D[0]!=0:
print(0)
else:
ans = 1
for i in range(1, v+1):
ans *= pow(c[i-1], c[i], mod)
ans %= mod
print(ans)
|
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 998244353
def resolve():
n = int(input())
D = list(map(int, input().split()))
MAX_L = max(D) + 1
cnt = [0] * MAX_L
for d in D:
cnt[d] += 1
if cnt[0] != 1 or D[0] != 0:
print(0)
exit()
res = 1
for i in range(1, MAX_L):
if cnt[i] == 0:
print(0)
break
res *= pow(cnt[i - 1], cnt[i], mod)
res %= mod
else:
print(res)
if __name__ == '__main__':
resolve()
| 1 | 154,639,894,874,528 | null | 284 | 284 |
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readlines
infty = 2 ** 20
lines = input()
n, m = list(map(int, lines[0].split()))
coin = list(map(int, lines[1].split()))
T = [[0] * (n+1) for i in range(m+1)]
#0行目の初期化
for i in range(1, n+1):
T[0][i] = infty
#0列目の初期化
for i in range(m+1):
T[i][0] = 0
#1行目の初期化
for i in range(1, n+1):
T[1][i] = i
cnt = 0
for i in range(1, m+1):
if coin[i-1] > n:
continue
else:
cnt += 1
for j in range(1, n+1):
if j < coin[i-1]:
T[i][j] = T[i-1][j]
else:
a = T[i-1][j] ; b = T[i][j-coin[i-1]]+1
if a < b:
T[i][j] = a
else:
T[i][j] = b
print(T[cnt][n])
|
n,m=map(int,raw_input().split())
c=map(int,raw_input().split())
dp=[[0]+[float('inf')]*n]+[[0]+[float('inf')]*n for i in xrange(m)]
for i in xrange(m):
for j in xrange(n+1):
if c[i]>j:
dp[i+1][j]=dp[i][j]
else:
dp[i+1][j]=min(dp[i][j],dp[i+1][j-c[i]]+1)
print(dp[m][n])
| 1 | 137,647,492,512 | null | 28 | 28 |
h1, m1, h2, m2, k = map(int, input().split())
h = (h2 * 60 + m2) - (h1 * 60 + m1)
ans = h - k
print(ans)
|
X = input()
print("".join(list(X)[0:3]))
| 0 | null | 16,396,847,994,590 | 139 | 130 |
s = input()
k = int(input())
di = []
cnt = 1
ans = 0
if len(s) > 1:
for i in range(1,len(s)):
if s[i] == s[i-1]:
cnt += 1
else:
di.append(cnt)
cnt = 1
di.append(cnt)
if di[0] != len(s):
for j in di:
ans += j//2
ans *= k
if s[0] == s[-1] and di[-1] % 2 == 1 and di[0] % 2 == 1:
ans += k - 1
else:
ans = k*len(s)//2
else:
ans = k//2
print(ans)
|
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,S = MI()
A = [0] + LI()
mod = 998244353
dp = [[0]*(S+1) for _ in range(N+1)]
dp[0][0] = 1
for i in range(1,N+1):
for j in range(S+1):
if j >= A[i]:
dp[i][j] = 2*dp[i-1][j] + dp[i-1][j-A[i]]
dp[i][j] %= mod
else:
dp[i][j] = 2*dp[i-1][j]
dp[i][j] %= mod
print(dp[-1][-1])
| 0 | null | 96,383,277,279,338 | 296 | 138 |
x = input().split()
a = int(x[0])
b = int(x[1])
if a == b :
print('a == b')
elif a > b :
print('a > b')
else :
print('a < b')
|
# Aizu Problem ITP_1_2_A: Small, Large or Equal
#
import sys, math, os
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
a, b = [int(_) for _ in input().split()]
if a < b:
print("a < b")
elif a > b:
print("a > b")
else:
print("a == b")
| 1 | 358,205,775,368 | null | 38 | 38 |
score = list(map(int,input().split()))
amari = score[0] % score[1]
kouho = score[1] - amari
if amari < kouho:
print(amari)
else:
print(kouho)
|
[N, K] = [int(i) for i in input().split()]
print(min(N%K, -N%K))
| 1 | 39,429,512,594,902 | null | 180 | 180 |
K,N=map(int,input().split())
A=list(map(int,input().split()))
l=[]
A.append(A[0]+K)
for i in range(N):
l.append(A[i+1]-A[i])
print(K-max(l))
|
k, n = map(int, input().split())
a = sorted(list(map(int, input().split())))
x = [(a[i]-a[i-1]) for i in range(1,n)]
x.append(k-a[n-1]+a[0])
y=sorted(x)
print(sum(y[:-1]))
| 1 | 43,571,104,204,892 | null | 186 | 186 |
INFTY = 10 ** 10
import queue
def bfs(s):
q = queue.Queue()
q.put(s)
d = [INFTY] * n
d[s] = 0
while not q.empty():
u = q.get()
for v in range(n):
if M[u][v] == 0:
continue
if d[v] != INFTY:
continue
d[v] = d[u] + 1
q.put(v)
for i in range(n):
if d[i] == INFTY:
print(i+1, -1)
else:
print(i+1, d[i])
n = int(input())
M = [[0] * n for _ in range(n)]
for i in range(n):
nums = list(map(int, input().split()))
u = nums[0] - 1
k = nums[1]
for j in range(k):
v = nums[j+2] - 1
M[u][v] = 1
bfs(0)
|
import statistics
N = int(input())
AB = [map(int, input().split()) for _ in range(N)]
A, B = [list(i) for i in zip(*AB)]
A_median = statistics.median(A)
B_median = statistics.median(B)
if N%2==0:
print(int((B_median-A_median)*2)+1)
else:
print(B_median-A_median+1)
| 0 | null | 8,731,370,523,402 | 9 | 137 |
H,N=map(int,input().split())
A=[0]*N
B=[0]*N
for i in range(N):
A[i],B[i]=map(int,input().split())
dp = [99999999999]*(H+1)
dp[0]=0
for h in range(H):
for i in range(N):
dp[min(H,h+A[i])]=min(dp[h] + B[i], dp[min(H,h+A[i])])
print(dp[-1])
|
h, n = map(int,input().split())
a = [0 for i in range(n)]
b = [0 for i in range(n)]
for i in range(n):
ai ,bi = map(int,input().split())
a[i] = ai
b[i] = bi
mh = [0 for i in range(10003)]
for i in range(1,h+1):
mb = 10**9
for j in range(n):
if mb > mh[i-a[j]] + b[j]:
mb = mh[i-a[j]] + b[j]
mh[i] = mb
print(mh[h])
| 1 | 81,099,651,704,350 | null | 229 | 229 |
x = [1,2,3,4,5,6,7,8,9]
y = [1,2,3,4,5,6,7,8,9]
for w in x :
for c in y :
print(w,"x",c,"=",w*c,sep="")
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
S = list(input())
from collections import Counter
c = Counter(S)
ans = c['R']*c['G']*c['B']
for i in range(1, N):
for j in range(N):
first, second, third = j, j+i, j+i*2
if third>=N:
break
if len(set((S[first], S[second], S[third])))==3:
ans -= 1
print(ans)
| 0 | null | 17,980,609,797,972 | 1 | 175 |
from sys import stdin
def main():
a, b, c = map(int, input().split())
if (a == b) and (a != c):
print("Yes")
elif (b == c) and (a != c):
print("Yes")
elif (a == c) and (a != b):
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
n, k = map(int, input().split())
l = [0] * n
for i in range(k):
d = int(input())
a = list(map(int, input().split()))
for j in range(d):
l[a[j] - 1] += 1
count = 0
for i in range(n):
if l[i] == 0:
count += 1
print(count)
| 0 | null | 46,463,324,359,442 | 216 | 154 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def main():
l,r,d = LI()
return r // d - (l-1) // d
print(main())
|
import math
k,n= map(int,input().split())
a = list(map(int,input().split()))
ans = a[0]+k-a[n-1]
for i in range(1,len(a)):
s = a[i]-a[i-1]
ans =max(ans,s)
print(k-ans)
| 0 | null | 25,499,030,129,910 | 104 | 186 |
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import gcd, sin, cos, tan, asin, acos, atan, degrees, radians
sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7
def lcm(x,y):
return x*y//gcd(x,y)
def lgcd(l):
return reduce(gcd,l)
def llcm(l):
return reduce(lcm,l)
def powmod(n,i,mod):
return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod)
def div2(x):
return x.bit_length()
def div10(x):
return len(str(x))-(x==0)
def intput():
return int(input())
def mint():
return map(int,input().split())
def lint():
return list(map(int,input().split()))
def ilint():
return int(input()), list(map(int,input().split()))
def judge(x, l=['Yes', 'No']):
print(l[0] if x else l[1])
def lprint(l, sep='\n'):
for x in l:
print(x, end=sep)
def ston(c, c0='a'):
return ord(c)-ord(c0)
def ntos(x, c0='a'):
return chr(x+ord(c0))
class counter(dict):
def __init__(self, *args):
super().__init__(args)
def add(self,x,d=1):
self.setdefault(x,0)
self[x] += d
def list(self):
l = []
for k in self:
l.extend([k]*self[k])
return l
class comb():
def __init__(self, n, mod=None):
self.l = [1]
self.n = n
self.mod = mod
def get(self,k):
l,n,mod = self.l, self.n, self.mod
k = n-k if k>n//2 else k
while len(l)<=k:
i = len(l)
l.append(l[i-1]*(n+1-i)//i if mod==None else (l[i-1]*(n+1-i)*powmod(i,-1,mod))%mod)
return l[k]
def pf(x):
C = counter()
p = 2
while x>1:
k = 0
while x%p==0:
x //= p
k += 1
if k>0:
C.add(p,k)
p = p+2-(p==2) if p*p<x else x
return C
X,Y=mint()
if (X+Y)%3!=0:
print(0)
exit()
k=abs(X-Y)
N=min(X,Y)-k
if N<0:
print(0)
exit()
n=2*(N//3)+k
C=comb(n,MOD)
print(C.get(N//3))
|
def dfs(v, time_, d, f, dp):
if d[v] == 0:
d[v] = time_
for i in range(len(dp[v])):
if d[dp[v][i]] == 0:
time_ = dfs(dp[v][i], time_ + 1, d, f, dp)
f[v] = time_ + 1
return time_ + 1
def main():
N = int(input())
dp = [[] for i in range(N)]
for i in range(N):
line = [int(k) for k in input().split()]
for j in range(len(line)):
if j == 0 or j == 1:
continue
dp[line[0] - 1].append(line[j] - 1)
d = [0] * N
f = [0] * N
time_ = 1
for i in range(N):
if d[i] == 0:
time_ = dfs(i, time_, d, f, dp)
time_ += 1
for i in range(N):
print(i + 1, d[i], f[i])
if __name__ == '__main__':
main()
| 0 | null | 75,265,143,534,304 | 281 | 8 |
S, T = [i for i in input().split()]
A, B = map(int, input().split())
U = input()
if U == S:
A -= 1
elif U == T:
B -= 1
print(str(A) + " " + str(B))
|
input = raw_input()
for i in xrange(len(input)):
# print "i = " + str(i) + ", input[i] = " + input[i]
if input[i].islower():
input = input[:i] + input[i].upper() + input[i + 1:]
elif input[i].isupper():
input = input[:i] + input[i].lower() + input[i + 1:]
print input
| 0 | null | 36,557,609,101,252 | 220 | 61 |
while True:
a = input()
if a == '0':
break
print(sum(map(int,*a.split())))
|
while True:
a = input()
if a == "0":
break
print(sum([int(a[i]) for i in range(len(a))]))
| 1 | 1,576,921,426,720 | null | 62 | 62 |
def main():
s = input()
n = len(s)
rule1 = True
rule2 = True
rule3 = True
for i in range(n):
if s[i] != s[n - 1 - i]:
rule1 = False
break
for i in range(n // 2):
if s[i] != s[n // 2 - 1 - i]:
rule2 = False
break
for i in range(n // 2):
if s[n // 2 + 1 + i] != s[n - 1 - i]:
rule3 = False
break
if rule1 and rule2 and rule3:
ans = "Yes"
else:
ans = "No"
print(ans)
if __name__ == "__main__":
main()
|
#-*-coding:utf-8-*-
def main():
string = input()
answer=""
for s in string:
if s.islower()==True:
answer+=s.upper()
elif s.isupper():
answer+=s.lower()
else:
answer+=s
print(answer)
if __name__=="__main__":
main()
| 0 | null | 23,943,608,014,910 | 190 | 61 |
n = int(input())
A = list(map(int, input().split()))
p = []
for i, v in enumerate(A):
p.append((v, i))
p.sort(reverse=True)
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(n):
k = p[i][0]
r = p[i][1]
for x in range(i + 1):
y = i - x
dp[x + 1][y] = max(dp[x + 1][y], dp[x][y] + abs(r - x) * k)
dp[x][y + 1] = max(dp[x][y + 1], dp[x][y] + abs(r - (n - 1 - y)) * k)
ans = 0
for i in range(n):
ans = max(ans, dp[i][n-i])
print(ans)
|
N=int(input())
A=sorted(list(map(int,input().split())))
m=A[-1]
dp=[True]*m
ans,p,q=0,0,False
for a in A:
if p==a and q:
ans-=1
q=False
if dp[a-1]:
p,q=a,True
ans+=1
aa=a
while m>=aa:
dp[aa-1]=False
aa+=a
print(ans)
| 0 | null | 24,048,153,478,482 | 171 | 129 |
def resolve():
x, y, z = list(map(int, input().split()))
print(f'{z} {x} {y}')
resolve()
|
def ABC_swap():
# 入力
X, Y, Z = map(int, input().split())
A = X
B = Y
C = Z
# 入れ替え処理
A, B = B, A
A, C = C, A
# 表示
print(A, B, C)
ABC_swap()
| 1 | 38,042,811,927,756 | null | 178 | 178 |
n,m,q=map(int,input().split())
def dfs(seq):
u=0
if len(seq)==n:
ans=0
for a,b,c,d in data:
if seq[b-1]-seq[a-1]==c:
ans+=d
return ans
else:
for i in range(seq[-1],m+1):
seq_next=seq.copy()
seq_next.append(i)
u=max(u,dfs(seq_next))
return u
data=[]
for _ in range(q):
A=list(map(int,input().split()))
data.append(A)
print(dfs([1]))
|
n, t = map(int, input().split())
a = [tuple(map(int, input().split())) for _ in range(n)]
dp = [[0] * t for _ in range(n)]
ans = 0
a.sort()
for i in range(n-1):
for j in range(t):
if j - a[i][0] < 0:
dp[i + 1][j] = dp[i][j]
else:
dp[i + 1][j] = max(dp[i][j], dp[i][j - a[i][0]] + a[i][1])
ans = max(ans, dp[i + 1][-1] + a[i+1][1])
print(ans)
| 0 | null | 89,771,876,466,750 | 160 | 282 |
import math
h=[int(input())for _ in range(2)]
n=int(input())
print(math.ceil(n/max(h)))
|
import itertools
N, K = map(int, input().split())
d = []
A = []
for i in range(K):
d.append(int(input()))
A.append(list(map(int, input().split())))
A = list(itertools.chain.from_iterable(A))
ans = 0
for i in range(1, N + 1):
if i in A:
continue
else:
ans += 1
print(ans)
| 0 | null | 56,551,113,091,298 | 236 | 154 |
n, m, l = map(int, raw_input().split(" "))
a = [[0 for i in range(m)] for j in range(n)]
b = [[0 for k in range(l)] for i in range(m)]
for j in range(n):
a[j] = map(int, raw_input().split(" "))
for i in range(m):
b[i] = map(int, raw_input().split(" "))
c = [[0 for k in range(l)] for j in range(n)]
for j in range(n):
for k in range(l):
for i in range(m):
c[j][k] += a[j][i] * b[i][k]
for j in range(n):
print " ".join(map(str, (c[j])))
|
n = int(input())
al = list(map(int,input().split()))
kabu = 0
money = 1000
for i in range(n-1):
if al[i] < al[i+1]:
# 全部売る
money += kabu * al[i]
kabu = 0
# 全部買う
kabu += money // al[i]
money = money % al[i]
else:
# 全部売る
money += kabu * al[i]
kabu = 0
print(money+ kabu*al[-1])
| 0 | null | 4,368,268,571,510 | 60 | 103 |
x,n= map(int,input().split())
p = list(map(int,input().split()))
ans=0
i=0
while True:
if x-i not in p:
ans=x-i
break
elif x+i not in p:
ans=x+i
break
else:
i+=1
continue
print(ans)
|
a,b,c,k = list(map(int,input().split()))
ans = 0
if a >= k:
print(k)
elif a+b >= k:
print(a)
else:
ans += a
k -= (a+b)
ans -= k
print(ans)
| 0 | null | 18,111,900,141,010 | 128 | 148 |
x = int(input())
l = [i**5 for i in range(1000)]
for i in range(len(l)-1):
for j in range(i+1,len(l)):
if l[j]-l[i]==x:
print(int(l[j]**(1/5)),int(l[i]**(1/5)))
exit()
if l[j]+l[i]==x:
print(int(l[j]**(1/5)),-int(l[i]**(1/5)))
exit()
print('Not found')
|
s = "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"
S = s.split(", ")
k = int(input())
print(S[k-1])
| 0 | null | 37,865,151,716,860 | 156 | 195 |
import sys
input = sys.stdin.readline
N = int(input())
musics = []
for _ in range(N):
s, t = input().split()
musics.append((s.strip(), int(t)))
X = input().strip()
ans = 0
flag = False
for s, t in musics:
if flag:
ans += t
if s == X:
flag = True
print(ans)
|
def main():
musics = int(input())
title = []
time = []
for _ in range(musics):
s, t = input().split()
title.append(s)
time.append(int(t))
last_song = input()
for i in range(musics):
if title[i] == last_song:
print(sum(time[i + 1:]))
break
if __name__ == '__main__':
main()
| 1 | 96,939,156,029,880 | null | 243 | 243 |
n = int(input())
print(n**3/27)
|
num = int(input())
number = num / 3
print(number * number * number)
| 1 | 47,050,427,525,630 | null | 191 | 191 |
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = sum(a)/(4*m)
cnt = 0
for i in a:
if b <= i:
cnt += 1
if cnt >= m:
print("Yes")
exit()
print("No")
|
N, M = map(int, input().split())
aaa = list(map(int, input().split()))
acc = sum(aaa)
print('Yes' if sum(4 * M * a >= acc for a in aaa) >= M else 'No')
| 1 | 38,774,133,177,440 | null | 179 | 179 |
K = int(input())
S = input()
X = len(S)
mod = 10**9+7
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 = 2*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 )
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
A = 0
B = K
temp = cmb(A+X-1,X-1,mod)*power(25,A,mod)
temp %= mod
temp *= power(26,B,mod)
temp %= mod
ans = temp
for i in range(X+1,K+X+1):
temp *= 25
temp %= mod
temp *= pow(26, mod-2, mod)
temp %= mod
temp *= i-1
temp %= mod
temp *= pow(i-X, mod-2, mod)
temp %= mod
ans += temp
ans %= mod
print(ans)
|
N = int(input())
S = input()
r,g,b = S.count('R'),S.count('G'),S.count('B')
#rgbでr,g,bがすべて異なる組み合わせ数
total = r*g*b
# そこからj-i=k-jの組み合わせを引く
for i in range(0,N-2):
for j in range(i+1,N-1):
k = 2*j-i
if k >= N: break;
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
total-=1
# flg = [[[0 for i in range(N)] for j in range(N)] for k in range(N)]
print(total)
| 0 | null | 24,459,626,537,620 | 124 | 175 |
N,R = map(int,input().split())
print((R,R +100*(10-N))[N<=10])
|
n,a,b = map(int,input().split())
if n%(a+b)<=a:
print(n//(a+b)*a+n%(a+b))
else:
print(n//(a+b)*a+a)
| 0 | null | 59,334,037,424,840 | 211 | 202 |
import sys
while 1:
H,W=map(int,raw_input().split())
if H==0 and W==0:
break;
else:
for h in range(H):
for w in range(W):
if h == 0 or w == 0 or h == H-1 or w == W-1 :
sys.stdout.write('#')
else:
sys.stdout.write('.')
sys.stdout.write('\n')
sys.stdout.write('\n')
|
H, W = map(int, raw_input().split())
while H | W != 0:
for i in range(H):
if i == 0 or i == H - 1:
print '#' * W
else:
print '#' + '.' * (W - 2) + '#'
print ''
H, W = map(int, raw_input().split())
| 1 | 823,174,646,752 | null | 50 | 50 |
N,K = map(int,input().split())
p = list(map(int,input().split()))
l = []
for i in range(N):
l.append(((1+p[i])*(p[i]/2))/p[i])
que = [0]*(N+1)
for i in range(1,N+1):
que[i] = l[i-1]+que[i-1]
ans = 0
for i in range(K,len(l)):
ans = max(ans,que[i+1]-que[i+1-K])
if N == K:
print(max(que))
else:
print(ans)
|
N, K = map(int, input().split())
p=list(map(int,input().split()))
for i in range(N):
p[i]=(1+p[i])/2
ans=[0]*(N-K+1)
ans[0]=sum(p[:K])
for i in range(1, N-K+1):
ans[i]=ans[i-1]-p[i-1]+p[i+K-1]
print(max(ans))
| 1 | 74,821,103,754,610 | null | 223 | 223 |
c = []
def listcreate():
global c
c = []
for y in range(a[0]):
b = []
for x in range(a[1]):
if y == 0 or y == a[0]-1 or x == 0 or x == a[1]-1:
b.append("#")
else:
b.append(".")
c.append(b)
return
def listdraw():
global c
for y in range(len(c)):
for x in range(len(c[0])):
print(c[y][x], end='')
print()
return
for i in range(10000):
a = list(map(int,input().split()))
if sum(a)==0:
break
listcreate()
listdraw()
print()
|
while True:
[h, w] = map(int, (input().split()))
if h==0 and w==0:
break
else:
print("#"*w+"\n"+("#"+"."*(w-2)+"#\n")*(h-2)+"#"*w+"\n")
| 1 | 820,751,051,910 | null | 50 | 50 |
"""
○ 角速度 = θ / t [rad/s]
・時針
ω = θ / t
= math.radians(360) / (12 * 60 * 60) [rad/s]
・分針
ω = θ / t
= math.radians(360) / (60 * 60) [rad/s]
"""
import math
def colon():
# 入力
A, B, H, M = map(int, input().split())
# 時針と分針の角速度
angular_velocity_h = math.radians(360) / (12 * 60 * 60)
angular_velocity_m = math.radians(360) / (60 * 60)
# 0時を基準に時針が何度傾いたか
radian_h = angular_velocity_h * ((H * 60 * 60) + (M * 60))
# 0時を基準に分針が何度傾いたか
radian_m = angular_velocity_m * (M * 60)
# 時針と分針の間の角度
radian_hm = abs(radian_h - radian_m)
if radian_hm > math.pi:
radian_hm = 2 * math.pi - radian_hm
elif radian_hm == math.pi:
return A + B
elif math.pi > radian_hm:
pass
# 端点の距離
distance = math.sqrt((A**2 + B**2) - (2 * A * B * math.cos(radian_hm)))
# 戻り値
return distance
result = colon()
print(result)
|
import math
def abs(num):
if num < 0:
return -num
return num
def main():
abhm = [int(_x) for _x in input().split()]
HL = abhm[0]
ML = abhm[1]
H = abhm[2]
M = abhm[3]
radian = 2.0 * math.pi * abs(M / 60.0 - (H + M / 60.0) / 12.0)
length = math.sqrt(HL * HL + ML * ML - 2 * HL * ML * math.cos(radian))
print(length)
main()
| 1 | 20,197,419,910,140 | null | 144 | 144 |
def II(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
N=II()
A=LI()
cnt=[0]*((10**6)+1)
for elem in A:
cnt[elem]+=1
unique=[]
for i in range((10**6)+1):
if cnt[i]==1:
unique.append(i)
cnt=[0]*((10**6)+1)
A=list(set(A))
for elem in A:
for m in range(elem*2,10**6+1,elem):
cnt[m]=1
ans=0
for i in unique:
if cnt[i]==0:
ans+=1
print(ans)
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
a = np.array(read().split(), np.int32)[1:]
count = np.zeros(10**6+1, np.int32)
for ae in a:
if count[ae] <= 1:
count[::ae] += 1
r = 0
for ae in a:
r += count[ae] == 1
print(r)
if __name__ == '__main__':
main()
| 1 | 14,285,569,821,864 | null | 129 | 129 |
def is_good(mid, key):
S = list(map(int, str(mid)))
N = len(S)
dp = [[[0] * 11 for _ in range(2)] for _ in range(N + 1)]
dp[1][1][10] = 1
for k in range(1, S[0]):
dp[1][1][k] = 1
dp[1][0][S[0]] = 1
for i in range(1, N):
for k in range(1, 11):
dp[i + 1][1][k] += dp[i][0][10] + dp[i][1][10]
for is_less in range(2):
for k in range(10):
for l in range(k - 1, k + 2):
if not 0 <= l <= 9 or (not is_less and l > S[i]):
continue
dp[i + 1][is_less or l < S[i]][l] += dp[i][is_less][k]
return sum(dp[N][0][k] + dp[N][1][k] for k in range(10)) >= key
def binary_search(bad, good, key):
while good - bad > 1:
mid = (bad + good) // 2
if is_good(mid, key):
good = mid
else:
bad = mid
return good
K = int(input())
print(binary_search(0, 3234566667, K))
|
import math
a,b,x = map(int,input().split())
if x <= a*a*b//2:
theta = (math.pi/2) - math.atan((2*x)/(a*b*b))
else:
theta = math.atan(2*(a*a*b-x)/(a*a*a))
degree = math.degrees(theta)
print(degree)
| 0 | null | 101,767,289,092,690 | 181 | 289 |
def solve_145e():
from collections import namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Food = namedtuple('Food', 'time_to_eat deliciousness')
N, T = map(int, input().split())
foods = []
for _ in range(N):
row = map(int, input().split())
foods.append(Food(*row))
foods.sort(key=attrgetter('time_to_eat'))
# 同じ料理の組を食べるなら時間のかかるものを後回しにしても結果は悪くならない
dp = [-1] * T
dp[0] = 0
# dp[time]:=timeに食べ終わる注文の仕方で得られる最大満足度
ma = 0 # 回答候補
ca = 0 # フィニッシュ前候補
for food in foods:
# これでフィニッシュの場合
ma = max(ma, ca + food.deliciousness)
# まだ食べる場合
for time in range(T - 1 - food.time_to_eat, -1, -1):
if ~dp[time]:
when_eat = dp[time] + food.deliciousness
if dp[time + food.time_to_eat] < when_eat:
dp[time + food.time_to_eat] = when_eat
ca = max(ca, when_eat)
print(ma)
return
if __name__ == '__main__':
solve_145e()
|
n,t= map(int, input().split())
a= [list(map(int, input().split())) for i in range(n)]
# dp[i][j]: i番目の料理まで見て時間がjの時の満足度のMAX
dpA=[[0]*t for i in range(n+1)]
# dp[i][j]: n-i番目の料理まで見て時間がjのときの満足度のMAX
dpB=[[0]*t for i in range(n+1)]
for i in range(n):
for j in range(t):
if a[i][0]>j:
dpA[i+1][j]=dpA[i][j]
else:
dpA[i+1][j]=max(dpA[i][j-a[i][0]]+a[i][1],dpA[i][j])
for i in range(n):
for j in range(t):
if a[n-i-1][0]>j:
dpB[n-i-1][j]=dpB[n-i][j]
else:
dpB[n-i-1][j]=max(dpB[n-i][j-a[n-i-1][0]]+a[n-i-1][1],dpB[n-i][j])
ans=0
for i in range(n):
for j in range(t):
ans=max(dpA[i][j]+dpB[i+1][t-j-1]+a[i][1],ans)
print(ans)
| 1 | 152,003,080,266,138 | null | 282 | 282 |
print('Yes' if '7' in input() else 'No')
|
n = input()
for i in range(len(n)):
if n[i] == '7':
print('Yes')
exit()
print('No')
| 1 | 34,385,096,614,640 | null | 172 | 172 |
def W(d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
##############################
n,w,l= map(int,input().split()) #n:頂点数 w:辺の数
d = [[10**14]*n for i in range(n)]
#d[u][v] : 辺uvのコスト(存在しないときはinf)
for i in range(w):
x,y,z = map(int,input().split())
if z>l:
continue
x=x-1
y=y-1
d[x][y] = z
d[y][x] = z
for i in range(n):
d[i][i] = 0 #自身のところに行くコストは０
D=W(d)
G=[[10**4]*n for i in range(n)]
for i in range(n):
for j in range(n):
if D[i][j]>l:
continue
G[i][j]=1
WW=W(G)
for i in range(int(input())):
a,b=map(int,input().split())
a=a-1
b=b-1
if WW[a][b]>=10**4:
print(-1)
else:
print(WW[a][b]-1)
|
#!/usr/bin/python3
# -*- coding: utf-8 -*-
# scipy version
import sys
from collections import deque
from array import array
from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import floyd_warshall
def input():
return sys.stdin.readline().rstrip('\n')
##### main
N,M,L = list(map(int, input().split()))
C = [[0]*N for _ in range(N)]
for i in range(M):
a,b,c = list(map(int, input().split()))
if c>L:
continue
C[a-1][b-1] = c
Q = int(input())
ST = [None]*Q
for i in range(Q):
s, t = list(map(int, input().split()))
ST[i] = (s-1,t-1)
dist_matrix, predecessors = floyd_warshall(csgraph=C, directed=False, return_predecessors=True)
# D[i][j] <= L となる i,j に辺を張る
for i in range(N):
for j in range(i+1,N):
if dist_matrix[i][j] <= L:
C[i][j] = 1
dist_matrix, predecessors = floyd_warshall(csgraph=C, directed=False, return_predecessors=True)
# answer
for q in range(Q):
i,j = ST[q]
step = dist_matrix[i][j]
if step > 10**9:
print(-1)
else:
print(int(step-1))
| 1 | 173,607,308,244,228 | null | 295 | 295 |
from string import ascii_uppercase as au
N = int(input())
S = input()
ans = ''
for s in S:
idx = (au.index(s) + N) % len(au)
ans += au[idx]
print(ans)
|
def main():
x, k, d = map(int, input().split())
y = abs(x) // d
if y == k:
print(abs(x) % d)
elif y < k:
if (k-y) % 2 == 0:
print(abs(x) % d)
else:
print(min(abs(abs(x) % d - d), abs(abs(x) % d + d)))
else:
print(min(abs(abs(x)-d*k), abs(abs(x)+d*k)))
if __name__ == '__main__':
main()
| 0 | null | 70,097,728,064,910 | 271 | 92 |
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
x=sum(a)%mod
y=0
for i in range(n):
y+=a[i]**2
y%=mod
z=pow(2,mod-2,mod)
print(((x**2-y)*z)%mod)
|
for number1 in range(1, 10) :
for number2 in range(1, 10) :
print(str(number1) + 'x' + str(number2) + '=' + str(number1 * number2))
| 0 | null | 1,910,319,377,860 | 83 | 1 |
#x,a=[int(x) for x in input().split]t,input()
x,a=map(int,input().split())
counter=0
while(x>0):
x-=a
counter+=1
print(counter)
|
n = int(input())
s = input()
ans = 0
for i in range(10):
for j in range(10):
for k in range(10):
fi = False
fj = False
for ss in s:
ss = int(ss)
if not fi and ss == i:
fi = True
continue
if fi and not fj and ss == j:
fj = True
continue
if fj and ss == k:
ans += 1
break
print(ans)
| 0 | null | 102,508,925,712,340 | 225 | 267 |
s = input()*2
print('Yes' if input() in s else 'No')
|
s = input()
p = input()
s = s * 2
for i in range(len(s) - len(p) + 1):
#print(s[i:i + len(p)])
if p == s[i:i + len(p)]:
print("Yes")
exit()
print("No")
| 1 | 1,717,193,070,128 | null | 64 | 64 |
print(0 if int(input()) else 1)
|
import math
def is_prime(x):
if x == 2:
return True
if (x % 2 == 0):
return False
m = math.ceil(math.sqrt(x))
for i in range(3, m + 1):
if x % i == 0:
return False
return True
n = int(input())
prime = 0
for i in range(n):
x = int(input())
if is_prime(x):
prime += 1
print(prime)
| 0 | null | 1,484,578,154,890 | 76 | 12 |
x=input()
y=str
if x=="ABC":
y="ARC"
else: y="ABC"
print(y)
|
al = 'abcdefghijklmnopqrstuvwxyz'
text = ''
while True:
try:
text += input().lower()
except EOFError:
break
for i in al:
print('{} : {}'.format(i, text.count(i)))
| 0 | null | 12,990,499,317,160 | 153 | 63 |
print('YNeos'[input().replace('hi','')!=''::2])
|
n=int(input())
a=list(map(int,input().split()))
ans=[0]*(n+1)
for i in range(n-1):
ans[a[i]]+=1
ans.pop(0)
for j in ans:
print(j)
| 0 | null | 42,872,258,074,272 | 199 | 169 |
from collections import Counter
N = int(input())
A = [int(i) for i in input().split()]
num = set(A)
count = Counter(A)
dp = [True] * (10**6 + 1)
for a in num:
for n in range(a+a, 10**6+1, a):
dp[n] = False
ans = 0
for a in num:
if count[a] == 1 and dp[a] == True:
ans += 1
print(ans)
|
n,a=int(input()),sorted(list(map(int,input().split())))
m=a[-1]+1
s=[0]*m
for i in a:
s[i]+=1
for i in set(a):
if s[i]:
for j in range(i*2,m,i):
s[j]=0
print(s.count(1))
| 1 | 14,387,146,457,552 | null | 129 | 129 |
a,b=input().split()
a=int(a)
b=int(float(b)*100)
if (a*b<100):
print(0)
else:
print(str(a*b)[:-2])
|
from bisect import bisect_right as br
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MergeSort(aa, left=0, right=-1):
def merge(aa, left2, mid2, right2):
res=0
inf = float("inf")
L = aa[left2:mid2] + [inf]
R = aa[mid2:right2] + [inf]
Li = Ri = 0
for ai in range(left2, right2):
res+=1
if L[Li] < R[Ri]:
aa[ai] = L[Li]
Li += 1
else:
aa[ai] = R[Ri]
Ri += 1
return res
res=0
if right == -1: right = len(aa)
if left + 1 < right:
mid = (left + right) // 2
res+=MergeSort(aa, left, mid)
res+=MergeSort(aa, mid, right)
res+=merge(aa, left, mid, right)
return res
def main():
n=int(input())
aa=list(map(int, input().split()))
cnt=MergeSort(aa)
print(*aa)
print(cnt)
main()
| 0 | null | 7,919,419,925,120 | 133 | 26 |
A, B, C, K = map(int, input().split())
ret = 0
for numberOfCards, point in [(A, 1), (B, 0), (C, -1)]:
if K >= numberOfCards:
K -= numberOfCards
ret += numberOfCards * point
else:
ret += K * point
break
print(ret)
|
import math
A, B = map(int, input().split())
arange = set(range(math.ceil(A*100/8), math.ceil((A+1)*100/8)))
brange = set(range(math.ceil(B*100/10), math.ceil((B+1)*100/10)))
ans_range = arange & brange
if len(ans_range) == 0:
print(-1)
else:
print(min(ans_range))
| 0 | null | 39,090,982,001,068 | 148 | 203 |
import math
def solve():
N = int(input())
A = [int(i) for i in input().split()]
S = sum(A)
l = A[0]
I = 0
m = math.ceil(S / 2)
for i in range(1, N):
if (l + A[i]) <= m:
l += A[i]
else:
I = i - 1
break
if l == S / 2:
print(0)
exit()
c = A[I + 1]
r = S - l - c
ans1 = abs(r - (l + c))
ans2 = abs(l - (r + c))
print(min(ans1, ans2))
if __name__ == "__main__":
solve()
|
n=int(input())
a=[0]*n
a=list(map(int,input().split()))
left=a[0]
right=sum(a[1::])
t=abs(right-left)
for i in range(1,n):
left+=a[i]
right-=a[i]
t=min(t,abs(right-left))
print(t)
| 1 | 141,874,757,265,440 | null | 276 | 276 |
H, W, M = map(int, input().split())
HW = set()
sum_h = [0]*H; sum_w = [0]*W
max_sum_h = max_sum_w = 0
for _ in range(M):
h, w = map(lambda x:int(x)-1, input().split())
HW.add((h, w))
sum_h[h] += 1
sum_w[w] += 1
max_sum_h = max(max_sum_h, sum_h[h])
max_sum_w = max(max_sum_w, sum_w[w])
hs = []; ws = []
for i in range(H):
if sum_h[i] == max_sum_h: hs.append(i)
for i in range(W):
if sum_w[i] == max_sum_w: ws.append(i)
ans = max_sum_h + max_sum_w - 1
for h in hs:
for w in ws:
if (h, w) in HW: continue
print(ans + 1)
exit()
print(ans)
|
from collections import defaultdict
h, w, m = map(int, input().split())
targets = defaultdict(int)
targets_count_yoko = defaultdict(int)
targets_count_tate = defaultdict(int)
for _ in range(m):
y, x = map(int, input().split())
y -= 1
x -= 1
targets_count_yoko[x] += 1
targets_count_tate[y] += 1
targets[(y, x)] = -1
max_row = max(targets_count_yoko.values())
max_line = max(targets_count_tate.values())
y_idx = defaultdict(bool)
x_idx = defaultdict(bool)
max_count_x = 0
max_count_y = 0
for i in range(w):
if targets_count_yoko[i] == max_row:
x_idx[i] = True
max_count_x += 1
for i in range(h):
if targets_count_tate[i] == max_line:
y_idx[i] = True
max_count_y += 1
ans = max_line + max_row
kumi = max_count_x*max_count_y
for key_y, key_x in targets.keys():
if y_idx[key_y] and x_idx[key_x]:
kumi -= 1
if kumi == 0:
break
if kumi == 0:
print(ans-1)
else:
print(ans)
| 1 | 4,769,778,609,558 | null | 89 | 89 |
# B
a, b, c, d = list(map(int, input().split(" ")))
numlist = [a*c, a*d, b*c, b*d]
maxnum = max(numlist)
print(maxnum)
|
L, R, d = map(int, input().split())
print(R // d - L // d + (L % d == 0))
| 0 | null | 5,337,105,110,820 | 77 | 104 |
def A():
d, t, s = map(int, input().split())
print("Yes" if t*s>=d else "No")
def B():
s = input()
t = input()
sa = len(s) - len(t)
ret = 10000000000
for i in range(sa+1):
cnt = 0
for j in range(len(t)):
if s[j+i] != t[j]: cnt += 1
ret = min(ret, cnt)
print(ret)
def C():
int(input())
A = list(map(int, input().split()))
S = sum(A)
T = 0
for e in A:
T += e*e
print((S * S - T)//2)
class UF:
def __init__(self, N):
self.N = N
self.sz = [1] * N
self.par = [i for i in range(N)]
self.d = [1] * N
def find(self, x):
if self.par[x] == x: return x
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y: return False
if self.d[y] > self.d[x]:
self.par[x] = y
self.sz[y] += self.sz[x]
else:
self.par[y] = x
self.sz[x] += self.sz[y]
if self.d[x] == self.d[y]: self.d[x] += 1
def D():
n, m = map(int, input().split())
uf = UF(n+1)
for i in range(m):
a, b = map(int, input().split())
uf.unite(a, b)
print(max(uf.sz))
D()
|
import math
def sd(n, students, average):
rlt = 0
for i in students:
rlt += (i - average) ** 2
rlt = rlt / n
return math.sqrt(rlt)
if __name__ == '__main__':
while True:
n = int(input())
if not n:
break
students = list(map(int, input().split()))
average = sum(students) / n
ans = sd(n, students, average)
print(round(ans, 8))
| 0 | null | 2,108,602,771,748 | 84 | 31 |
i = list(map(int, input().split()))
time = 0
while (i[0] > 0):
i[0] -= i[1]
time += i[2]
print(time)
|
import math
a, b = map(int, input().split())
print(int((a*b)/math.gcd(a, b)))
| 0 | null | 58,844,709,975,898 | 86 | 256 |
import math
n,m=map(int,input().split())
print(n*(n-1)//2+m*(m-1)//2)
|
from math import floor
n,m = map(int,input().split())
a =(n*(n-1))/2
b =(m*(m-1))/2
print(floor(a+b))
| 1 | 45,848,922,430,190 | null | 189 | 189 |
A, B = map(int,input().split())
import math
c = math.gcd(A,B)
d = (A*B) / c
print(int(d))
|
import math
n = float(input())
m = n / 1.08
if math.floor(math.floor(m) * 1.08) == n:
print(math.floor(m))
elif math.floor(math.ceil(m) * 1.08) == n:
print(math.ceil(m))
else:
print(':(')
| 0 | null | 119,292,605,030,888 | 256 | 265 |
n = int(input())
M = int(n**(0.5))
ans = [0]*(n+1)
for x in range(1,M+1):
for y in range(1,10**2):
for z in range(1,10**2):
if x**2+y**2+z**2+x*y+y*z+z*x > n:
break
ans[x**2+y**2+z**2+x*y+y*z+z*x] += 1
if x**2+y**2 > n:
break
for i in range(n):
print(ans[i+1])
|
nn = int(input())
number_of_match = [0 for _ in range(10005)]
for xx in range(1,105):
xxxx = xx**2
for yy in range(1,105):
yyyy = yy**2
xxyy = xx*yy
for zz in range(1,105):
result = xxxx + yyyy + (zz)**2 + xxyy + (yy)*(zz) + (zz)*(xx)
if result < 10005:
number_of_match[result] += 1
for i in range(1,nn+1):
print(number_of_match[i])
| 1 | 7,906,612,620,128 | null | 106 | 106 |
n,k = map(int,input().split())
count = 1
while k<=n:
n //= k
count += 1
print(count)
|
N,K=map(int,input().split())
count = 1
kai = K
while N >= K:
K = K*kai
count += 1
print(count)
| 1 | 64,652,197,378,698 | null | 212 | 212 |
S = input()
a = S[0] == 'S'
b = S[1] == 'S'
c = S[2] == 'S'
if (a and b and c ):
print(0)
elif ( b or(a and c)):
print(1)
elif(a or c):
print(2)
else:
print(3)
|
'''
def main():
S = input()
cnt = 0
ans = 0
f = 1
for i in range(3):
if S[i] == 'R':
cnt += 1
else:
cnt = 0
ans = max(ans, cnt)
print(ans)
'''
def main():
S = input()
p = S[0] == 'R'
q = S[1] == 'R'
r = S[2] == 'R'
if p and q and r :
print(3)
elif (p and q) or (q and r):
print(2)
elif p or q or r:
print(1)
else:
print(0)
if __name__ == "__main__":
main()
| 1 | 4,880,948,504,920 | null | 90 | 90 |
import sys
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
n=int(input())
d=[]
for e in sys.stdin:
e=int(e)
if e in a:
a[a.index(e)]=0
if e in b:
b[b.index(e)]=0
if e in c:
c[c.index(e)]=0
if sum(a)==0 or sum(b)==0 or sum(c)==0:
print("Yes")
exit()
for i in range(3):
if a[i]==0 and b[i]==0 and c[i]==0:
print("Yes")
exit()
if (a[0]==0 and b[1]==0 and c[2]==0) or (a[2]==0 and b[1]==0 and c[0]==0):
print("Yes")
exit()
print("No")
|
A = [list(map(int,input().split())) for _ in range(3)]
N = int(input())
B = [[0 for _ in range(3)] for _ in range(3)]
for _ in range(N):
b = int(input())
for i in range(3):
for j in range(3):
if A[i][j]==b:
B[i][j] = 1
flag = 0
for i in range(3):
if sum(B[i])==3:
flag = 1
break
for j in range(3):
cnt = 0
for i in range(3):
cnt += B[i][j]
if cnt==3:
flag = 1
break
if B[0][0]+B[1][1]+B[2][2]==3:
flag = 1
if B[2][0]+B[1][1]+B[0][2]==3:
flag = 1
if flag==1:
print("Yes")
else:
print("No")
| 1 | 59,484,031,992,038 | null | 207 | 207 |
#!/usr/bin/env python3
import collections as cl
import sys
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
def main():
N, M = MI()
S, C = [], []
for i in range(M):
s, c = MI()
S.append(s - 1)
C.append(c)
ans = [-1] * N
for i in range(M):
if ans[S[i]] != -1 and ans[S[i]] != C[i]:
print(-1)
exit()
ans[S[i]] = C[i]
if ans[0] == 0:
if N != 1:
print(-1)
exit()
else:
print(0)
exit()
if N == 1 and ans[0] == -1:
print(0)
exit()
for i in range(N):
if ans[i] == -1:
ans[i] = 0 if i != 0 else 1
ans[i] = str(ans[i])
print("".join(ans))
main()
|
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def array(size, init=0):
return [[init for j in range(size[1])] for i in range(size[0])]
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(input())
def nitti(x, y):
count = 0
for i in range(len(x)):
if x[i] == y[i]:
count += 1
return count
x = acinput()
res = 10**20*(-1)
for i in range(2):
for j in range(2, 4):
res = max(res, x[i]*x[j])
print(res)
| 0 | null | 31,840,561,459,890 | 208 | 77 |
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
S = int(input())
return S
def combinations_count(n: int, r: int) -> int:
"""
組み合わせの総数を取得する.
Args:\n
n (int): 整数
r (int): 整数(r <= n)
Returns:\n
int: 組み合わせの総数
"""
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def main(S: int) -> None:
"""
メイン処理.
Args:\n
S (int): 整数(1 <= S <= 2000)
"""
# 求解処理
a = S // 3
b = S % 3
ans = 0
while a > 0:
ans += combinations_count(b + a - 1, b)
a -= 1
b += 3
ans %= 10**9 + 7
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
S = get_input()
# メイン処理
main(S)
|
MOD = 10**9 + 7
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
# print(combination(10,2))
s = int(input())
n = s//3
ans = 0
while n:
S = s - n*3
# print(S+n-1,n-1)
ans += combination(S+n-1,n-1)
n-=1
print(ans%MOD)
| 1 | 3,322,564,120,240 | null | 79 | 79 |
K = int(input())
S = input()
print(S[:K] + ('...' if len(S) > K else ''))
|
s = list(input())
t = list(input())
cnt = 0
for i in range(len(s)):
if s[i] == t[i]:
continue
else:
cnt += 1
print(cnt)
| 0 | null | 15,108,028,248,532 | 143 | 116 |
import math
from functools import reduce
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def div2_n(x):
n = 0
while x % 2 == 0:
if x % 2 == 0:
n += 1
x >>= 1
return n
n, m = map(int, input().split())
a = list(map(int, input().split()))
a2 = [i//2 for i in a]
n0 = div2_n(a2[0])
for i in range(1,n):
if div2_n(a2[i]) != n0:
print(0)
exit()
a2_l = lcm(*a2)
print(m//a2_l - m//(a2_l*2))
|
#!/usr/bin/env python3
import sys
from itertools import chain
def solve(N: int, K: int, H: "List[int]"):
H = sorted(H, reverse=True)
return sum(H[K:])
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
H = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
answer = solve(N, K, H)
print(answer)
if __name__ == "__main__":
main()
| 0 | null | 90,394,253,237,148 | 247 | 227 |
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N):
for j in range(N):
for k in range(N):
if i < j < k and L[i] < L[j] < L[k] and L[i] + L[j] > L[k]:
ans += 1
print(ans)
|
mod = 10**9+7
n,a,b = map(int,input().split())
base = pow(2,n,mod)-1
def comb(n,k):
comb = 1
for i in range(n-k+1,n+1):
comb *= i
comb %= mod
for i in range(1, k+1):
comb *= pow(i,mod-2,mod)
comb %= mod
return comb
print((base-comb(n,a)-comb(n,b))%mod)
| 0 | null | 35,824,454,844,430 | 91 | 214 |
X, Y = map(int, input().split())
P = 10 ** 9 + 7
N = (X+Y) // 3
R = (2 * X - Y) // 3
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N+1):
fact.append((fact[-1] * i) % P)
inv.append((-inv[P % i] * (P//i) % P))
factinv.append((factinv[-1] * inv[-1] % P))
def cmb_mod(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n-r)
return fact[n] * factinv[r] * factinv[n-r] % p
if (X+Y) % 3 != 0:
print(0)
else:
print(cmb_mod(N, R, P))
|
x,y = list(map(int, input().split()))
if (x+y) % 3 != 0:
print(0)
exit()
a = (2*x - y) // 3
b = (2*y - x) // 3
if a < 0 or b < 0:
# (x,y) = (1,5)とかは無理
print(0)
exit()
MOD = 10**9+7
def fact(x):
f = 1
for i in range(2, x+1):
f *= i
f %= MOD
return f
def fact_inv(x):
return pow(fact(x), MOD-2, MOD)
ans = fact(a+b) * fact_inv(a) * fact_inv(b) % MOD
print(ans)
| 1 | 150,089,317,047,840 | null | 281 | 281 |
X=int(input())
i=1
while True:
if (X*i)%360==0:
print(i)
exit()
i+=1
|
import math
if __name__ == "__main__":
deg = int(input())
print(360//math.gcd(deg, 360))
| 1 | 13,198,386,983,932 | null | 125 | 125 |
def resolve():
import math
n = int(input())
for i in range(1, n+1):
if math.floor(i * 1.08) == n:
print(i)
quit()
print(":(")
resolve()
|
n = int(input())
r = n % 27
if r == 13 or r == 26:
print(':(')
elif r ==0:
x = int(100*n/108)
print(x)
else:
for i in range(1, 25):
if 1.08*(i-1) < r <= 1.08*i:
break
x = int(100*(n - i)/108) + i
print(x)
| 1 | 125,894,848,989,760 | null | 265 | 265 |
# B-81
# 標準入力 N
N = int(input())
num_list = [1, 2, 3, 4, 5, 6, 7, 8, 9]
j = 0
for i in range(1, 9 + 1):
if (N / i) in num_list:
j += 1
if j == 0:
print('No')
else:
print('Yes')
|
x = list(map(int, input().split()))
ans = 0
for i in range(5):
if x[i] == 0:
ans = i+1
print(ans)
| 0 | null | 86,918,047,482,968 | 287 | 126 |
x = list(map(int, input().split(" ")))
h1 = x[0]
m1 = x[1]
h2 = x[2]
m2 = x[3]
s = x[4]
h = (h2-h1)*60
m = m2-m1
print((h+m)-s)
|
import sys
a,b = map(int, sys.stdin.readline().split())
x=int(a//b)
y=int(a%b)
z=float(a/b)
print (x,y,"{0:2f}".format(z))
| 0 | null | 9,322,174,433,700 | 139 | 45 |
#ABC145B
n = int(input())
s = input()
print("Yes" if s[:n//2]==s[n//2:] else "No")
|
n = int(input())
s = input()
if n % 2 != 0:
print("No")
else:
h = n // 2
print("Yes" if s[0:h] == s[h:] else "No")
| 1 | 146,799,093,412,272 | null | 279 | 279 |
while True:
c = 0
n, x= map(int, input().split())
if n == 0 and x == 0:
break
for i in range(1, n + 1):
for j in range(1, n + 1 ):
if j <= i:
continue
for k in range(1, n + 1):
if k <= j:
continue
if i != j and i != k and j != k and i + j + k == x:
c += 1
print(c)
|
# coding: utf-8
import itertools
data_set = []
answer = []
while (1):
n,x = map(int, input().split())
if (n == 0 and x == 0):
break
data_set.append([n,x])
for d in data_set:
num = list(range(d[0] + 1))[1:]
counter = 0
for i in itertools.combinations(num, 3):
if (sum(i) == d[1]):
counter += 1
answer.append(counter)
for ans in answer:
print(ans)
| 1 | 1,276,805,719,328 | null | 58 | 58 |
N = int(input())
flag = 'No'
cnt = 0
for i in range(N):
d1, d2 = map(int, input().split())
if d1 == d2:
cnt += 1
if cnt == 3:
flag = 'Yes'
else:
cnt = 0
print(flag)
|
n = int(input())
d1 = [0] * n
d2 = [0] * n
for i in range(n):
d1[i], d2[i] = map(int,input().split())
for i in range(n-2):
if d1[i] == d2[i] and d1[i+1] == d2[i+1] and d1[i+2] == d2[i+2]:
print('Yes')
break
else:
print('No')
| 1 | 2,466,309,775,320 | null | 72 | 72 |
n, k = map(int, input().split())
cnt = 0
while n >= 1:
n = n//k
cnt +=1
print(cnt)
|
N,K = map(int,input().split())
i = 0
while True:
if N >= K ** i:
i += 1
else:
break
print(i)
| 1 | 64,114,908,007,908 | null | 212 | 212 |
#!/usr/bin/env python3
x = int(input())
for i in range(360):
k = i + 1
if x * k % 360 == 0:
print(k)
exit()
|
n=int(input())
from math import gcd
m=gcd(360,n)
print(360//m)
| 1 | 13,094,191,080,670 | null | 125 | 125 |
#!/usr/bin/env python3
import sys
from itertools import chain
def solve(A: int, B: int):
answer = A * B
return answer
def main():
tokens = chain(*(line.split() for line in sys.stdin))
# A, B = map(int, line.split())
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
answer = solve(A, B)
print(answer)
if __name__ == "__main__":
main()
|
N = int(input())
A = list(map(int,input().split()))
SUM = sum(A)
half = SUM//2
acc = 0;dif = SUM
for i in range(N):
acc += A[i]
dif = min(dif,abs(SUM-2*acc))
print(dif)
| 0 | null | 78,985,164,670,290 | 133 | 276 |
from collections import deque
n, q = [int(_) for _ in input().split()]
processes = deque([tuple(input().split()) for i in range(n)])
time = 0
while processes:
process = processes.popleft()
if int(process[1]) <= q:
time += int(process[1])
print(process[0], time)
else:
time += q
processes.append((process[0], int(process[1]) - q))
|
from collections import deque
n,q=map(int,raw_input().split())
l=deque([raw_input().split()for _ in range(n)])
t=0
while len(l):
a,b=l.popleft()
b=int(b)
if q<b: t+=q;l.append([a,b-q])
else: t+=b;print a,t
| 1 | 41,143,642,720 | null | 19 | 19 |
n=int(input())
a=list(map(int, input().split()))
max=a[0]
dai=0
for i in range(n):
#print(f"{i}回目")
if max>a[i]:
dai+=max-a[i]
else:
max=a[i]
#print(max,dai)
print(dai)
|
X = int(input())
for i, start in enumerate(range(400, 1900, 200)):
if start <= X < start + 200:
print(8 - i)
| 0 | null | 5,608,605,505,482 | 88 | 100 |
# ABC170
# A Five Variables
X = list(input().split())
print(X.index('0') + 1)
|
X=list(map(str,input().split()))
print(X.index("0")+1)
| 1 | 13,418,206,838,218 | null | 126 | 126 |
import math
a, b, x = map(int, input().split(' '))
base = a * a * b /2
if int(base) == x:
print(math.degrees(math.atan(b/a)))
elif base > x:
ah = 2 * x / (a * b)
print(math.degrees(math.atan(b/ah)))
else:
bh = 2 * x / a ** 2 - b
c = b - bh
print(math.degrees(math.atan(c/a)))
|
import math
a, b, x = map(int, input().split())
s = x/a
half = (a*b)/2
if s<=half:
y = (2*s)/b
z = math.sqrt(b**2+y**2)
alpha = b/z
alpha = math.asin(alpha)
alpha = math.degrees(alpha)
print(alpha)
if s>half:
z = math.sqrt(b**2+a**2)
alpha = b/z
alpha = math.asin(alpha)
alpha = math.degrees(alpha)
beta = a/z
beta = math.asin(beta)
beta = math.degrees(beta)
l = 2*(s-half)/(math.sin(math.radians(90-alpha))*z)
k = math.sqrt(z**2+l**2-2*l*z*math.cos(math.radians(90-alpha)))
gamma = 2*(s-half)/(k*z)
gamma = math.asin(gamma)
gamma = math.degrees(gamma)
print(90-(gamma+beta))
| 1 | 163,035,899,162,048 | null | 289 | 289 |
while True:
a, op, b = input().split()
a = int(a)
b = int(b)
if op == '?':
break
if op == '+':
ans = a+b
elif op == '-':
ans = a-b
elif op == '*':
ans = a*b
else:
ans = a/b
print('%d' %(ans))
|
def main():
N = int(input())
A = input().split()
if len(set(A)) == N:
print("YES")
else:
print("NO")
if __name__ == '__main__':
main()
| 0 | null | 37,071,889,199,908 | 47 | 222 |
def print_func(s, order):
print(s[order[1]:order[2]+1])
def reverse_func(s, order):
ans = list(s[order[1]:order[2]+1])
ans.reverse()
s = s[:order[1]]+''.join(ans)+s[order[2]+1:]
return s
def replace_func(s, order):
cnt = 0
s = list(s)
for i in range(order[1], order[2]+1):
s[i] = str(order[3])[cnt]
cnt += 1
s = ''.join(s)
return s
if __name__ == '__main__':
s = input()
for i in range(int(input())):
order = input().split()
order[1] = int(order[1])
order[2] = int(order[2])
if order[0] == 'print':
print_func(s, order)
elif order[0] == 'reverse':
s = reverse_func(s, order)
else:
s = replace_func(s, order)
|
def ok(a, n, k, p):
t = 0
t_cnt = 0
for w in a:
if p < w:
return -1
if t + w > p:
t_cnt += 1
if t_cnt >= k:
return -1
t = w
else:
t += w
return 0
n, k = map(int, input().split())
a = [int(input()) for _ in range(n)]
P_max = n * 10000 // k + 10001
l = 0
r = P_max
m = 0
while l < r - 1:
m = (l + r) // 2
if ok(a, n, k, m) == 0:
r = m
else:
l = m
print(r)
| 0 | null | 1,114,117,078,998 | 68 | 24 |
N = int(input())
P = list(map(int, input().split()))
Q = []
m = 10**17
for p in P:
m = min(m, p)
Q.append(m)
c = 0
for x, y in zip(P, Q):
if x <= y:
c += 1
print(c)
|
n=int(input())
p =list(map(int,input().split()))
ans = 0
x = p[0]
for i in range(n):
if x >= p[i]:
ans +=1
x = p[i]
print(ans)
| 1 | 85,941,249,630,820 | null | 233 | 233 |
import decimal
def main():
A, B = map(decimal.Decimal,input().split())
if A == 0:
return 0
else:
AB = A*B
return int(AB)
print(main())
|
from sys import stdin
input = stdin.readline
def main():
A, B = input().split()
A = int(A)
# B = int(100*float(B))
B = int(B[0]+B[2:])
# print((A*B)//100)
if A*B < 100:
print(0)
else:
print(str(A*B)[:-2])
if(__name__ == '__main__'):
main()
| 1 | 16,530,702,697,044 | null | 135 | 135 |
def isPrime(x):
if x==2:
return True
if x<2 or x%2==0:
return False
for n in range(3,int(x**0.5)+1,2):
if x%n==0:
return False
return True
n=int(input())
num=[int(input()) for i in range(n)]
i=0
for nm in num:
if isPrime(nm):
i+=1
print(i)
|
S = list(input())
# 問題文の通りに実装する
n = len(S)
for i in range(n):
S[i] = 'x'
ans = ''
for i in range(n):
ans += S[i]
print(ans)
| 0 | null | 36,243,625,489,890 | 12 | 221 |
N=int(input())
for i in range(10):
for j in range(10):
if N==i*j:
print('Yes')
exit()
print('No')
|
N = int(input())
for x in range(1,10):
for y in range(1,10):
if x * y == N:
print('Yes')
exit()
print('No')
| 1 | 159,463,777,468,228 | null | 287 | 287 |
n = int(input())
ss = []
tt = []
for _ in range(n):
s,t = input().split()
ss.append(s)
tt.append(int(t))
x = input()
for i in range(n):
if ss[i] == x:
ans = sum(tt[i+1:])
break
print(ans)
|
n = int(input())
l = list(map(int,input().split()))
dp = [[-float("INF")]*(3) for i in range(n+1)]
dp[0][0] = 0
dp[1][-1] = 0
dp[1][1] = l[0]
for i in range(1,n):
dp[i+1][-1] = max(dp[i][0],dp[i-1][-1]+l[i])
dp[i+1][0] = max(dp[i][1],dp[i-1][0]+l[i])
dp[i+1][1] = dp[i-1][1]+l[i]
print(max(dp[-1][0],dp[-1][-1]))
| 0 | null | 67,457,385,906,600 | 243 | 177 |
from decimal import Decimal
a,b=map(Decimal,input().split())
print(a*b//1)
|
import math , sys
from decimal import Decimal
A , B = list( map( Decimal , input().split()))
print( int(A * B ) )
| 1 | 16,588,031,442,148 | null | 135 | 135 |
import re
import copy
pattern = r'([0-9])'
repatter = re.compile(pattern)
n = int(input())
text = input()
*lists, = text.split(" ")
lists2 = copy.copy(lists)
lists3 = copy.copy(lists)
# バブルソート
def bubble_sort(a):
flag = 1
i = 0
while flag:
flag = 0
for j in range(n-1, i, -1):
x = repatter.findall(a[j])
y = repatter.findall(a[j-1])
if x < y:
a[j], a[j-1] = a[j-1], a[j]
flag = 1
i += 1
print(*a)
print("Stable")
# 選択ソート
def select_sort(a):
for i in range(n):
min_j = i
for j in range(i+1, n):
x = repatter.findall(a[j])
y = repatter.findall(a[min_j])
if x < y:
min_j = j
a[i], a[min_j] = a[min_j], a[i]
print(*a)
def isStable(before, after):
flag = True
for i in range(n):
for j in range(i+1, n):
for a in range(n):
for b in range(a+1, n):
x = repatter.findall(before[i])
y = repatter.findall(before[j])
if x == y and before[i] == after[b] and before[j] == after[a]:
flag = False
if flag is True:
print("Stable")
else:
print("Not stable")
bubble_sort(lists)
select_sort(lists2)
isStable(lists3, lists2)
|
H,W=list(map(int,input().split()))
l=[list(input()) for i in range(H)]
inf=10**9
DP=[[inf]*W for i in range(H)]
DP[0][0]=0 if l[0][0]=="." else 1
for i in range(H):
for j in range(W):
if i>0:
DP[i][j]=min(DP[i][j],DP[i-1][j]+1) if l[i-1][j] == "." and l[i][j]=="#" else min(DP[i][j],DP[i-1][j])
if j>0:
DP[i][j]=min(DP[i][j],DP[i][j-1]+1) if l[i][j-1] == "." and l[i][j]=="#" else min(DP[i][j],DP[i][j-1])
print(DP[H-1][W-1])
| 0 | null | 24,763,053,011,822 | 16 | 194 |
n,k = [int(x) for x in input().split()]
mod = 10**9+7
MAX_N = 10**6
fact = [1]
fact_inv = [0]*(MAX_N+4)
for i in range(MAX_N+3):
fact.append(fact[-1]*(i+1)%mod)
fact_inv[-1] = pow(fact[-1],mod-2,mod)
for i in range(MAX_N+2,-1,-1):
fact_inv[i] = fact_inv[i+1]*(i+1)%mod
def mod_comb_k(n,k,mod):
return fact[n] * fact_inv[k] % mod * fact_inv[n-k] %mod
if k>=n:
print(mod_comb_k(2*n-1,n,mod))
else:
res=1
for i in range(1,k+1):
res = (res+mod_comb_k(n,i,mod)*mod_comb_k(n-1,n-i-1,mod))%mod
print(res)
|
def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
ns = []
while len(ns) < rantime:
n = random.randint(ran1, ran2)
if not n in ns:
ns.append(n)
return sorted(ns)
def rand_query(ran1, ran2, rantime):
r_query = []
while len(r_query) < rantime:
n_q = rand_ints_nodup(ran1, ran2, 2)
if not n_q in r_query:
r_query.append(n_q)
return sorted(r_query)
from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 998244353
#############
# Main Code #
#############
# N:ブロック
# M:色（バリエーション）
# K:隣合う組み
# N, M, K = 6, 2, 3のとき
# K = 0 のとき
# 121212, 212121
# K = 1のとき,
# 12121 のどこかに同じ数字を挟み込めば
# 112121, 122121という風にできる
# K = 2のとき
# 1212 のどこかに同じ数字を挟む を２回行う
# 112212, 112122もできるし
# 111212, 122212もできる
N, M, K = getNM()
# 重複組み合わせのため
# 繰り返し使うのでこのタイプ
Y = N + K + 1
fact =[1] #階乗
for i in range(1, Y + 1):
fact.append(fact[i - 1] * i % mod)
facv = [0] * (Y + 1) #階乗の逆元
facv[-1] = pow(fact[-1], mod - 2 , mod)
for i in range(Y - 1, -1, -1):
facv[i] = facv[i + 1] * (i + 1) % mod
def cmb(n, r):
if n < r:
return 0
return fact[n] * facv[r] * facv[n - r] % mod
ans = 0
for i in range(K + 1):
opt = M * pow(M - 1, N - i - 1, mod) * cmb(N - i + i - 1, i)
ans += opt % mod
print(ans % mod)
| 0 | null | 45,096,181,964,520 | 215 | 151 |
n,m=input().split()
print(m+n)
|
s,t = input().split()
print(t,s,sep='')
| 1 | 102,733,839,262,482 | null | 248 | 248 |
N = input()
check = False
for i in range(3):
if N[i] == "7":
check = True
print("Yes" if check else "No")
|
print('Yes'if input().count('7')else'No')
| 1 | 34,203,732,164,832 | null | 172 | 172 |
def main():
s = input()
n = int(input())
for i in range(n):
cmds = input().split(' ')
if 'reverse' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
s = s[:a]+''.join(reversed(s[a:b]))+s[b:]
if 'replace' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
res = cmds[3]
s = s[:a]+res+s[b:]
if 'print' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
print(s[a:b])
if __name__ == '__main__': main()
|
num = (1,0,0)
for _ in range(int(input()) - 2):
num = (num[1],num[2],num[0]+num[2])
print(num[2]%(10**9+7))
| 0 | null | 2,674,834,624,750 | 68 | 79 |
# Not Divisible
N = int(input())
A = [int(n) for n in input().split()]
check = [0] * 1000001
A.sort()
ok = [-1]
p = 0
for a in A:
if a == p:
if ok[-1] == p:
ok = ok[:-1]
continue
p = a
if check[a] == 1:
continue
for i in range(a, 1000001, a):
check[i] = 1
ok.append(a)
print(len(ok) - 1)
|
n, m, k = map(int, input().split())
def bin(a, b, p):
res = 1
while b > 0:
if b & 1 > 0:
res = res * a % p
a = a * a % p
b >>= 1
return res
MOD = 998244353
N = 200000 + 50
f = [0 for i in range(N)]
invf = [0 for i in range(N)]
f[0] = invf[0] = 1
for i in range(1, N):
f[i] = f[i-1] * i % MOD
invf[n] = bin(f[n], MOD-2, MOD)
for ri in range(1, N-1):
i = n - ri
invf[i] = invf[i+1] * (i+1) % MOD
def binom(n, m):
if n < m or n < 0 or m < 0:
return 0
return f[n] * invf[m] % MOD * invf[n-m] % MOD
def g(n, m):
return m * bin(m-1, n-1, MOD)
ans = 0
for i in range(0, k+1):
# print(n-i, i, binom(n-1, i), bin(n-i, m, MOD), n-i, m)
ans = (ans + binom(n-1, i) * g(n-i, m)) % MOD
print(ans)
| 0 | null | 18,682,039,185,120 | 129 | 151 |
def main():
r = int(input())
print(r * r)
main()
|
t = input()
n = int(input())
for i in range(n):
orders = input().split()
order = orders[0]
a = int(orders[1])
b = int(orders[2])
if order == "replace":
word = orders[3]
t = t[:a] + word + t[b+1:]
if order == "print":
print(t[a:b+1])
if order == "reverse":
t = t[:a] + t[a:b+1][::-1]+ t[b+1:]
| 0 | null | 73,440,214,632,860 | 278 | 68 |
n = input()
A = [i for i in input().split()]
A.reverse()
print(' '.join(A))
|
#!/usr/bin/python
n = input()
a = input().split()
a.reverse()
for (i, item) in enumerate(a):
print(str(item), end = ' ' if i != len(a)-1 else '\n')
| 1 | 980,717,931,732 | null | 53 | 53 |
input()
print(' '.join(reversed(input().split())))
|
import sys
sys.stdin.readline() # ?????????
data = sys.stdin.readline().strip().split(' ')
data.reverse()
print(' '.join(data))
| 1 | 958,444,984,278 | null | 53 | 53 |
A,B,N=map(int,input().split())
if N<B:
x=N
elif N==B:
x=N-1
else:
x=(N//B)*B-1
ans=(A*x/B)//1-A*(x//B)
print(int(ans))
|
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
minus = Counter([i - a[i] for i in range(n)])
plus = Counter([i + a[i] for i in range(n)])
cnt = 0
for i in minus:
if i in plus:
cnt += minus[i] * plus[i]
print(cnt)
| 0 | null | 27,180,646,019,680 | 161 | 157 |
# -*- coding: utf-8 -*-
n,m = list(map(int,input().split()))
s = input()
inf=float("inf")
#i番目のマスに行くための最小手数と、なんマス移動してきたか
dp = [(0,0)] + [(inf,None) for _ in range(n)]
for i in range(1,n+1):
if s[i]=="0":
for j in range(min(m,i),0,-1):
if dp[i-j][0]<inf:
dp[i]=(dp[i-j][0]+1,j)
break
if dp[-1][1]:
i = n
ret = []
ra = ret.append
while dp[i][1]:
ra(dp[i][1])
i-=dp[i][1]
print(" ".join(map(str,ret[::-1])))
else:
print(-1)
|
import sys
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
ans = 0
for i in range(N):
if i % 2 == 0 and A[i] % 2 == 1:
ans += 1
print(ans)
| 0 | null | 73,739,220,436,308 | 274 | 105 |
N = int(input())
A = list(map(int, input().split()))
ans = 1000
for i in range(N - 1):
a = A[i]
if a < A[i + 1]:
units = ans // a
ans = (ans - units * a) + units * A[i + 1]
# print(i, ans)
print(ans)
|
#!/usr/bin/env python3
n = int(input())
a = list(map(int, input().split()))
ans = 1000
left = 0
right = 0
while left < n:
right = left
while right + 1 < n and a[right] <= a[right + 1]:
right += 1
ans = ans // a[left] * a[right] + ans % a[left]
left = right
left += 1
print(ans)
| 1 | 7,382,385,861,582 | null | 103 | 103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.