code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
n=int(input())
num=list(map(int,input().split()))
count=0
for i in range(0,n):
minj=i
a=0
for j in range(i+1,n):
if num[minj]>num[j]:
minj=j
if minj!=i:
count+=1
a=num[minj]
num[minj]=num[i]
num[i]=a
print(' '.join(list(map(str,num))))
print(count)
| import sys
import math
from collections import defaultdict
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N = NI()
ans = 0
for a in range(1, N):
ans += N // a
if N % a == 0:
ans -= 1
print(ans)
if __name__ == "__main__":
main() | 0 | null | 1,282,668,689,302 | 15 | 73 |
text = ''
key= input().lower()
while True:
s = input()
if s.find("END_OF_TEXT") >= 0: break
try:
text += s + ' '
except:
break
print([x.lower() for x in text.split(" ")].count(key) ) | W = input()
num = 0
while True:
line = input()
if line == 'END_OF_TEXT':
break
for word in line.split():
if word.lower() == W.lower():
num += 1
print(num) | 1 | 1,827,059,025,892 | null | 65 | 65 |
#!/usr/bin/env python
#-*- coding: utf-8 -*-
if __name__ == '__main__':
N = int(raw_input())
l = map(int, raw_input().split())
cnt = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if l[j] < l[minj]:
minj = j
if i != minj:
l[i], l[minj] = l[minj], l[i]
cnt += 1
print ' '.join(map(str, l))
print cnt
| N = int(input())
As = []
Bs = []
for _ in range(N):
c = 0
m = 0
for s in input():
if s == '(':
c += 1
elif s == ')':
c -= 1
m = min(m, c)
if c >= 0:
As.append((-m, c - m))
else:
Bs.append((-m, c - m))
As.sort(key=lambda x: x[0])
Bs.sort(key=lambda x: x[1], reverse=True)
f = True
c = 0
for (l, r) in As:
if c < l:
f = False
break
c += r - l
if f:
for (l, r) in Bs:
if c < l:
f = False
break
c += r - l
f = f and (c == 0)
if f:
print('Yes')
else:
print('No') | 0 | null | 11,726,991,189,950 | 15 | 152 |
n=int(input())
a=n//3
b=n//5
c=n//15
suma=(0+a*3)*(a+1)//2
sumb=(0+b*5)*(b+1)//2
sumc=(0+c*15)*(c+1)//2
print((n+1)*n//2-suma-sumb+sumc) | #ABC146A
s = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
ss = input()
print(7-s.index(ss)) | 0 | null | 83,705,692,033,740 | 173 | 270 |
n=int(input())
b=input().split()
s=b[:]
for i in range(n):
for j in range(n-1,i,-1):
if b[j][1]<b[j-1][1]:b[j],b[j-1]=b[j-1],b[j]
m=i
for j in range(i,n):
if s[m][1]>s[j][1]:m=j
s[m],s[i]=s[i],s[m]
print(*b)
print('Stable')
print(*s)
print(['Not stable','Stable'][b==s]) | input()
s = input()
print(s.count("ABC")) | 0 | null | 49,495,387,909,970 | 16 | 245 |
from decimal import Decimal
a, b, c = map(int, input().split())
if a + b < c - (2*(Decimal(a*b).sqrt())):
print("Yes")
else:
print("No")
| from decimal import Decimal
a,b,c=map(lambda x:Decimal(x)**Decimal("0.5"),input().split())
print("Yes" if a+b<c else "No") | 1 | 51,622,759,447,068 | null | 197 | 197 |
N, K, S = map(int, input().split())
rem = S + 1
if rem > 10 ** 9:
rem = 1
ans = []
for i in range(N):
if i < K:
ans.append(str(S))
else:
ans.append(str(rem))
print(" ".join(ans))
| from collections import deque
N = int(input()) # 頂点数
conj = [[] for _ in range(N)]
for i in range(N): # 各頂点での進める先の候補の集合
L = list(map(int, input().split()))
for a in L[2:]:
conj[i].append(a-1) # 頂点番号をデクリメント
start = 0
visit = [False]*N # 訪れたかどうかをメモ
second_visit = [False]*N # 二度目に訪れた事をメモ
next_set = deque() # 次に進む候補を列挙する。スタック（右から取り出す = pop）だと深さ優先になり、キュー（左から取り出す = popleft）だと幅優先になる
next_set.append((start, 0)) # スタート地点を決める。第二成分は時刻を表す。
visit[start] = True # スタート地点は最初から踏んでいる。
res = [-1 for _ in range(N)]
res[0] = 0
while next_set: # p = [] になったら止める
p, t = next_set.popleft() # 要素を消去して、消去した要素を出力
for q in conj[p]: # 頂点 p から進める経路の候補から一つ選ぶ
if not visit[q]: # 訪れた事がない場所のみ進む。壁などの条件がある場合は、ここに " grid[p] != 壁 " 等を追加する
visit[q] = True # 頂点 q に一度訪れた事をメモ (for の前に書くと、ここで選ばれた q が最短であるはずなのに、違う経路でvisit = Trueを踏んでしまう可能性がある)
res[q] = t + 1
next_set.append((q, t + 1)) # p から q へと移動。時刻を 1 進める
for i in range(N):
print(i+1, res[i])
| 0 | null | 45,440,357,175,618 | 238 | 9 |
from sys import stdin
from math import ceil
N,X,T = [int(x) for x in stdin.readline().rstrip().split()]
result = ceil( N / X ) * T
print(result) | #C問題
import numpy as np
X,K,D = map(int, input().split())
ans = 0
if X >= 0 :
if int(X/D)<=K:
if int(X/D)%2==K%2:
ans = X%D
else:
ans = D-X%D
else:
ans = abs(X-K*D)
if X < 0 :
if abs(int(X/D))<=K:
if abs(int(X/D))%2==K%2:
ans = abs(X)%D
else:
ans = D-abs(X)%D
else:
ans = abs(X+K*D)
print(ans) | 0 | null | 4,711,662,397,438 | 86 | 92 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
if i < K:
continue
if A[i-K] < A[i]:
print('Yes')
else:
print('No')
| r,c,k = list(map(int, input().split()))
import copy
dp=[[[0]*4 for _ in range(c)] for _ in range(2)]
F = [[0]*c for _ in range(r)]
for _ in range(k):
x,y,v = list(map(int, input().split()))
x-=1
y-=1
F[x][y] = v
for nn in range(r):
for j in range(c):
i = 1
val = F[nn][j]
mxv = max(dp[i-1][j][0], dp[i-1][j][1], dp[i-1][j][2], dp[i-1][j][3])
dp[i][j][3] = max(dp[i][j-1][3], dp[i][j-1][2] + val)
dp[i][j][2] = max(dp[i][j-1][2], dp[i][j-1][1] + val)
dp[i][j][1] = max(dp[i][j-1][1], dp[i][j-1][0] + val, mxv + val)
dp[i][j][0] = mxv
dp[0] = dp[1]
dp[1] = [[0]*4 for _ in range(c)]
best = 0
for k in range(4):
best = max(best, dp[0][c-1][k])
print(best)
| 0 | null | 6,391,913,189,662 | 102 | 94 |
x = list(input().split())
for i in range(5):
# logging.debug("i = {},x[i] = {}".format(i, x[i])) #
if x[i] == "0":
print(i + 1)
exit()
# logging.debug("n = {},f = {},f**b = {}".format(n, f, f**b)) #
#logging.debug("デバッグ終了")# | #!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
def solve(x: "List[int]"):
return x.index(0) + 1
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
x = [int(next(tokens)) for _ in range(5)] # type: "List[int]"
print(solve(x))
if __name__ == '__main__':
main()
| 1 | 13,360,569,349,414 | null | 126 | 126 |
a,b,c =raw_input().split()
a,b,c = map(int,(a,b,c))
ls = list((a,b,c))
ls.sort()
string_ans=''
for k in ls:
string=''
string = str(k)+" "
string_ans = string_ans + string
print string_ans.strip() | a = [i for i in input().split()]
b = []
for i in range(len(a)):
b.append(a.pop(a.index(min(a))))
print(" ".join([str(i) for i in b])) | 1 | 414,344,753,218 | null | 40 | 40 |
# nikkei2019-2-qualA - Sum of Two Integers
def main():
N = int(input())
ans = (N - 1) // 2
print(ans)
if __name__ == "__main__":
main() | N = int(input())
mod = 10**9+7
ans = pow(10, N, mod) - ((pow(9, N, mod) * 2) - pow(8, N, mod))
ans %= mod
print(ans)
| 0 | null | 77,882,536,507,818 | 283 | 78 |
def getprimes(n):
primes = []
for i in xrange(2, n+1):
isprime = True
for j in xrange(len(primes)):
if i % primes[j] == 0:
isprime = False
break
if isprime:
primes.append(i)
return primes
n = int(raw_input())
primes = getprimes(10000)
count = 0
for _ in xrange(n):
x = int(raw_input())
isprime = True
for i in xrange(len(primes)):
if primes[i] >= x:
break
if x % primes[i] == 0:
isprime = False
break
if isprime:
count += 1
print count | def is_prime(x):
if x == 2:
return True
if (x < 2) or (x%2 == 0):
return False
return all(x%i for i in xrange(3, int(x**(0.5) + 1), 2))
N = input()
print sum(is_prime(input()) for i in range(N)) | 1 | 10,400,980,590 | null | 12 | 12 |
n = int(input())
string = input()
ans = 0
for i in range(0, n-2):
if string[i] == "A" and string[i+1] == "B" and string[i+2] == "C": ans += 1
print(ans) | n = list(input())
print("Yes") if any([i == "7" for i in n]) else print("No")
| 0 | null | 66,654,640,634,492 | 245 | 172 |
a = int(input())
if a == 1:
print("ACL")
elif a == 2:
print("ACLACL")
elif a == 3:
print("ACLACLACL")
elif a == 4:
print("ACLACLACLACL")
else:
print("ACLACLACLACLACL") | l = input().split()
print(l[2], l[0], l[1])
| 0 | null | 19,999,949,290,120 | 69 | 178 |
n = int(input())
c=0
for i in range(1,(n//2)+1):
if((n-i) != i):
c+=1
print(c) |
# ..
# .gMMN;
# .HMMMR ....-, .gggggggJJ...
# .J,. TMMN; ..JgNMMMMMMM{dMMMMMMMMMMMMNNgJ..
# .MMMNx. ?MMb .JNMMMMMMMMMMMMrJMMMMMMMMMMMMMMMMMNmJ.
# ?MMMMMNe. ?MN, .iMMMMMMMMMMMMMMMMP(MMMMMMMMMMMMMMMMMMMMMb .`(zvvvvrOO+. .(wvO- _(vvvvvrOz+. _(ro _(rl
# ?THMMNm. -"!.NMMMMMMMMMMMMMMMMMH%.WHHMMMMMMMMMMMMMMMMMM^ ~ zvC~~~?<?Ovo. !(rrrI `_(vO!~~?<1Oro. _(vI _(rI
# ..... ~7W$ ...MMMMMMMMMMMMB0C1????> dZZZZZZZZZWHMMMMMMMB! ~ zv> _ Orl -.vvrrv; _(vI _(Ov{ _(rI _(rI
# dMMMMMNNNme .jMMNmTMMMMMMMBC?????????> duZuZuZZuZZZZZXHMMY ~ zv> _ zvI ~jvv<?vw. _(rI .zr{ _(rI _(rI
# dMMMMBY"=!`.MMMMMMNmTMMM6????????????z_jZuZZuZuZuZuZZZZC` ~ zv> ._JvZ! _-vI` _jv> _(vI _(rr! _(rO-....(-JrI
# (MMMMMMMMMD ?1??=?=??=???=?=_(ZZZuZZZZZuZuZV! ~ zvw&+xzzwOC! ._zv: _.ww_ _(vr&J+xzzrC! _(rrrrrrvrrrrI
# .dMMMMMMMMMD_.- ?1?=?????=???=_(ZZuZZuZuZZZX=` ~ zvZ7I1vv> _(vv&..-(rro _(rvC777<<` _(vZ!````~_jrI
# .dMMMMMMMMM=.....- ?1??=??????=<(SZZuZZuZZZV! ~ zv> _.1rO- ..wrOOOOOOOrw- _(vZ _(vI _(vI
# (MMMMMMMM#!........- <?=???=??=:.SZuZZuZZ0> ~ zv> -?ww- ~jvv ~(vO _(rI _(rI _(rI
# .MMMMMMMM#!......_(J-.-.<?=?????>.ZZZuZZZC` ~ zv> _(Or+ _.rZ` -zv{ _(rI _(vI _(rI
# dMMMMMMMMt.......(TMNm,.-.<=??=?> XZZZZV! ~ zv> _(Or+..~zv> _(vw._(vI _(rI _(rI
# .MMMMMMMM#_.........?WMNm,.--<=??z_dZZ0=` ~ zw: _.OO>_.rC` _jr>_(rC _(rC _(rC
# (MMMMMMMMD.......-gNNMMMM$...--<?v`dZV~...
# dX0vrOz<_``. -7Y=<~_....... <gMMMMNNmgJJ... <-. (<
# jMMMMMMMNZ???>>+++++(((((----... dMMMMMMMMMMMMMMNNagJ... (<z!
# dMMMMMMMMR??>??>?>??>?>??>?????< ?MMMMMMMMMMMMMMMMMMMMMMNNm, .+>?1.
# JMMMMMMMMK>?????>??>??>?>???<<_(+_ (,?HMMMMMMMMMMMMMMMMMMMMMMMMm. ` `
# (MMMMMMMMN+?>>?>??>?>????<<_(;::<_Jyyx?rttrZVVHMMMMMMMMMMMMMMMMMb ...-....... .... ..-....... .... ...
# .MMMMMMMMNy?>?>?>????<<~_(;::;:;!.Xyyy+(rrtrtrttrrZUWMMMMMMMMMMMM; _.vrOOOOOwvO+. ~(rrw_ _jrrOOOOrvO- - jv> _ wv:
# dMMMMMMMMN+??????<<~-(;;::;;:;< jVyyyWo(trtrrtrtttrtrwMMMMMMMMMM] _.vZ~ ~_zvI. ..wrrvl _jv> ~?Oro -`jr> ~ Ov:
# .MMMMMMMMMR>??<<_-(;;::;;:;:;;!.XyyyyyWo(OrttrtrrtrttrdMMMMMMMMM\ _.vZ_ ~.vv> .~jvOOvr- _jv{ ~(vr_-`jv> ~ Or:
# (MMMMMMMMMC!_-(;;::;:;::;:;;< dVyyyyyyy+(OrrtrtrrtrtrdMMMMMMMMM! _.vZ_ ~.vr: _.vI`~(vI. _jv{ ~-vr!-`jv> _ wr:
# ?MMMMM#5uJ+;;;;:;;:;:;:;::;~.XyyyyyyyyV+(OrtrttrtrrdMMMMMMMMM@ _.vw- ..-(rr> ._zv: -zv: _jvl ..(zvC -`jvO((((J+Jrv:
# ?YY1(gMMMMN+::;:;:;:;;:;;< dyyyyyyyyyyW+.OrtrrtrwdMMMMMMMMMM\ _.vrrrrrrrZ<` _(vI ~(rO. _jrrrrrrvOC! -`jrOCCCCOCOrr:
# dMMMMMMMMNm+;::;:;::;:;`.VyyyyyyyyyyyWo.OrttrQMMMMMMMMMMMF _.vO><~jrw_ .-wrrOzzzwrvl _jvZ!!!~` -`jv> ~ Ov: . d=7n v=7h .d=7h.
# ?MMMMMMMMMMMmx+;:;:;:;< dyyyyyyyyyyyyVy{.zrQNMMMMMMMMMMMF _.vZ_ -.?rw- _(vZ<<<<<71ww_ _jv{ -`jv> ~ Or: (h (3dIJR.W=! .(= .(= ,$ d{
# .TMMMMMMMMMMMMNma+<;<`(yyyyyyyyyyyyyyyV{.dMMMMMMMMMMMMD _.vZ_ _?wr- _.rZ` _jvl _jv{ -`jv> ~ Or: (m$ 4,.,.V .,.(R-... .R-. ..W..f`
# (TMMMMMMMMMMMMMMMN;.dkkWWWWWWkQQQNNMMMm(MMMMMMMMMM#^ _.vZ_ _(wv+ ._jv> __Ov- _jr{ -`jv> ~ Or: `
# .TMMMMMMMMMMMMMM<dMMMMMMMMMMMMMMMMMMMN,HMMMMMM#= _.vZ_ _.Oro._.rZ` _(rI._jv{ -`jv> ~ Ov:
# _THMMMMMMMMMF(MMMMMMMMMMMMMMMMMMMMMN,WMMMD! _.CC` ~.7C`~?C! _7C`_?C! _?7! _.?C!
# _?TMMMMM1MMMMMMMMMMMMMMMMMMMMMMMF `
# ` THMMMMMMMMMMMMMMMB9""!`
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
def main():
n = int(input().strip())
ans = 0
for i in range(1, n):
j = n - i
if i == j:
continue
ans += 1
print(ans // 2)
if __name__ == '__main__':
main()
| 1 | 152,665,885,133,160 | null | 283 | 283 |
# F - Bracket Sequencing
import sys
readline = sys.stdin.readline
N = int(input())
L = []
R = []
for _ in range(N):
S = readline().strip()
sums = 0
mins = 0
for s in S:
if s == '(':
sums += 1
else:
sums -= 1
mins = min(mins, sums)
if sums >= 0:
L.append((sums, mins))
else:
R.append((-sums, mins-sums))
L.sort(key=lambda x: x[1], reverse=True)
R.sort(key=lambda x: x[1], reverse=True)
ans = 'Yes'
l_now = 0
for d, min_d in L:
if l_now + min_d < 0:
ans = 'No'
break
else:
l_now += d
r_now = 0
for d, min_d in R:
if r_now + min_d < 0:
ans = 'No'
break
else:
r_now += d
if l_now != r_now:
ans = 'No'
print(ans) |
n = int(input())
s = [list(input()) for i in range(n)]
r = []
l = []
ans = 0
for i in s:
now = 0
c = 0
for j in i:
if j =="(":
now += 1
else:
now -= 1
c = min(c,now)
if c == 0:
ans += now
elif now >= 0:
l.append([c,now])
else:
r.append([c-now,now])
l.sort(reverse =True)
r.sort()
for i,j in l:
if ans + i < 0:
print("No")
exit()
else:
ans += j
for i,j in r:
if ans +i+j < 0:
print("No")
exit()
else:
ans += j
if ans == 0:
print("Yes")
else:
print("No")
| 1 | 23,631,664,191,350 | null | 152 | 152 |
n = int(input())
ai = list(map(int, input().split()))
# n=3
# ai = np.array([1, 2, 3])
# ai = ai[np.newaxis, :]
#
# ai2 = ai.T.dot(ai)
# ai2u = np.triu(ai2, k=1)
#
# s = ai2u.sum()
l = len(ai)
integ = [ai[0]] * len(ai)
for i in range(1, len(ai)):
integ[i] = integ[i-1] + ai[i]
s = 0
for j in range(l):
this_s = integ[-1] - integ[j]
s += ai[j] * this_s
ans = s % (1000000000 + 7)
print(ans)
| # C - Sum of product of pairs
N = int(input())
A = list(int(a) for a in input().split())
MOD = 10**9 + 7
csA = [0] * (N+1)
for i in range(N):
csA[i+1] = csA[i] + A[i]
ans = 0
for i in range(N-1):
ans += (A[i] * (csA[N] - csA[i+1])) % MOD
print(ans%MOD) | 1 | 3,827,161,571,740 | null | 83 | 83 |
while 1:
m,f,r=map(int,input().split());s=m+f
if r<0>s:break
print('F'if m*f<0 or s<30 else'D'if(s<50)*(r<50)else'C'if s<65 else'B'if s<80 else'A')
| while True:
m, f, r = [int (x) for x in input().split(' ')]
if m == -1 and f == -1 and r == -1: break
if m == -1 or f == -1 or m + f < 30:
print('F')
elif m + f >= 80:
print('A')
elif m + f >= 65 and m + f < 80:
print('B')
elif m + f >= 50 and m + f < 65:
print('C')
elif m + f >= 30 and m + f < 50:
if r >= 50:
print('C')
else:
print('D') | 1 | 1,221,439,511,712 | null | 57 | 57 |
a = input()
N = len(a)
c = []
temp = int(1)
ans = int(0)
for i in range(N):
if i != N-1:
if a[i] == a[i+1]:
temp += 1
else:
c.append(temp)
temp = 1
else:
if a[i-1] == a[i]:
c.append(temp)
else:
c.append(1)
clen = len(c)
if a[0] == "<" and clen % 2 == 1:
c.append(0)
elif a[0] == ">" and clen % 2 == 0:
c.append(0)
if a[0] == "<":
for i in range(0,clen,2):
maxi = max([c[i],c[i+1]])
mini = min([c[i],c[i+1]])
ans += maxi*(maxi+1)/2
ans += mini*(mini-1)/2
else:
ans += c[0]*(c[0]+1)/2
for i in range(1,clen,2):
maxi = max([c[i],c[i+1]])
mini = min([c[i],c[i+1]])
ans += maxi*(maxi+1)/2
ans += mini*(mini-1)/2
print(int(ans)) | K=int(input())
S=str(input())
if len(S)<=K:
print(S)
else:
print(S[:K]+"...") | 0 | null | 88,395,809,562,850 | 285 | 143 |
h,n=map(int,input().split())
A=list(map(int,input().split()))
attack = sum(A)
if h > attack:
print('No')
else:
print('Yes') | a = [int(i) for i in input().split()]
a.sort()
print(*a,sep=" ")
| 0 | null | 38,957,210,591,442 | 226 | 40 |
def II(): return int(input())
def LI(): return list(map(int, input().split()))
N=II()
a=LI()
A=0
for elem in a:
A^=elem
ans=[elem^A for elem in a]
print(*ans) | def main():
N = int(input())
a = [int(i) for i in input().split()]
x = 0
for i in range(N):
x ^= a[i]
x ^= a[0]
xors = [x]
for i in range(1, N):
x ^= a[i-1]
x ^= a[i]
xors.append(x)
print(' '.join(str(x) for x in xors))
main()
| 1 | 12,471,202,932,544 | null | 123 | 123 |
S = input()
S_inv = S[-1::-1]
counter = 0
for i in range(len(S)//2):
if S[i]!=S_inv[i]:
counter +=1
print(counter)
| S = input()
S_rev = S[::-1]
cnt = 0
for i in range(len(S) // 2):
if S[i] != S_rev[i]:
cnt = cnt + 1
print(cnt)
| 1 | 120,068,320,593,000 | null | 261 | 261 |
N = int(input())
a = list(map(int,input().split()))
flag = True
for a_i in a:
if a_i%2==0:
if not (a_i%3==0 or a_i%5==0):
flag=False
print("APPROVED" if flag else "DENIED")
| a = int(input())
b = input().split()
c = "APPROVED"
for i in range(a):
if int(b[i]) % 2 == 0:
if int(b[i]) % 3 == 0 or int(b[i]) % 5 == 0:
c = "APPROVED"
else:
c = "DENIED"
break
print(c) | 1 | 68,843,377,285,010 | null | 217 | 217 |
import math
a = float(input())
b = math.acos(-1)
print "%f %f" % (a * a * b , 2 * a * b) | i = map(str, raw_input())
def check(x):
if x.islower():
return x.upper()
return x.lower()
print ''.join(map(check, i)) | 0 | null | 1,059,754,375,166 | 46 | 61 |
n = input()
ans = 100000
for i in range(n):
ans *= 1.05
if (ans % 1000) != 0:
ans = int(ans)
ans /= 1000
ans *= 1000
ans += 1000
print int(ans) | import sys
import math
import fractions
from collections import defaultdict
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
S=ns().split()
print(S[1]+S[0]) | 0 | null | 51,346,654,986,990 | 6 | 248 |
N,X,Y=map(int,input().split())
A=[0]*(N-1)
for i in range(1,N):
for j in range(i+1,N+1):
A[min(j-i,abs(X-i)+1+abs(j-Y),abs(Y-i)+1+abs(j-X))-1]+=1
for a in A:
print(a) | N = int(input())
A = list(map(int, input().split()))
A.sort()
Ans = "YES"
List = []
before_n = 0
for e in A:
if e == before_n:
Ans = "NO"
break
else:
before_n=e
print(Ans) | 0 | null | 59,113,077,673,298 | 187 | 222 |
S = input()
A = S.count("R")
B = S.count("RR")
if A==2:
if B==1:
print(2)
if B==0:
print(1)
elif A==1:
print(1)
elif A==3:
print(3)
else :
print(0) | weather = list(input())
i = 0
j = 0
days = 0
consecutive = []
while i <= 2:
while i + j <= 2:
if weather[i+j] == "R":
days += 1
j += 1
else:
break
i += 1
j = 0
consecutive.append(days)
days = 0
print(max(consecutive))
| 1 | 4,906,122,476,490 | null | 90 | 90 |
W, H, x, y, r = [int(temp) for temp in input().split()]
if r <= x <= (W - r) and r <= y <= (H - r) : print('Yes')
else : print('No') | x = input().split(" ")
if int(x[2]) - int(x[4]) >= 0 and int(x[3]) - int(x[4]) >= 0 and int(x[2]) + int(x[4]) <= int(x[0]) and int(x[3]) + int(x[4]) <= int(x[1]) :
print("Yes")
else:
print("No")
| 1 | 451,752,399,840 | null | 41 | 41 |
r = int(input())
n = (r*r) / 3.14
print(int(n / (1/3.14))) | import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')
def main():
k, x = list(map(int,input().split()))
if 500 * k >= x:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | 0 | null | 121,583,338,804,988 | 278 | 244 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
def main():
a, b, c = map(int, input().split())
x = ((c-a-b)**2-4*a*b > 0 ) and (c > a+b)
print('NYoe s'[x::2])
if __name__ == '__main__':
main() | a, b, c = map(int, input().split())
sahen = 4*a*b
uhen = (c-a-b)**2
if c-a-b < 0:
ans = "No"
elif sahen < uhen:
ans = "Yes"
else:
ans = "No"
print(ans)
| 1 | 51,627,706,990,132 | null | 197 | 197 |
s = list(input())
t = list(input())
ans = 1000
sub = 0
flag = False
for i in range(len(s)):
if s[i] != t[sub]:
sub = 0
continue
else:
if sub == len(t) - 1:
print(0)
flag = True
break
sub += 1
if not flag:
for i in range(len(s) - len(t) + 1):
sub = 0
an = 0
for j in range(len(t)):
if s[i + j] != t[sub]:
an += 1
sub += 1
ans = min(an, ans)
print(ans) | #!/usr/bin/env python3
def main():
s = input()
t = input()
ans = float("inf")
add = 0
for j in range(len(s) - len(t) + 1):
tans = 0
for i in range(len(t)):
if s[i + add] == t[i]:
pass
else:
tans += 1
add += 1
ans = min(ans, tans)
print(ans)
main()
| 1 | 3,655,418,326,560 | null | 82 | 82 |
n, m, k = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i in range(len(aa)):
asum.append(asum[i]+aa[i])
for i in range(len(bb)):
bsum.append(bsum[i]+bb[i])
j = len(bsum)-1
ans = 0
for i in range(len(asum)):
while j >= 0:
if k >= asum[i] + bsum[j]:
ans = max(ans, i+j)
break
else:
j -= 1
print(ans)
| n, m = map(int, input().split())
a = []
b = []
c = []
for i in range(n):
a.append(list(map(int, input().split())))
for i in range(m):
b.append(int(input()))
for i in range(n):
elm = 0
for k in range(m):
elm += a[i][k] * b[k]
c.append(elm)
for i in c:
print(i)
| 0 | null | 5,942,396,058,830 | 117 | 56 |
S = input()
S1 = S[:len(S) // 2]
S2 = S[-1:(len(S)-1) // 2:-1]
ans = 0
for s1, s2 in zip(S1, S2):
ans += s1!=s2
print(ans)
| S=input()
h=len(S)//2
l=S[0:h]
r=S[h:]
Rr=r[::-1]
ans=0
for i in range(h):
if l[i]==Rr[i]:
pass
else:
ans+=1
print(ans) | 1 | 120,541,827,561,170 | null | 261 | 261 |
n = int(input())
a = input().split()
max = -1000000
min = 1000000
sum = 0
for i in range(0,n):
sum = sum + int(a[i])
if int(a[i]) > max:
max = int(a[i])
if int(a[i]) < min:
min = int(a[i])
print(str(min) + " " + str(max) + " " + str(sum)) | (H,N) = map(int,input().split())
l = []
for i in range(N):
l.append([int(x) for x in input().split()])
dp = [10**10 for i in range(H+10**4+1)]
dp[0] = 0
for i in range(H+10**4+1):
for j in range(N):
if l[j][0] <= i:
dp[i] = min(dp[i],dp[i-l[j][0]]+l[j][1])
ans = dp[H]
for i in range(1,10**4+1):
ans = min(ans,dp[H+i])
print(ans) | 0 | null | 40,892,017,477,838 | 48 | 229 |
def solve():
import math
K = int(input())
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += math.gcd(math.gcd(i,j), k)
print(ans)
if __name__ == "__main__":
solve() | raw_input()
a = raw_input().split(" ")
a.reverse()
print " ".join(a) | 0 | null | 18,180,401,560,660 | 174 | 53 |
S=input()
Slist=list(S)
flag=True
for i, c in enumerate(S):
if i%2==0 and c!='h':
flag=False
break
if i%2==1 and c!='i':
flag=False
break
if flag and len(S)%2==0:
print('Yes')
else:
print('No') | S = input()
S_size = len(S)
S_hi = S.count('hi')
if S_size == S_hi*2:
print('Yes')
else:
print('No') | 1 | 52,993,818,623,250 | null | 199 | 199 |
N = int(input())
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
ans = 0
soinsu_list = factorization(N)
#print(soinsu_list)
for i in range(len(soinsu_list)):
cnt = 0
while soinsu_list[i][0] != 1:
cnt += 1
soinsu_list[i][1] -= cnt
if soinsu_list[i][1] < 0:
cnt -= 1
break
ans += cnt
print(ans)
| import fileinput
s, t = input().split()
print(t + s) | 0 | null | 60,296,744,814,560 | 136 | 248 |
def getprimes(n):
primes = []
for i in xrange(2, n+1):
isprime = True
for j in xrange(len(primes)):
if i % primes[j] == 0:
isprime = False
break
if isprime:
primes.append(i)
return primes
n = int(raw_input())
primes = getprimes(10000)
count = 0
for _ in xrange(n):
x = int(raw_input())
isprime = True
for i in xrange(len(primes)):
if primes[i] >= x:
break
if x % primes[i] == 0:
isprime = False
break
if isprime:
count += 1
print count | n, k= map(int, input().split())
x = [0]*n
for i in range(k):
z = int(input())
if z == 1:
x[int(input())-1] +=1
else:
a = list(map(int, input().split()))
for j in a:
x[j-1] +=1
print(x.count(0)) | 0 | null | 12,379,611,274,980 | 12 | 154 |
n = int(input())
a, b = map(list, input().split())
if len(a) == len(b):
for i in range(0, len(a)):
print(a[i] + b[i], end = "") | import itertools
n=int(input())
p=[int(i) for i in input().split()]
q=[int(i) for i in input().split()]
t=[int(i) for i in range(1,n+1)]
a=b=0
for i,j in enumerate(list(itertools.permutations(t,n))):
w=[1,1]
for x,y in enumerate(j):
if p[x]!=y: w[0]=0
if q[x]!=y: w[1]=0
if w[0]: a=i
if w[1]: b=i
print(abs(a-b)) | 0 | null | 106,371,665,771,292 | 255 | 246 |
import sys
import math
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
ng = 0
ok = 10 ** 9 + 1
while ok - ng > 1:
mid = (ok + ng) // 2
ans = sum(list(map(lambda x: math.ceil(x / mid) - 1, A)))
# for i in range(N):
# ans += A[i]//mid -1
# if A[i]%mid !=0:
# ans +=1
if ans <= K:
ok = mid
else:
ng = mid
print(ok)
if __name__ == "__main__":
main()
| N, K = map(int, input().split())
A = [int(i) for i in input().split()]
def f(length, ls):
cur = 0
for a in ls:
if a%length == 0:
cur += a//length - 1
else:
cur += a//length
if cur <= K:
return True
else:
return False
ok, ng = max(A), 0
while abs(ok - ng) > 1:
z = (ok+ng)//2
if f(z, A) == True:
ok = z
else:
ng = z
print(ok) | 1 | 6,541,589,891,040 | null | 99 | 99 |
import queue
h, w = map(int, input().split())
maze = [list(input()) for _ in range(h)]
# print(maze)
def bfs(dist, i, j):
q = queue.Queue()
q.put((i, j, 0))
while not q.empty():
i, j, c = q.get()
# print(i, j, c, dist)
if i != 0 and dist[i-1][j] == 0:
dist[i-1][j] = c+1
q.put((i-1, j, c+1))
if j != 0 and dist[i][j-1] == 0:
dist[i][j-1] = c+1
q.put((i, j-1, c+1))
if i != h-1 and dist[i+1][j] == 0:
dist[i+1][j] = c+1
q.put((i+1, j, c+1))
if j != w-1 and dist[i][j+1] == 0:
dist[i][j+1] = c+1
q.put((i, j+1, c+1))
return dist, c
ans = 0
for i in range(h):
for j in range(w):
if maze[i][j] == '.':
dist = [[(maze[y][x] == '#')*-1 for x in range(w)] for y in range(h)]
dist[i][j] = -10
dist, c = bfs(dist, i, j)
tmp_ans = c
if tmp_ans > ans:
ans = tmp_ans
print(ans)
| S = input()[::-1]
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
dp[1][0]=dp[0][0]+int(S[0])
dp[1][1]=dp[0][1]+10-int(S[0])
for i in range(1,l):
dp[i+1][0]=min(dp[i][0]+int(S[i]),dp[i][1]+int(S[i])+1)
dp[i+1][1]=min(dp[i][0]+10-int(S[i]),dp[i][1]+10-int(S[i])-1)
print(min(dp[-1][0],dp[-1][1]+1)) | 0 | null | 82,898,014,941,278 | 241 | 219 |
s = input()
s = 'x'*len(s)
print(s)
| from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction
# t = int(stdin.readline())
# for _ in range(t):
# n, m = map(int, stdin.readline().split())
# nums = list(map(int, stdin.readline().split()))
# n = int(input())
# if n%10 in [2, 4, 5, 7, 9]:
# print('hon')
# elif n%10 in [0, 1, 6, 8]:
# print('pon')
# else:
# print('bon')
k = int(input())
s = input()
ans = s[:k] + ('...' if len(s) > k else '')
print(ans) | 0 | null | 46,385,485,495,270 | 221 | 143 |
def plus(x):
yen = 0
if x < 4:
yen = yen + 100000
if x < 3:
yen = yen + 100000
if x < 2:
yen = yen + 100000
return yen
x, y = map(int, input().split())
res = plus(x) + plus(y)
if x == 1 and y == 1:
res = res + 400000
print(res) | def circle(n):
return n * n
if __name__ == "__main__":
n = int(input())
print(circle(n)) | 0 | null | 142,339,344,259,840 | 275 | 278 |
se = set([])
n = int(raw_input())
for i in range(n):
s = raw_input().split()
if s[0] == 'insert':
se.add(s[1])
elif s[0] == 'find':
if s[1] in se:
print 'yes'
else:
print 'no' | n = int(input())
dic = set()
for i in range(n):
order, Str = input().split()
if order=='insert':
dic.add(Str)
if order=='find':
if Str in dic:
print('yes')
else:
print('no')
| 1 | 73,553,129,658 | null | 23 | 23 |
N = int(input())
A_ls = list(map(int, input().split(' ')))
rst = [0] * N
for i in A_ls:
rst[i - 1] += 1
for i in rst:
print(i) | ichi = input().split()
n = int(ichi[0])
m = int(ichi[1])
a = [[0 for j in range(m)] for i in range(n)]
for i in range(n):
input_a = input().split()
for j in range(m):
a[i][j] = int(input_a[j])
b = []
for i in range(m):
b.append(int(input()))
for i in range(n):
c=0
for j in range(m):
c += a[i][j] * b[j]
print(c) | 0 | null | 16,990,930,334,080 | 169 | 56 |
N=int(input())
A=list(map(int,input().split()))
A.sort(reverse=True)
if N%2==0:
x=A[0]
x+=sum(A[1:N//2])*2
print(x)
else:
x=A[0]
x+=sum(A[1:(N-1)//2])*2
x+=A[(N-1)//2]
print(x)
| n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
ans = 0
for i in range(60):
cou = 0
bit = 1 << i
for j in a:
if j & bit:
cou += 1
num1 = cou
num0 = n - num1
ans += ((num1*num0) * bit )%mod
print(ans%mod) | 0 | null | 66,190,988,128,860 | 111 | 263 |
import sys
input = sys.stdin.readline
class SegTree():
# ここでは操作の都合上根元のindexを1とする
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.f = function
self.b = basement
self.seg = [basement]*2**(self.K+1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i+X] = v
for i in range(X-1, 0, -1):
self.seg[i] = self.f(self.seg[i << 1], self.seg[i << 1 | 1])
def update(self, k, value):
X = 2**self.K
k += X
self.seg[k] = value
while k:
k = k >> 1
self.seg[k] = self.f(self.seg[k << 1], self.seg[(k << 1) | 1])
def query(self, L, R):
num = 2**self.K
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
def main():
N = int(input())
S = list(input())
Q = int(input())
que = [tuple(input().split()) for i in range(Q)]
alpha = "abcdefghijklmnopqrstuvwxyz"
Data = {alpha[i]: [0]*N for i in range(26)}
for i in range(N):
Data[S[i]][i] += 1
SEG = {alpha[i]: SegTree(Data[alpha[i]], max, 0) for i in range(26)}
for X, u, v in que:
if X == "1":
u = int(u)-1
NOW = S[u]
S[u] = v
SEG[NOW].update(u, 0)
SEG[v].update(u, 1)
else:
u, v = int(u)-1, int(v)-1
res = 0
for j in range(26):
res += SEG[alpha[j]].query(u, v+1)
print(res)
if __name__ == "__main__":
main() | n , m = map(int,input().split(" "))
if n * 500 >= m:
print("Yes")
elif n * 500 < m:
print("No") | 0 | null | 80,178,762,500,958 | 210 | 244 |
x = raw_input().split()
m = map(int,x)
a = m[0]
b = m[1]
if a > b:
print "a > b"
elif a < b:
print "a < b"
else:
print "a == b" | def factorize(n):
tmp = n
for i in range(2, int(n**0.5)+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
if i in fact:
fact[i] = max(fact[i],cnt)
else:
fact[i] = cnt
if tmp != 1:
if tmp in fact:
fact[tmp] = max(fact[tmp],1)
else:
fact[tmp] = 1
if len(fact) == 0:
if N in fact:
fact[N] = max(fact[N],1)
else:
fact[N] = 1
def inv(n, p):
return pow(n, p-2, p)
N = int(input())
A = list(map(int, input().split()))
p = 10**9+7
fact = {}
for i in range(N):
if A[i] != 1:
factorize(A[i])
lcm = 1
for key, val in fact.items():
lcm *= pow(key, val, p)
lcm %= p
inv_sum = 0
for i in range(N):
inv_sum += inv(A[i], p)
inv_sum %= p
print(lcm * inv_sum % p) | 0 | null | 44,124,281,808,880 | 38 | 235 |
import sys
K,X = map(int,input().split())
if not ( 1 <= K <= 100 and 1 <= X <= 10**5 ): sys.exit()
print('Yes') if 500 * K >= X else print('No') | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
k, x = map(int, input().split())
print('Yes') if 500 * k >= x else print('No')
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| 1 | 97,770,885,110,948 | null | 244 | 244 |
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
N,K = I()
h = l()
for i in range(N):
if h[i] >= K:
count += 1
print(count)
| N = int(input())
S = input()
ans = 0
s = 0
while True:
x = S.find('ABC', s)
if x == -1:
break
else:
s = x+1
ans +=1
print(ans) | 0 | null | 138,587,129,598,974 | 298 | 245 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import defaultdict
from bisect import *
mod = 10**9+7
N = int(input())
A = list(map(int, input().split()))
cnt = [0]*3
ans = 1
for i, x in enumerate(A):
T = len([c for c in cnt if c == x])
for i, c in enumerate(cnt):
if c == x:
cnt[i] += 1
break
ans = ans * T % mod
print(ans)
| N,X,T=map(int,input().split())
count = 0
ans = 0
while count < N:
count += X
ans +=T
print(ans) | 0 | null | 66,817,993,285,358 | 268 | 86 |
def main():
X, Y = map(int, input().split())
ans = 0;
if X == 1:
ans += 300000
elif X == 2:
ans += 200000
elif X == 3:
ans += 100000
if Y == 1:
ans += 300000
elif Y == 2:
ans += 200000
elif Y == 3:
ans += 100000
if X == 1 and Y == 1:
ans += 400000
print(ans)
if __name__ == '__main__':
main() | import sys
n,k=map(int,input().split())
a=sorted(list(map(int,input().split())))
f=sorted(list(map(int,input().split())),reverse=True)
h,l=max(a[i]*f[i] for i in range(n))+1,0
if sum(a)<=k: print(0);sys.exit()
while h-l>1:
m=(h+l)//2
practice=sum(max(0,a[i]-m//f[i]) for i in range(n))
if practice<=k: h=m
else: l=m
print(h) | 0 | null | 153,075,567,560,580 | 275 | 290 |
#create date: 2020-06-30 22:48
import sys
stdin = sys.stdin
from itertools import product
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
t = [[-1] * n for _ in range(n)]
for j in range(n):
a = ni()
for i in range(a):
x, y = na()
t[j][x-1] = y
l = list(product([0, 1], repeat=n))
ans = 0
#print(t)
for li in l:
f = True
for i in range(n):
people = li[i]
if people:
for j in range(n):
if t[i][j] == 1 and li[j] == 0:
f = False
if t[i][j] == 0 and li[j] == 1:
f = False
if f:
#print(li, f)
ans = max(ans, sum(li))
print(ans)
if __name__ == "__main__":
main() | from time import time
from random import random
limit_secs = 2
start_time = time()
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
def calc_score(t):
score = 0
S = 0
last = [-1] * 26
for d in range(len(t)):
S += s[d][t[d]]
last[t[d]] = d
for i in range(26):
S -= c[i] * (d - last[i])
score += max(10 ** 6 + S, 0)
return score
def solution1():
return [i % 26 for i in range(D)]
def solution2():
t = None
score = -1
for i in range(26):
nt = [(i + j) % 26 for j in range(D)]
if calc_score(nt) > score:
t = nt
return t
def solution3():
t = []
for _ in range(D):
score = -1
best = -1
t.append(0)
for i in range(26):
t[-1] = i
new_score = calc_score(t)
if new_score > score:
best = i
score = new_score
t[-1] = best
return t
def optimize0(t):
return t
def optimize1(t):
score = calc_score(t)
while time() - start_time + 0.15 < limit_secs:
d = int(random() * D)
q = int(random() * 26)
old = t[d]
t[d] = q
new_score = calc_score(t)
if new_score < score:
t[d] = old
else:
score = new_score
return t
t = solution3()
t = optimize0(t)
print('\n'.join(str(e + 1) for e in t))
| 0 | null | 65,759,185,610,672 | 262 | 113 |
from collections import deque
from sys import stdin
input = stdin.readline
def main():
N = int(input())
G = [[] for _ in range(N)]
dic = {}
for i in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
G[a].append(b)
G[b].append(a)
dic[(a, b)] = i
dic[(b, a)] = i
color = [0]*(N-1)
upcol = [0]*(N)
upcol[0] = None
visited = set()
q = deque([0])
max_col = 0
while len(q):
now = q.popleft()
visited.add(now)
c = 0
for next_ in G[now]:
if next_ in visited:
continue
c += 1
if upcol[now] == c:
c += 1
color[dic[(now, next_)]] = c
upcol[next_] = c
q.append(next_)
max_col = max(max_col, c)
print(max_col)
print(*color, sep='\n')
if(__name__ == '__main__'):
main()
| data = input()
a, b, c = [int(i) for i in data.split()]
if a < b < c:
print('Yes')
else:
print('No') | 0 | null | 68,048,505,606,420 | 272 | 39 |
import copy
h, w = map(int,input().split())
maze = [[9]*(w+2)]
for i in range(h):
s = input()
tmp = [9]
for j in s:
if j == "#":
tmp.append(9)
else:
tmp.append(0)
tmp.append(9)
maze.append(tmp)
maze.append([9]*(w+2))
#print(maze)
def bfs(start):
maze2 = copy.deepcopy(maze)
#print(maze2)
pos = [start]
max_depth = 0
maze2[start[0]][start[1]] = 2
while len(pos):
x, y, depth = pos.pop(0)
max_depth = max(depth, max_depth)
if maze2[x-1][y] < 2:
pos.append([x-1,y,depth + 1])
maze2[x-1][y] = 2
if maze2[x+1][y] < 2:
pos.append([x+1,y,depth + 1])
maze2[x+1][y] = 2
if maze2[x][y-1] < 2:
pos.append([x,y-1,depth +1])
maze2[x][y-1] = 2
if maze2[x][y+1] < 2:
pos.append([x,y+1,depth +1])
maze2[x][y+1] = 2
return max_depth
ans = 0
for i in range(h):
for j in range(w):
start = [i+1,j+1,0]
maze2 = maze
if maze[i+1][j+1] != 9:
#print(bfs(start))
ans = max(ans,bfs(start))
print(ans) | H, W = map(int, input().split())
maze = [input() for i in range(H)]
direction = [
(0, 1),
(1, 0),
(-1, 0),
(0, -1)
]
def bfs(sy, sx):
reached = [[-1] * W for _ in range(H)]
reached[sy][sx] = 0
from collections import deque
que = deque([[sy, sx]])
#d_max = 0
while que:
iy, ix = que.popleft()
for d in direction:
tx, ty = ix + d[0], iy + d[1]
if tx >= W or ty >= H or tx < 0 or ty < 0:
continue
if reached[ty][tx] != -1 or maze[ty][tx] == '#':
continue
reached[ty][tx] = reached[iy][ix] + 1
#d_max = max(reached[ty][tx], d_max)
que.append([ty, tx])
d_max = 0
for i in range(H):
for j in range(W):
d_max = max(d_max,reached[i][j])
return d_max
ans = 0
for i in range(H):
for j in range(W):
if maze[i][j] == '.':
ans = max(ans, bfs(i, j))
# for i in range(H):
# for j in range(i, W):
# for k in range(H):
# for l in range(k, W):
# if maze[i][j] == '#' or maze[k][l] == '#':
# continue
# else:
# ans = max(ans, bfs(i, j, k, l))
print(ans)
| 1 | 94,801,469,881,728 | null | 241 | 241 |
n, k = map(int, input().split())
P = list(map(int, input().split()))
P_ac = [sum(P[:k])]
for i in range(n-k):
P_ac.append(P_ac[-1]-P[i]+P[i+k])
print((max(P_ac)+k)/2) | n, k = map(int, input().split())
lp = list(map(int, input().split()))
le = [(p + 1) / 2 for p in lp]
e = sum(le[:k])
m = e
for i in range(n - k):
e -= le[i]
e += le[k + i]
m = max(m, e)
print(m)
| 1 | 74,781,235,756,150 | null | 223 | 223 |
def main():
strTxt = input()
n = int(input())
for _ in range(n):
strCmd = input().split()
if strCmd[0] == 'print':
funcPrint(strTxt, int(strCmd[1]), int(strCmd[2]))
elif strCmd[0] == 'reverse':
strTxt = funcReverse(strTxt, int(strCmd[1]), int(strCmd[2]))
elif strCmd[0] == 'replace':
strTxt = funcReplace(strTxt, int(strCmd[1]), int(strCmd[2]), strCmd[3])
def funcPrint(strInput: str,a: int,b: int):
print(strInput[a:b+1])
def funcReverse(strInput: str,a: int,b: int):
return strInput[:a]+strInput[a:b+1][::-1]+strInput[b+1:]
def funcReplace(strInput: str,a: int,b: int, strAfter: str):
return strInput[:a]+strAfter+strInput[b+1:]
if __name__ == '__main__':
main()
| from functools import reduce
n=int(input())
A=list(map(int, input().split()))
sumxor=reduce(lambda x,y:x^y,A)
for AA in A:
print(sumxor ^ AA) | 0 | null | 7,231,052,318,688 | 68 | 123 |
import fractions
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
x=int(input())
y=lcm(x,360)
print(y//x) | import math
X = int(input())
i = 1
while True:
net = (i * X)/360
if math.floor(net) == math.ceil(net):
break
else:
i+=1
print(i) | 1 | 13,145,672,715,000 | null | 125 | 125 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
dp = [0] + [float('inf')]*(n)
for i in range(m):
for j in range(a[i],n+1):
dp[j] = min(dp[j],dp[j-a[i]]+1)
print(dp[-1])
| k = int(input())
s = list(input())
if len(s) <= k:
print("".join(s[0:]))
else:
print(str("".join(s[0:k])) + "...") | 0 | null | 9,924,548,699,172 | 28 | 143 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
INF = float('inf')
def solve():
n = II()
print((n + 1) // 2)
if __name__ == '__main__':
solve() | import sys,queue,math,copy
input = sys.stdin.readline
MOD = 10**9 + 7
LI = lambda : [int(x) for x in input().split()]
N = int(input())
A = LI()
c =[0,0,0]
cnt = [0 for _ in range(N)]
for i in range(N):
cnt[i] = c.count(A[i])
if cnt[i] == 0: break
c[c.index(A[i])] += 1
ans = 1
for i in range(N):
ans = (ans * cnt[i]) % MOD
print (ans) | 0 | null | 94,701,107,646,310 | 206 | 268 |
n = int(input())
p = [220000] + list(map(int, input().split()))
cnt = 0
m = 220000
for i in range(1, n+1):
now = p[i]
m = min(m, now)
if now == m:
cnt += 1
print(cnt) | N = int(input())
for i in range(1,11):
need = 1000 * i
if N <= need:
print(need - N)
break | 0 | null | 46,785,603,738,606 | 233 | 108 |
def solve():
N = int(input())
return N*N
print(solve()) | import math
N,K=map(int,input().split())
sum=0
for s in range(K,N+1):
sum+=(s*(2*N-s+1))/2-(s*(s-1))/2+1
print(int(sum+1)%1000000007) | 0 | null | 89,027,851,820,890 | 278 | 170 |
numbers = [int(i) for i in input().split()]
D, S, T = numbers[0], numbers[1], numbers[2]
if D <= S*T:
print("Yes")
else:
print("No")
| import math
A=[]
while True:
n=int(input())
if n==0 :
break
else :
b=list((map(int,input().split())))
ave=sum(b)/n
for i in range(n):
A.append((ave-b[i])**2)
p=math.sqrt(sum(A)/n)
print("{:.8f}".format(p))
A.clear()
| 0 | null | 1,841,467,432,760 | 81 | 31 |
n = int(input())
odd = n//2 + n%2
print(odd/n)
| def main():
L, R, d = (int(i) for i in input().split())
ans = 0
for i in range(L, R+1):
if i % d == 0:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 92,766,012,978,760 | 297 | 104 |
import numpy as np
MOD = 998244353
N,S = map(int,input().split())
A = list(map(int,input().split()))
coefs = np.array([0]*(S+1))
coefs[0] = 1
for i in range(N):
tmp = coefs[:]
coefs = coefs*2
coefs[A[i]:] += tmp[:-A[i]]
coefs%=MOD
print(coefs[-1])
| r = int(input())
a = r**2
print(a) | 0 | null | 81,197,313,980,090 | 138 | 278 |
class card:
def __init__(self, types, value):
self.types = types
self.value = value
def bubbleSort(A, N):
for i in range(0, N):
for j in range(N - 1, i, -1):
if A[j].value < A[j - 1].value:
exchange(A, j - 1, j)
printCards(A)
print "Stable"
def selectionSort(A, N):
origin = A[:]
for i in range(0, N):
minj = i
for j in range(i, N):
if A[j].value < A[minj].value:
minj = j
if i != minj:
exchange(A, i, minj)
printCards(A)
if checkStable(origin, A, N):
print "Stable"
else:
print "Not stable"
def exchange(array, i, j):
tmp = array[i]
array[i] = array[j]
array[j] = tmp
def printCards(cards):
print " ".join(t.types + str(t.value) for t in cards)
def checkStable(origin, sorted, N):
for i in range(0, N - 1):
if sorted[i].value == sorted[i + 1].value:
if origin.index(sorted[i]) > origin.index(sorted[i + 1]):
return False
return True
if __name__ == "__main__":
N = input()
A = [card(c[0], int(c[1])) for c in raw_input().split()]
bubbleSort(A[:], N)
selectionSort(A[:], N) | # coding: utf-8
# Here your code !
n=int(input())
cards=input().split()
def bubble_sort(cards_b,n):
for i in range(n):
for j in range(-1,-n,-1):
a=int(cards_b[j][1])
b=int(cards_b[j-1][1])
if a<b:
cards_b[j],cards_b[j-1]=cards_b[j-1],cards_b[j]
return cards_b
def selection_sort(cards_s,n):
for i in range(n):
minv=i
for j in range(i,n):
a=int(cards_s[minv][1])
b=int(cards_s[j][1])
if a>b:
minv=j
cards_s[minv],cards_s[i]=cards_s[i],cards_s[minv]
return cards_s
dummy=cards.copy()
ans_1=bubble_sort(cards,n)
ans_2=selection_sort(dummy,n)
print(*ans_1)
print("Stable")
print(*ans_2)
if ans_1!=ans_2:
print("Not stable")
else:
print("Stable") | 1 | 26,554,950,110 | null | 16 | 16 |
N,K = map(int,input().split())
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort()
F.sort(reverse=True)
ng = -1
ok = 10**12+100
while ok - ng > 1:
mid = (ok + ng) // 2
c = 0
for a,f in zip(A,F):
c += max(0,a-mid//f)
if c <= K:
ok = mid
else:
ng = mid
print(ok) | import sys
import numpy as np # noqa
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
C = readline().rstrip().decode()
a = 0 # a: 赤から白に変える操作
b = 0 # b: 白から赤に変える操作
for i in range(len(C)):
if C[i] == 'R':
a += 1
mn = a
for i in range(len(C)):
if C[i] == 'R':
a -= 1
else:
b += 1
mn = min(mn, min(a, b) + abs(a-b))
print(mn)
| 0 | null | 85,698,324,632,548 | 290 | 98 |
seq = int(input())
a = int(10**9 + 7)
answer = (10**seq - 9**seq - 9**seq + 8**seq)%a
print(answer) | n = int(input())
MOD = 1000000007
ans = pow(10,n,MOD) - pow(9,n,MOD) - pow(9,n,MOD) + pow(8,n,MOD)
print((ans+MOD)%MOD) | 1 | 3,178,440,806,302 | null | 78 | 78 |
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
#各行では連続した区間
#行ごとに見ないと話が進まん，降りるタイミぐは各列高々3000こ，来るタイミングも同様
mod=10**9+7
R,C,K=MI()
S=[[0]*(C+1) for _ in range(R+1)]
for i in range(K):
r,c,v=MI()
S[r][c]=v
dp1=[[0]*(C+1)for _ in range(R+1)]
dp2=[[0]*(C+1)for _ in range(R+1)]
dp3=[[0]*(C+1)for _ in range(R+1)]
# dp[i][j][k]はi行j列まで見てその行でk個以下
for i in range(R+1):
for j in range(C+1):
#S(i,j)からの移動を考える
#右へ移動，-,拾わない，拾う
if j+1<=C:
dp1[i][j+1]=max(dp1[i][j+1],dp1[i][j],S[i][j+1])
dp2[i][j+1]=max(dp2[i][j+1],dp2[i][j],dp1[i][j]+S[i][j+1])
dp3[i][j+1]=max(dp3[i][j+1],dp3[i][j],dp2[i][j]+S[i][j+1])
#下へ
if i+1<=R:
temp=max(dp1[i][j],dp2[i][j],dp3[i][j])
dp1[i+1][j]=temp+S[i+1][j]
ans=max(dp1[-1][-1],dp2[-1][-1],dp3[-1][-1])
# for i in range(R+1):
# print(dp[i])
print(ans)
main()
| import sys
alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
cnt = 26 * [0]
Input = ""
loop = True
#while loop:
# I = input()
# if not I:
# loop = False
# Input += I
for I in sys.stdin:
Input += I
for i1 in range(len(alphabet)):
for i2 in range(len(Input)):
if 'A' <= Input[i2] <= 'Z':
w = Input[i2].lower()
else:
w = Input[i2]
if alphabet[i1] == w:
cnt[i1] += 1
print(alphabet[i1] + " : " + str(cnt[i1])) | 0 | null | 3,606,382,840,098 | 94 | 63 |
import sys
n,m = map(int, input().split())
num = [0]*n
al = [-1]*n
Ans = 0
for i in range(m):
s,c = map(int, input().split())
if num[s-1] != 0 and num[s-1] != c:
print(-1)
sys.exit()
else:
num[s-1] = c
al[s-1] = c
if al.count(0)==n and n >= 2:
print(-1)
sys.exit()
if al[0] == 0and n >= 2:
print(-1)
sys.exit()
if num[0] == 0 and n >= 2:
num[0] = 1
for i in range(len(num)):
Ans = Ans + num[i] * (10 ** (n-i-1))
if Ans == 0 and n >= 2:
print(-1)
else:
print(Ans) | apex = ((1,2,3),
(1,4,2),
(1,5,4),
(1,3,5),
(2,1,4),
(2,3,1),
(2,6,3),
(2,4,6),
(3,1,2),
(3,5,1),
(3,6,5),
(3,2,6),
(4,1,5),
(4,2,1),
(4,6,2),
(4,5,6),
(5,3,6),
(5,1,3),
(5,4,1),
(5,6,4),
(6,3,2),
(6,5,3),
(6,4,5),
(6,2,4)
)
dice = {}
label = []
label[:] = map(int,input().split())
#print('label: {}'.format(label))
for i in range(0,6):
dice[label[i]] = i+1
#print('dice: {}'.format(dice))
q = int(input())
for _ in range(0,q):
numbers = []
numbers[:] = map(int,input().split())
right = 0
for t in apex:
if (t[0] == dice[numbers[0]] and t[1] == dice[numbers[1]]):
right = t[2]
#print('{} {} {}'.format(t[0],t[1],t[2]))
break
for key, n in dice.items():
if (n == right):
print(key)
break
| 0 | null | 30,316,003,131,340 | 208 | 34 |
import math
a,b,C=map(int,input().split())
c=C/180*math.pi
d=math.sqrt(a**2+b**2-2*a*b*math.cos(c))
S=1/2*a*b*math.sin(c)
L=a+b+d
h=2*S/a
print("{:.8f}".format(S))
print("{:.8f}".format(L))
print("{:.8f}".format(h))
| H=int(input())
W=int(input())
N=int(input())
if N%max(H,W)==0:
print(N//max(H,W))
else:
print(N//max(H,W)+1) | 0 | null | 44,630,284,285,792 | 30 | 236 |
X = int(input())
Y = X % 500
answer = (X // 500 * 1000 + Y // 5 * 5)
print(answer) | D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
out = [int(input()) for _ in range(D)]
sat = 0
last = [0] * 26
for d in range(D):
assert(1 <= out[d] and out[d] <= 26)
j = out[d] - 1
last[j] = d + 1
for i in range(26):
sat -= (d + 1 - last[i]) * c[i]
sat += s[d][j]
print(sat) | 0 | null | 26,380,415,523,290 | 185 | 114 |
N = int(input())
S = input()
ans = ['' for _ in range(len(S))]
a = ord('A')
for i, c in enumerate(S):
ans[i] = chr((ord(c) - a + N) % 26 + a)
print(''.join(ans)) | ma = lambda :map(int,input().split())
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
x = ni()
if x>=30:
f=True
else:
f=False
yn(f)
| 0 | null | 69,901,608,237,680 | 271 | 95 |
n = int(input())
fib = [1]*2 + [0]*(n-1)
for i in range(2, n+1):
fib[i] = fib[i-1] + fib[i-2]
print(fib[n]) | y=[1,1]
n=int(input())
for i in range(0,n):
a=y[i]+y[i+1]
y.append(a)
print(y[n])
| 1 | 1,904,870,338 | null | 7 | 7 |
from collections import deque
n = int(input())
que = deque()
for _ in range(n):
cmd = input()
if cmd == 'deleteFirst':
try:
que.popleft()
except:
pass
elif cmd == 'deleteLast':
try:
que.pop()
except:
pass
else:
cmd, x = cmd.split()
if cmd == 'insert':
que.appendleft(x)
elif cmd == 'delete':
try:
que.remove(x)
except:
pass
print(*que)
| import collections,sys
def s():
d=collections.deque()
input()
for e in sys.stdin:
if'i'==e[0]:d.appendleft(e[7:-1])
else:
if' '==e[6]:
m=e[7:-1]
if m in d:d.remove(m)
elif len(e)&1:d.pop()
else:d.popleft()
print(*d)
if'__main__'==__name__:s()
| 1 | 49,718,013,358 | null | 20 | 20 |
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 01:13:08 2020
@author: liang
"""
"""
ABC 171 D 差分更新 パケット変換
【無駄な探索は行わない（メモリ化） ⇒ パケット変換】
パケット
値vが出現する回数を記録しておく
dict()方式 ⇒ 探索にO(logn) or O(n)がかかる
配列方式 ⇒ 探索がO(1)となる!
【差分更新】
値Bが全て値Cになる
⇒ (C - B) * 値Bの個数だけ増加する
⇒ 値Cの個数 += 値Bの個数
⇒ 値Bの個数 = 0
"""
N = int(input())
A = [int(i) for i in input().split()]
Q = int(input())
d = [0]*(10**5)
for i in A:
d[i-1] += 1
ans = sum(A)
for i in range(Q):
b, c = map(int,input().split())
ans += (c-b)*d[b-1]
d[c-1] += d[b-1]
d[b-1] = 0
print(ans) | n=int(input())
s=input()
if n%2!=0:
print("No")
elif s[0:int(n/2)]==s[int(n/2):n]:
print("Yes")
else:
print("No")
| 0 | null | 79,272,787,897,888 | 122 | 279 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
n, *a = map(int, read().split())
p = np.array(a)
minp = np.minimum.accumulate(p)
r = np.count_nonzero(minp >= p)
print(r)
if __name__ == '__main__':
main() | N, M, X = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(N)]
answer = 10**7
for num in range(2**N):
algos = [0 for i in range(M+1)]
money = 0
for i in range(N):
if num>>i&1:
for j in range(1, M+1):
algos[j] += books[i][j]
money += books[i][0]
master = True
for k in range(1, M+1):
if algos[k] < X:
master = False
break
if master:
answer = min(answer, money)
if answer == 10**7:
print(-1)
else:
print(answer) | 0 | null | 54,151,014,459,010 | 233 | 149 |
def isPrime(n):
i = 2
while i*i <= n:
if n % i == 0:
return False
i += 1
return True
n = int(input())
ans = 0
for i in range(n):
t = int(input())
if isPrime(t):
ans += 1
print(ans) | SN=[5,1,2,6]
WE=[4,1,3,6]
def EWSN(d):
global SN,WE
if d == "S" :
SN = SN[3:4] + SN[0:3]
WE[3] = SN[3]
WE[1] = SN[1]
elif d == "N":
SN = SN[1:4] + SN[0:1]
WE[3] = SN[3]
WE[1] = SN[1]
elif d == "E":
WE = WE[3:4] + WE[0:3]
SN[3] = WE[3]
SN[1] = WE[1]
elif d == "W":
WE = WE[1:4] + WE[0:1]
SN[3] = WE[3]
SN[1] = WE[1]
dice = list(map(int,input().split(" ")))
op = input()
for i in op:
EWSN(i)
print(dice[SN[1] - 1])
| 0 | null | 119,437,850,232 | 12 | 33 |
import typing
def binary_serch(x:int, b_sum:list):
l = 0
r = len(b_sum) - 1
mid = (l + r + 1) // 2
res = mid
while True:
if x == b_sum[mid]:
return mid
elif x < b_sum[mid]:
res = mid - 1
r = mid
mid = (l + r + 1) // 2
elif b_sum[mid] < x:
res = mid
l = mid
mid = (l + r + 1) // 2
if l + 1 == r:
return res
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
b_sum = [0] * (m + 2)
for i in range(m):
b_sum[i + 1] = b[i] + b_sum[i]
b_sum[-1] = 10 ** 9 + 1
a = [0] + a
pass_k = 0
ans = 0
for i in range(n + 1):
if pass_k + a[i] <= k:
pass_k += a[i]
book = i
book += binary_serch(k - pass_k, b_sum)
ans = max(ans, book)
else:
break
print(ans) | import sys
from functools import reduce
from math import gcd
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
mod = 10 ** 9 + 7
N = int(readline())
A = list(map(int,readline().split()))
lcm = reduce(lambda x,y:x*y//gcd(x,y),A)
ans = 0
ans = sum(lcm//x for x in A)
print(ans%mod) | 0 | null | 49,151,047,479,920 | 117 | 235 |
from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))
def gcd(a, b):
if a % b == 0:
return b
else:
return gcd(b, a % b)
def main():
X = ri()
K = 360 // gcd(360, X)
print(K)
if __name__ == '__main__':
main()
| import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
x = int(readline())
for i in range(1, 361):
if (x * i) % 360 == 0:
return print(i)
if __name__ == '__main__':
main()
| 1 | 13,139,500,346,442 | null | 125 | 125 |
N = int(input())
c = input()
red = 0
for i in c:
if i=="R":
red += 1
br = 0
ans = 10**12 if red else 0
for i in range(red):
if c[i]=="R":
br += 1
white = i+1 - br
disappear = red - br - white
ans = min(ans, white+disappear)
print(ans)
| # -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
c_list = list(sys.stdin.readline().rstrip())
num_R = c_list.count("R")
cnt = 0
for i in range(num_R):
if c_list[i] == "W":
cnt += 1
print(cnt)
if __name__ == "__main__":
main()
| 1 | 6,359,581,755,140 | null | 98 | 98 |
N = int(input())
A = list(map(int, input().split()))
bottom = sum(A)
if N == 0:
if A[0] != 1:
print(-1)
else:
print(1)
exit()
ret = 1
children = 1 - A[0]
bottom -= A[0]
for i in range(N):
children = children * 2 - A[i+1]
if children <= -1:
ret = -1
break
bottom -= A[i+1]
if children >= bottom:
children = bottom
ret += children + A[i+1]
print(ret) | MOD = 998244353
N, K = list(map(int, input().split()))
dp = [0] * (N+1)
dp[1] = 1
LR = []
for i in range(K):
l, r = list(map(int, input().split()))
LR.append([l, r])
for i in range(2, N+1):
dp[i] = dp[i-1]
for j in range(K):
l, r = LR[j]
dp[i] += dp[max(i-l, 0)] - dp[max(i-r-1, 0)]
dp[i] %= MOD
print((dp[N]-dp[N-1]) % MOD) | 0 | null | 10,845,164,317,482 | 141 | 74 |
# 初期入力
from bisect import bisect_left
import sys
#input = sys.stdin.readline #文字列では使わない
N = int(input())
c =input().strip()
ans =0
w =[i for i, x in enumerate(c) if x == 'W']
r =[i for i, x in enumerate(c) if x == 'R']
w_num =len(w) #全体でWの数
r_num =len(r) #全体でRの数
ans =bisect_left(r,r_num)
print(r_num -ans) | n = int(input())
c = list(input())
r = 0
w = 0
for i in range(len(c)):
if(c[i]=="R"):
r += 1
ans = max(r,w)
for i in range(len(c)):
if(c[i]=="R"):
r -= 1
else:
w += 1
now = max(r,w)
ans = min(ans,now)
print(ans) | 1 | 6,307,902,146,140 | null | 98 | 98 |
from functools import reduce
N = int(input())
A = list(map(int, input().split()))
m = reduce(lambda a, b: a^b, A)
l = list(map(str, [a ^ m for a in A]))
ans = ' '.join(l)
print(ans) | N = int(input())
A = list(map(int,input().split()))
X = 0
for i in range(N):
X = X^A[i]
ans = []
for i in range(N):
temp = X^A[i]
ans.append(temp)
print(*ans) | 1 | 12,448,855,762,460 | null | 123 | 123 |
N = int(input())
L = list(map(int,input().split()))
d = {}
for i in range(N):
d[L[i]] = i + 1
for j in range(1 , N + 1):
print(d[j] , end = ' ')
| n=int(input())
A=list(map(int,input().split()))
r = [-1]*n
for i,a in enumerate(A):
r[a-1]=i+1
for r2 in r:
print(r2) | 1 | 180,276,973,588,322 | null | 299 | 299 |
from math import pow
N = int(input())
X = list(map(int, input().split(' ')))
Y = list(map(int, input().split(' ')))
for i in range(1, 4):
print('{:.5f}'.format(
pow(sum([abs(X[j] - Y[j])**i for j in range(N)]), 1/i)
))
print('{:.5f}'.format(
max([abs(X[j] - Y[j]) for j in range(N)])
)) | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort()
return divisors
n = int(input())
d2 = make_divisors(n - 1)
ans = len(d2)
for k in make_divisors(n):
if k == 1:
continue
tmp = n
while tmp % k == 0:
tmp //= k
if tmp % k == 1:
d2.append(k)
print(len(d2) - 1)
| 0 | null | 20,886,037,618,740 | 32 | 183 |
def makeRelation():
visited=[False]*(N+1)
g=0 # group
for n in range(1,N+1):
if visited[n]:
continue
q={n}
D.append(set())
while q:
j=q.pop()
for i in F[j]: # search for friend
if not visited[i]:
visited[i]=True
q.add(i)
D[g]|={i}
g+=1
def main():
makeRelation()
#print(D)
for g in D:
for d in g:
ans[d]=len(g) - len(F[d]) - len(g&B[d]) - 1
print(*ans[1:])
if __name__=='__main__':
N, M, K = map(int, input().split())
F=[set() for n in range(N+1)]
AB=[list(map(int, input().split())) for m in range(M)]
for a,b in AB:
F[a].add(b)
F[b].add(a)
B=[set() for n in range(N+1)]
CD=[list(map(int, input().split())) for k in range(K)]
for c,d in CD:
B[c].add(d)
B[d].add(c)
D=[]
#print(F)
#print(B)
ans=[0]*(N+1)
main() | K = int(input())
num = 0
for i in range(0,K+1):
num = (num*10+7)%K
if num==0:
print(i+1,'\n')
break
if num:
print("-1\n") | 0 | null | 33,868,551,958,720 | 209 | 97 |
while True:
a = list(map(lambda x : int(x), input().split(" ")))
if a[0] == 0 and a[1] == 0:
break
for i in range(a[0]):
for j in range(a[1]):
print("#", end="")
print()
print() | while True:
H,W = map(int, input().split())
if H == 0 and W == 0:
break
elif H > 301 or W > 301:
break
else:
for i in range(H):
row = '#' * W
print(row)
print("\n", end ='') | 1 | 770,134,249,950 | null | 49 | 49 |
while True:
a=int(input())
if a==0 :
break
b=list(map(float,input().split()))
m=sum(b)/a
ver=0.0
for i in b :
ver+=(i-m)**2/a
s=(ver)**0.5
print(s) | import numpy as np
import sys
input = sys.stdin.readline
def main():
h, w, k = map(int, input().split())
values = np.zeros((h, w), dtype=np.int64)
items = np.array([list(map(int, input().split())) for _ in range(k)])
ys, xs, vs = items[:, 0] - 1, items[:, 1] - 1, items[:, 2]
values[ys, xs] = vs
DP = np.zeros(w + 1, dtype=np.int64)
for line in values:
DP[1:] += line
DP = np.maximum.accumulate(DP)
for _ in range(2):
DP[1:] = np.maximum(DP[:-1] + line, DP[1:])
DP = np.maximum.accumulate(DP)
print(DP[-1])
if __name__ == "__main__":
main()
| 0 | null | 2,912,973,807,472 | 31 | 94 |
class Residents:
def __init__(self):
self.official_house = []
for b in range(4):
self.official_house.append([])
for f in range(3):
self.official_house[b].append([])
for r in range(10):
self.official_house[b][f].append(0)
def move_in(self, building, floor, room, num):
building -= 1
floor -= 1
room -= 1
if self.official_house[building][floor][room] + num > 9:
self.official_house[building][floor][room] = 9
else:
self.official_house[building][floor][room] += num
def move_out(self, building, floor, room, num):
building -= 1
floor -= 1
room -= 1
if self.official_house[building][floor][room] < num:
self.official_house[building][floor][room] = 0
else:
self.official_house[building][floor][room] -= num
def show(self, building, floor, room):
building -= 1
floor -= 1
room -= 1
return self.official_house[building][floor][room]
def output(self):
result = ''
for b in range(4):
if b > 0:
result += '#' * 20 + '\n'
for f in range(3):
for r in range(10):
result += ' ' + str(self.official_house[b][f][r])
result += '\n'
return result
if __name__ == '__main__':
residents = Residents()
rows = int(input())
for i in range(rows):
(b, f, r, num) = [int(i) for i in input().split(' ')]
if num > 0:
residents.move_in(b, f, r, num)
else:
residents.move_out(b, f, r, num * -1)
print(residents.output(), end='') | inf = int(input())
i = 0
table = []
buil = [[[0]*10 for i in range(3)]for i in range(4)]
while(i < inf):
b,f,r,v = map(int,input().split())
b -=1
f -=1
r -=1
buil[b][f][r] += v
if buil[b][f][r] > 9: buil[b][f][r] = 9
elif buil[b][f][r] < 0: buil[b][f][r] = 0
i += 1
for i in range(4):
if i != 0: print("#"*20)
for j in range(3):
for k in range(10):
print(" %d" %(buil[i][j][k]),end ="")
print()
| 1 | 1,085,478,957,042 | null | 55 | 55 |
import time
import copy
start_time = time.time()
#input
D = int(input())
c_list = list(map(int, input().split()))
s_grid = []
for i in range(D):
array = list(map(int, input().strip().split(' ')))
s_grid.append(array)
def calculate_score(d,t,last):
score = s_grid[d][t]
last[t] = -1
for i in range(26):
score -= c_list[i]*(last[i]+1)
return score
t_list = [] #task_list
last_list = [0 for _ in range(26)]
total_score = 0
for k in range(0,D):
X = -1 # k-日目に変える番号を探す
p = 0
last = copy.deepcopy(last_list)
for i in range(26): # 26通り試す
tmp = calculate_score(k,i,last)
if tmp > p:
X = i
p = tmp
#最大のXを投入
total_score += p
t_list.append(X)
last_list = [i+1 for i in last_list]
last_list[X] = 0
#if time.time() - start_time > 1.9:
# break
for j in range(len(t_list)):
print(int(t_list[j]) + 1) | MOD = 1000000007
def mod_pow(x , y):
if y == 0:
return 1
if y == 1:
return x
r = mod_pow(x , y // 2)
r2 = (r * r) % MOD
if y % 2 == 0:
return r2 % MOD
else:
return (r2 * x) % MOD
N , K = map(int , input().split())
result = 0
memo = {}
for g in range(K , 0 , -1):
comb = mod_pow(K // g , N)
for j in range(2 , K // g + 1):
comb = (comb - memo[j * g] + MOD) % MOD
memo[g] = comb
result = (result + comb * g) % MOD
print(result)
| 0 | null | 23,122,537,870,028 | 113 | 176 |
import math
n=int(input());
arr=[]
j=2
while j*j<=n:
cnt=0
while n%j==0:
cnt=cnt+1
n=n/j
if cnt!=0:
arr.append(cnt)
j=j+1
if n>1:
arr.append(1)
ans=int(0)
for i in arr:
ans=ans+int((math.sqrt(1+8*i)-1)/2)
print(ans) | n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
sum = 0
for i in range(n):
for j in range(i+1,n):
sum += ((a[i][0]-a[j][0])**2+(a[i][1]-a[j][1])**2)**0.5
print(2*sum/n) | 0 | null | 82,795,799,445,986 | 136 | 280 |
def black_jack():
# 入力
A1, A2, A3 = map(int, input().split())
# 初期処理
sum = A1 + A2 + A3
# 判別処理
if sum >= 22:
return 'bust'
elif sum <= 21:
return 'win'
result = black_jack()
print(result) | a, b, c = [int(x) for x in input().split()]
if a + b + c >= 22:
print("bust")
else:
print("win")
| 1 | 118,715,651,706,130 | null | 260 | 260 |
n = int(input())
dic = {}
for i in range(1,50000):
dic[int(i * 1.08)] = i
if n in dic:
print(dic[n])
else:
print(':(') | import math
def main():
n = int(input())
tax = 1.08
ans = math.ceil(n / tax)
ans_check = ans * tax
if math.floor(ans * tax) == n:
print(ans)
else:
print(":(")
if __name__ == "__main__":
main() | 1 | 125,852,188,392,700 | null | 265 | 265 |
def main():
x,y = map(int, input().split())
while y != 0:
if x < y: x, y = y, x
x, y = y, x % y
print(x)
main() | def gcd (x , y):
sur = x % y
while sur != 0:
x = y
y = sur
sur = x % y
return y
a,b = map(int,raw_input().split())
if a < b :
temp = a
a = b
b = temp
print gcd(a,b) | 1 | 7,781,065,598 | null | 11 | 11 |
if __name__ == '__main__':
N = int(input())
D = [input() for i in range(N)]
for i in range(2,N):
if (D[i][0] == D[i][-1]) \
and (D[i-1][0] == D[i-1][-1]) \
and (D[i-2][0] == D[i-2][-1]):
print('Yes')
break
if i == N-1:
print('No') | r_input = input().split()
r = int(r_input[0])
print(r*r) | 0 | null | 73,995,264,325,970 | 72 | 278 |
N = int(input())
a = list(map(int, input().split()))
ans = 0
h = a[0]
for i in range(1,N,1):
if h < a[i]:
h = a[i]
else:
ans += (h - a[i])
print(ans) | import sys
N, M = map(int, input().split())
A = list(map(int, input().split()))
sum_day = sum(A)
ans = N - sum_day
if ans < 0:
print(-1)
else:
print(ans) | 0 | null | 18,414,595,653,380 | 88 | 168 |
S = input()
Sx = ""
for _ in range(len(S)):
Sx += "x"
S = Sx
print(S) | S=input()
N=len(S)
M=[]
for i in range(N):
M.append('x')
L=''.join(M)
print(L) | 1 | 72,770,092,376,532 | null | 221 | 221 |
a,b,k=map(int,input().split())
print(a-k,b) if k-a<=0 else print(0,b-(k-a)) if b-(k-a)>=0 else print(0,0) | def main():
a, b, k = map(int, input().split())
if k >= a and b >= k-a:
print(0, b-(k-a))
elif k >= a and b < k-a:
print(0, 0)
else:
print(a-k, b)
if __name__ == '__main__':
main()
| 1 | 104,522,762,477,100 | null | 249 | 249 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.