user_id
stringlengths 10
10
| problem_id
stringlengths 6
6
| language
stringclasses 1
value | submission_id_v0
stringlengths 10
10
| submission_id_v1
stringlengths 10
10
| cpu_time_v0
int64 10
38.3k
| cpu_time_v1
int64 0
24.7k
| memory_v0
int64 2.57k
1.02M
| memory_v1
int64 2.57k
869k
| status_v0
stringclasses 1
value | status_v1
stringclasses 1
value | improvement_frac
float64 7.51
100
| input
stringlengths 20
4.55k
| target
stringlengths 17
3.34k
| code_v0_loc
int64 1
148
| code_v1_loc
int64 1
184
| code_v0_num_chars
int64 13
4.55k
| code_v1_num_chars
int64 14
3.34k
| code_v0_no_empty_lines
stringlengths 21
6.88k
| code_v1_no_empty_lines
stringlengths 20
4.93k
| code_same
bool 1
class | relative_loc_diff_percent
float64 0
79.8
| diff
list | diff_only_import_comment
bool 1
class | measured_runtime_v0
float64 0.01
4.45
| measured_runtime_v1
float64 0.01
4.31
| runtime_lift
float64 0
359
| key
list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u623819879
|
p02793
|
python
|
s562953614
|
s517964009
| 1,009 | 560 | 134,724 | 180,804 |
Accepted
|
Accepted
| 44.5 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in input().split()]
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def NI(n):
return [int(input()) for i in range(n)]
def NI_(n):
return [int(input())-1 for i in range(n)]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def LtoS(ls):
return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
org_inp=[]
g=[[] for i in range(n)]
for i in range(E):
inp=LI()
org_inp.append(inp)
if index==0:
inp[0]-=1
inp[1]-=1
if len(inp)==2:
a,b=inp
g[a].append(b)
if not Directed:
g[b].append(a)
elif len(inp)==3:
a,b,c=inp
aa=(inp[0],inp[2])
bb=(inp[1],inp[2])
g[a].append(bb)
if not Directed:
g[b].append(aa)
return g,org_inp
def bit_combination(k,n=2):
rt=[]
for tb in range(n**k):
s=[tb//(n**bt)%n for bt in range(k)]
rt+=[s]
return rt
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()
def ran_input():
import random
n=random.randint(4,16)
rmin,rmax=1,10
a=[random.randint(rmin,rmax) for _ in range(n)]
return n,a
def primeFactor(N): # return prime factors of N as dictionary {prime p:power of p}
i,n=2,N
ret={}
d,sq=2,99
while i<=sq:
k=0
while n%i==0:
n,k,ret[i]=n//i,k+1,k+1
if k>0 or i==97:
sq=int(n**(1/2)+0.5)
if i<4:
i=i*2-1
else:
i,d=i+d,d^6
if n>1:
ret[n]=1
return ret
def PrimeNumSet(N): # return the list of prime numbers in [2,N], using eratosthenes sieve
Max = int(N**0.5)
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList and seachList[0] <= Max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
def LCM(b,mo=10**9+7): # retrun LCM of numbers in list b
prs=PrimeNumSet(max(b))
M=dict(zip(prs,[0]*len(prs)))
for i in b:
dc=primeFactor(i)
for j,k in dc.items():
M[j]=max(M[j],k)
r=1
for j,k in M.items():
if k!=0:
r*=pow(j,k,mo)
r%=mo
return r
show_flg=False
show_flg=True
ans=0
n=I()
a=LI()
m=LCM(a)
x=0
for i in a:
x+=m*pow(i,mo-2,mo)
x%=mo
print(x)
|
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in input().split()]
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def NI(n):
return [int(input()) for i in range(n)]
def NI_(n):
return [int(input())-1 for i in range(n)]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def LtoS(ls):
return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
org_inp=[]
g=[[] for i in range(n)]
for i in range(E):
inp=LI()
org_inp.append(inp)
if index==0:
inp[0]-=1
inp[1]-=1
if len(inp)==2:
a,b=inp
g[a].append(b)
if not Directed:
g[b].append(a)
elif len(inp)==3:
a,b,c=inp
aa=(inp[0],inp[2])
bb=(inp[1],inp[2])
g[a].append(bb)
if not Directed:
g[b].append(aa)
return g,org_inp
def bit_combination(k,n=2):
rt=[]
for tb in range(n**k):
s=[tb//(n**bt)%n for bt in range(k)]
rt+=[s]
return rt
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()
def ran_input():
import random
n=random.randint(4,16)
rmin,rmax=1,10
a=[random.randint(rmin,rmax) for _ in range(n)]
return n,a
def primeFactor(N): # return prime factors of N as dictionary {prime p:power of p}
i,n=2,N
ret={}
d,sq=2,99
while i<=sq:
k=0
while n%i==0:
n,k,ret[i]=n//i,k+1,k+1
if k>0 or i==97:
sq=int(n**(1/2)+0.5)
if i<4:
i=i*2-1
else:
i,d=i+d,d^6
if n>1:
ret[n]=1
return ret
def PrimeNumSet(N): # return the list of prime numbers in [2,N], using eratosthenes sieve
Max = int(N**0.5)
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList:
if seachList[0] <= Max:
break
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
def LCM(b,mo=10**9+7): # retrun LCM of numbers in list b
prs=PrimeNumSet(max(b))
M=dict(zip(prs,[0]*len(prs)))
for i in b:
dc=primeFactor(i)
for j,k in dc.items():
M[j]=max(M[j],k)
r=1
for j,k in M.items():
if k!=0:
r*=pow(j,k,mo)
r%=mo
return r
show_flg=False
show_flg=True
ans=0
n=I()
a=LI()
m=LCM(a)
x=0
for i in a:
x+=m*pow(i,mo-2,mo)
x%=mo
print(x)
| 140 | 142 | 3,264 | 3,292 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in input().split()]
def I():
return int(input())
def MI():
return map(int, input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i) - 1 for i in input().split()]
def NI(n):
return [int(input()) for i in range(n)]
def NI_(n):
return [int(input()) - 1 for i in range(n)]
def StoI():
return [ord(i) - 97 for i in input()]
def ItoS(nn):
return chr(nn + 97)
def LtoS(ls):
return "".join([chr(i + 97) for i in ls])
def GI(V, E, Directed=False, index=0):
org_inp = []
g = [[] for i in range(n)]
for i in range(E):
inp = LI()
org_inp.append(inp)
if index == 0:
inp[0] -= 1
inp[1] -= 1
if len(inp) == 2:
a, b = inp
g[a].append(b)
if not Directed:
g[b].append(a)
elif len(inp) == 3:
a, b, c = inp
aa = (inp[0], inp[2])
bb = (inp[1], inp[2])
g[a].append(bb)
if not Directed:
g[b].append(aa)
return g, org_inp
def bit_combination(k, n=2):
rt = []
for tb in range(n**k):
s = [tb // (n**bt) % n for bt in range(k)]
rt += [s]
return rt
def show(*inp, end="\n"):
if show_flg:
print(*inp, end=end)
YN = ["Yes", "No"]
mo = 10**9 + 7
inf = float("inf")
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**5)
input = lambda: sys.stdin.readline().rstrip()
def ran_input():
import random
n = random.randint(4, 16)
rmin, rmax = 1, 10
a = [random.randint(rmin, rmax) for _ in range(n)]
return n, a
def primeFactor(N): # return prime factors of N as dictionary {prime p:power of p}
i, n = 2, N
ret = {}
d, sq = 2, 99
while i <= sq:
k = 0
while n % i == 0:
n, k, ret[i] = n // i, k + 1, k + 1
if k > 0 or i == 97:
sq = int(n ** (1 / 2) + 0.5)
if i < 4:
i = i * 2 - 1
else:
i, d = i + d, d ^ 6
if n > 1:
ret[n] = 1
return ret
def PrimeNumSet(
N,
): # return the list of prime numbers in [2,N], using eratosthenes sieve
Max = int(N**0.5)
seachList = [i for i in range(2, N + 1)]
primeNum = []
while seachList and seachList[0] <= Max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
def LCM(b, mo=10**9 + 7): # retrun LCM of numbers in list b
prs = PrimeNumSet(max(b))
M = dict(zip(prs, [0] * len(prs)))
for i in b:
dc = primeFactor(i)
for j, k in dc.items():
M[j] = max(M[j], k)
r = 1
for j, k in M.items():
if k != 0:
r *= pow(j, k, mo)
r %= mo
return r
show_flg = False
show_flg = True
ans = 0
n = I()
a = LI()
m = LCM(a)
x = 0
for i in a:
x += m * pow(i, mo - 2, mo)
x %= mo
print(x)
|
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
return input()
def LS():
return [i for i in input().split()]
def I():
return int(input())
def MI():
return map(int, input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i) - 1 for i in input().split()]
def NI(n):
return [int(input()) for i in range(n)]
def NI_(n):
return [int(input()) - 1 for i in range(n)]
def StoI():
return [ord(i) - 97 for i in input()]
def ItoS(nn):
return chr(nn + 97)
def LtoS(ls):
return "".join([chr(i + 97) for i in ls])
def GI(V, E, Directed=False, index=0):
org_inp = []
g = [[] for i in range(n)]
for i in range(E):
inp = LI()
org_inp.append(inp)
if index == 0:
inp[0] -= 1
inp[1] -= 1
if len(inp) == 2:
a, b = inp
g[a].append(b)
if not Directed:
g[b].append(a)
elif len(inp) == 3:
a, b, c = inp
aa = (inp[0], inp[2])
bb = (inp[1], inp[2])
g[a].append(bb)
if not Directed:
g[b].append(aa)
return g, org_inp
def bit_combination(k, n=2):
rt = []
for tb in range(n**k):
s = [tb // (n**bt) % n for bt in range(k)]
rt += [s]
return rt
def show(*inp, end="\n"):
if show_flg:
print(*inp, end=end)
YN = ["Yes", "No"]
mo = 10**9 + 7
inf = float("inf")
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**5)
input = lambda: sys.stdin.readline().rstrip()
def ran_input():
import random
n = random.randint(4, 16)
rmin, rmax = 1, 10
a = [random.randint(rmin, rmax) for _ in range(n)]
return n, a
def primeFactor(N): # return prime factors of N as dictionary {prime p:power of p}
i, n = 2, N
ret = {}
d, sq = 2, 99
while i <= sq:
k = 0
while n % i == 0:
n, k, ret[i] = n // i, k + 1, k + 1
if k > 0 or i == 97:
sq = int(n ** (1 / 2) + 0.5)
if i < 4:
i = i * 2 - 1
else:
i, d = i + d, d ^ 6
if n > 1:
ret[n] = 1
return ret
def PrimeNumSet(
N,
): # return the list of prime numbers in [2,N], using eratosthenes sieve
Max = int(N**0.5)
seachList = [i for i in range(2, N + 1)]
primeNum = []
while seachList:
if seachList[0] <= Max:
break
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
return primeNum
def LCM(b, mo=10**9 + 7): # retrun LCM of numbers in list b
prs = PrimeNumSet(max(b))
M = dict(zip(prs, [0] * len(prs)))
for i in b:
dc = primeFactor(i)
for j, k in dc.items():
M[j] = max(M[j], k)
r = 1
for j, k in M.items():
if k != 0:
r *= pow(j, k, mo)
r %= mo
return r
show_flg = False
show_flg = True
ans = 0
n = I()
a = LI()
m = LCM(a)
x = 0
for i in a:
x += m * pow(i, mo - 2, mo)
x %= mo
print(x)
| false | 1.408451 |
[
"- while seachList and seachList[0] <= Max:",
"+ while seachList:",
"+ if seachList[0] <= Max:",
"+ break"
] | false | 0.617039 | 0.186958 | 3.300415 |
[
"s562953614",
"s517964009"
] |
u870164956
|
p02900
|
python
|
s529527461
|
s097091099
| 215 | 168 | 38,512 | 38,512 |
Accepted
|
Accepted
| 21.86 |
# 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）
# 3. 2.の結果に含まれる数の種類の数＋１が答え
def main():
a, b = list(map(int, input().split()))
while b != 0: a, b = b, a % b #最大公約数を求める
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
if n == 1: return ans
cursor = 2
if n % cursor == 0: ans += 1
while n % cursor == 0: n = n // cursor
cursor = 3
while cursor ** 2 <= n: # リストを作成して探索範囲を先に作ってforで回す処理だと、リスト生成時の計算量やメモリ消費が多いからwhileで都度計算
if n == 1: break # 終了条件を入れて計算量を間引く
if n % cursor == 0: ans += 1
while n % cursor == 0: n = n // cursor
cursor += 2
if n != 1: ans += 1
return ans
if __name__ == "__main__":
main()
|
# 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）
# 3. 2.の結果に含まれる数の種類の数＋１が答え
def main():
a, b = list(map(int, input().split()))
while b != 0: a, b = b, a % b #最大公約数を求める
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
if n == 1: return ans
cursor = 2
if n % cursor == 0: ans += 1
while n % cursor == 0: n = n // cursor
cursor = 3
# リストを作成して探索範囲を先に作ってforで回す処理だと、リスト生成時の計算量やメモリ消費が多いからwhileで都度計算
while cursor ** 2 <= n:
if n == 1: break
if n % cursor == 0: ans += 1
while n % cursor == 0: n = n // cursor
cursor += 2
if n != 1: ans += 1
return ans
if __name__ == "__main__":
main()
| 31 | 32 | 713 | 699 |
# 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）
# 3. 2.の結果に含まれる数の種類の数＋１が答え
def main():
a, b = list(map(int, input().split()))
while b != 0:
a, b = b, a % b # 最大公約数を求める
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
if n == 1:
return ans
cursor = 2
if n % cursor == 0:
ans += 1
while n % cursor == 0:
n = n // cursor
cursor = 3
while (
cursor**2 <= n
): # リストを作成して探索範囲を先に作ってforで回す処理だと、リスト生成時の計算量やメモリ消費が多いからwhileで都度計算
if n == 1:
break # 終了条件を入れて計算量を間引く
if n % cursor == 0:
ans += 1
while n % cursor == 0:
n = n // cursor
cursor += 2
if n != 1:
ans += 1
return ans
if __name__ == "__main__":
main()
|
# 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）
# 3. 2.の結果に含まれる数の種類の数＋１が答え
def main():
a, b = list(map(int, input().split()))
while b != 0:
a, b = b, a % b # 最大公約数を求める
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
if n == 1:
return ans
cursor = 2
if n % cursor == 0:
ans += 1
while n % cursor == 0:
n = n // cursor
cursor = 3
# リストを作成して探索範囲を先に作ってforで回す処理だと、リスト生成時の計算量やメモリ消費が多いからwhileで都度計算
while cursor**2 <= n:
if n == 1:
break
if n % cursor == 0:
ans += 1
while n % cursor == 0:
n = n // cursor
cursor += 2
if n != 1:
ans += 1
return ans
if __name__ == "__main__":
main()
| false | 3.125 |
[
"- while (",
"- cursor**2 <= n",
"- ): # リストを作成して探索範囲を先に作ってforで回す処理だと、リスト生成時の計算量やメモリ消費が多いからwhileで都度計算",
"+ # リストを作成して探索範囲を先に作ってforで回す処理だと、リスト生成時の計算量やメモリ消費が多いからwhileで都度計算",
"+ while cursor**2 <= n:",
"- break # 終了条件を入れて計算量を間引く",
"+ break"
] | false | 0.045285 | 0.044896 | 1.008668 |
[
"s529527461",
"s097091099"
] |
u724687935
|
p03329
|
python
|
s633763972
|
s835516929
| 240 | 221 | 41,708 | 40,940 |
Accepted
|
Accepted
| 7.92 |
N = int(eval(input()))
ans = N
for v9 in range(N + 1):
cnt = 0
t = v9
w = 9 ** 5
while t >= 9:
if t >= w:
cnt9, t = divmod(t, w)
cnt += cnt9
w //= 9
t = N - (v9 - t)
w = 6 ** 7
while t >= 6:
if t >= w:
cnt6, t = divmod(t, w)
cnt += cnt6
w //= 6
ans = min(ans, cnt + t)
print(ans)
|
N = int(eval(input()))
ans = N
for i in range(N + 1):
cnt = 0
t = i
while t > 0:
cnt += t % 9
t //= 9
t = N - i
while t > 0:
cnt += t % 6
t //= 6
ans = min(ans, cnt)
print(ans)
| 22 | 16 | 409 | 244 |
N = int(eval(input()))
ans = N
for v9 in range(N + 1):
cnt = 0
t = v9
w = 9**5
while t >= 9:
if t >= w:
cnt9, t = divmod(t, w)
cnt += cnt9
w //= 9
t = N - (v9 - t)
w = 6**7
while t >= 6:
if t >= w:
cnt6, t = divmod(t, w)
cnt += cnt6
w //= 6
ans = min(ans, cnt + t)
print(ans)
|
N = int(eval(input()))
ans = N
for i in range(N + 1):
cnt = 0
t = i
while t > 0:
cnt += t % 9
t //= 9
t = N - i
while t > 0:
cnt += t % 6
t //= 6
ans = min(ans, cnt)
print(ans)
| false | 27.272727 |
[
"-for v9 in range(N + 1):",
"+for i in range(N + 1):",
"- t = v9",
"- w = 9**5",
"- while t >= 9:",
"- if t >= w:",
"- cnt9, t = divmod(t, w)",
"- cnt += cnt9",
"- w //= 9",
"- t = N - (v9 - t)",
"- w = 6**7",
"- while t >= 6:",
"- if t >= w:",
"- cnt6, t = divmod(t, w)",
"- cnt += cnt6",
"- w //= 6",
"- ans = min(ans, cnt + t)",
"+ t = i",
"+ while t > 0:",
"+ cnt += t % 9",
"+ t //= 9",
"+ t = N - i",
"+ while t > 0:",
"+ cnt += t % 6",
"+ t //= 6",
"+ ans = min(ans, cnt)"
] | false | 0.107972 | 0.259825 | 0.415556 |
[
"s633763972",
"s835516929"
] |
u887207211
|
p03273
|
python
|
s823798940
|
s220592876
| 23 | 18 | 3,316 | 3,064 |
Accepted
|
Accepted
| 21.74 |
H, W = list(map(int,input().split()))
HW = [eval(input()) for _ in range(H)]
HW = ["".join(hw) for hw in zip(*HW) if hw.count("#") > 0]
HW = ["".join(hw) for hw in zip(*HW) if hw.count("#") > 0]
print(("\n".join(HW)))
|
import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
def main():
h, w = na()
a = [ns() for _ in range(h)]
a = ["".join(hw) for hw in zip(*a) if hw.count("#") > 0]
a = ["".join(hw) for hw in zip(*a) if hw.count("#") > 0]
print(("\n".join(a)))
main()
| 5 | 16 | 207 | 370 |
H, W = list(map(int, input().split()))
HW = [eval(input()) for _ in range(H)]
HW = ["".join(hw) for hw in zip(*HW) if hw.count("#") > 0]
HW = ["".join(hw) for hw in zip(*HW) if hw.count("#") > 0]
print(("\n".join(HW)))
|
import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
def main():
h, w = na()
a = [ns() for _ in range(h)]
a = ["".join(hw) for hw in zip(*a) if hw.count("#") > 0]
a = ["".join(hw) for hw in zip(*a) if hw.count("#") > 0]
print(("\n".join(a)))
main()
| false | 68.75 |
[
"-H, W = list(map(int, input().split()))",
"-HW = [eval(input()) for _ in range(H)]",
"-HW = [\"\".join(hw) for hw in zip(*HW) if hw.count(\"#\") > 0]",
"-HW = [\"\".join(hw) for hw in zip(*HW) if hw.count(\"#\") > 0]",
"-print((\"\\n\".join(HW)))",
"+import sys",
"+",
"+stdin = sys.stdin",
"+ns = lambda: stdin.readline().rstrip()",
"+ni = lambda: int(ns())",
"+na = lambda: list(map(int, stdin.readline().split()))",
"+",
"+",
"+def main():",
"+ h, w = na()",
"+ a = [ns() for _ in range(h)]",
"+ a = [\"\".join(hw) for hw in zip(*a) if hw.count(\"#\") > 0]",
"+ a = [\"\".join(hw) for hw in zip(*a) if hw.count(\"#\") > 0]",
"+ print((\"\\n\".join(a)))",
"+",
"+",
"+main()"
] | false | 0.036729 | 0.059673 | 0.615503 |
[
"s823798940",
"s220592876"
] |
u936985471
|
p03087
|
python
|
s553505051
|
s496017231
| 879 | 302 | 6,084 | 7,964 |
Accepted
|
Accepted
| 65.64 |
N,Q=list(map(int,input().split()))
S=eval(input())
cs=[0]*N
cnt=0
for i in range(1,len(S)):
if S[i-1]=="A" and S[i]=="C":
cnt+=1
cs[i]=cnt
for i in range(Q):
l,r=list(map(int,input().split()))
print((cs[r-1]-cs[l-1]))
|
import sys
readline = sys.stdin.readline
N,Q = list(map(int,readline().split()))
S = readline().rstrip()
cnt = [0] * (N + 1)
for i in range(1,len(S)):
if S[i - 1:i + 1] == "AC":
cnt[i + 1] = 1
for i in range(1,len(cnt)):
cnt[i] = cnt[i - 1] + cnt[i]
for i in range(Q):
l,r = list(map(int,readline().split()))
print((cnt[r] - cnt[l]))
| 11 | 17 | 219 | 358 |
N, Q = list(map(int, input().split()))
S = eval(input())
cs = [0] * N
cnt = 0
for i in range(1, len(S)):
if S[i - 1] == "A" and S[i] == "C":
cnt += 1
cs[i] = cnt
for i in range(Q):
l, r = list(map(int, input().split()))
print((cs[r - 1] - cs[l - 1]))
|
import sys
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
S = readline().rstrip()
cnt = [0] * (N + 1)
for i in range(1, len(S)):
if S[i - 1 : i + 1] == "AC":
cnt[i + 1] = 1
for i in range(1, len(cnt)):
cnt[i] = cnt[i - 1] + cnt[i]
for i in range(Q):
l, r = list(map(int, readline().split()))
print((cnt[r] - cnt[l]))
| false | 35.294118 |
[
"-N, Q = list(map(int, input().split()))",
"-S = eval(input())",
"-cs = [0] * N",
"-cnt = 0",
"+import sys",
"+",
"+readline = sys.stdin.readline",
"+N, Q = list(map(int, readline().split()))",
"+S = readline().rstrip()",
"+cnt = [0] * (N + 1)",
"- if S[i - 1] == \"A\" and S[i] == \"C\":",
"- cnt += 1",
"- cs[i] = cnt",
"+ if S[i - 1 : i + 1] == \"AC\":",
"+ cnt[i + 1] = 1",
"+for i in range(1, len(cnt)):",
"+ cnt[i] = cnt[i - 1] + cnt[i]",
"- l, r = list(map(int, input().split()))",
"- print((cs[r - 1] - cs[l - 1]))",
"+ l, r = list(map(int, readline().split()))",
"+ print((cnt[r] - cnt[l]))"
] | false | 0.046798 | 0.038511 | 1.215199 |
[
"s553505051",
"s496017231"
] |
u654470292
|
p03013
|
python
|
s790974154
|
s239526370
| 207 | 104 | 7,080 | 21,124 |
Accepted
|
Accepted
| 49.76 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
waru=1000000007
def Fib(n):
a, b = 0, 1
if n == 1:
return a
elif n == 2:
return b
else:
for i in range(n-2):
a, b = b, a + b
return b
ans=1
now=0
for i in range(m):
ans*=Fib(a[i]-now+1)
now=a[i]+1
ans*=Fib(n-now+2)
print((ans%waru))
|
import bisect, copy, heapq, math
from math import inf
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dic={}
for i in range(m):
dic[a[i]]=1
dp=[0]*(n+2)
dp[0]=1
for i in range(n):
if i in dic:
continue
dp[i+1]+=dp[i]
dp[i+2]+=dp[i]
dp[i+1]%=mod
dp[i+2]%=mod
print((dp[-2]))
| 24 | 34 | 389 | 761 |
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
waru = 1000000007
def Fib(n):
a, b = 0, 1
if n == 1:
return a
elif n == 2:
return b
else:
for i in range(n - 2):
a, b = b, a + b
return b
ans = 1
now = 0
for i in range(m):
ans *= Fib(a[i] - now + 1)
now = a[i] + 1
ans *= Fib(n - now + 2)
print((ans % waru))
|
import bisect, copy, heapq, math
from math import inf
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0] + list(accumulate(lst))
def celi(a, b):
return -(-a // b)
sys.setrecursionlimit(5000000)
mod = pow(10, 9) + 7
al = [chr(ord("a") + i) for i in range(26)]
direction = [[1, 0], [0, 1], [-1, 0], [0, -1]]
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
dic = {}
for i in range(m):
dic[a[i]] = 1
dp = [0] * (n + 2)
dp[0] = 1
for i in range(n):
if i in dic:
continue
dp[i + 1] += dp[i]
dp[i + 2] += dp[i]
dp[i + 1] %= mod
dp[i + 2] %= mod
print((dp[-2]))
| false | 29.411765 |
[
"+import bisect, copy, heapq, math",
"+from math import inf",
"+import sys",
"+from collections import *",
"+from functools import lru_cache",
"+from itertools import accumulate, combinations, permutations, product",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline()[:-1]",
"+",
"+",
"+def ruiseki(lst):",
"+ return [0] + list(accumulate(lst))",
"+",
"+",
"+def celi(a, b):",
"+ return -(-a // b)",
"+",
"+",
"+sys.setrecursionlimit(5000000)",
"+mod = pow(10, 9) + 7",
"+al = [chr(ord(\"a\") + i) for i in range(26)]",
"+direction = [[1, 0], [0, 1], [-1, 0], [0, -1]]",
"-waru = 1000000007",
"-",
"-",
"-def Fib(n):",
"- a, b = 0, 1",
"- if n == 1:",
"- return a",
"- elif n == 2:",
"- return b",
"- else:",
"- for i in range(n - 2):",
"- a, b = b, a + b",
"- return b",
"-",
"-",
"-ans = 1",
"-now = 0",
"+dic = {}",
"- ans *= Fib(a[i] - now + 1)",
"- now = a[i] + 1",
"-ans *= Fib(n - now + 2)",
"-print((ans % waru))",
"+ dic[a[i]] = 1",
"+dp = [0] * (n + 2)",
"+dp[0] = 1",
"+for i in range(n):",
"+ if i in dic:",
"+ continue",
"+ dp[i + 1] += dp[i]",
"+ dp[i + 2] += dp[i]",
"+ dp[i + 1] %= mod",
"+ dp[i + 2] %= mod",
"+print((dp[-2]))"
] | false | 0.043662 | 0.040101 | 1.088802 |
[
"s790974154",
"s239526370"
] |
u452885705
|
p03160
|
python
|
s548524073
|
s317716942
| 173 | 146 | 13,924 | 20,388 |
Accepted
|
Accepted
| 15.61 |
n = int(eval(input()))
h = [int(x) for x in input().split(" ")]
INF = 10**9
dp = [INF] * n
dp[0] = 0
for i in range(1,n):
dp[i] = min(dp[i],dp[i-1]+abs(h[i]-h[i-1]))
if (i > 1):
dp[i] = min(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print((dp[n-1]))
|
n = int(eval(input()))
h = [int(x) for x in input().split()]
INF = 10**10
dp = [INF]*n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,n):
dp[i] = min(dp[i], dp[i-1] + abs(h[i]-h[i-1]))
dp[i] = min(dp[i], dp[i-2] + abs(h[i]-h[i-2]))
print((dp[n-1]))
| 12 | 14 | 259 | 269 |
n = int(eval(input()))
h = [int(x) for x in input().split(" ")]
INF = 10**9
dp = [INF] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
if i > 1:
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
|
n = int(eval(input()))
h = [int(x) for x in input().split()]
INF = 10**10
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| false | 14.285714 |
[
"-h = [int(x) for x in input().split(\" \")]",
"-INF = 10**9",
"+h = [int(x) for x in input().split()]",
"+INF = 10**10",
"-for i in range(1, n):",
"+dp[1] = abs(h[1] - h[0])",
"+for i in range(2, n):",
"- if i > 1:",
"- dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))",
"+ dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))"
] | false | 0.039146 | 0.039691 | 0.986259 |
[
"s548524073",
"s317716942"
] |
u652057333
|
p03448
|
python
|
s359554818
|
s510029052
| 50 | 19 | 3,060 | 3,064 |
Accepted
|
Accepted
| 62 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for v_a in range(a+1):
for v_b in range(b+1):
for v_c in range(c+1):
if v_a*500 + v_b*100 + v_c*50 == x:
count += 1
print(count)
|
# B
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for i in range(a+1):
for j in range(b+1):
k = x - i*500 - j*100
if k >= 0 and k // 50 <= c:
count += 1
print(count)
| 12 | 12 | 261 | 240 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for v_a in range(a + 1):
for v_b in range(b + 1):
for v_c in range(c + 1):
if v_a * 500 + v_b * 100 + v_c * 50 == x:
count += 1
print(count)
|
# B
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for i in range(a + 1):
for j in range(b + 1):
k = x - i * 500 - j * 100
if k >= 0 and k // 50 <= c:
count += 1
print(count)
| false | 0 |
[
"+# B",
"-for v_a in range(a + 1):",
"- for v_b in range(b + 1):",
"- for v_c in range(c + 1):",
"- if v_a * 500 + v_b * 100 + v_c * 50 == x:",
"- count += 1",
"+for i in range(a + 1):",
"+ for j in range(b + 1):",
"+ k = x - i * 500 - j * 100",
"+ if k >= 0 and k // 50 <= c:",
"+ count += 1"
] | false | 0.065482 | 0.072967 | 0.897425 |
[
"s359554818",
"s510029052"
] |
u936985471
|
p03283
|
python
|
s881619829
|
s670793953
| 718 | 415 | 13,628 | 18,672 |
Accepted
|
Accepted
| 42.2 |
import sys
readline = sys.stdin.readline
N,M,Q = list(map(int,readline().split()))
train = [[0] * (N + 1) for i in range(N + 1)]
for i in range(M):
l,r = list(map(int,readline().split()))
train[l][r] += 1
for i in range(len(train)):
for j in range(1,len(train[i])):
train[i][j] = train[i][j] + train[i][j - 1]
for j in range(len(train)):
for i in range(1,len(train[i])):
train[i][j] = train[i - 1][j] + train[i][j]
for i in range(Q):
p,q = list(map(int,readline().split()))
print((train[q][q] - train[p - 1][q] - train[q][p - 1] + train[p - 1][p - 1]))
|
import sys
readline = sys.stdin.readline
N,M,Q = list(map(int,readline().split()))
train = [[0] * (N + 1) for i in range(N + 1)]
for i in range(M):
L,R = list(map(int,readline().split()))
train[L][R] += 1
for i in range(N + 1):
for j in range(1, N + 1):
train[i][j] += train[i][j - 1]
for j in range(N + 1):
for i in range(1, N + 1):
train[i][j] += train[i - 1][j]
for i in range(Q):
p,q = list(map(int,readline().split()))
print((train[q][q] - train[p - 1][q] - train[q][p - 1] + train[p - 1][p - 1]))
| 20 | 22 | 582 | 536 |
import sys
readline = sys.stdin.readline
N, M, Q = list(map(int, readline().split()))
train = [[0] * (N + 1) for i in range(N + 1)]
for i in range(M):
l, r = list(map(int, readline().split()))
train[l][r] += 1
for i in range(len(train)):
for j in range(1, len(train[i])):
train[i][j] = train[i][j] + train[i][j - 1]
for j in range(len(train)):
for i in range(1, len(train[i])):
train[i][j] = train[i - 1][j] + train[i][j]
for i in range(Q):
p, q = list(map(int, readline().split()))
print((train[q][q] - train[p - 1][q] - train[q][p - 1] + train[p - 1][p - 1]))
|
import sys
readline = sys.stdin.readline
N, M, Q = list(map(int, readline().split()))
train = [[0] * (N + 1) for i in range(N + 1)]
for i in range(M):
L, R = list(map(int, readline().split()))
train[L][R] += 1
for i in range(N + 1):
for j in range(1, N + 1):
train[i][j] += train[i][j - 1]
for j in range(N + 1):
for i in range(1, N + 1):
train[i][j] += train[i - 1][j]
for i in range(Q):
p, q = list(map(int, readline().split()))
print((train[q][q] - train[p - 1][q] - train[q][p - 1] + train[p - 1][p - 1]))
| false | 9.090909 |
[
"- l, r = list(map(int, readline().split()))",
"- train[l][r] += 1",
"-for i in range(len(train)):",
"- for j in range(1, len(train[i])):",
"- train[i][j] = train[i][j] + train[i][j - 1]",
"-for j in range(len(train)):",
"- for i in range(1, len(train[i])):",
"- train[i][j] = train[i - 1][j] + train[i][j]",
"+ L, R = list(map(int, readline().split()))",
"+ train[L][R] += 1",
"+for i in range(N + 1):",
"+ for j in range(1, N + 1):",
"+ train[i][j] += train[i][j - 1]",
"+for j in range(N + 1):",
"+ for i in range(1, N + 1):",
"+ train[i][j] += train[i - 1][j]"
] | false | 0.036943 | 0.147311 | 0.250779 |
[
"s881619829",
"s670793953"
] |
u010090035
|
p02708
|
python
|
s003390688
|
s588676712
| 193 | 131 | 9,184 | 9,192 |
Accepted
|
Accepted
| 32.12 |
MOD=(10**9)+7
n,k=list(map(int,input().split()))
ans=0
for i in range(k,n+2):
min_start=0
min_end=min_start+i-1
max_end=n
max_start=n-i+1
min_sum=(min_end-min_start+1)*(min_end+min_start)//2
max_sum=(max_end-max_start+1)*(max_end+max_start)//2
# print(i,min_start,min_end,min_sum,max_start,max_end,max_sum,max_sum-min_sum+1)
ans+=max_sum-min_sum+1
ans=ans%MOD
print((ans%MOD))
|
n,k=list(map(int,input().split()))
MOD=(10**9)+7
ans=0
for i in range(k,n+2):
min_sum=i*(i-1)//2
max_sum=i*(n+(n-i+1))//2
# print(i,min_sum,max_sum,max_sum-min_sum+1)
ans=(ans+(max_sum-min_sum+1))%MOD
print(ans)
| 14 | 10 | 416 | 230 |
MOD = (10**9) + 7
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n + 2):
min_start = 0
min_end = min_start + i - 1
max_end = n
max_start = n - i + 1
min_sum = (min_end - min_start + 1) * (min_end + min_start) // 2
max_sum = (max_end - max_start + 1) * (max_end + max_start) // 2
# print(i,min_start,min_end,min_sum,max_start,max_end,max_sum,max_sum-min_sum+1)
ans += max_sum - min_sum + 1
ans = ans % MOD
print((ans % MOD))
|
n, k = list(map(int, input().split()))
MOD = (10**9) + 7
ans = 0
for i in range(k, n + 2):
min_sum = i * (i - 1) // 2
max_sum = i * (n + (n - i + 1)) // 2
# print(i,min_sum,max_sum,max_sum-min_sum+1)
ans = (ans + (max_sum - min_sum + 1)) % MOD
print(ans)
| false | 28.571429 |
[
"+n, k = list(map(int, input().split()))",
"-n, k = list(map(int, input().split()))",
"- min_start = 0",
"- min_end = min_start + i - 1",
"- max_end = n",
"- max_start = n - i + 1",
"- min_sum = (min_end - min_start + 1) * (min_end + min_start) // 2",
"- max_sum = (max_end - max_start + 1) * (max_end + max_start) // 2",
"- # print(i,min_start,min_end,min_sum,max_start,max_end,max_sum,max_sum-min_sum+1)",
"- ans += max_sum - min_sum + 1",
"- ans = ans % MOD",
"-print((ans % MOD))",
"+ min_sum = i * (i - 1) // 2",
"+ max_sum = i * (n + (n - i + 1)) // 2",
"+ # print(i,min_sum,max_sum,max_sum-min_sum+1)",
"+ ans = (ans + (max_sum - min_sum + 1)) % MOD",
"+print(ans)"
] | false | 0.214698 | 0.070311 | 3.053527 |
[
"s003390688",
"s588676712"
] |
u780962115
|
p02950
|
python
|
s827238291
|
s310173159
| 1,815 | 196 | 74,772 | 69,568 |
Accepted
|
Accepted
| 89.2 |
class Combi():
def __init__(self, N, mod):
self.power = [1 for _ in range(N+1)]
self.rev = [1 for _ in range(N+1)]
self.mod = mod
for i in range(2, N+1):
self.power[i] = (self.power[i-1]*i) % self.mod
self.rev[N] = pow(self.power[N], self.mod-2, self.mod)
for j in range(N, 0, -1):
self.rev[j-1] = (self.rev[j]*j) % self.mod
def C(self, K, R):
if K < R:
return 0
else:
return ((self.power[K])*(self.rev[K-R])*(self.rev[R])) % self.mod
def P(self, K, R):
if K < R:
return 0
else:
return (self.power[K])*(self.rev[K-R]) % self.mod
P = int(eval(input()))
c = Combi(P-1, P)
A = list(map(int,input().split()))
ans = [0 for i in range(P)]
for i in range(P):
if A[i] != 0:
ans[0] += 1
for j in range(P):
ans[j] -= c.C(P-1, j)*pow(-i, P-1-j,P)
for i in range(P):
ans[i] %= P
print((*ans))
|
class Combi():
def __init__(self, N, mod):
self.power = [1 for _ in range(N+1)]
self.rev = [1 for _ in range(N+1)]
self.mod = mod
for i in range(2, N+1):
self.power[i] = (self.power[i-1]*i) % self.mod
self.rev[N] = pow(self.power[N], self.mod-2, self.mod)
for j in range(N, 0, -1):
self.rev[j-1] = (self.rev[j]*j) % self.mod
def C(self, K, R):
if K < R:
return 0
else:
return ((self.power[K])*(self.rev[K-R])*(self.rev[R])) % self.mod
def P(self, K, R):
if K < R:
return 0
else:
return (self.power[K])*(self.rev[K-R]) % self.mod
P = int(eval(input()))
c = Combi(P-1, P)
A = list(map(int,input().split()))
power=[1 for i in range(P)]
ans = [0 for i in range(P)]
for i in range(P):
if A[i] != 0:
ans[0] += 1
power[0]
for _ in range(1,P):
power[_]=power[_-1]*(-i)%P
for j in range(P):
ans[j] -= c.C(P-1, j)*power[P-1-j]
for i in range(P):
ans[i] %= P
print((*ans))
| 36 | 40 | 1,012 | 1,127 |
class Combi:
def __init__(self, N, mod):
self.power = [1 for _ in range(N + 1)]
self.rev = [1 for _ in range(N + 1)]
self.mod = mod
for i in range(2, N + 1):
self.power[i] = (self.power[i - 1] * i) % self.mod
self.rev[N] = pow(self.power[N], self.mod - 2, self.mod)
for j in range(N, 0, -1):
self.rev[j - 1] = (self.rev[j] * j) % self.mod
def C(self, K, R):
if K < R:
return 0
else:
return ((self.power[K]) * (self.rev[K - R]) * (self.rev[R])) % self.mod
def P(self, K, R):
if K < R:
return 0
else:
return (self.power[K]) * (self.rev[K - R]) % self.mod
P = int(eval(input()))
c = Combi(P - 1, P)
A = list(map(int, input().split()))
ans = [0 for i in range(P)]
for i in range(P):
if A[i] != 0:
ans[0] += 1
for j in range(P):
ans[j] -= c.C(P - 1, j) * pow(-i, P - 1 - j, P)
for i in range(P):
ans[i] %= P
print((*ans))
|
class Combi:
def __init__(self, N, mod):
self.power = [1 for _ in range(N + 1)]
self.rev = [1 for _ in range(N + 1)]
self.mod = mod
for i in range(2, N + 1):
self.power[i] = (self.power[i - 1] * i) % self.mod
self.rev[N] = pow(self.power[N], self.mod - 2, self.mod)
for j in range(N, 0, -1):
self.rev[j - 1] = (self.rev[j] * j) % self.mod
def C(self, K, R):
if K < R:
return 0
else:
return ((self.power[K]) * (self.rev[K - R]) * (self.rev[R])) % self.mod
def P(self, K, R):
if K < R:
return 0
else:
return (self.power[K]) * (self.rev[K - R]) % self.mod
P = int(eval(input()))
c = Combi(P - 1, P)
A = list(map(int, input().split()))
power = [1 for i in range(P)]
ans = [0 for i in range(P)]
for i in range(P):
if A[i] != 0:
ans[0] += 1
power[0]
for _ in range(1, P):
power[_] = power[_ - 1] * (-i) % P
for j in range(P):
ans[j] -= c.C(P - 1, j) * power[P - 1 - j]
for i in range(P):
ans[i] %= P
print((*ans))
| false | 10 |
[
"+power = [1 for i in range(P)]",
"+ power[0]",
"+ for _ in range(1, P):",
"+ power[_] = power[_ - 1] * (-i) % P",
"- ans[j] -= c.C(P - 1, j) * pow(-i, P - 1 - j, P)",
"+ ans[j] -= c.C(P - 1, j) * power[P - 1 - j]"
] | false | 0.091278 | 0.178817 | 0.510456 |
[
"s827238291",
"s310173159"
] |
u860002137
|
p02866
|
python
|
s427389512
|
s611401078
| 140 | 125 | 21,468 | 21,468 |
Accepted
|
Accepted
| 10.71 |
from collections import Counter
def solve(n, arr):
if arr[0] != 0:
return 0
c = Counter(arr)
if c[0] != 1:
return 0
for i in range(max(c) + 1):
if i not in c:
return 0
c = list(c.items())
c.sort()
prev = 1
ans = 1
mod = 998244353
for _, i in c[1:]:
ans *= pow(prev, i) % mod
ans %= mod
prev = i
return ans
n = int(eval(input()))
arr = list(map(int, input().split()))
print((solve(n, arr)))
|
from collections import Counter
def solve(n, arr):
if arr[0] != 0:
return 0
c = Counter(arr)
if c[0] != 1:
return 0
for i in range(max(c) + 1):
if i not in c:
return 0
c = list(c.items())
c.sort()
prev = 1
ans = 1
mod = 998244353
for _, i in c[1:]:
ans *= prev**i % mod
ans %= mod
prev = i
return ans
n = int(eval(input()))
arr = list(map(int, input().split()))
print((solve(n, arr)))
| 35 | 35 | 531 | 526 |
from collections import Counter
def solve(n, arr):
if arr[0] != 0:
return 0
c = Counter(arr)
if c[0] != 1:
return 0
for i in range(max(c) + 1):
if i not in c:
return 0
c = list(c.items())
c.sort()
prev = 1
ans = 1
mod = 998244353
for _, i in c[1:]:
ans *= pow(prev, i) % mod
ans %= mod
prev = i
return ans
n = int(eval(input()))
arr = list(map(int, input().split()))
print((solve(n, arr)))
|
from collections import Counter
def solve(n, arr):
if arr[0] != 0:
return 0
c = Counter(arr)
if c[0] != 1:
return 0
for i in range(max(c) + 1):
if i not in c:
return 0
c = list(c.items())
c.sort()
prev = 1
ans = 1
mod = 998244353
for _, i in c[1:]:
ans *= prev**i % mod
ans %= mod
prev = i
return ans
n = int(eval(input()))
arr = list(map(int, input().split()))
print((solve(n, arr)))
| false | 0 |
[
"- ans *= pow(prev, i) % mod",
"+ ans *= prev**i % mod"
] | false | 0.047345 | 0.048703 | 0.97212 |
[
"s427389512",
"s611401078"
] |
u608088992
|
p03592
|
python
|
s965876608
|
s812963012
| 318 | 209 | 3,188 | 3,064 |
Accepted
|
Accepted
| 34.28 |
N, M, K = list(map(int, input().split()))
fin = False
for n in range(N + 1):
for m in range(M + 1):
if n * (M - m) + m * (N - n) == K:
print("Yes")
fin = True
break
if fin: break
else: print("No")
|
import sys
def solve():
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
possible = False
for i in range(N + 1):
for j in range(M + 1):
black = (N - i) * j + i * (M - j)
if black == K:
print("Yes")
possible = True
break
if possible: break
else: print("No")
return 0
if __name__ == "__main__":
solve()
| 10 | 20 | 225 | 452 |
N, M, K = list(map(int, input().split()))
fin = False
for n in range(N + 1):
for m in range(M + 1):
if n * (M - m) + m * (N - n) == K:
print("Yes")
fin = True
break
if fin:
break
else:
print("No")
|
import sys
def solve():
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
possible = False
for i in range(N + 1):
for j in range(M + 1):
black = (N - i) * j + i * (M - j)
if black == K:
print("Yes")
possible = True
break
if possible:
break
else:
print("No")
return 0
if __name__ == "__main__":
solve()
| false | 50 |
[
"-N, M, K = list(map(int, input().split()))",
"-fin = False",
"-for n in range(N + 1):",
"- for m in range(M + 1):",
"- if n * (M - m) + m * (N - n) == K:",
"- print(\"Yes\")",
"- fin = True",
"+import sys",
"+",
"+",
"+def solve():",
"+ input = sys.stdin.readline",
"+ N, M, K = list(map(int, input().split()))",
"+ possible = False",
"+ for i in range(N + 1):",
"+ for j in range(M + 1):",
"+ black = (N - i) * j + i * (M - j)",
"+ if black == K:",
"+ print(\"Yes\")",
"+ possible = True",
"+ break",
"+ if possible:",
"- if fin:",
"- break",
"-else:",
"- print(\"No\")",
"+ else:",
"+ print(\"No\")",
"+ return 0",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false | 0.044645 | 0.045544 | 0.980253 |
[
"s965876608",
"s812963012"
] |
u191874006
|
p03075
|
python
|
s252494227
|
s907335442
| 22 | 17 | 3,188 | 2,940 |
Accepted
|
Accepted
| 22.73 |
#!/usr/bin/env python3
import re
a = []
for i in range(6):
b = int(eval(input()))
a.append(b)
count = 0
for i in range(5):
for j in range(i+1,5):
if(a[j] - a[i] > a[5]):
count += 1
else:
pass
if(count == 0):
print("Yay!")
else:
print(":(")
|
#!/usr/bin/env python3
#ABC123 A
LI = [int(eval(input())) for _ in range(6)]
K = LI[-1]
for i in range(1,5):
for j in range(i):
if LI[i] - LI[j] > K:
print(':(')
exit()
print('Yay!')
| 20 | 12 | 316 | 226 |
#!/usr/bin/env python3
import re
a = []
for i in range(6):
b = int(eval(input()))
a.append(b)
count = 0
for i in range(5):
for j in range(i + 1, 5):
if a[j] - a[i] > a[5]:
count += 1
else:
pass
if count == 0:
print("Yay!")
else:
print(":(")
|
#!/usr/bin/env python3
# ABC123 A
LI = [int(eval(input())) for _ in range(6)]
K = LI[-1]
for i in range(1, 5):
for j in range(i):
if LI[i] - LI[j] > K:
print(":(")
exit()
print("Yay!")
| false | 40 |
[
"-import re",
"-",
"-a = []",
"-for i in range(6):",
"- b = int(eval(input()))",
"- a.append(b)",
"-count = 0",
"-for i in range(5):",
"- for j in range(i + 1, 5):",
"- if a[j] - a[i] > a[5]:",
"- count += 1",
"- else:",
"- pass",
"-if count == 0:",
"- print(\"Yay!\")",
"-else:",
"- print(\":(\")",
"+# ABC123 A",
"+LI = [int(eval(input())) for _ in range(6)]",
"+K = LI[-1]",
"+for i in range(1, 5):",
"+ for j in range(i):",
"+ if LI[i] - LI[j] > K:",
"+ print(\":(\")",
"+ exit()",
"+print(\"Yay!\")"
] | false | 0.092114 | 0.047492 | 1.939547 |
[
"s252494227",
"s907335442"
] |
u724687935
|
p02829
|
python
|
s781696500
|
s184790856
| 165 | 17 | 38,384 | 2,940 |
Accepted
|
Accepted
| 89.7 |
A = int(eval(input()))
B = int(eval(input()))
ans = [1, 2, 3]
wrong = [A, B]
for i in ans:
if i not in wrong:
print(i)
|
ans = set([1, 2, 3])
A = int(eval(input()))
B = int(eval(input()))
ans.remove(A)
ans.remove(B)
print((*ans))
| 9 | 8 | 129 | 104 |
A = int(eval(input()))
B = int(eval(input()))
ans = [1, 2, 3]
wrong = [A, B]
for i in ans:
if i not in wrong:
print(i)
|
ans = set([1, 2, 3])
A = int(eval(input()))
B = int(eval(input()))
ans.remove(A)
ans.remove(B)
print((*ans))
| false | 11.111111 |
[
"+ans = set([1, 2, 3])",
"-ans = [1, 2, 3]",
"-wrong = [A, B]",
"-for i in ans:",
"- if i not in wrong:",
"- print(i)",
"+ans.remove(A)",
"+ans.remove(B)",
"+print((*ans))"
] | false | 0.048679 | 0.048523 | 1.003209 |
[
"s781696500",
"s184790856"
] |
u631277801
|
p03607
|
python
|
s955010383
|
s440272357
| 224 | 202 | 16,640 | 13,204 |
Accepted
|
Accepted
| 9.82 |
from collections import Counter
N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
cntr = Counter(A)
ans = 0
for v in list(cntr.values()):
ans += v%2
print(ans)
|
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a_set = set()
for ai in a:
if ai in a_set:
a_set.remove(ai)
else:
a_set.add(ai)
print((len(a_set)))
| 14 | 12 | 194 | 197 |
from collections import Counter
N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
cntr = Counter(A)
ans = 0
for v in list(cntr.values()):
ans += v % 2
print(ans)
|
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a_set = set()
for ai in a:
if ai in a_set:
a_set.remove(ai)
else:
a_set.add(ai)
print((len(a_set)))
| false | 14.285714 |
[
"-from collections import Counter",
"-",
"-N = int(eval(input()))",
"-A = []",
"-for i in range(N):",
"- A.append(int(eval(input())))",
"-cntr = Counter(A)",
"-ans = 0",
"-for v in list(cntr.values()):",
"- ans += v % 2",
"-print(ans)",
"+n = int(eval(input()))",
"+a = [int(eval(input())) for _ in range(n)]",
"+a_set = set()",
"+for ai in a:",
"+ if ai in a_set:",
"+ a_set.remove(ai)",
"+ else:",
"+ a_set.add(ai)",
"+print((len(a_set)))"
] | false | 0.040765 | 0.158345 | 0.257444 |
[
"s955010383",
"s440272357"
] |
u408071652
|
p02583
|
python
|
s415373343
|
s025327189
| 45 | 34 | 9,196 | 9,196 |
Accepted
|
Accepted
| 24.44 |
import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
count = 0
for j in range(1, N - 1):
for i in range(j):
if L[i] == L[j]:
break
t = L[i] + L[j]
for k in range(j + 1, N):
if L[j] != L[k]:
if t > L[k]:
count += 1
else:
break
print(count)
if __name__ == "__main__":
main()
|
import sys
import bisect
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
count = 0
for j in range(1, N - 1):
for i in range(j):
if L[i] == L[j]:
break
count += bisect.bisect_left(L[j + 1:], L[i] + L[j]) - bisect.bisect_right(L[j + 1:], L[j])
print(count)
if __name__ == "__main__":
main()
| 30 | 27 | 588 | 481 |
import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
count = 0
for j in range(1, N - 1):
for i in range(j):
if L[i] == L[j]:
break
t = L[i] + L[j]
for k in range(j + 1, N):
if L[j] != L[k]:
if t > L[k]:
count += 1
else:
break
print(count)
if __name__ == "__main__":
main()
|
import sys
import bisect
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
count = 0
for j in range(1, N - 1):
for i in range(j):
if L[i] == L[j]:
break
count += bisect.bisect_left(L[j + 1 :], L[i] + L[j]) - bisect.bisect_right(
L[j + 1 :], L[j]
)
print(count)
if __name__ == "__main__":
main()
| false | 10 |
[
"+import bisect",
"- t = L[i] + L[j]",
"- for k in range(j + 1, N):",
"- if L[j] != L[k]:",
"- if t > L[k]:",
"- count += 1",
"- else:",
"- break",
"+ count += bisect.bisect_left(L[j + 1 :], L[i] + L[j]) - bisect.bisect_right(",
"+ L[j + 1 :], L[j]",
"+ )"
] | false | 0.103771 | 0.043025 | 2.4119 |
[
"s415373343",
"s025327189"
] |
u109617108
|
p02911
|
python
|
s871393431
|
s558300367
| 591 | 540 | 50,904 | 50,904 |
Accepted
|
Accepted
| 8.63 |
N,K,Q=list(map(int,input().split())) #Nは人の人数、Kはみなが最初に持っているポイント、Qはクイズの回数
L=[K-Q]*N #
for i in range(Q):
m=int(eval(input()))-1
L[m]+=1
for k in range(N):
if L[k]>0:
print("Yes")
else:
print("No")
|
N,K,Q=list(map(int,input().split()))
L=[K-Q]*N
for j in range(1,Q+1):
A=int(eval(input()))
L[A-1]+=1
for i in L:
if i>0:
print("Yes")
else:
print("No")
| 10 | 10 | 223 | 165 |
N, K, Q = list(map(int, input().split())) # Nは人の人数、Kはみなが最初に持っているポイント、Qはクイズの回数
L = [K - Q] * N #
for i in range(Q):
m = int(eval(input())) - 1
L[m] += 1
for k in range(N):
if L[k] > 0:
print("Yes")
else:
print("No")
|
N, K, Q = list(map(int, input().split()))
L = [K - Q] * N
for j in range(1, Q + 1):
A = int(eval(input()))
L[A - 1] += 1
for i in L:
if i > 0:
print("Yes")
else:
print("No")
| false | 0 |
[
"-N, K, Q = list(map(int, input().split())) # Nは人の人数、Kはみなが最初に持っているポイント、Qはクイズの回数",
"-L = [K - Q] * N #",
"-for i in range(Q):",
"- m = int(eval(input())) - 1",
"- L[m] += 1",
"-for k in range(N):",
"- if L[k] > 0:",
"+N, K, Q = list(map(int, input().split()))",
"+L = [K - Q] * N",
"+for j in range(1, Q + 1):",
"+ A = int(eval(input()))",
"+ L[A - 1] += 1",
"+for i in L:",
"+ if i > 0:"
] | false | 0.047893 | 0.048024 | 0.997276 |
[
"s871393431",
"s558300367"
] |
u982896977
|
p03370
|
python
|
s558549705
|
s215035193
| 358 | 17 | 3,060 | 2,940 |
Accepted
|
Accepted
| 95.25 |
N,X = list(map(int,input().split()))
a = [int(eval(input())) for i in range(N)]
moto = X - sum(a)
ans = N
while moto >= min(a):
ans += 1
moto = moto - min(a)
print(ans)
|
N,X = list(map(int,input().split()))
a = [int(eval(input())) for i in range(N)]
ans = N + (X - sum(a)) // min(a)
print(ans)
| 8 | 4 | 165 | 114 |
N, X = list(map(int, input().split()))
a = [int(eval(input())) for i in range(N)]
moto = X - sum(a)
ans = N
while moto >= min(a):
ans += 1
moto = moto - min(a)
print(ans)
|
N, X = list(map(int, input().split()))
a = [int(eval(input())) for i in range(N)]
ans = N + (X - sum(a)) // min(a)
print(ans)
| false | 50 |
[
"-moto = X - sum(a)",
"-ans = N",
"-while moto >= min(a):",
"- ans += 1",
"- moto = moto - min(a)",
"+ans = N + (X - sum(a)) // min(a)"
] | false | 0.125904 | 0.03505 | 3.592108 |
[
"s558549705",
"s215035193"
] |
u792198242
|
p03163
|
python
|
s771275464
|
s519798123
| 1,614 | 881 | 9,784 | 7,736 |
Accepted
|
Accepted
| 45.42 |
N,W=list(map(int,input().split()))
dp=[0]*(W+1)
L = sorted([list(map(int,input().split())) for i in range(N)])
s=0
for w, v in L:
s+=w
for j in range(min(W,s),w-1,-1):
if dp[j-w]+v > dp[j]: dp[j]=dp[j-w]+v
print((max(dp)))
|
def solve(N, W, weightValues):
dp = [0] * (W + 1)
s = 0
for w, v in weightValues:
s += w
for j in range(min(W, s), w - 1, -1):
if dp[j - w] + v > dp[j]:
dp[j] = dp[j - w] + v
print((max(dp)))
N, W = list(map(int, input().split()))
weightValues = sorted([list(map(int, input().split())) for i in range(N)])
solve(N, W, weightValues)
| 12 | 15 | 249 | 400 |
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
L = sorted([list(map(int, input().split())) for i in range(N)])
s = 0
for w, v in L:
s += w
for j in range(min(W, s), w - 1, -1):
if dp[j - w] + v > dp[j]:
dp[j] = dp[j - w] + v
print((max(dp)))
|
def solve(N, W, weightValues):
dp = [0] * (W + 1)
s = 0
for w, v in weightValues:
s += w
for j in range(min(W, s), w - 1, -1):
if dp[j - w] + v > dp[j]:
dp[j] = dp[j - w] + v
print((max(dp)))
N, W = list(map(int, input().split()))
weightValues = sorted([list(map(int, input().split())) for i in range(N)])
solve(N, W, weightValues)
| false | 20 |
[
"+def solve(N, W, weightValues):",
"+ dp = [0] * (W + 1)",
"+ s = 0",
"+ for w, v in weightValues:",
"+ s += w",
"+ for j in range(min(W, s), w - 1, -1):",
"+ if dp[j - w] + v > dp[j]:",
"+ dp[j] = dp[j - w] + v",
"+ print((max(dp)))",
"+",
"+",
"-dp = [0] * (W + 1)",
"-L = sorted([list(map(int, input().split())) for i in range(N)])",
"-s = 0",
"-for w, v in L:",
"- s += w",
"- for j in range(min(W, s), w - 1, -1):",
"- if dp[j - w] + v > dp[j]:",
"- dp[j] = dp[j - w] + v",
"-print((max(dp)))",
"+weightValues = sorted([list(map(int, input().split())) for i in range(N)])",
"+solve(N, W, weightValues)"
] | false | 0.073378 | 0.046605 | 1.574466 |
[
"s771275464",
"s519798123"
] |
u295178043
|
p02911
|
python
|
s116646025
|
s713000119
| 577 | 275 | 52,312 | 12,548 |
Accepted
|
Accepted
| 52.34 |
n, k, q = list(map(int, input().split()))
a = [-1] * q
for i in range(q):
a[i] = int(eval(input()))
t = [0] * (n+1)
for i in range(q):
t[ a[i] ] += 1
p = [0] * (n+1)
for i in range(1, n+1):
p[i] = k - q + t[i]
for i in range(1, n+1):
if p[i] > 0:
print('Yes')
else:
print('No')
|
n, k, q = list(map(int, input().split()))
a = [-1] * q
for i in range(q):
a[i] = int(eval(input()))
t = [0] * (n+1)
for i in range(q):
t[ a[i] ] += 1
p = [k - q + t[i] for i in range(0, n+1)]
p[0] = 0
for i in range(1, n+1):
if p[i] > 0:
print('Yes')
else:
print('No')
| 19 | 18 | 324 | 310 |
n, k, q = list(map(int, input().split()))
a = [-1] * q
for i in range(q):
a[i] = int(eval(input()))
t = [0] * (n + 1)
for i in range(q):
t[a[i]] += 1
p = [0] * (n + 1)
for i in range(1, n + 1):
p[i] = k - q + t[i]
for i in range(1, n + 1):
if p[i] > 0:
print("Yes")
else:
print("No")
|
n, k, q = list(map(int, input().split()))
a = [-1] * q
for i in range(q):
a[i] = int(eval(input()))
t = [0] * (n + 1)
for i in range(q):
t[a[i]] += 1
p = [k - q + t[i] for i in range(0, n + 1)]
p[0] = 0
for i in range(1, n + 1):
if p[i] > 0:
print("Yes")
else:
print("No")
| false | 5.263158 |
[
"-p = [0] * (n + 1)",
"-for i in range(1, n + 1):",
"- p[i] = k - q + t[i]",
"+p = [k - q + t[i] for i in range(0, n + 1)]",
"+p[0] = 0"
] | false | 0.042992 | 0.046978 | 0.91514 |
[
"s116646025",
"s713000119"
] |
u046187684
|
p03503
|
python
|
s871287581
|
s152998980
| 205 | 71 | 3,188 | 3,188 |
Accepted
|
Accepted
| 65.37 |
def solve(string):
n, *fp = string.split()
n = int(n)
f = fp[:10 * n]
p = list(map(int, fp[10 * n:]))
ans = -n * 10**7
int_f = [int("".join(f[10 * i:10 * (i + 1)]), 2) for i in range(n)]
for o in range(1, 2**10):
tmp = [sum(map(int, "{:b}".format(o & _f))) for _f in int_f]
ans = max(ans, sum([p[11 * i + t] for i, t in enumerate(tmp)]))
return str(ans)
if __name__ == '__main__':
n = int(eval(input()))
print((solve('{}\n'.format(n) + '\n'.join([eval(input()) for _ in range(2 * n)]))))
|
def solve(string):
n, *fp = string.split()
n = int(n)
f = fp[:10 * n]
p = list(map(int, fp[10 * n:]))
int_f = [int("".join(f[10 * i:10 * (i + 1)]), 2) for i in range(n)]
return str(
max(
sum([p[11 * i + bin(o & _f).count("1")]
for i, _f in enumerate(int_f)])
for o in range(1, 2**10)))
if __name__ == '__main__':
n = int(eval(input()))
print((solve('{}\n'.format(n) + '\n'.join([eval(input()) for _ in range(2 * n)]))))
| 16 | 16 | 547 | 504 |
def solve(string):
n, *fp = string.split()
n = int(n)
f = fp[: 10 * n]
p = list(map(int, fp[10 * n :]))
ans = -n * 10**7
int_f = [int("".join(f[10 * i : 10 * (i + 1)]), 2) for i in range(n)]
for o in range(1, 2**10):
tmp = [sum(map(int, "{:b}".format(o & _f))) for _f in int_f]
ans = max(ans, sum([p[11 * i + t] for i, t in enumerate(tmp)]))
return str(ans)
if __name__ == "__main__":
n = int(eval(input()))
print((solve("{}\n".format(n) + "\n".join([eval(input()) for _ in range(2 * n)]))))
|
def solve(string):
n, *fp = string.split()
n = int(n)
f = fp[: 10 * n]
p = list(map(int, fp[10 * n :]))
int_f = [int("".join(f[10 * i : 10 * (i + 1)]), 2) for i in range(n)]
return str(
max(
sum([p[11 * i + bin(o & _f).count("1")] for i, _f in enumerate(int_f)])
for o in range(1, 2**10)
)
)
if __name__ == "__main__":
n = int(eval(input()))
print((solve("{}\n".format(n) + "\n".join([eval(input()) for _ in range(2 * n)]))))
| false | 0 |
[
"- ans = -n * 10**7",
"- for o in range(1, 2**10):",
"- tmp = [sum(map(int, \"{:b}\".format(o & _f))) for _f in int_f]",
"- ans = max(ans, sum([p[11 * i + t] for i, t in enumerate(tmp)]))",
"- return str(ans)",
"+ return str(",
"+ max(",
"+ sum([p[11 * i + bin(o & _f).count(\"1\")] for i, _f in enumerate(int_f)])",
"+ for o in range(1, 2**10)",
"+ )",
"+ )"
] | false | 0.100863 | 0.086876 | 1.160999 |
[
"s871287581",
"s152998980"
] |
u987164499
|
p02838
|
python
|
s459183970
|
s720971466
| 1,996 | 338 | 42,212 | 51,100 |
Accepted
|
Accepted
| 83.07 |
from sys import stdin
def main():
n = int(stdin.readline().rstrip())
a = list(map(int,stdin.readline().rstrip().split()))
mod = 10**9+7
point = 0
for i in range(61):
now = sum(1 for j in a if(j >> i)&1)
point += now*(n-now)*(2**i)%mod
point %= mod
print(point)
if __name__ == "__main__":
main()
|
from sys import stdin
import numpy as np
def main():
n = int(stdin.readline().rstrip())
a = list(map(int,stdin.readline().rstrip().split()))
a = np.array(a)
mod = 10**9+7
point = 0
for i in range(61):
b = (a >> i)&1
x = np.count_nonzero(b)
y = n-x
point += x*y*(2**i)%mod
print((point%mod))
if __name__ == "__main__":
main()
| 13 | 16 | 358 | 401 |
from sys import stdin
def main():
n = int(stdin.readline().rstrip())
a = list(map(int, stdin.readline().rstrip().split()))
mod = 10**9 + 7
point = 0
for i in range(61):
now = sum(1 for j in a if (j >> i) & 1)
point += now * (n - now) * (2**i) % mod
point %= mod
print(point)
if __name__ == "__main__":
main()
|
from sys import stdin
import numpy as np
def main():
n = int(stdin.readline().rstrip())
a = list(map(int, stdin.readline().rstrip().split()))
a = np.array(a)
mod = 10**9 + 7
point = 0
for i in range(61):
b = (a >> i) & 1
x = np.count_nonzero(b)
y = n - x
point += x * y * (2**i) % mod
print((point % mod))
if __name__ == "__main__":
main()
| false | 18.75 |
[
"+import numpy as np",
"+ a = np.array(a)",
"- now = sum(1 for j in a if (j >> i) & 1)",
"- point += now * (n - now) * (2**i) % mod",
"- point %= mod",
"- print(point)",
"+ b = (a >> i) & 1",
"+ x = np.count_nonzero(b)",
"+ y = n - x",
"+ point += x * y * (2**i) % mod",
"+ print((point % mod))"
] | false | 0.077128 | 0.170425 | 0.452566 |
[
"s459183970",
"s720971466"
] |
u966000628
|
p03697
|
python
|
s895964973
|
s464307851
| 13 | 11 | 2,696 | 2,568 |
Accepted
|
Accepted
| 15.38 |
a,b = list(map(int,input().split()))
if (a + b) < 10:
print(a+b)
else:
print("error")
|
a,b = list(map(int,input().split()))
sum = a+b
if sum >= 10:
print("error")
else:
print(sum)
| 5 | 6 | 87 | 98 |
a, b = list(map(int, input().split()))
if (a + b) < 10:
print(a + b)
else:
print("error")
|
a, b = list(map(int, input().split()))
sum = a + b
if sum >= 10:
print("error")
else:
print(sum)
| false | 16.666667 |
[
"-if (a + b) < 10:",
"- print(a + b)",
"+sum = a + b",
"+if sum >= 10:",
"+ print(\"error\")",
"- print(\"error\")",
"+ print(sum)"
] | false | 0.037617 | 0.038865 | 0.967892 |
[
"s895964973",
"s464307851"
] |
u798818115
|
p02785
|
python
|
s519042303
|
s211457674
| 172 | 151 | 26,024 | 26,024 |
Accepted
|
Accepted
| 12.21 |
# coding: utf-8
# Your code here!
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
H.sort()
for _ in range(min(K,len(H))):
H.pop(-1)
print((sum(H)))
|
# coding: utf-8
# Your code here!
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
H.sort()
print((sum(H[:max(0,N-K)])))
| 13 | 9 | 184 | 143 |
# coding: utf-8
# Your code here!
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H.sort()
for _ in range(min(K, len(H))):
H.pop(-1)
print((sum(H)))
|
# coding: utf-8
# Your code here!
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H.sort()
print((sum(H[: max(0, N - K)])))
| false | 30.769231 |
[
"-for _ in range(min(K, len(H))):",
"- H.pop(-1)",
"-print((sum(H)))",
"+print((sum(H[: max(0, N - K)])))"
] | false | 0.042573 | 0.038055 | 1.118714 |
[
"s519042303",
"s211457674"
] |
u761320129
|
p03215
|
python
|
s806052378
|
s445193486
| 1,725 | 241 | 71,036 | 65,916 |
Accepted
|
Accepted
| 86.03 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
cums = [0]
for a in A:
cums.append(cums[-1] + a)
vs = []
for l in range(N):
for r in range(l+1,N+1):
vs.append(cums[r] - cums[l])
vs.sort(reverse=True)
for i in range(100,-1,-1):
tmps = []
for v in vs:
if v&(1<<i):
tmps.append(v)
if len(tmps) >= K:
vs = tmps
if len(vs) < K:
print((0))
else:
ans = vs[0]
for v in vs[1:K]:
ans &= v
print(ans)
|
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = []
for i,a in enumerate(A):
k = 0
for c in A[i:]:
k += c
B.append(k)
ans = 0
for i in range(40,-1,-1):
C = []
for b in B:
if b&(1<<i):
C.append(b)
if len(C) >= K:
B = C
ans += 2**i
print(ans)
| 27 | 19 | 514 | 352 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
cums = [0]
for a in A:
cums.append(cums[-1] + a)
vs = []
for l in range(N):
for r in range(l + 1, N + 1):
vs.append(cums[r] - cums[l])
vs.sort(reverse=True)
for i in range(100, -1, -1):
tmps = []
for v in vs:
if v & (1 << i):
tmps.append(v)
if len(tmps) >= K:
vs = tmps
if len(vs) < K:
print((0))
else:
ans = vs[0]
for v in vs[1:K]:
ans &= v
print(ans)
|
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = []
for i, a in enumerate(A):
k = 0
for c in A[i:]:
k += c
B.append(k)
ans = 0
for i in range(40, -1, -1):
C = []
for b in B:
if b & (1 << i):
C.append(b)
if len(C) >= K:
B = C
ans += 2**i
print(ans)
| false | 29.62963 |
[
"-cums = [0]",
"-for a in A:",
"- cums.append(cums[-1] + a)",
"-vs = []",
"-for l in range(N):",
"- for r in range(l + 1, N + 1):",
"- vs.append(cums[r] - cums[l])",
"-vs.sort(reverse=True)",
"-for i in range(100, -1, -1):",
"- tmps = []",
"- for v in vs:",
"- if v & (1 << i):",
"- tmps.append(v)",
"- if len(tmps) >= K:",
"- vs = tmps",
"-if len(vs) < K:",
"- print((0))",
"-else:",
"- ans = vs[0]",
"- for v in vs[1:K]:",
"- ans &= v",
"- print(ans)",
"+B = []",
"+for i, a in enumerate(A):",
"+ k = 0",
"+ for c in A[i:]:",
"+ k += c",
"+ B.append(k)",
"+ans = 0",
"+for i in range(40, -1, -1):",
"+ C = []",
"+ for b in B:",
"+ if b & (1 << i):",
"+ C.append(b)",
"+ if len(C) >= K:",
"+ B = C",
"+ ans += 2**i",
"+print(ans)"
] | false | 0.037379 | 0.065868 | 0.567487 |
[
"s806052378",
"s445193486"
] |
u627600101
|
p02781
|
python
|
s040529328
|
s381078781
| 30 | 26 | 9,160 | 9,148 |
Accepted
|
Accepted
| 13.33 |
N = eval(input())
K = int(eval(input()))
if len(N) < K:
print((0))
exit()
ans = [1, int(N[-1]), 0, 0];
def combination(N,K):
if N < K:
return 0
else:
p = 1
for k in range(K):
p *= N
N -= 1
for k in range(1, K+1):
p //= k
return p
for k in range(1, len(N)):
if int(N[-k-1]) > 0:
a = [1, 0, 0, 0]
for j in range(1, K+1):
a[j] += (9**(j))*combination(k, j)
a[j] += (int(N[-k-1])-1)*combination(k, j-1)*(9**(j-1)) + ans[j-1]
ans = a
print((ans[K]))
|
N = eval(input())
K = int(eval(input()))
if len(N) < K:
print((0))
exit()
ans = [1, int(N[-1]), 0, 0];
nine = [1, 9, 81, 729]
def combination(N,K):
if N < K:
return 0
elif K == 0:
return 1
elif K == 1:
return N
elif K == 2:
return N*(N-1)//2
else:
return N*(N-1)*(N-2)//6
for k in range(1, len(N)):
if int(N[-k-1]) > 0:
a = [1, 0, 0, 0]
for j in range(1, K+1):
a[j] += nine[j]*combination(k, j)
a[j] += (int(N[-k-1])-1)*combination(k, j-1)*nine[j-1] + ans[j-1]
ans = a
print((ans[K]))
| 29 | 30 | 532 | 561 |
N = eval(input())
K = int(eval(input()))
if len(N) < K:
print((0))
exit()
ans = [1, int(N[-1]), 0, 0]
def combination(N, K):
if N < K:
return 0
else:
p = 1
for k in range(K):
p *= N
N -= 1
for k in range(1, K + 1):
p //= k
return p
for k in range(1, len(N)):
if int(N[-k - 1]) > 0:
a = [1, 0, 0, 0]
for j in range(1, K + 1):
a[j] += (9 ** (j)) * combination(k, j)
a[j] += (int(N[-k - 1]) - 1) * combination(k, j - 1) * (9 ** (j - 1)) + ans[
j - 1
]
ans = a
print((ans[K]))
|
N = eval(input())
K = int(eval(input()))
if len(N) < K:
print((0))
exit()
ans = [1, int(N[-1]), 0, 0]
nine = [1, 9, 81, 729]
def combination(N, K):
if N < K:
return 0
elif K == 0:
return 1
elif K == 1:
return N
elif K == 2:
return N * (N - 1) // 2
else:
return N * (N - 1) * (N - 2) // 6
for k in range(1, len(N)):
if int(N[-k - 1]) > 0:
a = [1, 0, 0, 0]
for j in range(1, K + 1):
a[j] += nine[j] * combination(k, j)
a[j] += (int(N[-k - 1]) - 1) * combination(k, j - 1) * nine[j - 1] + ans[
j - 1
]
ans = a
print((ans[K]))
| false | 3.333333 |
[
"+nine = [1, 9, 81, 729]",
"+ elif K == 0:",
"+ return 1",
"+ elif K == 1:",
"+ return N",
"+ elif K == 2:",
"+ return N * (N - 1) // 2",
"- p = 1",
"- for k in range(K):",
"- p *= N",
"- N -= 1",
"- for k in range(1, K + 1):",
"- p //= k",
"- return p",
"+ return N * (N - 1) * (N - 2) // 6",
"- a[j] += (9 ** (j)) * combination(k, j)",
"- a[j] += (int(N[-k - 1]) - 1) * combination(k, j - 1) * (9 ** (j - 1)) + ans[",
"+ a[j] += nine[j] * combination(k, j)",
"+ a[j] += (int(N[-k - 1]) - 1) * combination(k, j - 1) * nine[j - 1] + ans["
] | false | 0.03745 | 0.040974 | 0.914005 |
[
"s040529328",
"s381078781"
] |
u823513038
|
p02398
|
python
|
s065370597
|
s820113777
| 40 | 20 | 7,732 | 5,596 |
Accepted
|
Accepted
| 50 |
import math
a, b, c = list(map(int, input().split()))
l = []; d = int(math.sqrt(c)); e = 0
for i in range(1, d + 1):
if i * i == c: l += [i]
elif c % i == 0: l += [i, c // i]
for x in l:
if a <= x <= b: e += 1
print(e)
|
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b + 1):
if c % i == 0:
ans += 1
print(ans)
| 9 | 6 | 223 | 113 |
import math
a, b, c = list(map(int, input().split()))
l = []
d = int(math.sqrt(c))
e = 0
for i in range(1, d + 1):
if i * i == c:
l += [i]
elif c % i == 0:
l += [i, c // i]
for x in l:
if a <= x <= b:
e += 1
print(e)
|
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b + 1):
if c % i == 0:
ans += 1
print(ans)
| false | 33.333333 |
[
"-import math",
"-",
"-l = []",
"-d = int(math.sqrt(c))",
"-e = 0",
"-for i in range(1, d + 1):",
"- if i * i == c:",
"- l += [i]",
"- elif c % i == 0:",
"- l += [i, c // i]",
"-for x in l:",
"- if a <= x <= b:",
"- e += 1",
"-print(e)",
"+ans = 0",
"+for i in range(a, b + 1):",
"+ if c % i == 0:",
"+ ans += 1",
"+print(ans)"
] | false | 0.039062 | 0.03799 | 1.028206 |
[
"s065370597",
"s820113777"
] |
u677267454
|
p02712
|
python
|
s221306963
|
s387199465
| 155 | 21 | 9,124 | 9,124 |
Accepted
|
Accepted
| 86.45 |
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
|
N = int(eval(input()))
def sum(n):
return (n + 1) * n // 2
print((sum(N) - sum(N // 3) * 3 - sum(N // 5) * 5 + sum(N // 15) * 15))
| 8 | 8 | 122 | 138 |
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
|
N = int(eval(input()))
def sum(n):
return (n + 1) * n // 2
print((sum(N) - sum(N // 3) * 3 - sum(N // 5) * 5 + sum(N // 15) * 15))
| false | 0 |
[
"-ans = 0",
"-for i in range(1, N + 1):",
"- if i % 3 != 0 and i % 5 != 0:",
"- ans += i",
"-print(ans)",
"+",
"+",
"+def sum(n):",
"+ return (n + 1) * n // 2",
"+",
"+",
"+print((sum(N) - sum(N // 3) * 3 - sum(N // 5) * 5 + sum(N // 15) * 15))"
] | false | 0.26357 | 0.037159 | 7.093019 |
[
"s221306963",
"s387199465"
] |
u857428111
|
p03387
|
python
|
s803763258
|
s598746428
| 364 | 181 | 83,800 | 38,384 |
Accepted
|
Accepted
| 50.27 |
# coding: utf-8
# Your code here!
# coding: utf-8
from fractions import gcd
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe
# my functions here!
#標準エラー出力
def printargs2err(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' : '+repr(arg) for arg in args),file=sys.stderr)
def debug(x):
print(x,file=sys.stderr)
def printglobals():
for (symbol, value) in globals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
def printlocals():
for (symbol, value) in locals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
#入力（後でいじる）
def pin(type=int):
return map(type,input().split())
"""
"""
#solution:
#input
def resolve():
A=sorted(list(pin()))
B=[a%2 for a in A]
ans=0
odd=[]
even=[]
for i in range(len(B)):
if B[i]==0:odd.append(i)
else:even.append(i)
if len(odd)==1:
for x in even:
A[x]+=1
ans+=1
elif len(even)==1:
for y in odd:
A[y]+=1
ans+=1
ans+=(A[2]*2-A[1]-A[0])//2
print(ans)
return 0
#print(["No","Yes"][cond])
#print([["NA","YYMM"],["MMYY","AMBIGUOUS"]][cMMYY][cYYMM])
#if __name__=="__main__":resolve()
"""
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """2 5 4"""
output = """2"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """2 6 3"""
output = """5"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """31 41 5"""
output = """23"""
self.assertIO(input, output)
if __name__ == "__main__":
resolve()
|
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return list(map(type,input().split()))
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
A=list(pin())
A.sort()
a=0
if A[0]%2!=A[1]%2:
A[1]+=1
A[2]+=1
a+=1
a+=(A[2]*2-A[0]-A[1])//2
print(a)
#%%submit!
resolve()
| 92 | 20 | 2,307 | 414 |
# coding: utf-8
# Your code here!
# coding: utf-8
from fractions import gcd
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe
# my functions here!
# 標準エラー出力
def printargs2err(*args):
names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
print(
", ".join(names.get(id(arg), "???") + " : " + repr(arg) for arg in args),
file=sys.stderr,
)
def debug(x):
print(x, file=sys.stderr)
def printglobals():
for (symbol, value) in globals().items():
print('symbol="%s"、value=%s' % (symbol, value), file=sys.stderr)
def printlocals():
for (symbol, value) in locals().items():
print('symbol="%s"、value=%s' % (symbol, value), file=sys.stderr)
# 入力（後でいじる）
def pin(type=int):
return map(type, input().split())
"""
"""
# solution:
# input
def resolve():
A = sorted(list(pin()))
B = [a % 2 for a in A]
ans = 0
odd = []
even = []
for i in range(len(B)):
if B[i] == 0:
odd.append(i)
else:
even.append(i)
if len(odd) == 1:
for x in even:
A[x] += 1
ans += 1
elif len(even) == 1:
for y in odd:
A[y] += 1
ans += 1
ans += (A[2] * 2 - A[1] - A[0]) // 2
print(ans)
return 0
# print(["No","Yes"][cond])
# print([["NA","YYMM"],["MMYY","AMBIGUOUS"]][cMMYY][cYYMM])
# if __name__=="__main__":resolve()
"""
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """2 5 4"""
output = """2"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """2 6 3"""
output = """5"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """31 41 5"""
output = """23"""
self.assertIO(input, output)
if __name__ == "__main__":
resolve()
|
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input = lambda: sys.stdin.readline().rstrip()
def pin(type=int):
return list(map(type, input().split()))
def tupin(t=int):
return tuple(pin(t))
#%%code
def resolve():
A = list(pin())
A.sort()
a = 0
if A[0] % 2 != A[1] % 2:
A[1] += 1
A[2] += 1
a += 1
a += (A[2] * 2 - A[0] - A[1]) // 2
print(a)
#%%submit!
resolve()
| false | 78.26087 |
[
"-# coding: utf-8",
"-# Your code here!",
"-# coding: utf-8",
"-from fractions import gcd",
"-from functools import reduce",
"+#!/usr/bin/env python3",
"+#%% for atcoder uniittest use",
"-sys.setrecursionlimit(200000000)",
"-from inspect import currentframe",
"-",
"-# my functions here!",
"-# 標準エラー出力",
"-def printargs2err(*args):",
"- names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}",
"- print(",
"- \", \".join(names.get(id(arg), \"???\") + \" : \" + repr(arg) for arg in args),",
"- file=sys.stderr,",
"- )",
"+input = lambda: sys.stdin.readline().rstrip()",
"-def debug(x):",
"- print(x, file=sys.stderr)",
"+def pin(type=int):",
"+ return list(map(type, input().split()))",
"-def printglobals():",
"- for (symbol, value) in globals().items():",
"- print('symbol=\"%s\"、value=%s' % (symbol, value), file=sys.stderr)",
"+def tupin(t=int):",
"+ return tuple(pin(t))",
"-def printlocals():",
"- for (symbol, value) in locals().items():",
"- print('symbol=\"%s\"、value=%s' % (symbol, value), file=sys.stderr)",
"+#%%code",
"+def resolve():",
"+ A = list(pin())",
"+ A.sort()",
"+ a = 0",
"+ if A[0] % 2 != A[1] % 2:",
"+ A[1] += 1",
"+ A[2] += 1",
"+ a += 1",
"+ a += (A[2] * 2 - A[0] - A[1]) // 2",
"+ print(a)",
"-# 入力（後でいじる）",
"-def pin(type=int):",
"- return map(type, input().split())",
"-",
"-",
"-\"\"\"",
"-\"\"\"",
"-# solution:",
"-# input",
"-def resolve():",
"- A = sorted(list(pin()))",
"- B = [a % 2 for a in A]",
"- ans = 0",
"- odd = []",
"- even = []",
"- for i in range(len(B)):",
"- if B[i] == 0:",
"- odd.append(i)",
"- else:",
"- even.append(i)",
"- if len(odd) == 1:",
"- for x in even:",
"- A[x] += 1",
"- ans += 1",
"- elif len(even) == 1:",
"- for y in odd:",
"- A[y] += 1",
"- ans += 1",
"- ans += (A[2] * 2 - A[1] - A[0]) // 2",
"- print(ans)",
"- return 0",
"- # print([\"No\",\"Yes\"][cond])",
"- # print([[\"NA\",\"YYMM\"],[\"MMYY\",\"AMBIGUOUS\"]][cMMYY][cYYMM])",
"-",
"-",
"-# if __name__==\"__main__\":resolve()",
"-\"\"\"",
"-#printデバッグ消した？",
"-#前の問題の結果見てないのに次の問題に行くの？",
"-\"\"\"",
"-\"\"\"",
"-お前カッコ閉じるの忘れてるだろ",
"-\"\"\"",
"-import sys",
"-from io import StringIO",
"-import unittest",
"-",
"-",
"-class TestClass(unittest.TestCase):",
"- def assertIO(self, input, output):",
"- stdout, stdin = sys.stdout, sys.stdin",
"- sys.stdout, sys.stdin = StringIO(), StringIO(input)",
"- resolve()",
"- sys.stdout.seek(0)",
"- out = sys.stdout.read()[:-1]",
"- sys.stdout, sys.stdin = stdout, stdin",
"- self.assertEqual(out, output)",
"-",
"- def test_入力例_1(self):",
"- input = \"\"\"2 5 4\"\"\"",
"- output = \"\"\"2\"\"\"",
"- self.assertIO(input, output)",
"-",
"- def test_入力例_2(self):",
"- input = \"\"\"2 6 3\"\"\"",
"- output = \"\"\"5\"\"\"",
"- self.assertIO(input, output)",
"-",
"- def test_入力例_3(self):",
"- input = \"\"\"31 41 5\"\"\"",
"- output = \"\"\"23\"\"\"",
"- self.assertIO(input, output)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- resolve()",
"+#%%submit!",
"+resolve()"
] | false | 0.114399 | 0.04041 | 2.830957 |
[
"s803763258",
"s598746428"
] |
u057109575
|
p02819
|
python
|
s720137671
|
s231448833
| 206 | 74 | 41,584 | 69,684 |
Accepted
|
Accepted
| 64.08 |
X = int(eval(input()))
def sieve(n):
prime = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
if is_prime[i]:
prime.append(i)
for j in range(2 * i, n + 1, i):
is_prime[j] = False
return prime
for v in sieve(100007):
if v >= X:
print(v)
break
|
N = int(eval(input()))
n = 100010
prime = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
if is_prime[i]:
prime.append(i)
for j in range(2 * i, n + 1, i):
is_prime[j] = False
for v in prime:
if v >= N:
print(v)
break
| 22 | 18 | 435 | 332 |
X = int(eval(input()))
def sieve(n):
prime = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
if is_prime[i]:
prime.append(i)
for j in range(2 * i, n + 1, i):
is_prime[j] = False
return prime
for v in sieve(100007):
if v >= X:
print(v)
break
|
N = int(eval(input()))
n = 100010
prime = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
if is_prime[i]:
prime.append(i)
for j in range(2 * i, n + 1, i):
is_prime[j] = False
for v in prime:
if v >= N:
print(v)
break
| false | 18.181818 |
[
"-X = int(eval(input()))",
"-",
"-",
"-def sieve(n):",
"- prime = []",
"- is_prime = [True] * (n + 1)",
"- is_prime[0] = False",
"- is_prime[1] = False",
"- for i in range(2, n + 1):",
"- if is_prime[i]:",
"- prime.append(i)",
"- for j in range(2 * i, n + 1, i):",
"- is_prime[j] = False",
"- return prime",
"-",
"-",
"-for v in sieve(100007):",
"- if v >= X:",
"+N = int(eval(input()))",
"+n = 100010",
"+prime = []",
"+is_prime = [True] * (n + 1)",
"+is_prime[0] = False",
"+is_prime[1] = False",
"+for i in range(2, n + 1):",
"+ if is_prime[i]:",
"+ prime.append(i)",
"+ for j in range(2 * i, n + 1, i):",
"+ is_prime[j] = False",
"+for v in prime:",
"+ if v >= N:"
] | false | 0.059423 | 0.128846 | 0.461192 |
[
"s720137671",
"s231448833"
] |
u596505843
|
p02702
|
python
|
s803635260
|
s514411494
| 189 | 148 | 77,876 | 78,044 |
Accepted
|
Accepted
| 21.69 |
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
S = rs()
mods = []
n = 0
e = 1
for i in reversed(list(range(len(S)))):
n += int(S[i]) * e
e = (e*10) % 2019
n = n % 2019
mods.append(n)
mods.append(0)
import collections
cnt = collections.Counter(mods)
ans = 0
for k, c in list(cnt.items()):
ans += c*(c-1)//2
print(ans)
|
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
S = rs()
#S = '1'*200000
mods = []
n = 0
e = 0
for i in reversed(list(range(len(S)))):
n += int(S[i]) * pow(10,e,2019)
#e = (e*10) % 2019
e += 1
#n = n % 2019
mods.append(n % 2019)
mods.append(0)
import collections
cnt = collections.Counter(mods)
ans = 0
for k, c in list(cnt.items()):
ans += c*(c-1)//2
print(ans)
| 25 | 27 | 475 | 523 |
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
S = rs()
mods = []
n = 0
e = 1
for i in reversed(list(range(len(S)))):
n += int(S[i]) * e
e = (e * 10) % 2019
n = n % 2019
mods.append(n)
mods.append(0)
import collections
cnt = collections.Counter(mods)
ans = 0
for k, c in list(cnt.items()):
ans += c * (c - 1) // 2
print(ans)
|
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
S = rs()
# S = '1'*200000
mods = []
n = 0
e = 0
for i in reversed(list(range(len(S)))):
n += int(S[i]) * pow(10, e, 2019)
# e = (e*10) % 2019
e += 1
# n = n % 2019
mods.append(n % 2019)
mods.append(0)
import collections
cnt = collections.Counter(mods)
ans = 0
for k, c in list(cnt.items()):
ans += c * (c - 1) // 2
print(ans)
| false | 7.407407 |
[
"+# S = '1'*200000",
"-e = 1",
"+e = 0",
"- n += int(S[i]) * e",
"- e = (e * 10) % 2019",
"- n = n % 2019",
"- mods.append(n)",
"+ n += int(S[i]) * pow(10, e, 2019)",
"+ # e = (e*10) % 2019",
"+ e += 1",
"+ # n = n % 2019",
"+ mods.append(n % 2019)"
] | false | 0.04231 | 0.040731 | 1.038763 |
[
"s803635260",
"s514411494"
] |
u989345508
|
p03338
|
python
|
s073968747
|
s819067830
| 19 | 17 | 3,064 | 3,060 |
Accepted
|
Accepted
| 10.53 |
n=int(eval(input()))
s=eval(input())
dic={}
for i in set(list(s)):
if s.count(i)>1:
dic[i]=s.count(i)
#print(dic)
d=0
for i in range(n-1):
c=0
x=s[:i+1]
y=s[i+1:]
if len(y)>len(x):
for j in dic:
if x.count(j)!=dic[j] and x.count(j)>0:
c+=1
else:
for j in dic:
if y.count(j)!=dic[j] and y.count(j)>0:
c+=1
if c>d:
d=c
#print(i)
print(d)
|
n=int(eval(input()))
s=eval(input())
ans=0
for i in range(n-1):
s1=s[:i+1]
s2=s[i+1:]
s3=set(s1)&set(s2)
ans=max(ans,len(s3))
print(ans)
| 26 | 9 | 475 | 148 |
n = int(eval(input()))
s = eval(input())
dic = {}
for i in set(list(s)):
if s.count(i) > 1:
dic[i] = s.count(i)
# print(dic)
d = 0
for i in range(n - 1):
c = 0
x = s[: i + 1]
y = s[i + 1 :]
if len(y) > len(x):
for j in dic:
if x.count(j) != dic[j] and x.count(j) > 0:
c += 1
else:
for j in dic:
if y.count(j) != dic[j] and y.count(j) > 0:
c += 1
if c > d:
d = c
# print(i)
print(d)
|
n = int(eval(input()))
s = eval(input())
ans = 0
for i in range(n - 1):
s1 = s[: i + 1]
s2 = s[i + 1 :]
s3 = set(s1) & set(s2)
ans = max(ans, len(s3))
print(ans)
| false | 65.384615 |
[
"-dic = {}",
"-for i in set(list(s)):",
"- if s.count(i) > 1:",
"- dic[i] = s.count(i)",
"-# print(dic)",
"-d = 0",
"+ans = 0",
"- c = 0",
"- x = s[: i + 1]",
"- y = s[i + 1 :]",
"- if len(y) > len(x):",
"- for j in dic:",
"- if x.count(j) != dic[j] and x.count(j) > 0:",
"- c += 1",
"- else:",
"- for j in dic:",
"- if y.count(j) != dic[j] and y.count(j) > 0:",
"- c += 1",
"- if c > d:",
"- d = c",
"- # print(i)",
"-print(d)",
"+ s1 = s[: i + 1]",
"+ s2 = s[i + 1 :]",
"+ s3 = set(s1) & set(s2)",
"+ ans = max(ans, len(s3))",
"+print(ans)"
] | false | 0.044728 | 0.048782 | 0.91691 |
[
"s073968747",
"s819067830"
] |
u077898957
|
p03658
|
python
|
s455085004
|
s534386693
| 150 | 17 | 12,500 | 2,940 |
Accepted
|
Accepted
| 88.67 |
import numpy as np
import sys
n,k = list(map(int,input().split()))
l = sorted(list(map(int,input().split())))[::-1]
print((sum(l[:k])))
|
n,k=list(map(int,input().split()))
L = sorted(list(map(int,input().split())))[::-1]
print((sum(L[0:k])))
| 5 | 3 | 132 | 98 |
import numpy as np
import sys
n, k = list(map(int, input().split()))
l = sorted(list(map(int, input().split())))[::-1]
print((sum(l[:k])))
|
n, k = list(map(int, input().split()))
L = sorted(list(map(int, input().split())))[::-1]
print((sum(L[0:k])))
| false | 40 |
[
"-import numpy as np",
"-import sys",
"-",
"-l = sorted(list(map(int, input().split())))[::-1]",
"-print((sum(l[:k])))",
"+L = sorted(list(map(int, input().split())))[::-1]",
"+print((sum(L[0:k])))"
] | false | 0.066341 | 0.060228 | 1.101494 |
[
"s455085004",
"s534386693"
] |
u052906927
|
p02553
|
python
|
s140476118
|
s701671589
| 33 | 29 | 9,092 | 8,996 |
Accepted
|
Accepted
| 12.12 |
a=[int(x) for x in input().split()]
b=[a[0]*a[2],a[0]*a[3],a[1]*a[2],a[1]*a[3]]
print((max(b)))
|
a=[int(x) for x in input().split()]
#(a)
#b=[a[0]*a[2],a[0]*a[3],a[1]*a[2],a[1]*a[3]]
print((max(a[0]*a[2],a[0]*a[3],a[1]*a[2],a[1]*a[3])))
| 3 | 4 | 95 | 140 |
a = [int(x) for x in input().split()]
b = [a[0] * a[2], a[0] * a[3], a[1] * a[2], a[1] * a[3]]
print((max(b)))
|
a = [int(x) for x in input().split()]
# (a)
# b=[a[0]*a[2],a[0]*a[3],a[1]*a[2],a[1]*a[3]]
print((max(a[0] * a[2], a[0] * a[3], a[1] * a[2], a[1] * a[3])))
| false | 25 |
[
"-b = [a[0] * a[2], a[0] * a[3], a[1] * a[2], a[1] * a[3]]",
"-print((max(b)))",
"+# (a)",
"+# b=[a[0]*a[2],a[0]*a[3],a[1]*a[2],a[1]*a[3]]",
"+print((max(a[0] * a[2], a[0] * a[3], a[1] * a[2], a[1] * a[3])))"
] | false | 0.047738 | 0.047858 | 0.997501 |
[
"s140476118",
"s701671589"
] |
u319245933
|
p02607
|
python
|
s028254840
|
s954388039
| 63 | 27 | 61,916 | 9,052 |
Accepted
|
Accepted
| 57.14 |
print((sum([int(x)%2 for x in open(0).read().split()[1::2]])))
|
N, *A = list(map(int, open(0).read().split()))
print((len([a for a in A[::2] if a%2])))
| 1 | 3 | 63 | 82 |
print((sum([int(x) % 2 for x in open(0).read().split()[1::2]])))
|
N, *A = list(map(int, open(0).read().split()))
print((len([a for a in A[::2] if a % 2])))
| false | 66.666667 |
[
"-print((sum([int(x) % 2 for x in open(0).read().split()[1::2]])))",
"+N, *A = list(map(int, open(0).read().split()))",
"+print((len([a for a in A[::2] if a % 2])))"
] | false | 0.037067 | 0.036195 | 1.024088 |
[
"s028254840",
"s954388039"
] |
u745087332
|
p04035
|
python
|
s947821357
|
s695966169
| 161 | 128 | 14,400 | 14,432 |
Accepted
|
Accepted
| 20.5 |
# coding:utf-8
INF = float('inf')
def inpl(): return list(map(int, input().split()))
N, L = inpl()
A = inpl()
tmp = 0
connect = False
knot = None
for i in range(N):
if A[i] >= L:
knots = i
break
if knot is None:
for i in range(N - 1):
if sum(A[i:i + 2]) >= L:
knot = i
connect = True
break
if knot is None:
print('Impossible')
else:
print('Possible')
for i in range(N - 1):
if i == knot:
break
else:
print((i + 1))
for i in range(N - 2, -1, -1):
if i == knot:
break
else:
print((i + 1))
if connect:
print((knot + 1))
|
# coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
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 II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n, l = LI()
A = LI()
for i in range(n - 1):
if A[i] + A[i + 1] >= l:
k = i
print('Possible')
break
else:
print('Impossible')
return 0
for i in range(k):
print((i + 1))
for i in range(k, n - 1)[::-1]:
print((i + 1))
return 1
main()
| 43 | 38 | 738 | 767 |
# coding:utf-8
INF = float("inf")
def inpl():
return list(map(int, input().split()))
N, L = inpl()
A = inpl()
tmp = 0
connect = False
knot = None
for i in range(N):
if A[i] >= L:
knots = i
break
if knot is None:
for i in range(N - 1):
if sum(A[i : i + 2]) >= L:
knot = i
connect = True
break
if knot is None:
print("Impossible")
else:
print("Possible")
for i in range(N - 1):
if i == knot:
break
else:
print((i + 1))
for i in range(N - 2, -1, -1):
if i == knot:
break
else:
print((i + 1))
if connect:
print((knot + 1))
|
# coding:utf-8
import sys
INF = float("inf")
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
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 II():
return int(sys.stdin.readline())
def SI():
return eval(input())
def main():
n, l = LI()
A = LI()
for i in range(n - 1):
if A[i] + A[i + 1] >= l:
k = i
print("Possible")
break
else:
print("Impossible")
return 0
for i in range(k):
print((i + 1))
for i in range(k, n - 1)[::-1]:
print((i + 1))
return 1
main()
| false | 11.627907 |
[
"+import sys",
"+",
"+MOD = 10**9 + 7",
"-def inpl():",
"- return list(map(int, input().split()))",
"+def LI():",
"+ return [int(x) for x in sys.stdin.readline().split()]",
"-N, L = inpl()",
"-A = inpl()",
"-tmp = 0",
"-connect = False",
"-knot = None",
"-for i in range(N):",
"- if A[i] >= L:",
"- knots = i",
"- break",
"-if knot is None:",
"- for i in range(N - 1):",
"- if sum(A[i : i + 2]) >= L:",
"- knot = i",
"- connect = True",
"+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 II():",
"+ return int(sys.stdin.readline())",
"+",
"+",
"+def SI():",
"+ return eval(input())",
"+",
"+",
"+def main():",
"+ n, l = LI()",
"+ A = LI()",
"+ for i in range(n - 1):",
"+ if A[i] + A[i + 1] >= l:",
"+ k = i",
"+ print(\"Possible\")",
"-if knot is None:",
"- print(\"Impossible\")",
"-else:",
"- print(\"Possible\")",
"- for i in range(N - 1):",
"- if i == knot:",
"- break",
"- else:",
"- print((i + 1))",
"- for i in range(N - 2, -1, -1):",
"- if i == knot:",
"- break",
"- else:",
"- print((i + 1))",
"- if connect:",
"- print((knot + 1))",
"+ else:",
"+ print(\"Impossible\")",
"+ return 0",
"+ for i in range(k):",
"+ print((i + 1))",
"+ for i in range(k, n - 1)[::-1]:",
"+ print((i + 1))",
"+ return 1",
"+",
"+",
"+main()"
] | false | 0.037908 | 0.076298 | 0.496839 |
[
"s947821357",
"s695966169"
] |
u761529120
|
p02842
|
python
|
s023611794
|
s027106678
| 185 | 168 | 39,408 | 38,512 |
Accepted
|
Accepted
| 9.19 |
def main():
N = int(eval(input()))
for x in range(50001):
if int(x * 1.08) == N:
print(x)
exit()
print(':(')
if __name__ == "__main__":
main()
|
def main():
N = int(eval(input()))
for i in range(1,50000):
if int(i * 1.08) == N:
print(i)
exit()
print(':(')
if __name__ == "__main__":
main()
| 12 | 13 | 198 | 210 |
def main():
N = int(eval(input()))
for x in range(50001):
if int(x * 1.08) == N:
print(x)
exit()
print(":(")
if __name__ == "__main__":
main()
|
def main():
N = int(eval(input()))
for i in range(1, 50000):
if int(i * 1.08) == N:
print(i)
exit()
print(":(")
if __name__ == "__main__":
main()
| false | 7.692308 |
[
"- for x in range(50001):",
"- if int(x * 1.08) == N:",
"- print(x)",
"+ for i in range(1, 50000):",
"+ if int(i * 1.08) == N:",
"+ print(i)"
] | false | 0.045619 | 0.045788 | 0.996301 |
[
"s023611794",
"s027106678"
] |
u545368057
|
p02913
|
python
|
s275799051
|
s259923360
| 1,070 | 682 | 232,200 | 230,280 |
Accepted
|
Accepted
| 36.26 |
N = int(eval(input()))
S = eval(input())
dp = [[0] * (N+1) for i in range(N+1)]
for i in range(N-1,-1,-1):
for j in range(N-1,-1,-1):
# print(i,j)
if S[i] == S[j]:
dp[i][j] = dp[i+1][j+1] + 1
# print(dp)
ans = 0
for i in range(N):
for j in range(N):
val = min(abs(i-j),dp[i][j])
ans = max(val,ans)
print(ans)
|
N = int(eval(input()))
S = eval(input())
dp = [[0] * (N+1) for i in range(N+1)]
for i in range(N-1,-1,-1):
for j in range(N-1,i-1,-1):
# print(i,j)
if S[i] == S[j]:
dp[i][j] = dp[i+1][j+1] + 1
# print(dp)
ans = 0
for i in range(N):
for j in range(i+1,N):
val = min(abs(i-j),dp[i][j])
ans = max(val,ans)
print(ans)
| 19 | 19 | 370 | 375 |
N = int(eval(input()))
S = eval(input())
dp = [[0] * (N + 1) for i in range(N + 1)]
for i in range(N - 1, -1, -1):
for j in range(N - 1, -1, -1):
# print(i,j)
if S[i] == S[j]:
dp[i][j] = dp[i + 1][j + 1] + 1
# print(dp)
ans = 0
for i in range(N):
for j in range(N):
val = min(abs(i - j), dp[i][j])
ans = max(val, ans)
print(ans)
|
N = int(eval(input()))
S = eval(input())
dp = [[0] * (N + 1) for i in range(N + 1)]
for i in range(N - 1, -1, -1):
for j in range(N - 1, i - 1, -1):
# print(i,j)
if S[i] == S[j]:
dp[i][j] = dp[i + 1][j + 1] + 1
# print(dp)
ans = 0
for i in range(N):
for j in range(i + 1, N):
val = min(abs(i - j), dp[i][j])
ans = max(val, ans)
print(ans)
| false | 0 |
[
"- for j in range(N - 1, -1, -1):",
"+ for j in range(N - 1, i - 1, -1):",
"- for j in range(N):",
"+ for j in range(i + 1, N):"
] | false | 0.035036 | 0.037096 | 0.944455 |
[
"s275799051",
"s259923360"
] |
u813387707
|
p03673
|
python
|
s968347536
|
s894212012
| 159 | 128 | 30,900 | 30,804 |
Accepted
|
Accepted
| 19.5 |
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
b = []
c = []
for i, a in enumerate(a_list):
if i % 2 == 0:
b.append(a)
else:
c.append(a)
if n % 2 == 0:
d = list(reversed(c)) + b
else:
d = list(reversed(b)) + c
print((*d))
|
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
if n % 2 == 0:
b_list = a_list[n-1::-2] + a_list[0::2]
else:
b_list = a_list[n-1::-2] + a_list[1::2]
print((*b_list))
| 14 | 7 | 277 | 189 |
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
b = []
c = []
for i, a in enumerate(a_list):
if i % 2 == 0:
b.append(a)
else:
c.append(a)
if n % 2 == 0:
d = list(reversed(c)) + b
else:
d = list(reversed(b)) + c
print((*d))
|
n = int(eval(input()))
a_list = [int(x) for x in input().split()]
if n % 2 == 0:
b_list = a_list[n - 1 :: -2] + a_list[0::2]
else:
b_list = a_list[n - 1 :: -2] + a_list[1::2]
print((*b_list))
| false | 50 |
[
"-b = []",
"-c = []",
"-for i, a in enumerate(a_list):",
"- if i % 2 == 0:",
"- b.append(a)",
"- else:",
"- c.append(a)",
"- d = list(reversed(c)) + b",
"+ b_list = a_list[n - 1 :: -2] + a_list[0::2]",
"- d = list(reversed(b)) + c",
"-print((*d))",
"+ b_list = a_list[n - 1 :: -2] + a_list[1::2]",
"+print((*b_list))"
] | false | 0.105782 | 0.032465 | 3.258323 |
[
"s968347536",
"s894212012"
] |
u411203878
|
p03196
|
python
|
s672163584
|
s967876897
| 179 | 84 | 38,640 | 66,020 |
Accepted
|
Accepted
| 53.07 |
def prime(p):
memo = []
for i in range(2,(int(p**0.5)+1)):
while p%i==0:
p //= i
memo.append(i)
if p != 1:
memo.append(p)
return memo
import collections
n,p = list(map(int,input().split()))
memo = prime(p)
c = collections.Counter(memo)
score_sorted = sorted(list(c.items()), key=lambda x:-x[0])
if n == 1:
ans = p
else:
kake = []
for i , j in score_sorted:
if n <= j:
kake.append(i**(j//n))
ans = 1
for i in kake:
ans *= i
print(ans)
|
def prime(p):
memo = []
for i in range(2,(int(p**0.5)+1)):
while p%i==0:
p //= i
memo.append(i)
if p != 1:
memo.append(p)
return memo
import collections
N,P = list(map(int,input().split()))
memo = prime(P)
c = collections.Counter(memo)
ans = 1
for key,value in list(c.items()):
if N <= value:
ans *= key**(value//N)
print(ans)
| 33 | 24 | 565 | 411 |
def prime(p):
memo = []
for i in range(2, (int(p**0.5) + 1)):
while p % i == 0:
p //= i
memo.append(i)
if p != 1:
memo.append(p)
return memo
import collections
n, p = list(map(int, input().split()))
memo = prime(p)
c = collections.Counter(memo)
score_sorted = sorted(list(c.items()), key=lambda x: -x[0])
if n == 1:
ans = p
else:
kake = []
for i, j in score_sorted:
if n <= j:
kake.append(i ** (j // n))
ans = 1
for i in kake:
ans *= i
print(ans)
|
def prime(p):
memo = []
for i in range(2, (int(p**0.5) + 1)):
while p % i == 0:
p //= i
memo.append(i)
if p != 1:
memo.append(p)
return memo
import collections
N, P = list(map(int, input().split()))
memo = prime(P)
c = collections.Counter(memo)
ans = 1
for key, value in list(c.items()):
if N <= value:
ans *= key ** (value // N)
print(ans)
| false | 27.272727 |
[
"-n, p = list(map(int, input().split()))",
"-memo = prime(p)",
"+N, P = list(map(int, input().split()))",
"+memo = prime(P)",
"-score_sorted = sorted(list(c.items()), key=lambda x: -x[0])",
"-if n == 1:",
"- ans = p",
"-else:",
"- kake = []",
"- for i, j in score_sorted:",
"- if n <= j:",
"- kake.append(i ** (j // n))",
"- ans = 1",
"- for i in kake:",
"- ans *= i",
"+ans = 1",
"+for key, value in list(c.items()):",
"+ if N <= value:",
"+ ans *= key ** (value // N)"
] | false | 0.09831 | 0.220271 | 0.446313 |
[
"s672163584",
"s967876897"
] |
u875361824
|
p03287
|
python
|
s860669885
|
s620303114
| 102 | 85 | 20,036 | 19,528 |
Accepted
|
Accepted
| 16.67 |
def main():
"""
1 <= N <= 10^5
2 <= M <= 10^9
1 <= Ai <= 10^9
1 <= i <= N
1 <= l <= r <= N
A_l + A_l+1 + ... + Ar = x * M
"""
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
# ans = f(N, M, A)
ans = editorial(N, M, A)
print(ans)
def f(N, M, A):
"""
直感: 累積和, 10^5^2: TLE
二分探索?
"""
b = [0] * N
b[0] = A[0]
for i in range(1, N):
b[i] = b[i-1] + A[i]
ans = TLE(N, M, A, b)
return ans
def editorial(N, M, A):
"""
"""
b = [0] * (N + 1)
for i in range(N):
b[i+1] = b[i] + A[i]
c = [x % M for x in b]
ans = 0
m = {}
c = [x % M for x in b]
for x in c:
if not x in m:
m[x] = 0
else:
ans += m[x]
m[x] += 1
return ans
def TLE(N, M, A, b):
ans = 0
for l in range(N):
for r in range(l, N):
if l - 1 < 0:
s = b[r]
else:
s = b[r] - b[l-1]
if s % M == 0:
ans += 1
return ans
if __name__ == '__main__':
main()
|
def main():
"""
1 <= N <= 10^5
2 <= M <= 10^9
1 <= Ai <= 10^9
1 <= i <= N
1 <= l <= r <= N
A_l + A_l+1 + ... + Ar = x * M
"""
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
# ans = f(N, M, A)
ans = editorial(N, M, A)
print(ans)
def f(N, M, A):
"""
直感: 累積和, 10^5^2: TLE
二分探索?
"""
b = [0] * N
b[0] = A[0]
for i in range(1, N):
b[i] = b[i-1] + A[i]
ans = TLE(N, M, A, b)
return ans
def editorial(N, M, A):
"""
"""
b = [0] * (N + 1)
for i in range(N):
b[i+1] = b[i] + A[i]
c = [x % M for x in b]
return binomial_coefficients(c)
# return loop(c)
def binomial_coefficients(c):
from collections import Counter
ans = 0
for i, n in list(Counter(c).items()):
ans += n * (n - 1) // 2
return ans
def loop(c):
ans = 0
m = {}
for x in c:
if not x in m:
m[x] = 0
else:
ans += m[x]
m[x] += 1
return ans
def TLE(N, M, A, b):
ans = 0
for l in range(N):
for r in range(l, N):
if l - 1 < 0:
s = b[r]
else:
s = b[r] - b[l-1]
if s % M == 0:
ans += 1
return ans
if __name__ == '__main__':
main()
| 69 | 83 | 1,199 | 1,423 |
def main():
"""
1 <= N <= 10^5
2 <= M <= 10^9
1 <= Ai <= 10^9
1 <= i <= N
1 <= l <= r <= N
A_l + A_l+1 + ... + Ar = x * M
"""
N, M = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
# ans = f(N, M, A)
ans = editorial(N, M, A)
print(ans)
def f(N, M, A):
"""
直感: 累積和, 10^5^2: TLE
二分探索?
"""
b = [0] * N
b[0] = A[0]
for i in range(1, N):
b[i] = b[i - 1] + A[i]
ans = TLE(N, M, A, b)
return ans
def editorial(N, M, A):
""" """
b = [0] * (N + 1)
for i in range(N):
b[i + 1] = b[i] + A[i]
c = [x % M for x in b]
ans = 0
m = {}
c = [x % M for x in b]
for x in c:
if not x in m:
m[x] = 0
else:
ans += m[x]
m[x] += 1
return ans
def TLE(N, M, A, b):
ans = 0
for l in range(N):
for r in range(l, N):
if l - 1 < 0:
s = b[r]
else:
s = b[r] - b[l - 1]
if s % M == 0:
ans += 1
return ans
if __name__ == "__main__":
main()
|
def main():
"""
1 <= N <= 10^5
2 <= M <= 10^9
1 <= Ai <= 10^9
1 <= i <= N
1 <= l <= r <= N
A_l + A_l+1 + ... + Ar = x * M
"""
N, M = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
# ans = f(N, M, A)
ans = editorial(N, M, A)
print(ans)
def f(N, M, A):
"""
直感: 累積和, 10^5^2: TLE
二分探索?
"""
b = [0] * N
b[0] = A[0]
for i in range(1, N):
b[i] = b[i - 1] + A[i]
ans = TLE(N, M, A, b)
return ans
def editorial(N, M, A):
""" """
b = [0] * (N + 1)
for i in range(N):
b[i + 1] = b[i] + A[i]
c = [x % M for x in b]
return binomial_coefficients(c)
# return loop(c)
def binomial_coefficients(c):
from collections import Counter
ans = 0
for i, n in list(Counter(c).items()):
ans += n * (n - 1) // 2
return ans
def loop(c):
ans = 0
m = {}
for x in c:
if not x in m:
m[x] = 0
else:
ans += m[x]
m[x] += 1
return ans
def TLE(N, M, A, b):
ans = 0
for l in range(N):
for r in range(l, N):
if l - 1 < 0:
s = b[r]
else:
s = b[r] - b[l - 1]
if s % M == 0:
ans += 1
return ans
if __name__ == "__main__":
main()
| false | 16.86747 |
[
"+ return binomial_coefficients(c)",
"+ # return loop(c)",
"+",
"+",
"+def binomial_coefficients(c):",
"+ from collections import Counter",
"+",
"+ ans = 0",
"+ for i, n in list(Counter(c).items()):",
"+ ans += n * (n - 1) // 2",
"+ return ans",
"+",
"+",
"+def loop(c):",
"- c = [x % M for x in b]"
] | false | 0.044728 | 0.044557 | 1.003835 |
[
"s860669885",
"s620303114"
] |
u133936772
|
p03262
|
python
|
s912036903
|
s735985683
| 78 | 71 | 20,060 | 20,128 |
Accepted
|
Accepted
| 8.97 |
f=lambda:[*list(map(int,input().split()))]
n,x=f()
l=f()
d=[l[i+1]-l[i] for i in range(n-1)]
a=abs(x-l[0])
from math import *
for i in d:
a=gcd(a,i)
print(a)
|
f=lambda:[*list(map(int,input().split()))]
n,x=f()
d=[abs(i-x) for i in f()]
a=d.pop()
from math import *
for i in d:
a=gcd(a,i)
print(a)
| 9 | 8 | 161 | 140 |
f = lambda: [*list(map(int, input().split()))]
n, x = f()
l = f()
d = [l[i + 1] - l[i] for i in range(n - 1)]
a = abs(x - l[0])
from math import *
for i in d:
a = gcd(a, i)
print(a)
|
f = lambda: [*list(map(int, input().split()))]
n, x = f()
d = [abs(i - x) for i in f()]
a = d.pop()
from math import *
for i in d:
a = gcd(a, i)
print(a)
| false | 11.111111 |
[
"-l = f()",
"-d = [l[i + 1] - l[i] for i in range(n - 1)]",
"-a = abs(x - l[0])",
"+d = [abs(i - x) for i in f()]",
"+a = d.pop()"
] | false | 0.043488 | 0.037577 | 1.1573 |
[
"s912036903",
"s735985683"
] |
u268554510
|
p02769
|
python
|
s615148510
|
s072028091
| 613 | 362 | 48,476 | 42,736 |
Accepted
|
Accepted
| 40.95 |
n,k = list(map(int,input().split()))
k = min(k,n-1)
mod=10**9+7
fact = [1]*(5*10**5+1)
for i in range(2,5*10**5+1):
tmp = fact[i-1]*i
tmp%=mod
fact[i]=tmp
fact_inv = [0]*(5*10**5+1)
for i in range(5*10**5+1):
fact_inv[i]=pow(fact[i],mod-2,mod)
ans=0
def comb(a,b):
tmp = (fact[a]*fact_inv[a-b]%mod)*fact_inv[b]
tmp%=mod
return tmp
for i in range(k+1):
tmp = comb(n,i)*comb(n-1,i)
tmp%=mod
ans+=tmp
ans%=mod
print((ans%mod))
|
n,k = list(map(int,input().split()))
k = min(k,n-1)
mod=10**9+7
fact = [1]*(2*10**5+1)
for i in range(2,2*10**5+1):
tmp = fact[i-1]*i
tmp%=mod
fact[i]=tmp
fact_inv = [0]*(2*10**5+1)
for i in range(2*10**5+1):
fact_inv[i]=pow(fact[i],mod-2,mod)
ans=0
def comb(a,b):
tmp = (fact[a]*fact_inv[a-b]%mod)*fact_inv[b]
tmp%=mod
return tmp
for i in range(k+1):
tmp = comb(n,i)*comb(n-1,i)
tmp%=mod
ans+=tmp
ans%=mod
print((ans%mod))
| 26 | 26 | 470 | 470 |
n, k = list(map(int, input().split()))
k = min(k, n - 1)
mod = 10**9 + 7
fact = [1] * (5 * 10**5 + 1)
for i in range(2, 5 * 10**5 + 1):
tmp = fact[i - 1] * i
tmp %= mod
fact[i] = tmp
fact_inv = [0] * (5 * 10**5 + 1)
for i in range(5 * 10**5 + 1):
fact_inv[i] = pow(fact[i], mod - 2, mod)
ans = 0
def comb(a, b):
tmp = (fact[a] * fact_inv[a - b] % mod) * fact_inv[b]
tmp %= mod
return tmp
for i in range(k + 1):
tmp = comb(n, i) * comb(n - 1, i)
tmp %= mod
ans += tmp
ans %= mod
print((ans % mod))
|
n, k = list(map(int, input().split()))
k = min(k, n - 1)
mod = 10**9 + 7
fact = [1] * (2 * 10**5 + 1)
for i in range(2, 2 * 10**5 + 1):
tmp = fact[i - 1] * i
tmp %= mod
fact[i] = tmp
fact_inv = [0] * (2 * 10**5 + 1)
for i in range(2 * 10**5 + 1):
fact_inv[i] = pow(fact[i], mod - 2, mod)
ans = 0
def comb(a, b):
tmp = (fact[a] * fact_inv[a - b] % mod) * fact_inv[b]
tmp %= mod
return tmp
for i in range(k + 1):
tmp = comb(n, i) * comb(n - 1, i)
tmp %= mod
ans += tmp
ans %= mod
print((ans % mod))
| false | 0 |
[
"-fact = [1] * (5 * 10**5 + 1)",
"-for i in range(2, 5 * 10**5 + 1):",
"+fact = [1] * (2 * 10**5 + 1)",
"+for i in range(2, 2 * 10**5 + 1):",
"-fact_inv = [0] * (5 * 10**5 + 1)",
"-for i in range(5 * 10**5 + 1):",
"+fact_inv = [0] * (2 * 10**5 + 1)",
"+for i in range(2 * 10**5 + 1):"
] | false | 2.939181 | 2.427499 | 1.210786 |
[
"s615148510",
"s072028091"
] |
u796408111
|
p03610
|
python
|
s292102209
|
s948780935
| 28 | 18 | 3,188 | 3,188 |
Accepted
|
Accepted
| 35.71 |
s = str(eval(input()))
ans = ""
for i in range(0, len(s), 2):
ans += s[i]
print(ans)
|
s = eval(input())
print((s[::2]))
| 6 | 2 | 88 | 27 |
s = str(eval(input()))
ans = ""
for i in range(0, len(s), 2):
ans += s[i]
print(ans)
|
s = eval(input())
print((s[::2]))
| false | 66.666667 |
[
"-s = str(eval(input()))",
"-ans = \"\"",
"-for i in range(0, len(s), 2):",
"- ans += s[i]",
"-print(ans)",
"+s = eval(input())",
"+print((s[::2]))"
] | false | 0.04351 | 0.043192 | 1.007351 |
[
"s292102209",
"s948780935"
] |
u125269142
|
p02676
|
python
|
s700436898
|
s191303481
| 24 | 22 | 9,080 | 9,076 |
Accepted
|
Accepted
| 8.33 |
K = int(eval(input()))
S = eval(input())
S_length = len(S)
if S_length <= K:
print(S)
else:
print((S[0:K] + '...'))
|
k = int(eval(input()))
s = eval(input())
if len(s) <= k:
print(s)
else:
print((s[:k] + '...'))
| 9 | 7 | 117 | 92 |
K = int(eval(input()))
S = eval(input())
S_length = len(S)
if S_length <= K:
print(S)
else:
print((S[0:K] + "..."))
|
k = int(eval(input()))
s = eval(input())
if len(s) <= k:
print(s)
else:
print((s[:k] + "..."))
| false | 22.222222 |
[
"-K = int(eval(input()))",
"-S = eval(input())",
"-S_length = len(S)",
"-if S_length <= K:",
"- print(S)",
"+k = int(eval(input()))",
"+s = eval(input())",
"+if len(s) <= k:",
"+ print(s)",
"- print((S[0:K] + \"...\"))",
"+ print((s[:k] + \"...\"))"
] | false | 0.033577 | 0.035676 | 0.94114 |
[
"s700436898",
"s191303481"
] |
u072717685
|
p02583
|
python
|
s467105006
|
s183773479
| 156 | 109 | 20,728 | 73,880 |
Accepted
|
Accepted
| 30.13 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations
def main():
n, *l = list(map(int, read().split()))
if n < 3:
print((0))
sys.exit()
com = tuple(combinations(l, 3))
r = 0
for c in com:
c1 = c[0]
c2 = c[1]
c3 = c[2]
if c1 == c2 or c2 == c3 or c1 == c3:
continue
else:
cs = sum(c) - max(c)
r += cs > max(c)
print(r)
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations
def main():
n, *a = list(map(int, read().split()))
coma = combinations(a, 3)
r = 0
for c in coma:
if sum(c) > max(c)*2:
if len(set(c)) > 2:
r += 1
print(r)
if __name__ == '__main__':
main()
| 24 | 16 | 533 | 360 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations
def main():
n, *l = list(map(int, read().split()))
if n < 3:
print((0))
sys.exit()
com = tuple(combinations(l, 3))
r = 0
for c in com:
c1 = c[0]
c2 = c[1]
c3 = c[2]
if c1 == c2 or c2 == c3 or c1 == c3:
continue
else:
cs = sum(c) - max(c)
r += cs > max(c)
print(r)
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations
def main():
n, *a = list(map(int, read().split()))
coma = combinations(a, 3)
r = 0
for c in coma:
if sum(c) > max(c) * 2:
if len(set(c)) > 2:
r += 1
print(r)
if __name__ == "__main__":
main()
| false | 33.333333 |
[
"- n, *l = list(map(int, read().split()))",
"- if n < 3:",
"- print((0))",
"- sys.exit()",
"- com = tuple(combinations(l, 3))",
"+ n, *a = list(map(int, read().split()))",
"+ coma = combinations(a, 3)",
"- for c in com:",
"- c1 = c[0]",
"- c2 = c[1]",
"- c3 = c[2]",
"- if c1 == c2 or c2 == c3 or c1 == c3:",
"- continue",
"- else:",
"- cs = sum(c) - max(c)",
"- r += cs > max(c)",
"+ for c in coma:",
"+ if sum(c) > max(c) * 2:",
"+ if len(set(c)) > 2:",
"+ r += 1"
] | false | 0.044497 | 0.083815 | 0.530896 |
[
"s467105006",
"s183773479"
] |
u562935282
|
p03171
|
python
|
s593480389
|
s780322170
| 532 | 287 | 179,804 | 112,092 |
Accepted
|
Accepted
| 46.05 |
def main():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([None] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[l] - memo[l + 1][r], a[r] - memo[l][r - 1])
print((memo[0][n - 1]))
if __name__ == '__main__':
main()
# [l,r]を
# l:=配列aの右端から左にシフト
# r:=lと一致する位置からn-1まで右にシフト
# と考えると、l==rは既にメモ化済みなので、l=n-2以前、r=l+1以降を調べればよい
# 漸化式で使う値は、
# lがより右にいるときの計算結果（前のループで計算済み）と
# rがより左にいるときの計算結果（一番左でもl==rなので計算済み）
# なので、参照する値がNoneになることはなく、Noneのチェックは不要になる
# 関数名は関係あるのか？
|
def main():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([0] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[l] - memo[l + 1][r], a[r] - memo[l][r - 1])
print((memo[0][n - 1]))
if __name__ == '__main__':
main()
# [l,r]を
# l:=配列aの右端から左にシフト
# r:=lと一致する位置からn-1まで右にシフト
# と考えると、l==rは既にメモ化済みなので、l=n-2以前、r=l+1以降を調べればよい
# 漸化式で使う値は、
# lがより右にいるときの計算結果（前のループで計算済み）と
# rがより左にいるときの計算結果（一番左でもl==rなので計算済み）
# なので、参照する値がNoneになることはなく、Noneのチェックは不要になる
# Noneではなく、0で初期化する
| 28 | 28 | 653 | 655 |
def main():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([None] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[l] - memo[l + 1][r], a[r] - memo[l][r - 1])
print((memo[0][n - 1]))
if __name__ == "__main__":
main()
# [l,r]を
# l:=配列aの右端から左にシフト
# r:=lと一致する位置からn-1まで右にシフト
# と考えると、l==rは既にメモ化済みなので、l=n-2以前、r=l+1以降を調べればよい
# 漸化式で使う値は、
# lがより右にいるときの計算結果（前のループで計算済み）と
# rがより左にいるときの計算結果（一番左でもl==rなので計算済み）
# なので、参照する値がNoneになることはなく、Noneのチェックは不要になる
# 関数名は関係あるのか？
|
def main():
n = int(eval(input()))
a = tuple(int(x) for x in input().split())
memo = tuple([0] * n for _ in range(n))
for i in range(n):
memo[i][i] = a[i]
for l in range(n - 2, -1, -1):
for r in range(l + 1, n):
memo[l][r] = max(a[l] - memo[l + 1][r], a[r] - memo[l][r - 1])
print((memo[0][n - 1]))
if __name__ == "__main__":
main()
# [l,r]を
# l:=配列aの右端から左にシフト
# r:=lと一致する位置からn-1まで右にシフト
# と考えると、l==rは既にメモ化済みなので、l=n-2以前、r=l+1以降を調べればよい
# 漸化式で使う値は、
# lがより右にいるときの計算結果（前のループで計算済み）と
# rがより左にいるときの計算結果（一番左でもl==rなので計算済み）
# なので、参照する値がNoneになることはなく、Noneのチェックは不要になる
# Noneではなく、0で初期化する
| false | 0 |
[
"- memo = tuple([None] * n for _ in range(n))",
"+ memo = tuple([0] * n for _ in range(n))",
"-# 関数名は関係あるのか？",
"+# Noneではなく、0で初期化する"
] | false | 0.034947 | 0.093736 | 0.372826 |
[
"s593480389",
"s780322170"
] |
u714878632
|
p03588
|
python
|
s201569884
|
s541710237
| 281 | 77 | 3,064 | 3,060 |
Accepted
|
Accepted
| 72.6 |
def main():
n = int(eval(input()))
max_a, max_b = 0, 0 # type:int
for _ in range(n):
a, b = list(map(int, input().split(' ')))
# a = int(a)
if max_a < a:
max_a = a
max_b = b # int(b)
print((max_a + max_b))
if __name__ == "__main__":
main()
|
import sys
from sys import stdin
input = stdin.readline
def main():
n = int(eval(input()))
max_a, max_b = 0, 0 # type:int
for _ in range(n):
a, b = input().split()
a = int(a)
if max_a < a:
max_a = a
max_b = int(b)
print((max_a + max_b))
if __name__ == "__main__":
main()
| 14 | 18 | 310 | 350 |
def main():
n = int(eval(input()))
max_a, max_b = 0, 0 # type:int
for _ in range(n):
a, b = list(map(int, input().split(" ")))
# a = int(a)
if max_a < a:
max_a = a
max_b = b # int(b)
print((max_a + max_b))
if __name__ == "__main__":
main()
|
import sys
from sys import stdin
input = stdin.readline
def main():
n = int(eval(input()))
max_a, max_b = 0, 0 # type:int
for _ in range(n):
a, b = input().split()
a = int(a)
if max_a < a:
max_a = a
max_b = int(b)
print((max_a + max_b))
if __name__ == "__main__":
main()
| false | 22.222222 |
[
"+import sys",
"+from sys import stdin",
"+",
"+input = stdin.readline",
"+",
"+",
"- a, b = list(map(int, input().split(\" \")))",
"- # a = int(a)",
"+ a, b = input().split()",
"+ a = int(a)",
"- max_b = b # int(b)",
"+ max_b = int(b)"
] | false | 0.059522 | 0.059513 | 1.000159 |
[
"s201569884",
"s541710237"
] |
u384657160
|
p03475
|
python
|
s893597957
|
s743699389
| 172 | 78 | 3,188 | 3,188 |
Accepted
|
Accepted
| 54.65 |
from sys import stdin
n = int(eval(input()))
s = [stdin.readline().rstrip().split() for i in range(n-1)]
def kaisuu(s,i):
t = int(s[i][0]) + int(s[i][1])
if i != n-1:
for j in range(i+1,n-1):
if t <= int(s[j][1]):
t = int(s[j][0]) + int(s[j][1])
elif t % int(s[j][2]) == 0:
t = t + int(s[j][0])
else:
t = t + int(s[j][0]) + (int(s[j][2]) - t % int(s[j][2]))
return t
for i in range(0,n-1):
print((kaisuu(s,i)))
print((0))
|
n = int(eval(input()))
s = [list(map(int,input().split())) for i in range(n-1)]
def kaisuu(s,i):
t = s[i][0] + s[i][1]
if i != n-1:
for j in range(i+1,n-1):
if t <= s[j][1]:
t = s[j][0] + s[j][1]
elif t % s[j][2] == 0:
t = t + s[j][0]
else:
t = t + s[j][0] + (s[j][2] - t % s[j][2])
return t
for i in range(0,n-1):
print((kaisuu(s,i)))
print((0))
| 21 | 19 | 544 | 466 |
from sys import stdin
n = int(eval(input()))
s = [stdin.readline().rstrip().split() for i in range(n - 1)]
def kaisuu(s, i):
t = int(s[i][0]) + int(s[i][1])
if i != n - 1:
for j in range(i + 1, n - 1):
if t <= int(s[j][1]):
t = int(s[j][0]) + int(s[j][1])
elif t % int(s[j][2]) == 0:
t = t + int(s[j][0])
else:
t = t + int(s[j][0]) + (int(s[j][2]) - t % int(s[j][2]))
return t
for i in range(0, n - 1):
print((kaisuu(s, i)))
print((0))
|
n = int(eval(input()))
s = [list(map(int, input().split())) for i in range(n - 1)]
def kaisuu(s, i):
t = s[i][0] + s[i][1]
if i != n - 1:
for j in range(i + 1, n - 1):
if t <= s[j][1]:
t = s[j][0] + s[j][1]
elif t % s[j][2] == 0:
t = t + s[j][0]
else:
t = t + s[j][0] + (s[j][2] - t % s[j][2])
return t
for i in range(0, n - 1):
print((kaisuu(s, i)))
print((0))
| false | 9.52381 |
[
"-from sys import stdin",
"-",
"-s = [stdin.readline().rstrip().split() for i in range(n - 1)]",
"+s = [list(map(int, input().split())) for i in range(n - 1)]",
"- t = int(s[i][0]) + int(s[i][1])",
"+ t = s[i][0] + s[i][1]",
"- if t <= int(s[j][1]):",
"- t = int(s[j][0]) + int(s[j][1])",
"- elif t % int(s[j][2]) == 0:",
"- t = t + int(s[j][0])",
"+ if t <= s[j][1]:",
"+ t = s[j][0] + s[j][1]",
"+ elif t % s[j][2] == 0:",
"+ t = t + s[j][0]",
"- t = t + int(s[j][0]) + (int(s[j][2]) - t % int(s[j][2]))",
"+ t = t + s[j][0] + (s[j][2] - t % s[j][2])"
] | false | 0.047354 | 0.047815 | 0.990343 |
[
"s893597957",
"s743699389"
] |
u323680411
|
p04045
|
python
|
s313719974
|
s398717305
| 44 | 24 | 2,940 | 3,060 |
Accepted
|
Accepted
| 45.45 |
N, K = list(map(int, input().split()))
D = set(input().split())
n = N
while True:
for c in str(n):
if c in D:
break
else:
break
n += 1
print(n)
|
import sys
n, k = list(map(int, input().split()))
D = [int(x) for x in input().split()]
def dfs(s: str, m: int) -> None:
if s != "" and int(s) >= n:
print(s)
sys.exit()
if len(s) == m:
return
for i in range(10):
if i not in D:
dfs(str(i) + s, m)
for i in range(sys.maxsize):
dfs("", i)
| 14 | 21 | 193 | 367 |
N, K = list(map(int, input().split()))
D = set(input().split())
n = N
while True:
for c in str(n):
if c in D:
break
else:
break
n += 1
print(n)
|
import sys
n, k = list(map(int, input().split()))
D = [int(x) for x in input().split()]
def dfs(s: str, m: int) -> None:
if s != "" and int(s) >= n:
print(s)
sys.exit()
if len(s) == m:
return
for i in range(10):
if i not in D:
dfs(str(i) + s, m)
for i in range(sys.maxsize):
dfs("", i)
| false | 33.333333 |
[
"-N, K = list(map(int, input().split()))",
"-D = set(input().split())",
"-n = N",
"-while True:",
"- for c in str(n):",
"- if c in D:",
"- break",
"- else:",
"- break",
"- n += 1",
"-print(n)",
"+import sys",
"+",
"+n, k = list(map(int, input().split()))",
"+D = [int(x) for x in input().split()]",
"+",
"+",
"+def dfs(s: str, m: int) -> None:",
"+ if s != \"\" and int(s) >= n:",
"+ print(s)",
"+ sys.exit()",
"+ if len(s) == m:",
"+ return",
"+ for i in range(10):",
"+ if i not in D:",
"+ dfs(str(i) + s, m)",
"+",
"+",
"+for i in range(sys.maxsize):",
"+ dfs(\"\", i)"
] | false | 0.15399 | 0.061072 | 2.521457 |
[
"s313719974",
"s398717305"
] |
u009288816
|
p02268
|
python
|
s576872078
|
s985796049
| 700 | 390 | 15,172 | 16,900 |
Accepted
|
Accepted
| 44.29 |
import sys
def binSearch(x,data):
start = 0
end = len(data)
while start <= end:
mid = int((start + end) / 2)
if data[mid] == x:
return 1
elif int(data[mid]) > int(x):
end = mid - 1
else:
start = mid + 1
return 0
l = []
for i in sys.stdin:
l.append(i)
l[1] = l[1].split()
l[3] = l[3].split()
count = 0
for i in range(0,len(l[3])):
count += binSearch(l[3][i],l[1])
print(count)
|
def binSearch(l, x):
u = 0
d = len(l) - 1
while True:
if u > d:
break
m = int((u + d) / 2)
if l[m] == x:
return True
elif l[m] < x:
u = m + 1
else:
d = m - 1
return False
n = int(eval(input()))
ni = [int(x) for x in input().split()]
q = int(eval(input()))
qi = [int(x) for x in input().split()]
print((sum([1 for x in qi if binSearch(ni, x) is True])))
| 22 | 21 | 489 | 387 |
import sys
def binSearch(x, data):
start = 0
end = len(data)
while start <= end:
mid = int((start + end) / 2)
if data[mid] == x:
return 1
elif int(data[mid]) > int(x):
end = mid - 1
else:
start = mid + 1
return 0
l = []
for i in sys.stdin:
l.append(i)
l[1] = l[1].split()
l[3] = l[3].split()
count = 0
for i in range(0, len(l[3])):
count += binSearch(l[3][i], l[1])
print(count)
|
def binSearch(l, x):
u = 0
d = len(l) - 1
while True:
if u > d:
break
m = int((u + d) / 2)
if l[m] == x:
return True
elif l[m] < x:
u = m + 1
else:
d = m - 1
return False
n = int(eval(input()))
ni = [int(x) for x in input().split()]
q = int(eval(input()))
qi = [int(x) for x in input().split()]
print((sum([1 for x in qi if binSearch(ni, x) is True])))
| false | 4.545455 |
[
"-import sys",
"+def binSearch(l, x):",
"+ u = 0",
"+ d = len(l) - 1",
"+ while True:",
"+ if u > d:",
"+ break",
"+ m = int((u + d) / 2)",
"+ if l[m] == x:",
"+ return True",
"+ elif l[m] < x:",
"+ u = m + 1",
"+ else:",
"+ d = m - 1",
"+ return False",
"-def binSearch(x, data):",
"- start = 0",
"- end = len(data)",
"- while start <= end:",
"- mid = int((start + end) / 2)",
"- if data[mid] == x:",
"- return 1",
"- elif int(data[mid]) > int(x):",
"- end = mid - 1",
"- else:",
"- start = mid + 1",
"- return 0",
"-",
"-",
"-l = []",
"-for i in sys.stdin:",
"- l.append(i)",
"-l[1] = l[1].split()",
"-l[3] = l[3].split()",
"-count = 0",
"-for i in range(0, len(l[3])):",
"- count += binSearch(l[3][i], l[1])",
"-print(count)",
"+n = int(eval(input()))",
"+ni = [int(x) for x in input().split()]",
"+q = int(eval(input()))",
"+qi = [int(x) for x in input().split()]",
"+print((sum([1 for x in qi if binSearch(ni, x) is True])))"
] | false | 0.048702 | 0.048599 | 1.002113 |
[
"s576872078",
"s985796049"
] |
u844789719
|
p03277
|
python
|
s074573785
|
s729530754
| 1,747 | 1,240 | 129,864 | 124,580 |
Accepted
|
Accepted
| 29.02 |
import itertools
N = int(eval(input()))
A = [int(_) for _ in input().split()]
def check(x):
class SegmentTree():
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
e :
identity element of the monoid
size : int
limit for array size
"""
def __init__(self, array, f, e, size):
self.f = f
self.e = e
self.size = size
self.n = n = len(array)
self.dat = [e] * n + array + [e] * (2 * size - 2 * n)
self.build()
def build(self):
dat, n, f = self.dat, self.n, self.f
for i in range(n - 1, 0, -1):
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def modify(self, p, v):
"""
set value at position p (0-indexed)
"""
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
dat[p >> 1] = f(dat[p], dat[p ^ 1])
p >>= 1
def query(self, l, r):
"""
result on interval [l, r) (0-indexed)
"""
f, e, n, dat = self.f, self.e, self.n, self.dat
res = e
l += n
r += n
while l < r:
if l & 1:
res = f(res, dat[l])
l += 1
if r & 1:
r -= 1
res = f(res, dat[r])
l >>= 1
r >>= 1
return res
cumsum = list(itertools.accumulate([0] + [1 if a <= x else -1 for a in A]))
# sum([l:r)) = cumsum[r] - cumsum[l] >= 0
# ⇔ cumsum[l] <= cumsum[r]
e = 0
size = 2 * N + 10
ST = SegmentTree([e] * size, f=lambda x, y: x + y, e=e, size=size)
count = 0
for c in cumsum:
c += N + 5
count += ST.query(0, c + 1)
ST.modify(c + 1, ST.query(c + 1, c + 2) + 1)
return 2 * count > N * (N + 1) // 2
A_sorted = [0] + sorted(set(A)) + [10**10]
lb = 0
rb = len(A_sorted) - 1
# check(x) == Trueとなる最小のx
while rb - lb > 1:
mid = (rb + lb) // 2
if check(A_sorted[mid]):
rb = mid
else:
lb = mid
print((A_sorted[rb]))
|
import itertools
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class SegmentTree():
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
e :
identity element of the monoid
size : int
limit for array size
"""
def __init__(self, array, f, e, size):
self.f = f
self.e = e
self.size = size
self.n = n = len(array)
self.dat = [e] * n + array + [e] * (2 * size - 2 * n)
self.build()
def build(self):
dat, n, f = self.dat, self.n, self.f
for i in range(n - 1, 0, -1):
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def modify(self, p, v):
"""
set value at position p (0-indexed)
"""
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
dat[p >> 1] = f(dat[p], dat[p ^ 1])
p >>= 1
def query(self, l, r):
"""
result on interval [l, r) (0-indexed)
"""
f, e, n, dat = self.f, self.e, self.n, self.dat
res = e
l += n
r += n
while l < r:
if l & 1:
res = f(res, dat[l])
l += 1
if r & 1:
r -= 1
res = f(res, dat[r])
l >>= 1
r >>= 1
return res
e = 0
size = 2 * N + 2
f = lambda a, b: a + b
offset = N
def check(x):
cumsum = list(itertools.accumulate([0] + [1 if a <= x else -1 for a in A]))
# sum([l:r)) = cumsum[r] - cumsum[l] >= 0
# ⇔ cumsum[l] <= cumsum[r]
ST = SegmentTree([e] * size, f=f, e=e, size=size)
count = 0
for c in cumsum:
c += offset
count += ST.query(0, c + 1)
ST.modify(c + 1, ST.query(c + 1, c + 2) + 1)
return 2 * count > N * (N + 1) // 2
A_sorted = [0] + sorted(set(A)) + [10**10]
lb = 0
rb = len(A_sorted) - 1
# check(x) == Trueとなる最小のx
while rb - lb > 1:
mid = (rb + lb) // 2
if check(A_sorted[mid]):
rb = mid
else:
lb = mid
print((A_sorted[rb]))
| 88 | 93 | 2,461 | 2,270 |
import itertools
N = int(eval(input()))
A = [int(_) for _ in input().split()]
def check(x):
class SegmentTree:
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
e :
identity element of the monoid
size : int
limit for array size
"""
def __init__(self, array, f, e, size):
self.f = f
self.e = e
self.size = size
self.n = n = len(array)
self.dat = [e] * n + array + [e] * (2 * size - 2 * n)
self.build()
def build(self):
dat, n, f = self.dat, self.n, self.f
for i in range(n - 1, 0, -1):
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def modify(self, p, v):
"""
set value at position p (0-indexed)
"""
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
dat[p >> 1] = f(dat[p], dat[p ^ 1])
p >>= 1
def query(self, l, r):
"""
result on interval [l, r) (0-indexed)
"""
f, e, n, dat = self.f, self.e, self.n, self.dat
res = e
l += n
r += n
while l < r:
if l & 1:
res = f(res, dat[l])
l += 1
if r & 1:
r -= 1
res = f(res, dat[r])
l >>= 1
r >>= 1
return res
cumsum = list(itertools.accumulate([0] + [1 if a <= x else -1 for a in A]))
# sum([l:r)) = cumsum[r] - cumsum[l] >= 0
# ⇔ cumsum[l] <= cumsum[r]
e = 0
size = 2 * N + 10
ST = SegmentTree([e] * size, f=lambda x, y: x + y, e=e, size=size)
count = 0
for c in cumsum:
c += N + 5
count += ST.query(0, c + 1)
ST.modify(c + 1, ST.query(c + 1, c + 2) + 1)
return 2 * count > N * (N + 1) // 2
A_sorted = [0] + sorted(set(A)) + [10**10]
lb = 0
rb = len(A_sorted) - 1
# check(x) == Trueとなる最小のx
while rb - lb > 1:
mid = (rb + lb) // 2
if check(A_sorted[mid]):
rb = mid
else:
lb = mid
print((A_sorted[rb]))
|
import itertools
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class SegmentTree:
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary operation of the monoid
e :
identity element of the monoid
size : int
limit for array size
"""
def __init__(self, array, f, e, size):
self.f = f
self.e = e
self.size = size
self.n = n = len(array)
self.dat = [e] * n + array + [e] * (2 * size - 2 * n)
self.build()
def build(self):
dat, n, f = self.dat, self.n, self.f
for i in range(n - 1, 0, -1):
dat[i] = f(dat[i << 1], dat[i << 1 | 1])
def modify(self, p, v):
"""
set value at position p (0-indexed)
"""
f, n, dat = self.f, self.n, self.dat
p += n
dat[p] = v
while p > 1:
dat[p >> 1] = f(dat[p], dat[p ^ 1])
p >>= 1
def query(self, l, r):
"""
result on interval [l, r) (0-indexed)
"""
f, e, n, dat = self.f, self.e, self.n, self.dat
res = e
l += n
r += n
while l < r:
if l & 1:
res = f(res, dat[l])
l += 1
if r & 1:
r -= 1
res = f(res, dat[r])
l >>= 1
r >>= 1
return res
e = 0
size = 2 * N + 2
f = lambda a, b: a + b
offset = N
def check(x):
cumsum = list(itertools.accumulate([0] + [1 if a <= x else -1 for a in A]))
# sum([l:r)) = cumsum[r] - cumsum[l] >= 0
# ⇔ cumsum[l] <= cumsum[r]
ST = SegmentTree([e] * size, f=f, e=e, size=size)
count = 0
for c in cumsum:
c += offset
count += ST.query(0, c + 1)
ST.modify(c + 1, ST.query(c + 1, c + 2) + 1)
return 2 * count > N * (N + 1) // 2
A_sorted = [0] + sorted(set(A)) + [10**10]
lb = 0
rb = len(A_sorted) - 1
# check(x) == Trueとなる最小のx
while rb - lb > 1:
mid = (rb + lb) // 2
if check(A_sorted[mid]):
rb = mid
else:
lb = mid
print((A_sorted[rb]))
| false | 5.376344 |
[
"+class SegmentTree:",
"+ \"\"\"",
"+ Parameters",
"+ array : list",
"+ to construct segment tree from",
"+ f : func",
"+ binary operation of the monoid",
"+ e :",
"+ identity element of the monoid",
"+ size : int",
"+ limit for array size",
"+ \"\"\"",
"+",
"+ def __init__(self, array, f, e, size):",
"+ self.f = f",
"+ self.e = e",
"+ self.size = size",
"+ self.n = n = len(array)",
"+ self.dat = [e] * n + array + [e] * (2 * size - 2 * n)",
"+ self.build()",
"+",
"+ def build(self):",
"+ dat, n, f = self.dat, self.n, self.f",
"+ for i in range(n - 1, 0, -1):",
"+ dat[i] = f(dat[i << 1], dat[i << 1 | 1])",
"+",
"+ def modify(self, p, v):",
"+ \"\"\"",
"+ set value at position p (0-indexed)",
"+ \"\"\"",
"+ f, n, dat = self.f, self.n, self.dat",
"+ p += n",
"+ dat[p] = v",
"+ while p > 1:",
"+ dat[p >> 1] = f(dat[p], dat[p ^ 1])",
"+ p >>= 1",
"+",
"+ def query(self, l, r):",
"+ \"\"\"",
"+ result on interval [l, r) (0-indexed)",
"+ \"\"\"",
"+ f, e, n, dat = self.f, self.e, self.n, self.dat",
"+ res = e",
"+ l += n",
"+ r += n",
"+ while l < r:",
"+ if l & 1:",
"+ res = f(res, dat[l])",
"+ l += 1",
"+ if r & 1:",
"+ r -= 1",
"+ res = f(res, dat[r])",
"+ l >>= 1",
"+ r >>= 1",
"+ return res",
"+",
"+",
"+e = 0",
"+size = 2 * N + 2",
"+f = lambda a, b: a + b",
"+offset = N",
"+",
"+",
"- class SegmentTree:",
"- \"\"\"",
"- Parameters",
"- array : list",
"- to construct segment tree from",
"- f : func",
"- binary operation of the monoid",
"- e :",
"- identity element of the monoid",
"- size : int",
"- limit for array size",
"- \"\"\"",
"-",
"- def __init__(self, array, f, e, size):",
"- self.f = f",
"- self.e = e",
"- self.size = size",
"- self.n = n = len(array)",
"- self.dat = [e] * n + array + [e] * (2 * size - 2 * n)",
"- self.build()",
"-",
"- def build(self):",
"- dat, n, f = self.dat, self.n, self.f",
"- for i in range(n - 1, 0, -1):",
"- dat[i] = f(dat[i << 1], dat[i << 1 | 1])",
"-",
"- def modify(self, p, v):",
"- \"\"\"",
"- set value at position p (0-indexed)",
"- \"\"\"",
"- f, n, dat = self.f, self.n, self.dat",
"- p += n",
"- dat[p] = v",
"- while p > 1:",
"- dat[p >> 1] = f(dat[p], dat[p ^ 1])",
"- p >>= 1",
"-",
"- def query(self, l, r):",
"- \"\"\"",
"- result on interval [l, r) (0-indexed)",
"- \"\"\"",
"- f, e, n, dat = self.f, self.e, self.n, self.dat",
"- res = e",
"- l += n",
"- r += n",
"- while l < r:",
"- if l & 1:",
"- res = f(res, dat[l])",
"- l += 1",
"- if r & 1:",
"- r -= 1",
"- res = f(res, dat[r])",
"- l >>= 1",
"- r >>= 1",
"- return res",
"-",
"- e = 0",
"- size = 2 * N + 10",
"- ST = SegmentTree([e] * size, f=lambda x, y: x + y, e=e, size=size)",
"+ ST = SegmentTree([e] * size, f=f, e=e, size=size)",
"- c += N + 5",
"+ c += offset"
] | false | 0.04067 | 0.045417 | 0.895483 |
[
"s074573785",
"s729530754"
] |
u392029857
|
p03126
|
python
|
s103049769
|
s497760296
| 19 | 17 | 3,064 | 2,940 |
Accepted
|
Accepted
| 10.53 |
n, m = list(map(int, input().split()))
k = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i in range(1, m+1):
cnt = 0
for p in k:
if i in p[1:]:
cnt += 1
if cnt == n:
ans += 1
print(ans)
|
n,m = list(map(int,input().split()))
cnt = [0]*(m+1)
for i in range(n):
x = list(map(int, input().split()))
for p in x[1:]:
cnt[p] += 1
print((cnt.count(n)))
| 11 | 7 | 247 | 171 |
n, m = list(map(int, input().split()))
k = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i in range(1, m + 1):
cnt = 0
for p in k:
if i in p[1:]:
cnt += 1
if cnt == n:
ans += 1
print(ans)
|
n, m = list(map(int, input().split()))
cnt = [0] * (m + 1)
for i in range(n):
x = list(map(int, input().split()))
for p in x[1:]:
cnt[p] += 1
print((cnt.count(n)))
| false | 36.363636 |
[
"-k = [list(map(int, input().split())) for i in range(n)]",
"-ans = 0",
"-for i in range(1, m + 1):",
"- cnt = 0",
"- for p in k:",
"- if i in p[1:]:",
"- cnt += 1",
"- if cnt == n:",
"- ans += 1",
"-print(ans)",
"+cnt = [0] * (m + 1)",
"+for i in range(n):",
"+ x = list(map(int, input().split()))",
"+ for p in x[1:]:",
"+ cnt[p] += 1",
"+print((cnt.count(n)))"
] | false | 0.041897 | 0.075508 | 0.55486 |
[
"s103049769",
"s497760296"
] |
u788137651
|
p02953
|
python
|
s371797300
|
s343676134
| 215 | 85 | 59,632 | 17,420 |
Accepted
|
Accepted
| 60.47 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float, input().split()))
def MI_(): return list(map(INT_,input().split()))
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in eval(input())]
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def ST(): return input().replace('\n', '')
def main():
N=I()
H=LI()[::-1]
for i,h in enumerate(H):
if i == 0:
pass
else:
if h <= H[i-1]:
continue
else:
H[i]-=1
if H[i] > H[i-1]:
print("No")
exit()
print("Yes")
if __name__ == '__main__':
main()
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N = I()
H=LI()
now = 0
for h in H:
if now > h:
print("No")
return
now = max(now, h-1)
print("Yes")
if __name__ == '__main__':
main()
| 54 | 53 | 1,491 | 1,519 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict
from itertools import (
accumulate,
permutations,
combinations,
product,
combinations_with_replacement,
)
from bisect import bisect_left, bisect_right
inf = float("inf")
mod = 10**9 + 7
def INT_(n):
return int(n) - 1
def MI():
return list(map(int, input().split()))
def MF():
return list(map(float, input().split()))
def MI_():
return list(map(INT_, input().split()))
def LI():
return list(MI())
def LI_():
return [int(x) - 1 for x in input().split()]
def LF():
return list(MF())
def LIN(n: int):
return [I() for _ in range(n)]
def LLIN(n: int):
return [LI() for _ in range(n)]
def LLIN_(n: int):
return [LI_() for _ in range(n)]
def LLI():
return [list(map(int, l.split())) for l in eval(input())]
def I():
return int(eval(input()))
def F():
return float(eval(input()))
def ST():
return input().replace("\n", "")
def main():
N = I()
H = LI()[::-1]
for i, h in enumerate(H):
if i == 0:
pass
else:
if h <= H[i - 1]:
continue
else:
H[i] -= 1
if H[i] > H[i - 1]:
print("No")
exit()
print("Yes")
if __name__ == "__main__":
main()
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import (
accumulate,
permutations,
combinations,
product,
combinations_with_replacement,
)
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a, b):
return (a + b - 1) // b
inf = float("inf")
mod = 10**9 + 7
def pprint(*A):
for a in A:
print(*a, sep="\n")
def INT_(n):
return int(n) - 1
def MI():
return map(int, input().split())
def MF():
return map(float, input().split())
def MI_():
return map(INT_, input().split())
def LI():
return list(MI())
def LI_():
return [int(x) - 1 for x in input().split()]
def LF():
return list(MF())
def LIN(n: int):
return [I() for _ in range(n)]
def LLIN(n: int):
return [LI() for _ in range(n)]
def LLIN_(n: int):
return [LI_() for _ in range(n)]
def LLI():
return [list(map(int, l.split())) for l in input()]
def I():
return int(input())
def F():
return float(input())
def ST():
return input().replace("\n", "")
def main():
N = I()
H = LI()
now = 0
for h in H:
if now > h:
print("No")
return
now = max(now, h - 1)
print("Yes")
if __name__ == "__main__":
main()
| false | 1.851852 |
[
"+sys.setrecursionlimit(10**6)",
"-from math import floor, ceil, sqrt, factorial, log # log2ないｙｐ",
"+from math import floor, sqrt, factorial, hypot, log # log2ないｙｐ",
"-from collections import Counter, defaultdict",
"+from collections import Counter, defaultdict, deque",
"+from copy import deepcopy",
"+from fractions import gcd",
"+from random import randint",
"+",
"+",
"+def ceil(a, b):",
"+ return (a + b - 1) // b",
"+",
"+",
"+",
"+def pprint(*A):",
"+ for a in A:",
"+ print(*a, sep=\"\\n\")",
"- return list(map(int, input().split()))",
"+ return map(int, input().split())",
"- return list(map(float, input().split()))",
"+ return map(float, input().split())",
"- return list(map(INT_, input().split()))",
"+ return map(INT_, input().split())",
"- return [list(map(int, l.split())) for l in eval(input())]",
"+ return [list(map(int, l.split())) for l in input()]",
"- return int(eval(input()))",
"+ return int(input())",
"- return float(eval(input()))",
"+ return float(input())",
"- H = LI()[::-1]",
"- for i, h in enumerate(H):",
"- if i == 0:",
"- pass",
"- else:",
"- if h <= H[i - 1]:",
"- continue",
"- else:",
"- H[i] -= 1",
"- if H[i] > H[i - 1]:",
"- print(\"No\")",
"- exit()",
"+ H = LI()",
"+ now = 0",
"+ for h in H:",
"+ if now > h:",
"+ print(\"No\")",
"+ return",
"+ now = max(now, h - 1)"
] | false | 0.049013 | 0.035843 | 1.367426 |
[
"s371797300",
"s343676134"
] |
u633068244
|
p00116
|
python
|
s352837567
|
s214735904
| 2,340 | 2,040 | 60,480 | 10,312 |
Accepted
|
Accepted
| 12.82 |
while 1:
H,W = list(map(int,input().split()))
if H == 0: break
A = [input() for i in range(H)]
S = [[[0,0] for j in range(W)] for i in range(H)]
ans = 0
for h in range(H):
L = 0
for w in range(W):
if A[h][w] == ".":
L += 1
else:
L = 0
S[h][w][0] = L
try: S[h][w][1] = S[h-1][w][1] + 1 if L > 0 else 0
except: S[h][w][1] = 1 if L > 0 else 0
if L*S[h][w][1] > ans:
a = L
for hi in range(1,S[h][w][1]):
a = min(a,S[h-hi][w][0])
ans = max(ans,a*(hi+1))
if a*S[h][w][1] < ans:
break
print(ans)
|
while 1:
H,W = list(map(int,input().split()))
if H == 0: break
M = [input() for i in range(H)]
A = [[0]*W for i in range(H)]
B = [[0]*W for i in range(H)]
ans = 0
for h in range(H):
L = 0
for w in range(W):
if M[h][w] == ".":
L += 1
else:
L = 0
A[h][w] = L
try: B[h][w] = B[h-1][w] + 1 if L > 0 else 0
except: B[h][w] = 1 if L > 0 else 0
if L*B[h][w] > ans:
a = L
for hi in range(B[h][w]):
a = min(a,A[h-hi][w])
if a*B[h][w] <= ans:
break
ans = max(ans,a*(hi+1))
print(ans)
| 24 | 25 | 770 | 565 |
while 1:
H, W = list(map(int, input().split()))
if H == 0:
break
A = [input() for i in range(H)]
S = [[[0, 0] for j in range(W)] for i in range(H)]
ans = 0
for h in range(H):
L = 0
for w in range(W):
if A[h][w] == ".":
L += 1
else:
L = 0
S[h][w][0] = L
try:
S[h][w][1] = S[h - 1][w][1] + 1 if L > 0 else 0
except:
S[h][w][1] = 1 if L > 0 else 0
if L * S[h][w][1] > ans:
a = L
for hi in range(1, S[h][w][1]):
a = min(a, S[h - hi][w][0])
ans = max(ans, a * (hi + 1))
if a * S[h][w][1] < ans:
break
print(ans)
|
while 1:
H, W = list(map(int, input().split()))
if H == 0:
break
M = [input() for i in range(H)]
A = [[0] * W for i in range(H)]
B = [[0] * W for i in range(H)]
ans = 0
for h in range(H):
L = 0
for w in range(W):
if M[h][w] == ".":
L += 1
else:
L = 0
A[h][w] = L
try:
B[h][w] = B[h - 1][w] + 1 if L > 0 else 0
except:
B[h][w] = 1 if L > 0 else 0
if L * B[h][w] > ans:
a = L
for hi in range(B[h][w]):
a = min(a, A[h - hi][w])
if a * B[h][w] <= ans:
break
ans = max(ans, a * (hi + 1))
print(ans)
| false | 4 |
[
"- A = [input() for i in range(H)]",
"- S = [[[0, 0] for j in range(W)] for i in range(H)]",
"+ M = [input() for i in range(H)]",
"+ A = [[0] * W for i in range(H)]",
"+ B = [[0] * W for i in range(H)]",
"- if A[h][w] == \".\":",
"+ if M[h][w] == \".\":",
"- S[h][w][0] = L",
"+ A[h][w] = L",
"- S[h][w][1] = S[h - 1][w][1] + 1 if L > 0 else 0",
"+ B[h][w] = B[h - 1][w] + 1 if L > 0 else 0",
"- S[h][w][1] = 1 if L > 0 else 0",
"- if L * S[h][w][1] > ans:",
"+ B[h][w] = 1 if L > 0 else 0",
"+ if L * B[h][w] > ans:",
"- for hi in range(1, S[h][w][1]):",
"- a = min(a, S[h - hi][w][0])",
"+ for hi in range(B[h][w]):",
"+ a = min(a, A[h - hi][w])",
"+ if a * B[h][w] <= ans:",
"+ break",
"- if a * S[h][w][1] < ans:",
"- break"
] | false | 0.168752 | 0.045182 | 3.734939 |
[
"s352837567",
"s214735904"
] |
u729133443
|
p03738
|
python
|
s707405252
|
s144580975
| 178 | 17 | 38,384 | 2,940 |
Accepted
|
Accepted
| 90.45 |
a=int(eval(input()))-int(eval(input()));print(('GELRQEEUSAASTL E R'[(a<1)+(a<0)::3]))
|
a,b=list(map(int,open(0)));print((['ELQEUSASL'[a<b::2],'GREATER'][a>b]))
| 1 | 1 | 72 | 64 |
a = int(eval(input())) - int(eval(input()))
print(("GELRQEEUSAASTL E R"[(a < 1) + (a < 0) :: 3]))
|
a, b = list(map(int, open(0)))
print((["ELQEUSASL"[a < b :: 2], "GREATER"][a > b]))
| false | 0 |
[
"-a = int(eval(input())) - int(eval(input()))",
"-print((\"GELRQEEUSAASTL E R\"[(a < 1) + (a < 0) :: 3]))",
"+a, b = list(map(int, open(0)))",
"+print(([\"ELQEUSASL\"[a < b :: 2], \"GREATER\"][a > b]))"
] | false | 0.080547 | 0.067131 | 1.199862 |
[
"s707405252",
"s144580975"
] |
u673361376
|
p02990
|
python
|
s093495655
|
s758415532
| 1,914 | 204 | 49,116 | 41,968 |
Accepted
|
Accepted
| 89.34 |
from itertools import combinations, groupby
from operator import mul
from functools import reduce
def ncr(n,r):
if r == 0: return 1
numer = reduce(mul, list(range(n, n-r, -1)), 1)
denom = reduce(mul, list(range(1, r+1)), 1)
return numer//denom
N, K = list(map(int,input().split()))
MOD = 10**9 + 7
for k in range(1,K+1):
print(((ncr(N-K+1,k)*ncr(K-1,k-1))%MOD))
|
MOD = 10 ** 9 + 7
def make_table_mod(n, mod=10 ** 9 + 7):
fct = [1, 1]
inv = [1, 1]
for i in range(2, n + 1):
fct.append((fct[i-1] * i) % MOD)
inv.append(divmod(fct[i]))
return fct, inv
def divmod(n, p=10**9+7):
return pow(n, p-2, p)
def ncr(n, r, mod=10**9+7):
return (fct[n] * inv[r] * inv[n-r]) % mod
N, K = list(map(int, input().split()))
fct, inv = make_table_mod(N)
for i in range(1, K + 1):
if N - K + 1 < i:
print((0))
else:
print(((ncr(N - K + 1, i) * ncr(K - 1, i - 1)) % MOD))
| 15 | 27 | 368 | 576 |
from itertools import combinations, groupby
from operator import mul
from functools import reduce
def ncr(n, r):
if r == 0:
return 1
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
for k in range(1, K + 1):
print(((ncr(N - K + 1, k) * ncr(K - 1, k - 1)) % MOD))
|
MOD = 10**9 + 7
def make_table_mod(n, mod=10**9 + 7):
fct = [1, 1]
inv = [1, 1]
for i in range(2, n + 1):
fct.append((fct[i - 1] * i) % MOD)
inv.append(divmod(fct[i]))
return fct, inv
def divmod(n, p=10**9 + 7):
return pow(n, p - 2, p)
def ncr(n, r, mod=10**9 + 7):
return (fct[n] * inv[r] * inv[n - r]) % mod
N, K = list(map(int, input().split()))
fct, inv = make_table_mod(N)
for i in range(1, K + 1):
if N - K + 1 < i:
print((0))
else:
print(((ncr(N - K + 1, i) * ncr(K - 1, i - 1)) % MOD))
| false | 44.444444 |
[
"-from itertools import combinations, groupby",
"-from operator import mul",
"-from functools import reduce",
"+MOD = 10**9 + 7",
"-def ncr(n, r):",
"- if r == 0:",
"- return 1",
"- numer = reduce(mul, list(range(n, n - r, -1)), 1)",
"- denom = reduce(mul, list(range(1, r + 1)), 1)",
"- return numer // denom",
"+def make_table_mod(n, mod=10**9 + 7):",
"+ fct = [1, 1]",
"+ inv = [1, 1]",
"+ for i in range(2, n + 1):",
"+ fct.append((fct[i - 1] * i) % MOD)",
"+ inv.append(divmod(fct[i]))",
"+ return fct, inv",
"+",
"+",
"+def divmod(n, p=10**9 + 7):",
"+ return pow(n, p - 2, p)",
"+",
"+",
"+def ncr(n, r, mod=10**9 + 7):",
"+ return (fct[n] * inv[r] * inv[n - r]) % mod",
"-MOD = 10**9 + 7",
"-for k in range(1, K + 1):",
"- print(((ncr(N - K + 1, k) * ncr(K - 1, k - 1)) % MOD))",
"+fct, inv = make_table_mod(N)",
"+for i in range(1, K + 1):",
"+ if N - K + 1 < i:",
"+ print((0))",
"+ else:",
"+ print(((ncr(N - K + 1, i) * ncr(K - 1, i - 1)) % MOD))"
] | false | 0.176229 | 0.047641 | 3.699151 |
[
"s093495655",
"s758415532"
] |
u190405389
|
p03693
|
python
|
s795036538
|
s721486515
| 19 | 17 | 3,060 | 2,940 |
Accepted
|
Accepted
| 10.53 |
r, g, b = list(map(int, input().split()))
print(('YES' if (g*10+b) % 4 == 0 else 'NO'))
|
r, g, b = input().split()
print(('YES' if int(g+b) % 4 == 0 else 'NO'))
| 2 | 2 | 81 | 71 |
r, g, b = list(map(int, input().split()))
print(("YES" if (g * 10 + b) % 4 == 0 else "NO"))
|
r, g, b = input().split()
print(("YES" if int(g + b) % 4 == 0 else "NO"))
| false | 0 |
[
"-r, g, b = list(map(int, input().split()))",
"-print((\"YES\" if (g * 10 + b) % 4 == 0 else \"NO\"))",
"+r, g, b = input().split()",
"+print((\"YES\" if int(g + b) % 4 == 0 else \"NO\"))"
] | false | 0.068183 | 0.048893 | 1.39452 |
[
"s795036538",
"s721486515"
] |
u508273185
|
p02724
|
python
|
s718129246
|
s149844551
| 385 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 95.58 |
x = int(eval(input()))
count = 0
while (x >= 500):
count += 1000
x = x-500
while (x >= 5):
if x > 5:
count += 5
x = x-5
print(count)
|
#別回答
x = int(eval(input()))
print(((x//500*1000) + ((x%500)//5*5)))
| 11 | 4 | 165 | 63 |
x = int(eval(input()))
count = 0
while x >= 500:
count += 1000
x = x - 500
while x >= 5:
if x > 5:
count += 5
x = x - 5
print(count)
|
# 別回答
x = int(eval(input()))
print(((x // 500 * 1000) + ((x % 500) // 5 * 5)))
| false | 63.636364 |
[
"+# 別回答",
"-count = 0",
"-while x >= 500:",
"- count += 1000",
"- x = x - 500",
"-while x >= 5:",
"- if x > 5:",
"- count += 5",
"- x = x - 5",
"-print(count)",
"+print(((x // 500 * 1000) + ((x % 500) // 5 * 5)))"
] | false | 0.217364 | 0.036066 | 6.026767 |
[
"s718129246",
"s149844551"
] |
u570018655
|
p03030
|
python
|
s079685583
|
s101710874
| 189 | 17 | 38,384 | 3,060 |
Accepted
|
Accepted
| 91.01 |
from operator import itemgetter
N = int(input())
SP = []
d = {}
for i in range(1, N+1):
s, p = input().split()
SP.append([s, -int(p), i])
d[int(p)] = i
# SP.sort(key= lambda x:x[0])
# SP.sort(key=lambda x:x[1])
SP.sort()
[print(i[2]) for i in SP]
|
N = int(eval(input()))
SP = []
for i in range(1, N + 1):
s, p = input().split()
SP.append((s, int(p), i))
sp = sorted(SP, key=lambda x: x[1], reverse=True)
for i in sorted(sp, key=lambda x: x[0]):
print((i[2]))
| 13 | 8 | 272 | 222 |
from operator import itemgetter
N = int(input())
SP = []
d = {}
for i in range(1, N + 1):
s, p = input().split()
SP.append([s, -int(p), i])
d[int(p)] = i
# SP.sort(key= lambda x:x[0])
# SP.sort(key=lambda x:x[1])
SP.sort()
[print(i[2]) for i in SP]
|
N = int(eval(input()))
SP = []
for i in range(1, N + 1):
s, p = input().split()
SP.append((s, int(p), i))
sp = sorted(SP, key=lambda x: x[1], reverse=True)
for i in sorted(sp, key=lambda x: x[0]):
print((i[2]))
| false | 38.461538 |
[
"-from operator import itemgetter",
"-",
"-N = int(input())",
"+N = int(eval(input()))",
"-d = {}",
"- SP.append([s, -int(p), i])",
"- d[int(p)] = i",
"-# SP.sort(key= lambda x:x[0])",
"-# SP.sort(key=lambda x:x[1])",
"-SP.sort()",
"-[print(i[2]) for i in SP]",
"+ SP.append((s, int(p), i))",
"+sp = sorted(SP, key=lambda x: x[1], reverse=True)",
"+for i in sorted(sp, key=lambda x: x[0]):",
"+ print((i[2]))"
] | false | 0.03813 | 0.036343 | 1.049187 |
[
"s079685583",
"s101710874"
] |
u297574184
|
p02960
|
python
|
s201729420
|
s682942981
| 764 | 565 | 61,916 | 61,916 |
Accepted
|
Accepted
| 26.05 |
MOD = 10**9 + 7
Ss = eval(input())
N = len(Ss)
dp = [[0]*(13) for _ in range(N+1)]
dp[0][0] = 1
for d, Sd in enumerate(Ss):
# print(d, Sd)
for mod13 in range(13):
if Sd != '?':
x = int(Sd)
mod13n = (10*mod13 + x) % 13
dp[d+1][mod13n] += dp[d][mod13]
dp[d+1][mod13n] %= MOD
else:
for x in range(10):
mod13n = (10*mod13 + x) % 13
dp[d+1][mod13n] += dp[d][mod13]
dp[d+1][mod13n] %= MOD
print((dp[-1][5]))
|
MOD = 10**9 + 7
Ss = input().rstrip()
lenS = len(Ss)
dp = [[0]*(13) for _ in range(lenS+1)]
dp[0][0] = 1
for i, S in enumerate(Ss):
for j in range(13):
dp[i][j] %= MOD
if S != '?':
S = int(S)
for j in range(13):
j2 = (j*10+S) % 13
dp[i+1][j2] += dp[i][j]
else:
for S in range(10):
for j in range(13):
j2 = (j*10+S) % 13
dp[i+1][j2] += dp[i][j]
ans = dp[lenS][5] % MOD
print(ans)
| 23 | 24 | 551 | 518 |
MOD = 10**9 + 7
Ss = eval(input())
N = len(Ss)
dp = [[0] * (13) for _ in range(N + 1)]
dp[0][0] = 1
for d, Sd in enumerate(Ss):
# print(d, Sd)
for mod13 in range(13):
if Sd != "?":
x = int(Sd)
mod13n = (10 * mod13 + x) % 13
dp[d + 1][mod13n] += dp[d][mod13]
dp[d + 1][mod13n] %= MOD
else:
for x in range(10):
mod13n = (10 * mod13 + x) % 13
dp[d + 1][mod13n] += dp[d][mod13]
dp[d + 1][mod13n] %= MOD
print((dp[-1][5]))
|
MOD = 10**9 + 7
Ss = input().rstrip()
lenS = len(Ss)
dp = [[0] * (13) for _ in range(lenS + 1)]
dp[0][0] = 1
for i, S in enumerate(Ss):
for j in range(13):
dp[i][j] %= MOD
if S != "?":
S = int(S)
for j in range(13):
j2 = (j * 10 + S) % 13
dp[i + 1][j2] += dp[i][j]
else:
for S in range(10):
for j in range(13):
j2 = (j * 10 + S) % 13
dp[i + 1][j2] += dp[i][j]
ans = dp[lenS][5] % MOD
print(ans)
| false | 4.166667 |
[
"-Ss = eval(input())",
"-N = len(Ss)",
"-dp = [[0] * (13) for _ in range(N + 1)]",
"+Ss = input().rstrip()",
"+lenS = len(Ss)",
"+dp = [[0] * (13) for _ in range(lenS + 1)]",
"-for d, Sd in enumerate(Ss):",
"- # print(d, Sd)",
"- for mod13 in range(13):",
"- if Sd != \"?\":",
"- x = int(Sd)",
"- mod13n = (10 * mod13 + x) % 13",
"- dp[d + 1][mod13n] += dp[d][mod13]",
"- dp[d + 1][mod13n] %= MOD",
"- else:",
"- for x in range(10):",
"- mod13n = (10 * mod13 + x) % 13",
"- dp[d + 1][mod13n] += dp[d][mod13]",
"- dp[d + 1][mod13n] %= MOD",
"-print((dp[-1][5]))",
"+for i, S in enumerate(Ss):",
"+ for j in range(13):",
"+ dp[i][j] %= MOD",
"+ if S != \"?\":",
"+ S = int(S)",
"+ for j in range(13):",
"+ j2 = (j * 10 + S) % 13",
"+ dp[i + 1][j2] += dp[i][j]",
"+ else:",
"+ for S in range(10):",
"+ for j in range(13):",
"+ j2 = (j * 10 + S) % 13",
"+ dp[i + 1][j2] += dp[i][j]",
"+ans = dp[lenS][5] % MOD",
"+print(ans)"
] | false | 0.10509 | 0.084439 | 1.244567 |
[
"s201729420",
"s682942981"
] |
u934442292
|
p02873
|
python
|
s502644441
|
s721347218
| 285 | 228 | 23,360 | 29,128 |
Accepted
|
Accepted
| 20 |
import sys
input = sys.stdin.readline # NOQA
def left(T, S, a, i):
# ...>>><
j = 1
l = i
while 0 <= l:
if S[l] == ">" and a[l] < j:
a[l] = j
l -= 1
j += 1
else:
break
def right(T, S, a, i):
# ><<<...
j = 1
r = i
while r <= T - 1:
if S[r] == "<" and a[r + 1] < j:
a[r + 1] = j
r += 1
j += 1
else:
break
def main():
S = input().rstrip()
T = len(S)
N = T + 1
a = [-1] * N
if S[0] == "<":
a[0] = 0
right(T, S, a, 0)
for i in range(T - 1):
if S[i] == ">" and S[i + 1] == "<":
a[i + 1] = 0
left(T, S, a, i)
right(T, S, a, i + 1)
if S[T - 1] == ">":
a[N - 1] = 0
left(T, S, a, T - 1)
ans = sum(a)
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline
def left(N, S, a, i):
a[i + 1] = 0
v = 0
while True:
if i == 0:
a[i] = v + 1
break
if S[i - 1] == ">":
v += 1
a[i] = v
i -= 1
else:
a[i] = max(a[i], v + 1)
break
def right(N, S, a, i):
a[i] = 0
v = 0
while True:
if i == N - 1:
a[i + 1] = v + 1
break
if S[i + 1] == "<":
i += 1
v += 1
a[i] = v
else:
a[i + 1] = max(a[i + 1], v + 1)
break
def main():
S = input().rstrip()
N = len(S)
a = [0] * (N + 1)
if S[0] == "<":
right(N, S, a, 0)
if S[-1] == ">":
left(N, S, a, N - 1)
for i in range(N - 1):
if S[i:i + 2] == "><":
left(N, S, a, i)
right(N, S, a, i + 1)
ans = sum(a)
print(ans)
if __name__ == "__main__":
main()
| 55 | 57 | 977 | 1,047 |
import sys
input = sys.stdin.readline # NOQA
def left(T, S, a, i):
# ...>>><
j = 1
l = i
while 0 <= l:
if S[l] == ">" and a[l] < j:
a[l] = j
l -= 1
j += 1
else:
break
def right(T, S, a, i):
# ><<<...
j = 1
r = i
while r <= T - 1:
if S[r] == "<" and a[r + 1] < j:
a[r + 1] = j
r += 1
j += 1
else:
break
def main():
S = input().rstrip()
T = len(S)
N = T + 1
a = [-1] * N
if S[0] == "<":
a[0] = 0
right(T, S, a, 0)
for i in range(T - 1):
if S[i] == ">" and S[i + 1] == "<":
a[i + 1] = 0
left(T, S, a, i)
right(T, S, a, i + 1)
if S[T - 1] == ">":
a[N - 1] = 0
left(T, S, a, T - 1)
ans = sum(a)
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline
def left(N, S, a, i):
a[i + 1] = 0
v = 0
while True:
if i == 0:
a[i] = v + 1
break
if S[i - 1] == ">":
v += 1
a[i] = v
i -= 1
else:
a[i] = max(a[i], v + 1)
break
def right(N, S, a, i):
a[i] = 0
v = 0
while True:
if i == N - 1:
a[i + 1] = v + 1
break
if S[i + 1] == "<":
i += 1
v += 1
a[i] = v
else:
a[i + 1] = max(a[i + 1], v + 1)
break
def main():
S = input().rstrip()
N = len(S)
a = [0] * (N + 1)
if S[0] == "<":
right(N, S, a, 0)
if S[-1] == ">":
left(N, S, a, N - 1)
for i in range(N - 1):
if S[i : i + 2] == "><":
left(N, S, a, i)
right(N, S, a, i + 1)
ans = sum(a)
print(ans)
if __name__ == "__main__":
main()
| false | 3.508772 |
[
"-input = sys.stdin.readline # NOQA",
"+input = sys.stdin.readline",
"-def left(T, S, a, i):",
"- # ...>>><",
"- j = 1",
"- l = i",
"- while 0 <= l:",
"- if S[l] == \">\" and a[l] < j:",
"- a[l] = j",
"- l -= 1",
"- j += 1",
"+def left(N, S, a, i):",
"+ a[i + 1] = 0",
"+ v = 0",
"+ while True:",
"+ if i == 0:",
"+ a[i] = v + 1",
"+ break",
"+ if S[i - 1] == \">\":",
"+ v += 1",
"+ a[i] = v",
"+ i -= 1",
"+ a[i] = max(a[i], v + 1)",
"-def right(T, S, a, i):",
"- # ><<<...",
"- j = 1",
"- r = i",
"- while r <= T - 1:",
"- if S[r] == \"<\" and a[r + 1] < j:",
"- a[r + 1] = j",
"- r += 1",
"- j += 1",
"+def right(N, S, a, i):",
"+ a[i] = 0",
"+ v = 0",
"+ while True:",
"+ if i == N - 1:",
"+ a[i + 1] = v + 1",
"+ break",
"+ if S[i + 1] == \"<\":",
"+ i += 1",
"+ v += 1",
"+ a[i] = v",
"+ a[i + 1] = max(a[i + 1], v + 1)",
"- T = len(S)",
"- N = T + 1",
"- a = [-1] * N",
"+ N = len(S)",
"+ a = [0] * (N + 1)",
"- a[0] = 0",
"- right(T, S, a, 0)",
"- for i in range(T - 1):",
"- if S[i] == \">\" and S[i + 1] == \"<\":",
"- a[i + 1] = 0",
"- left(T, S, a, i)",
"- right(T, S, a, i + 1)",
"- if S[T - 1] == \">\":",
"- a[N - 1] = 0",
"- left(T, S, a, T - 1)",
"+ right(N, S, a, 0)",
"+ if S[-1] == \">\":",
"+ left(N, S, a, N - 1)",
"+ for i in range(N - 1):",
"+ if S[i : i + 2] == \"><\":",
"+ left(N, S, a, i)",
"+ right(N, S, a, i + 1)"
] | false | 0.042604 | 0.037186 | 1.145678 |
[
"s502644441",
"s721347218"
] |
u597374218
|
p02993
|
python
|
s498475555
|
s461081935
| 19 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 10.53 |
a,b,c,d=eval(input())
print(("Good" if a!=b!=c!=d else "Bad"))
|
S = eval(input())
print(("Good" if S[0] != S[1] != S[2] != S[3] else "Bad"))
| 2 | 2 | 55 | 69 |
a, b, c, d = eval(input())
print(("Good" if a != b != c != d else "Bad"))
|
S = eval(input())
print(("Good" if S[0] != S[1] != S[2] != S[3] else "Bad"))
| false | 0 |
[
"-a, b, c, d = eval(input())",
"-print((\"Good\" if a != b != c != d else \"Bad\"))",
"+S = eval(input())",
"+print((\"Good\" if S[0] != S[1] != S[2] != S[3] else \"Bad\"))"
] | false | 0.061752 | 0.088749 | 0.695807 |
[
"s498475555",
"s461081935"
] |
u906428167
|
p03176
|
python
|
s876418125
|
s515533649
| 890 | 686 | 119,548 | 119,444 |
Accepted
|
Accepted
| 22.92 |
def init(init_val):
for i in range(n):
MI[i+num-1] = init_val[i]
MA[i+num-1] = init_val[i]
for i in range(num-2, -1, -1):
MI[i] = min(MI[2*i+1], MI[2*i+2])
MA[i] = max(MA[2*i+1], MA[2*i+2])
def update(k, x):
k += num-1
MI[k] = x
MA[k] = x
while k+1:
k = (k-1)//2
MI[k] = min(MI[k*2+1], MI[k*2+2])
MA[k] = max(MA[k*2+1], MA[k*2+2])
def rangemin(p, q):
if q <= p:
return 1 << 100
p += num-1
q += num-2
res = 1 << 100
while q-p > 1:
if p & 1 == 0:
res = min(res, MI[p])
if q & 1 == 1:
res = min(res, MI[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = min(res, MI[p])
else:
res = min(min(res, MI[p]), MI[q])
return res
def rangemax(p, q):
if q <= p:
return -1
p += num-1
q += num-2
res = -1
while q-p > 1:
if p & 1 == 0:
res = max(res, MA[p])
if q & 1 == 1:
res = max(res, MA[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = max(res, MA[p])
else:
res = max(max(res, MA[p]), MA[q])
return res
n = int(eval(input()))
h = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dp = [0 for _ in range(n+1)]
num = 2**(n).bit_length()
MI = [1 << 100]*2*num
MA = [-1]*2*num
init(dp)
for i in range(n):
update(h[i], a[i] + rangemax(0, h[i]))
print((rangemax(0, n+1)))
|
class SegmentTree: # 0-indexed
def __init__(self, array, operation=min, identity=10**30):
self.identity = identity
self.n = len(array)
self.N = 1 << (self.n - 1).bit_length()
self.tree = [self.identity] * 2 * self.N
self.opr = operation
for i in range(self.n):
self.tree[i+self.N-1] = array[i]
for i in range(self.N-2, -1, -1):
self.tree[i] = self.opr(self.tree[2*i+1], self.tree[2*i+2])
def value(self, k):
return self.tree[k+self.N-1]
def update(self, k, x):
k += self.N-1
self.tree[k] = x
while k+1:
k = (k-1)//2
self.tree[k] = self.opr(self.tree[k*2+1], self.tree[k*2+2])
def query(self, p, q): # [p,q)
if q <= p:
print("Oops! That was no valid number. Try again...")
exit()
p += self.N-1
q += self.N-2
res = self.identity
while q-p > 1:
if p & 1 == 0:
res = self.opr(res, self.tree[p])
if q & 1 == 1:
res = self.opr(res, self.tree[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = self.opr(res, self.tree[p])
else:
res = self.opr(self.opr(res, self.tree[p]), self.tree[q])
return res
n = int(eval(input()))
h = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dp = [0 for _ in range(n+1)]
ST = SegmentTree(dp, max, -1)
for i in range(n):
ST.update(h[i], a[i] + ST.query(0, h[i]))
print((ST.query(0, n+1)))
| 76 | 56 | 1,587 | 1,658 |
def init(init_val):
for i in range(n):
MI[i + num - 1] = init_val[i]
MA[i + num - 1] = init_val[i]
for i in range(num - 2, -1, -1):
MI[i] = min(MI[2 * i + 1], MI[2 * i + 2])
MA[i] = max(MA[2 * i + 1], MA[2 * i + 2])
def update(k, x):
k += num - 1
MI[k] = x
MA[k] = x
while k + 1:
k = (k - 1) // 2
MI[k] = min(MI[k * 2 + 1], MI[k * 2 + 2])
MA[k] = max(MA[k * 2 + 1], MA[k * 2 + 2])
def rangemin(p, q):
if q <= p:
return 1 << 100
p += num - 1
q += num - 2
res = 1 << 100
while q - p > 1:
if p & 1 == 0:
res = min(res, MI[p])
if q & 1 == 1:
res = min(res, MI[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = min(res, MI[p])
else:
res = min(min(res, MI[p]), MI[q])
return res
def rangemax(p, q):
if q <= p:
return -1
p += num - 1
q += num - 2
res = -1
while q - p > 1:
if p & 1 == 0:
res = max(res, MA[p])
if q & 1 == 1:
res = max(res, MA[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = max(res, MA[p])
else:
res = max(max(res, MA[p]), MA[q])
return res
n = int(eval(input()))
h = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dp = [0 for _ in range(n + 1)]
num = 2 ** (n).bit_length()
MI = [1 << 100] * 2 * num
MA = [-1] * 2 * num
init(dp)
for i in range(n):
update(h[i], a[i] + rangemax(0, h[i]))
print((rangemax(0, n + 1)))
|
class SegmentTree: # 0-indexed
def __init__(self, array, operation=min, identity=10**30):
self.identity = identity
self.n = len(array)
self.N = 1 << (self.n - 1).bit_length()
self.tree = [self.identity] * 2 * self.N
self.opr = operation
for i in range(self.n):
self.tree[i + self.N - 1] = array[i]
for i in range(self.N - 2, -1, -1):
self.tree[i] = self.opr(self.tree[2 * i + 1], self.tree[2 * i + 2])
def value(self, k):
return self.tree[k + self.N - 1]
def update(self, k, x):
k += self.N - 1
self.tree[k] = x
while k + 1:
k = (k - 1) // 2
self.tree[k] = self.opr(self.tree[k * 2 + 1], self.tree[k * 2 + 2])
def query(self, p, q): # [p,q)
if q <= p:
print("Oops! That was no valid number. Try again...")
exit()
p += self.N - 1
q += self.N - 2
res = self.identity
while q - p > 1:
if p & 1 == 0:
res = self.opr(res, self.tree[p])
if q & 1 == 1:
res = self.opr(res, self.tree[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = self.opr(res, self.tree[p])
else:
res = self.opr(self.opr(res, self.tree[p]), self.tree[q])
return res
n = int(eval(input()))
h = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dp = [0 for _ in range(n + 1)]
ST = SegmentTree(dp, max, -1)
for i in range(n):
ST.update(h[i], a[i] + ST.query(0, h[i]))
print((ST.query(0, n + 1)))
| false | 26.315789 |
[
"-def init(init_val):",
"- for i in range(n):",
"- MI[i + num - 1] = init_val[i]",
"- MA[i + num - 1] = init_val[i]",
"- for i in range(num - 2, -1, -1):",
"- MI[i] = min(MI[2 * i + 1], MI[2 * i + 2])",
"- MA[i] = max(MA[2 * i + 1], MA[2 * i + 2])",
"+class SegmentTree: # 0-indexed",
"+ def __init__(self, array, operation=min, identity=10**30):",
"+ self.identity = identity",
"+ self.n = len(array)",
"+ self.N = 1 << (self.n - 1).bit_length()",
"+ self.tree = [self.identity] * 2 * self.N",
"+ self.opr = operation",
"+ for i in range(self.n):",
"+ self.tree[i + self.N - 1] = array[i]",
"+ for i in range(self.N - 2, -1, -1):",
"+ self.tree[i] = self.opr(self.tree[2 * i + 1], self.tree[2 * i + 2])",
"+ def value(self, k):",
"+ return self.tree[k + self.N - 1]",
"-def update(k, x):",
"- k += num - 1",
"- MI[k] = x",
"- MA[k] = x",
"- while k + 1:",
"- k = (k - 1) // 2",
"- MI[k] = min(MI[k * 2 + 1], MI[k * 2 + 2])",
"- MA[k] = max(MA[k * 2 + 1], MA[k * 2 + 2])",
"+ def update(self, k, x):",
"+ k += self.N - 1",
"+ self.tree[k] = x",
"+ while k + 1:",
"+ k = (k - 1) // 2",
"+ self.tree[k] = self.opr(self.tree[k * 2 + 1], self.tree[k * 2 + 2])",
"-",
"-def rangemin(p, q):",
"- if q <= p:",
"- return 1 << 100",
"- p += num - 1",
"- q += num - 2",
"- res = 1 << 100",
"- while q - p > 1:",
"- if p & 1 == 0:",
"- res = min(res, MI[p])",
"- if q & 1 == 1:",
"- res = min(res, MI[q])",
"- q -= 1",
"- p = p // 2",
"- q = (q - 1) // 2",
"- if p == q:",
"- res = min(res, MI[p])",
"- else:",
"- res = min(min(res, MI[p]), MI[q])",
"- return res",
"-",
"-",
"-def rangemax(p, q):",
"- if q <= p:",
"- return -1",
"- p += num - 1",
"- q += num - 2",
"- res = -1",
"- while q - p > 1:",
"- if p & 1 == 0:",
"- res = max(res, MA[p])",
"- if q & 1 == 1:",
"- res = max(res, MA[q])",
"- q -= 1",
"- p = p // 2",
"- q = (q - 1) // 2",
"- if p == q:",
"- res = max(res, MA[p])",
"- else:",
"- res = max(max(res, MA[p]), MA[q])",
"- return res",
"+ def query(self, p, q): # [p,q)",
"+ if q <= p:",
"+ print(\"Oops! That was no valid number. Try again...\")",
"+ exit()",
"+ p += self.N - 1",
"+ q += self.N - 2",
"+ res = self.identity",
"+ while q - p > 1:",
"+ if p & 1 == 0:",
"+ res = self.opr(res, self.tree[p])",
"+ if q & 1 == 1:",
"+ res = self.opr(res, self.tree[q])",
"+ q -= 1",
"+ p = p // 2",
"+ q = (q - 1) // 2",
"+ if p == q:",
"+ res = self.opr(res, self.tree[p])",
"+ else:",
"+ res = self.opr(self.opr(res, self.tree[p]), self.tree[q])",
"+ return res",
"-num = 2 ** (n).bit_length()",
"-MI = [1 << 100] * 2 * num",
"-MA = [-1] * 2 * num",
"-init(dp)",
"+ST = SegmentTree(dp, max, -1)",
"- update(h[i], a[i] + rangemax(0, h[i]))",
"-print((rangemax(0, n + 1)))",
"+ ST.update(h[i], a[i] + ST.query(0, h[i]))",
"+print((ST.query(0, n + 1)))"
] | false | 0.048507 | 0.048262 | 1.005081 |
[
"s876418125",
"s515533649"
] |
u309120194
|
p03495
|
python
|
s804105342
|
s862388204
| 175 | 124 | 42,820 | 44,392 |
Accepted
|
Accepted
| 29.14 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# N=O(10^5)なので、O(N)で解く
# ABC-155-C-Poll の類題
# 各数字の出現回数を数える
dic = {}
for i in range(N):
a = A[i]
if a not in dic: dic[a] = 1
else: dic[a] += 1
# dicを昇順にソート
dic = sorted(list(dic.items()), key=lambda x:x[1])
# dicは [(5, 1), (3, 2), (2, 2), (4, 2), (1, 3)] のようになっている
# dicのvalueにおいて、前からlen(dic)-K個の和を取る
ans = 0
for i in range(max(len(dic)-K, 0)):
ans += dic[i][1]
print(ans)
|
from collections import Counter
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# N=O(10^5)なので、O(N)で解く
# ABC-155-C-Poll の類題
# 方針：各数字の出現回数を数える
# Counter(リスト) は辞書型のサブクラスであり、キーに要素・値に出現回数という形式
# Counter(リスト).most_common() は(要素, 出現回数)というタプルを出現回数順に並べたリスト
A = Counter(A).most_common()
# 出現回数の大きい方からK個はそのままにしておく(=変えない個数）
# 変える個数は、N-(変えない個数)
s = 0
for i in range(min(K, len(A))):
s += A[i][1]
print((N-s))
| 23 | 20 | 471 | 443 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# N=O(10^5)なので、O(N)で解く
# ABC-155-C-Poll の類題
# 各数字の出現回数を数える
dic = {}
for i in range(N):
a = A[i]
if a not in dic:
dic[a] = 1
else:
dic[a] += 1
# dicを昇順にソート
dic = sorted(list(dic.items()), key=lambda x: x[1])
# dicは [(5, 1), (3, 2), (2, 2), (4, 2), (1, 3)] のようになっている
# dicのvalueにおいて、前からlen(dic)-K個の和を取る
ans = 0
for i in range(max(len(dic) - K, 0)):
ans += dic[i][1]
print(ans)
|
from collections import Counter
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
# N=O(10^5)なので、O(N)で解く
# ABC-155-C-Poll の類題
# 方針：各数字の出現回数を数える
# Counter(リスト) は辞書型のサブクラスであり、キーに要素・値に出現回数という形式
# Counter(リスト).most_common() は(要素, 出現回数)というタプルを出現回数順に並べたリスト
A = Counter(A).most_common()
# 出現回数の大きい方からK個はそのままにしておく(=変えない個数）
# 変える個数は、N-(変えない個数)
s = 0
for i in range(min(K, len(A))):
s += A[i][1]
print((N - s))
| false | 13.043478 |
[
"+from collections import Counter",
"+",
"-# 各数字の出現回数を数える",
"-dic = {}",
"-for i in range(N):",
"- a = A[i]",
"- if a not in dic:",
"- dic[a] = 1",
"- else:",
"- dic[a] += 1",
"-# dicを昇順にソート",
"-dic = sorted(list(dic.items()), key=lambda x: x[1])",
"-# dicは [(5, 1), (3, 2), (2, 2), (4, 2), (1, 3)] のようになっている",
"-# dicのvalueにおいて、前からlen(dic)-K個の和を取る",
"-ans = 0",
"-for i in range(max(len(dic) - K, 0)):",
"- ans += dic[i][1]",
"-print(ans)",
"+# 方針：各数字の出現回数を数える",
"+# Counter(リスト) は辞書型のサブクラスであり、キーに要素・値に出現回数という形式",
"+# Counter(リスト).most_common() は(要素, 出現回数)というタプルを出現回数順に並べたリスト",
"+A = Counter(A).most_common()",
"+# 出現回数の大きい方からK個はそのままにしておく(=変えない個数）",
"+# 変える個数は、N-(変えない個数)",
"+s = 0",
"+for i in range(min(K, len(A))):",
"+ s += A[i][1]",
"+print((N - s))"
] | false | 0.042194 | 0.039532 | 1.06734 |
[
"s804105342",
"s862388204"
] |
u923662841
|
p03212
|
python
|
s487885786
|
s559539001
| 78 | 55 | 9,156 | 12,564 |
Accepted
|
Accepted
| 29.49 |
import itertools
N = eval(input())
keta = len(N)
s = 0
for i in range(3,keta+1):
a = itertools.product([3,5,7],repeat=i)
for j in a:
if 3 in j and 5 in j and 7 in j:
if int("".join(map(str,j)))<= int(N):
s +=1
print(s)
|
import itertools
N=int(eval(input()))
ans=0
S=[]
for i in range(10):
S+=list(itertools.product("357",repeat=i))
for s in S:
if len(set(s))>2 and int("".join(s))<=N:
ans+=1
print(ans)
| 11 | 10 | 266 | 201 |
import itertools
N = eval(input())
keta = len(N)
s = 0
for i in range(3, keta + 1):
a = itertools.product([3, 5, 7], repeat=i)
for j in a:
if 3 in j and 5 in j and 7 in j:
if int("".join(map(str, j))) <= int(N):
s += 1
print(s)
|
import itertools
N = int(eval(input()))
ans = 0
S = []
for i in range(10):
S += list(itertools.product("357", repeat=i))
for s in S:
if len(set(s)) > 2 and int("".join(s)) <= N:
ans += 1
print(ans)
| false | 9.090909 |
[
"-N = eval(input())",
"-keta = len(N)",
"-s = 0",
"-for i in range(3, keta + 1):",
"- a = itertools.product([3, 5, 7], repeat=i)",
"- for j in a:",
"- if 3 in j and 5 in j and 7 in j:",
"- if int(\"\".join(map(str, j))) <= int(N):",
"- s += 1",
"-print(s)",
"+N = int(eval(input()))",
"+ans = 0",
"+S = []",
"+for i in range(10):",
"+ S += list(itertools.product(\"357\", repeat=i))",
"+for s in S:",
"+ if len(set(s)) > 2 and int(\"\".join(s)) <= N:",
"+ ans += 1",
"+print(ans)"
] | false | 0.037033 | 0.200784 | 0.18444 |
[
"s487885786",
"s559539001"
] |
u057109575
|
p03805
|
python
|
s367247548
|
s112983310
| 205 | 27 | 42,972 | 3,064 |
Accepted
|
Accepted
| 86.83 |
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[None] * N for _ in range(N)]
for u, v in edges:
graph[u - 1][v - 1] = True
graph[v - 1][u - 1] = True
def dfs(s):
if all(visited):
return 1
cnt = 0
for i in range(N):
if graph[s][i] is None:
continue
if visited[i]:
continue
visited[i] = True
cnt += dfs(i)
visited[i] = False
return cnt
visited = [False] * N
visited[0] = True
print((dfs(0)))
|
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[0] * N for _ in range(N)]
for u, v in edges:
graph[u - 1][v - 1] = 1
graph[v - 1][u - 1] = 1
visited = [False] * N
visited[0] = True
def dfs(s):
if all(visited):
return 1
cnt = 0
for i in range(N):
if visited[i] or graph[s][i] != 1:
continue
visited[i] = True
cnt += dfs(i)
visited[i] = False
return cnt
print((dfs(0)))
| 30 | 27 | 600 | 553 |
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[None] * N for _ in range(N)]
for u, v in edges:
graph[u - 1][v - 1] = True
graph[v - 1][u - 1] = True
def dfs(s):
if all(visited):
return 1
cnt = 0
for i in range(N):
if graph[s][i] is None:
continue
if visited[i]:
continue
visited[i] = True
cnt += dfs(i)
visited[i] = False
return cnt
visited = [False] * N
visited[0] = True
print((dfs(0)))
|
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[0] * N for _ in range(N)]
for u, v in edges:
graph[u - 1][v - 1] = 1
graph[v - 1][u - 1] = 1
visited = [False] * N
visited[0] = True
def dfs(s):
if all(visited):
return 1
cnt = 0
for i in range(N):
if visited[i] or graph[s][i] != 1:
continue
visited[i] = True
cnt += dfs(i)
visited[i] = False
return cnt
print((dfs(0)))
| false | 10 |
[
"-graph = [[None] * N for _ in range(N)]",
"+graph = [[0] * N for _ in range(N)]",
"- graph[u - 1][v - 1] = True",
"- graph[v - 1][u - 1] = True",
"+ graph[u - 1][v - 1] = 1",
"+ graph[v - 1][u - 1] = 1",
"+visited = [False] * N",
"+visited[0] = True",
"- if graph[s][i] is None:",
"- continue",
"- if visited[i]:",
"+ if visited[i] or graph[s][i] != 1:",
"-visited = [False] * N",
"-visited[0] = True"
] | false | 0.078443 | 0.03858 | 2.033272 |
[
"s367247548",
"s112983310"
] |
u225388820
|
p02558
|
python
|
s409457525
|
s534122398
| 281 | 257 | 89,344 | 87,912 |
Accepted
|
Accepted
| 8.54 |
import typing
class DSU:
'''
Implement (union by size) + (path compression)
Reference:
Zvi Galil and Giuseppe F. Italiano,
Data structures and algorithms for disjoint set union problems
'''
def __init__(self, n: int = 0):
self._n = n
self.parent_or_size = [-1] * n
def merge(self, a: int, b: int) -> int:
assert 0 <= a < self._n
assert 0 <= b < self._n
x = self.leader(a)
y = self.leader(b)
if x == y:
return x
if -self.parent_or_size[x] < -self.parent_or_size[y]:
x, y = y, x
self.parent_or_size[x] += self.parent_or_size[y]
self.parent_or_size[y] = x
return x
def same(self, a: int, b: int) -> bool:
assert 0 <= a < self._n
assert 0 <= b < self._n
return self.leader(a) == self.leader(b)
def leader(self, a: int) -> int:
assert 0 <= a < self._n
update_list = []
while self.parent_or_size[a] >= 0:
update_list.append(a)
a = self.parent_or_size[a]
for i in update_list:
self.parent_or_size[i] = a
return a
def size(self, a: int) -> int:
assert 0 <= a < self._n
return -self.parent_or_size[self.leader(a)]
def groups(self) -> typing.List[typing.List[int]]:
leader_buf = [self.leader(i) for i in range(self._n)]
result = [[] for _ in range(self._n)]
for i in range(self._n):
result[leader_buf[i]].append(i)
return list([r for r in result if r])
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = DSU(n)
res = []
for i in range(q):
t, u, v = list(map(int, input().split()))
if t:
res.append(int(uf.same(u, v)))
else:
uf.merge(u, v)
print(("\n".join(map(str, res))))
|
import typing
class DSU:
'''
Implement (union by size) + (path compression)
Reference:
Zvi Galil and Giuseppe F. Italiano,
Data structures and algorithms for disjoint set union problems
'''
def __init__(self, n: int = 0):
self._n = n
self.parent_or_size = [-1] * n
def merge(self, a: int, b: int) -> int:
assert 0 <= a < self._n
assert 0 <= b < self._n
x = self.leader(a)
y = self.leader(b)
if x == y:
return x
if -self.parent_or_size[x] < -self.parent_or_size[y]:
x, y = y, x
self.parent_or_size[x] += self.parent_or_size[y]
self.parent_or_size[y] = x
return x
def same(self, a: int, b: int) -> bool:
assert 0 <= a < self._n
assert 0 <= b < self._n
return self.leader(a) == self.leader(b)
def leader(self, a: int) -> int:
assert 0 <= a < self._n
r = a
while self.parent_or_size[r] >= 0:
r = self.parent_or_size[r]
while self.parent_or_size[a] >= 0:
self.parent_or_size[a], a = r, self.parent_or_size[a]
return r
def size(self, a: int) -> int:
assert 0 <= a < self._n
return -self.parent_or_size[self.leader(a)]
def groups(self) -> typing.List[typing.List[int]]:
leader_buf = [self.leader(i) for i in range(self._n)]
result = [[] for _ in range(self._n)]
for i in range(self._n):
result[leader_buf[i]].append(i)
return list([r for r in result if r])
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = DSU(n)
res = []
for i in range(q):
t, u, v = list(map(int, input().split()))
if t:
res.append(int(uf.same(u, v)))
else:
uf.merge(u, v)
print(("\n".join(map(str, res))))
| 79 | 78 | 1,931 | 1,925 |
import typing
class DSU:
"""
Implement (union by size) + (path compression)
Reference:
Zvi Galil and Giuseppe F. Italiano,
Data structures and algorithms for disjoint set union problems
"""
def __init__(self, n: int = 0):
self._n = n
self.parent_or_size = [-1] * n
def merge(self, a: int, b: int) -> int:
assert 0 <= a < self._n
assert 0 <= b < self._n
x = self.leader(a)
y = self.leader(b)
if x == y:
return x
if -self.parent_or_size[x] < -self.parent_or_size[y]:
x, y = y, x
self.parent_or_size[x] += self.parent_or_size[y]
self.parent_or_size[y] = x
return x
def same(self, a: int, b: int) -> bool:
assert 0 <= a < self._n
assert 0 <= b < self._n
return self.leader(a) == self.leader(b)
def leader(self, a: int) -> int:
assert 0 <= a < self._n
update_list = []
while self.parent_or_size[a] >= 0:
update_list.append(a)
a = self.parent_or_size[a]
for i in update_list:
self.parent_or_size[i] = a
return a
def size(self, a: int) -> int:
assert 0 <= a < self._n
return -self.parent_or_size[self.leader(a)]
def groups(self) -> typing.List[typing.List[int]]:
leader_buf = [self.leader(i) for i in range(self._n)]
result = [[] for _ in range(self._n)]
for i in range(self._n):
result[leader_buf[i]].append(i)
return list([r for r in result if r])
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = DSU(n)
res = []
for i in range(q):
t, u, v = list(map(int, input().split()))
if t:
res.append(int(uf.same(u, v)))
else:
uf.merge(u, v)
print(("\n".join(map(str, res))))
|
import typing
class DSU:
"""
Implement (union by size) + (path compression)
Reference:
Zvi Galil and Giuseppe F. Italiano,
Data structures and algorithms for disjoint set union problems
"""
def __init__(self, n: int = 0):
self._n = n
self.parent_or_size = [-1] * n
def merge(self, a: int, b: int) -> int:
assert 0 <= a < self._n
assert 0 <= b < self._n
x = self.leader(a)
y = self.leader(b)
if x == y:
return x
if -self.parent_or_size[x] < -self.parent_or_size[y]:
x, y = y, x
self.parent_or_size[x] += self.parent_or_size[y]
self.parent_or_size[y] = x
return x
def same(self, a: int, b: int) -> bool:
assert 0 <= a < self._n
assert 0 <= b < self._n
return self.leader(a) == self.leader(b)
def leader(self, a: int) -> int:
assert 0 <= a < self._n
r = a
while self.parent_or_size[r] >= 0:
r = self.parent_or_size[r]
while self.parent_or_size[a] >= 0:
self.parent_or_size[a], a = r, self.parent_or_size[a]
return r
def size(self, a: int) -> int:
assert 0 <= a < self._n
return -self.parent_or_size[self.leader(a)]
def groups(self) -> typing.List[typing.List[int]]:
leader_buf = [self.leader(i) for i in range(self._n)]
result = [[] for _ in range(self._n)]
for i in range(self._n):
result[leader_buf[i]].append(i)
return list([r for r in result if r])
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = DSU(n)
res = []
for i in range(q):
t, u, v = list(map(int, input().split()))
if t:
res.append(int(uf.same(u, v)))
else:
uf.merge(u, v)
print(("\n".join(map(str, res))))
| false | 1.265823 |
[
"- update_list = []",
"+ r = a",
"+ while self.parent_or_size[r] >= 0:",
"+ r = self.parent_or_size[r]",
"- update_list.append(a)",
"- a = self.parent_or_size[a]",
"- for i in update_list:",
"- self.parent_or_size[i] = a",
"- return a",
"+ self.parent_or_size[a], a = r, self.parent_or_size[a]",
"+ return r"
] | false | 0.067974 | 0.04262 | 1.594868 |
[
"s409457525",
"s534122398"
] |
u912237403
|
p00108
|
python
|
s241894784
|
s748860344
| 30 | 20 | 4,204 | 4,200 |
Accepted
|
Accepted
| 33.33 |
while eval(input())!=0:
a=list(map(int,input().split()))
c=0
while 1:
b=[a.count(e) for e in a]
if a==b: break
else: a=b; c+=1
print(c)
for e in a: print(e, end=' ')
print()
|
while eval(input())!=0:
a=list(map(int,input().split()))
c=0
while 1:
b=[a.count(e) for e in a]
if a==b: break
else: a=b; c+=1
print(c)
print(" ".join(map(str,a)))
| 10 | 9 | 186 | 183 |
while eval(input()) != 0:
a = list(map(int, input().split()))
c = 0
while 1:
b = [a.count(e) for e in a]
if a == b:
break
else:
a = b
c += 1
print(c)
for e in a:
print(e, end=" ")
print()
|
while eval(input()) != 0:
a = list(map(int, input().split()))
c = 0
while 1:
b = [a.count(e) for e in a]
if a == b:
break
else:
a = b
c += 1
print(c)
print(" ".join(map(str, a)))
| false | 10 |
[
"- for e in a:",
"- print(e, end=\" \")",
"- print()",
"+ print(\" \".join(map(str, a)))"
] | false | 0.049256 | 0.070096 | 0.702686 |
[
"s241894784",
"s748860344"
] |
u072717685
|
p02773
|
python
|
s090812317
|
s574626321
| 1,118 | 239 | 121,424 | 52,832 |
Accepted
|
Accepted
| 78.62 |
from collections import Counter
def main():
n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
s_c = Counter(s)
s_c_l = [c for c in list(s_c.items())]
m = max([c[1] for c in s_c_l])
s_c_l_max = [c[0] for c in s_c_l if c[1] == m]
s_c_l_max_s = set(s_c_l_max)
s_c_l_max_s = sorted(s_c_l_max_s)
for ch in s_c_l_max_s:
print(ch)
main()
|
import sys
read = sys.stdin.read
from collections import Counter
def main():
n, *s = read().split()
n = int(n)
sc = Counter(s)
scm = sc.most_common()
maxnum = scm[0][1]
r = []
for scme in scm:
if scme[1] == maxnum:
r.append(scme[0])
else:
break
r.sort()
print(*r, sep="\n")
if __name__ == '__main__':
main()
| 14 | 20 | 361 | 407 |
from collections import Counter
def main():
n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
s_c = Counter(s)
s_c_l = [c for c in list(s_c.items())]
m = max([c[1] for c in s_c_l])
s_c_l_max = [c[0] for c in s_c_l if c[1] == m]
s_c_l_max_s = set(s_c_l_max)
s_c_l_max_s = sorted(s_c_l_max_s)
for ch in s_c_l_max_s:
print(ch)
main()
|
import sys
read = sys.stdin.read
from collections import Counter
def main():
n, *s = read().split()
n = int(n)
sc = Counter(s)
scm = sc.most_common()
maxnum = scm[0][1]
r = []
for scme in scm:
if scme[1] == maxnum:
r.append(scme[0])
else:
break
r.sort()
print(*r, sep="\n")
if __name__ == "__main__":
main()
| false | 30 |
[
"+import sys",
"+",
"+read = sys.stdin.read",
"- n = int(eval(input()))",
"- s = [eval(input()) for _ in range(n)]",
"- s_c = Counter(s)",
"- s_c_l = [c for c in list(s_c.items())]",
"- m = max([c[1] for c in s_c_l])",
"- s_c_l_max = [c[0] for c in s_c_l if c[1] == m]",
"- s_c_l_max_s = set(s_c_l_max)",
"- s_c_l_max_s = sorted(s_c_l_max_s)",
"- for ch in s_c_l_max_s:",
"- print(ch)",
"+ n, *s = read().split()",
"+ n = int(n)",
"+ sc = Counter(s)",
"+ scm = sc.most_common()",
"+ maxnum = scm[0][1]",
"+ r = []",
"+ for scme in scm:",
"+ if scme[1] == maxnum:",
"+ r.append(scme[0])",
"+ else:",
"+ break",
"+ r.sort()",
"+ print(*r, sep=\"\\n\")",
"-main()",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.036624 | 0.040163 | 0.911885 |
[
"s090812317",
"s574626321"
] |
u624475441
|
p03292
|
python
|
s908438905
|
s229311938
| 19 | 17 | 3,060 | 2,940 |
Accepted
|
Accepted
| 10.53 |
f=lambda x,y,z:abs(y-x)+abs(z-y)
a,b,c=list(map(int,input().split()))
print((min(f(a,b,c),f(a,c,b),f(b,a,c),f(b,c,a),f(c,a,b),f(c,b,a))))
|
m,_,M=sorted(map(int,input().split()))
print((M-m))
| 3 | 2 | 131 | 50 |
f = lambda x, y, z: abs(y - x) + abs(z - y)
a, b, c = list(map(int, input().split()))
print((min(f(a, b, c), f(a, c, b), f(b, a, c), f(b, c, a), f(c, a, b), f(c, b, a))))
|
m, _, M = sorted(map(int, input().split()))
print((M - m))
| false | 33.333333 |
[
"-f = lambda x, y, z: abs(y - x) + abs(z - y)",
"-a, b, c = list(map(int, input().split()))",
"-print((min(f(a, b, c), f(a, c, b), f(b, a, c), f(b, c, a), f(c, a, b), f(c, b, a))))",
"+m, _, M = sorted(map(int, input().split()))",
"+print((M - m))"
] | false | 0.070718 | 0.051021 | 1.386066 |
[
"s908438905",
"s229311938"
] |
u188827677
|
p02983
|
python
|
s201519289
|
s975080538
| 829 | 518 | 3,060 | 2,940 |
Accepted
|
Accepted
| 37.52 |
l,r = list(map(int, input().split()))
if r-l >= 2019:
print((0))
exit()
ans = float('inf')
for i in range(l, r):
for j in range(i+1, r+1):
t = i*j%2019
ans = min(ans,t)
print(ans)
|
l,r = list(map(int, input().split()))
if r-l >= 2019:
print((0))
exit()
ans = float('inf')
for i in range(l, r):
for j in range(i+1, r+1):
t = i*j%2019
if t < ans: ans = t
print(ans)
| 12 | 12 | 196 | 199 |
l, r = list(map(int, input().split()))
if r - l >= 2019:
print((0))
exit()
ans = float("inf")
for i in range(l, r):
for j in range(i + 1, r + 1):
t = i * j % 2019
ans = min(ans, t)
print(ans)
|
l, r = list(map(int, input().split()))
if r - l >= 2019:
print((0))
exit()
ans = float("inf")
for i in range(l, r):
for j in range(i + 1, r + 1):
t = i * j % 2019
if t < ans:
ans = t
print(ans)
| false | 0 |
[
"- ans = min(ans, t)",
"+ if t < ans:",
"+ ans = t"
] | false | 0.059767 | 0.134497 | 0.444376 |
[
"s201519289",
"s975080538"
] |
u280978334
|
p03061
|
python
|
s767850508
|
s863387547
| 1,237 | 206 | 14,400 | 16,116 |
Accepted
|
Accepted
| 83.35 |
n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
def find(inte):
re = []
for i in range(1,int(inte**0.5)+1):
if inte%i==0:
re.append(i)
if i != inte/i:
re.append(int(inte/i))
return set(re)
if n==2:
print((A[1]))
else:
a1 = find(A[0])
a2 = find(A[1])
a3 = find(A[2])
t1 = a1 & a2
t2 = a2 & a3
t3 = a1 & a3
cond = t1 | t2 |t3
maxi = 0
for con in cond:
count = 0
flag = True
for a in A:
if a%con != 0:
count +=1
if count >= 2:
flag = False
break
if flag and maxi < con:
maxi = con
print(maxi)
|
from fractions import gcd
n = int(eval(input()))
A = list(map(int,input().split()))
left = [0]*(n+1)
right = [0]*(n+2)
for a,aa,i in zip(A,A[::-1],list(range(1,n+1))):
left[i] = gcd(a,left[i-1])
right[n+1-i] = gcd(aa,right[n-i+2])
ans = 1
for i in range(1,n+1):
if i ==1:
if ans < right[i+1]:
ans = right[i+1]
elif i == n:
if ans < left[i-1]:
ans = left[i-1]
else:
if ans < gcd(left[i-1],right[i+1]):
ans = gcd(left[i-1],right[i+1])
print(ans)
| 35 | 22 | 771 | 538 |
n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
def find(inte):
re = []
for i in range(1, int(inte**0.5) + 1):
if inte % i == 0:
re.append(i)
if i != inte / i:
re.append(int(inte / i))
return set(re)
if n == 2:
print((A[1]))
else:
a1 = find(A[0])
a2 = find(A[1])
a3 = find(A[2])
t1 = a1 & a2
t2 = a2 & a3
t3 = a1 & a3
cond = t1 | t2 | t3
maxi = 0
for con in cond:
count = 0
flag = True
for a in A:
if a % con != 0:
count += 1
if count >= 2:
flag = False
break
if flag and maxi < con:
maxi = con
print(maxi)
|
from fractions import gcd
n = int(eval(input()))
A = list(map(int, input().split()))
left = [0] * (n + 1)
right = [0] * (n + 2)
for a, aa, i in zip(A, A[::-1], list(range(1, n + 1))):
left[i] = gcd(a, left[i - 1])
right[n + 1 - i] = gcd(aa, right[n - i + 2])
ans = 1
for i in range(1, n + 1):
if i == 1:
if ans < right[i + 1]:
ans = right[i + 1]
elif i == n:
if ans < left[i - 1]:
ans = left[i - 1]
else:
if ans < gcd(left[i - 1], right[i + 1]):
ans = gcd(left[i - 1], right[i + 1])
print(ans)
| false | 37.142857 |
[
"+from fractions import gcd",
"+",
"-A.sort()",
"-",
"-",
"-def find(inte):",
"- re = []",
"- for i in range(1, int(inte**0.5) + 1):",
"- if inte % i == 0:",
"- re.append(i)",
"- if i != inte / i:",
"- re.append(int(inte / i))",
"- return set(re)",
"-",
"-",
"-if n == 2:",
"- print((A[1]))",
"-else:",
"- a1 = find(A[0])",
"- a2 = find(A[1])",
"- a3 = find(A[2])",
"- t1 = a1 & a2",
"- t2 = a2 & a3",
"- t3 = a1 & a3",
"- cond = t1 | t2 | t3",
"- maxi = 0",
"- for con in cond:",
"- count = 0",
"- flag = True",
"- for a in A:",
"- if a % con != 0:",
"- count += 1",
"- if count >= 2:",
"- flag = False",
"- break",
"- if flag and maxi < con:",
"- maxi = con",
"- print(maxi)",
"+left = [0] * (n + 1)",
"+right = [0] * (n + 2)",
"+for a, aa, i in zip(A, A[::-1], list(range(1, n + 1))):",
"+ left[i] = gcd(a, left[i - 1])",
"+ right[n + 1 - i] = gcd(aa, right[n - i + 2])",
"+ans = 1",
"+for i in range(1, n + 1):",
"+ if i == 1:",
"+ if ans < right[i + 1]:",
"+ ans = right[i + 1]",
"+ elif i == n:",
"+ if ans < left[i - 1]:",
"+ ans = left[i - 1]",
"+ else:",
"+ if ans < gcd(left[i - 1], right[i + 1]):",
"+ ans = gcd(left[i - 1], right[i + 1])",
"+print(ans)"
] | false | 0.068207 | 0.05836 | 1.168731 |
[
"s767850508",
"s863387547"
] |
u214617707
|
p03599
|
python
|
s907728601
|
s504043902
| 391 | 228 | 3,064 | 3,064 |
Accepted
|
Accepted
| 41.69 |
a, b, c, d, e, f = list(map(int, input().split()))
rec = (0, 0)
ma = 0
for i in range(31):
for j in range(31):
for k in range(100):
t = i * a * 100 + j * b * 100 + c * k
if t > f:
break
for l in range(100):
s = i * a * 100 + j * b * 100 + c * k + d * l
if s > f:
break
if c * k + d * l > (a * i + b * j) * e:
break
if (i * a + j * b + c * k + d * l) == 0:
continue
q = (c * k + d * l) / (100 * i * a + 100 * j * b + c * k + d * l) * 100
if q >= ma:
ma = q
rec = (s, c * k + d * l)
print((rec[0], rec[1]))
|
A, B, C, D, E, F = list(map(int, input().split()))
num = (0, 0)
rec = 0
for a in range(101):
for b in range(101):
if a * A * 100 + b * B * 100 > F:
break
for c in range(100):
if a * A * 100 + b * B * 100 + c * C > F:
break
for d in range(100):
q = a * A * 100 + b * B * 100
p = C * c + D * d
if p > E * (a * A + b * B):
continue
if p + q == 0:
continue
if p + q <= F:
if rec <= 100 * p / (p + q):
rec = 100 * p / (p + q)
num = (p + q, p)
else:
break
print((num[0], num[1]))
| 23 | 25 | 779 | 786 |
a, b, c, d, e, f = list(map(int, input().split()))
rec = (0, 0)
ma = 0
for i in range(31):
for j in range(31):
for k in range(100):
t = i * a * 100 + j * b * 100 + c * k
if t > f:
break
for l in range(100):
s = i * a * 100 + j * b * 100 + c * k + d * l
if s > f:
break
if c * k + d * l > (a * i + b * j) * e:
break
if (i * a + j * b + c * k + d * l) == 0:
continue
q = (c * k + d * l) / (100 * i * a + 100 * j * b + c * k + d * l) * 100
if q >= ma:
ma = q
rec = (s, c * k + d * l)
print((rec[0], rec[1]))
|
A, B, C, D, E, F = list(map(int, input().split()))
num = (0, 0)
rec = 0
for a in range(101):
for b in range(101):
if a * A * 100 + b * B * 100 > F:
break
for c in range(100):
if a * A * 100 + b * B * 100 + c * C > F:
break
for d in range(100):
q = a * A * 100 + b * B * 100
p = C * c + D * d
if p > E * (a * A + b * B):
continue
if p + q == 0:
continue
if p + q <= F:
if rec <= 100 * p / (p + q):
rec = 100 * p / (p + q)
num = (p + q, p)
else:
break
print((num[0], num[1]))
| false | 8 |
[
"-a, b, c, d, e, f = list(map(int, input().split()))",
"-rec = (0, 0)",
"-ma = 0",
"-for i in range(31):",
"- for j in range(31):",
"- for k in range(100):",
"- t = i * a * 100 + j * b * 100 + c * k",
"- if t > f:",
"+A, B, C, D, E, F = list(map(int, input().split()))",
"+num = (0, 0)",
"+rec = 0",
"+for a in range(101):",
"+ for b in range(101):",
"+ if a * A * 100 + b * B * 100 > F:",
"+ break",
"+ for c in range(100):",
"+ if a * A * 100 + b * B * 100 + c * C > F:",
"- for l in range(100):",
"- s = i * a * 100 + j * b * 100 + c * k + d * l",
"- if s > f:",
"+ for d in range(100):",
"+ q = a * A * 100 + b * B * 100",
"+ p = C * c + D * d",
"+ if p > E * (a * A + b * B):",
"+ continue",
"+ if p + q == 0:",
"+ continue",
"+ if p + q <= F:",
"+ if rec <= 100 * p / (p + q):",
"+ rec = 100 * p / (p + q)",
"+ num = (p + q, p)",
"+ else:",
"- if c * k + d * l > (a * i + b * j) * e:",
"- break",
"- if (i * a + j * b + c * k + d * l) == 0:",
"- continue",
"- q = (c * k + d * l) / (100 * i * a + 100 * j * b + c * k + d * l) * 100",
"- if q >= ma:",
"- ma = q",
"- rec = (s, c * k + d * l)",
"-print((rec[0], rec[1]))",
"+print((num[0], num[1]))"
] | false | 0.087868 | 0.202725 | 0.433432 |
[
"s907728601",
"s504043902"
] |
u073852194
|
p03163
|
python
|
s067947088
|
s591415639
| 505 | 450 | 120,172 | 218,844 |
Accepted
|
Accepted
| 10.89 |
n,w = list(map(int,input().split()))
item = [list(map(int,input().split())) for i in range(n)]
dp = [[0]*(w+1) for i in range(n+1)]
for i in range(1,n+1):
for j in range(1,w+1):
if item[i-1][0] <= j:
dp[i][j] = max(dp[i-1][j-item[i-1][0]]+item[i-1][1],dp[i-1][j])
else:
dp[i][j] = dp[i-1][j]
print((dp[n][w]))
|
N, W = list(map(int, input().split()))
dp = [[0 for i in range(W + 1)] for j in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((max(dp[N])))
| 12 | 13 | 337 | 349 |
n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * (w + 1) for i in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, w + 1):
if item[i - 1][0] <= j:
dp[i][j] = max(dp[i - 1][j - item[i - 1][0]] + item[i - 1][1], dp[i - 1][j])
else:
dp[i][j] = dp[i - 1][j]
print((dp[n][w]))
|
N, W = list(map(int, input().split()))
dp = [[0 for i in range(W + 1)] for j in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((max(dp[N])))
| false | 7.692308 |
[
"-n, w = list(map(int, input().split()))",
"-item = [list(map(int, input().split())) for i in range(n)]",
"-dp = [[0] * (w + 1) for i in range(n + 1)]",
"-for i in range(1, n + 1):",
"- for j in range(1, w + 1):",
"- if item[i - 1][0] <= j:",
"- dp[i][j] = max(dp[i - 1][j - item[i - 1][0]] + item[i - 1][1], dp[i - 1][j])",
"+N, W = list(map(int, input().split()))",
"+dp = [[0 for i in range(W + 1)] for j in range(N + 1)]",
"+for i in range(1, N + 1):",
"+ w, v = list(map(int, input().split()))",
"+ for j in range(1, W + 1):",
"+ if j - w >= 0:",
"+ dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)",
"-print((dp[n][w]))",
"+print((max(dp[N])))"
] | false | 0.041406 | 0.042174 | 0.981796 |
[
"s067947088",
"s591415639"
] |
u638795007
|
p02780
|
python
|
s172332867
|
s959586861
| 264 | 140 | 73,592 | 26,420 |
Accepted
|
Accepted
| 46.97 |
def examA():
S, T = LSI()
A, B = LI()
U = SI()
if S==U:
print((A-1,B))
else:
print((A,B-1))
return
def examB():
S = SI()
N = len(S)
ans = ""
for i in range(N):
ans += "x"
print(ans)
return
def examC():
N = I()
A = LI()
d = defaultdict(int)
for a in A:
d[a] += 1
if d[a]>=2:
print("NO")
return
print("YES")
return
def examD():
N, K = LI()
P = LI()
S = [0]*(N+1)
for i in range(N):
S[i+1] = S[i]+(P[i]+1)/2
ans = 0
for i in range(N-K+1):
cur = S[i+K]-S[i]
ans = max(ans,cur)
print(ans)
return
def examE():
ans = 0
print(ans)
return
def examF():
ans = 0
print(ans)
return
import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]
if __name__ == '__main__':
examD()
"""
"""
|
def examA():
def calc_L(x1,y1,x2,y2):
return ((x2-x1)**2 + (y2-y1)**2)**0.5
N = I()
X = [LI()for _ in range(N)]
ans = 0
for x in itertools.permutations(X):
cur = 0
for i in range(1,N):
cur += calc_L(x[i-1][0],x[i-1][1],x[i][0],x[i][1])
#print(x,cur)
ans += cur
for i in range(1,N+1):
ans /= i
print(ans)
return
def examB():
def judge(n):
sn = 0
for i in n:
sn += int(i)
if int(n)%sn==0:
return "Yes"
return "No"
N = SI()
ans = judge(N)
print(ans)
return
def examC():
N, K = LI()
P = LI()
ans = 0
S = [0]*(N+1)
for i in range(N):
S[i+1] = S[i]+(P[i]+1)/2
for i in range(N-K+1):
cur = S[i+K] - S[i]
if cur>ans:
ans = cur
print(ans)
return
def examD():
ans = 0
print(ans)
return
def examE():
ans = 0
print(ans)
return
def examF():
ans = 0
print(ans)
return
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]
sys.setrecursionlimit(10**6)
if __name__ == '__main__':
examC()
"""
"""
| 75 | 83 | 1,456 | 1,760 |
def examA():
S, T = LSI()
A, B = LI()
U = SI()
if S == U:
print((A - 1, B))
else:
print((A, B - 1))
return
def examB():
S = SI()
N = len(S)
ans = ""
for i in range(N):
ans += "x"
print(ans)
return
def examC():
N = I()
A = LI()
d = defaultdict(int)
for a in A:
d[a] += 1
if d[a] >= 2:
print("NO")
return
print("YES")
return
def examD():
N, K = LI()
P = LI()
S = [0] * (N + 1)
for i in range(N):
S[i + 1] = S[i] + (P[i] + 1) / 2
ans = 0
for i in range(N - K + 1):
cur = S[i + K] - S[i]
ans = max(ans, cur)
print(ans)
return
def examE():
ans = 0
print(ans)
return
def examF():
ans = 0
print(ans)
return
import sys, copy, bisect, itertools, heapq, math, random
from heapq import heappop, heappush, heapify
from collections import Counter, defaultdict, deque
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def LSI():
return list(map(str, sys.stdin.readline().split()))
def LS():
return sys.stdin.readline().split()
def SI():
return sys.stdin.readline().strip()
global mod, mod2, inf, alphabet, _ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10 ** (-12)
alphabet = [chr(ord("a") + i) for i in range(26)]
if __name__ == "__main__":
examD()
"""
"""
|
def examA():
def calc_L(x1, y1, x2, y2):
return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5
N = I()
X = [LI() for _ in range(N)]
ans = 0
for x in itertools.permutations(X):
cur = 0
for i in range(1, N):
cur += calc_L(x[i - 1][0], x[i - 1][1], x[i][0], x[i][1])
# print(x,cur)
ans += cur
for i in range(1, N + 1):
ans /= i
print(ans)
return
def examB():
def judge(n):
sn = 0
for i in n:
sn += int(i)
if int(n) % sn == 0:
return "Yes"
return "No"
N = SI()
ans = judge(N)
print(ans)
return
def examC():
N, K = LI()
P = LI()
ans = 0
S = [0] * (N + 1)
for i in range(N):
S[i + 1] = S[i] + (P[i] + 1) / 2
for i in range(N - K + 1):
cur = S[i + K] - S[i]
if cur > ans:
ans = cur
print(ans)
return
def examD():
ans = 0
print(ans)
return
def examE():
ans = 0
print(ans)
return
def examF():
ans = 0
print(ans)
return
import sys, bisect, itertools, heapq, math, random
from copy import deepcopy
from heapq import heappop, heappush, heapify
from collections import Counter, defaultdict, deque
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def LSI():
return list(map(str, sys.stdin.readline().split()))
def LS():
return sys.stdin.readline().split()
def SI():
return sys.stdin.readline().strip()
global mod, mod2, inf, alphabet, _ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10 ** (-12)
alphabet = [chr(ord("a") + i) for i in range(26)]
sys.setrecursionlimit(10**6)
if __name__ == "__main__":
examC()
"""
"""
| false | 9.638554 |
[
"- S, T = LSI()",
"- A, B = LI()",
"- U = SI()",
"- if S == U:",
"- print((A - 1, B))",
"- else:",
"- print((A, B - 1))",
"+ def calc_L(x1, y1, x2, y2):",
"+ return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5",
"+",
"+ N = I()",
"+ X = [LI() for _ in range(N)]",
"+ ans = 0",
"+ for x in itertools.permutations(X):",
"+ cur = 0",
"+ for i in range(1, N):",
"+ cur += calc_L(x[i - 1][0], x[i - 1][1], x[i][0], x[i][1])",
"+ # print(x,cur)",
"+ ans += cur",
"+ for i in range(1, N + 1):",
"+ ans /= i",
"+ print(ans)",
"- S = SI()",
"- N = len(S)",
"- ans = \"\"",
"- for i in range(N):",
"- ans += \"x\"",
"+ def judge(n):",
"+ sn = 0",
"+ for i in n:",
"+ sn += int(i)",
"+ if int(n) % sn == 0:",
"+ return \"Yes\"",
"+ return \"No\"",
"+",
"+ N = SI()",
"+ ans = judge(N)",
"- N = I()",
"- A = LI()",
"- d = defaultdict(int)",
"- for a in A:",
"- d[a] += 1",
"- if d[a] >= 2:",
"- print(\"NO\")",
"- return",
"- print(\"YES\")",
"+ N, K = LI()",
"+ P = LI()",
"+ ans = 0",
"+ S = [0] * (N + 1)",
"+ for i in range(N):",
"+ S[i + 1] = S[i] + (P[i] + 1) / 2",
"+ for i in range(N - K + 1):",
"+ cur = S[i + K] - S[i]",
"+ if cur > ans:",
"+ ans = cur",
"+ print(ans)",
"- N, K = LI()",
"- P = LI()",
"- S = [0] * (N + 1)",
"- for i in range(N):",
"- S[i + 1] = S[i] + (P[i] + 1) / 2",
"- for i in range(N - K + 1):",
"- cur = S[i + K] - S[i]",
"- ans = max(ans, cur)",
"-import sys, copy, bisect, itertools, heapq, math, random",
"+import sys, bisect, itertools, heapq, math, random",
"+from copy import deepcopy",
"+sys.setrecursionlimit(10**6)",
"- examD()",
"+ examC()"
] | false | 0.036063 | 0.038264 | 0.942467 |
[
"s172332867",
"s959586861"
] |
u968404618
|
p02886
|
python
|
s368048496
|
s874917715
| 179 | 34 | 39,024 | 9,152 |
Accepted
|
Accepted
| 81.01 |
N = int(eval(input()))
d_list = list(map(int, input().split()))
sum_num = 0
for i in range(N):
for j in range(i+1, N):
sum_num += d_list[i] * d_list[j]
print(sum_num)
|
from itertools import combinations
n = int(eval(input()))
D = list(map(int, input().split()))
C = list(combinations(D, 2))
ans = 0
for i, j in C:
ans += i*j
print(ans)
| 9 | 11 | 182 | 176 |
N = int(eval(input()))
d_list = list(map(int, input().split()))
sum_num = 0
for i in range(N):
for j in range(i + 1, N):
sum_num += d_list[i] * d_list[j]
print(sum_num)
|
from itertools import combinations
n = int(eval(input()))
D = list(map(int, input().split()))
C = list(combinations(D, 2))
ans = 0
for i, j in C:
ans += i * j
print(ans)
| false | 18.181818 |
[
"-N = int(eval(input()))",
"-d_list = list(map(int, input().split()))",
"-sum_num = 0",
"-for i in range(N):",
"- for j in range(i + 1, N):",
"- sum_num += d_list[i] * d_list[j]",
"-print(sum_num)",
"+from itertools import combinations",
"+",
"+n = int(eval(input()))",
"+D = list(map(int, input().split()))",
"+C = list(combinations(D, 2))",
"+ans = 0",
"+for i, j in C:",
"+ ans += i * j",
"+print(ans)"
] | false | 0.051796 | 0.036751 | 1.409348 |
[
"s368048496",
"s874917715"
] |
u423665486
|
p02684
|
python
|
s148260933
|
s344397260
| 369 | 156 | 213,568 | 32,388 |
Accepted
|
Accepted
| 57.72 |
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10**5*2)
def search(u, n, g, disc, k):
if disc[u] != None:
circles = n - disc[u]
v = (k - disc[u]) % circles
ans = u
if n > k:
ans = 0
for _ in range(k):
ans = g[ans]
return ans + 1
for i in range(v):
ans = g[ans]
return ans + 1
disc[u] = n
return search(g[u], n+1, g, disc, k)
def resolve():
n, k = list(map(int, input().split()))
g = list([int(x) - 1 for x in input().split()])
disc = [None]*n
v = search(0, 0, g, disc, k)
print(v)
resolve()
|
def resolve():
n, k = list(map(int, input().split()))
g = list(map(int, input().split()))
disc = [-1]*(n+1)
s = []
v = 1
c = 0
while disc[v] == -1:
disc[v] = len(s)
s.append(v)
v = g[v-1]
c = len(s) - disc[v]
l = len(s)
if l > k:
print((s[k]))
else:
r = (k - disc[v]) % c
for i in range(r):
v = g[v-1]
print(v)
resolve()
| 29 | 21 | 690 | 448 |
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10**5 * 2)
def search(u, n, g, disc, k):
if disc[u] != None:
circles = n - disc[u]
v = (k - disc[u]) % circles
ans = u
if n > k:
ans = 0
for _ in range(k):
ans = g[ans]
return ans + 1
for i in range(v):
ans = g[ans]
return ans + 1
disc[u] = n
return search(g[u], n + 1, g, disc, k)
def resolve():
n, k = list(map(int, input().split()))
g = list([int(x) - 1 for x in input().split()])
disc = [None] * n
v = search(0, 0, g, disc, k)
print(v)
resolve()
|
def resolve():
n, k = list(map(int, input().split()))
g = list(map(int, input().split()))
disc = [-1] * (n + 1)
s = []
v = 1
c = 0
while disc[v] == -1:
disc[v] = len(s)
s.append(v)
v = g[v - 1]
c = len(s) - disc[v]
l = len(s)
if l > k:
print((s[k]))
else:
r = (k - disc[v]) % c
for i in range(r):
v = g[v - 1]
print(v)
resolve()
| false | 27.586207 |
[
"-import sys",
"-from io import StringIO",
"-import unittest",
"-",
"-sys.setrecursionlimit(10**5 * 2)",
"-",
"-",
"-def search(u, n, g, disc, k):",
"- if disc[u] != None:",
"- circles = n - disc[u]",
"- v = (k - disc[u]) % circles",
"- ans = u",
"- if n > k:",
"- ans = 0",
"- for _ in range(k):",
"- ans = g[ans]",
"- return ans + 1",
"- for i in range(v):",
"- ans = g[ans]",
"- return ans + 1",
"- disc[u] = n",
"- return search(g[u], n + 1, g, disc, k)",
"-",
"-",
"- g = list([int(x) - 1 for x in input().split()])",
"- disc = [None] * n",
"- v = search(0, 0, g, disc, k)",
"- print(v)",
"+ g = list(map(int, input().split()))",
"+ disc = [-1] * (n + 1)",
"+ s = []",
"+ v = 1",
"+ c = 0",
"+ while disc[v] == -1:",
"+ disc[v] = len(s)",
"+ s.append(v)",
"+ v = g[v - 1]",
"+ c = len(s) - disc[v]",
"+ l = len(s)",
"+ if l > k:",
"+ print((s[k]))",
"+ else:",
"+ r = (k - disc[v]) % c",
"+ for i in range(r):",
"+ v = g[v - 1]",
"+ print(v)"
] | false | 0.099683 | 0.088241 | 1.129666 |
[
"s148260933",
"s344397260"
] |
u724687935
|
p02721
|
python
|
s868676580
|
s740638830
| 750 | 306 | 191,072 | 31,748 |
Accepted
|
Accepted
| 59.2 |
import sys
sys.setrecursionlimit(10 ** 6)
def dfs(n, rest):
global C, N
rst = 0
if maxR[n] > 0:
rst = maxR[n]
elif rest >= C and S[n] == 'o':
rst += 1
if n + (C + 1) < N:
rst += dfs(n + C + 1, C)
else:
if n + 1 < N:
rst += dfs(n + 1, rest + 1)
maxR[n] = rst
return rst
def dfs2(n, rest):
global C, N
rst = 0
if maxL[n] > 0:
rst = maxL[n]
elif rest >= C and S[n] == 'o':
rst += 1
if n - (C + 1) >= 0:
rst += dfs2(n - (C + 1), C)
else:
if n - 1 >= 0:
rst += dfs2(n - 1, rest + 1)
maxL[n] = rst
return rst
N, K, C = map(int, input().split())
S = input()
maxR = [-1] * N
for i in range(N):
if maxR[i] == -1:
maxR[i] = dfs(i, C)
# if maxR[-1] == -1:
# maxR[-1] = 0
# for i in range(N - 2, -1, -1):
# if maxR[i] == -1:
# maxR[i] = maxR[i + 1]
maxL = [-1] * N
for i in range(N - 1, -1, -1):
if maxL[i] == -1:
maxL[i] = dfs2(i, C)
# if maxL[0] == -1:
# maxL[0] = 0
# for i in range(1, N):
# if maxL[i] == -1:
# maxL[i] = maxL[i - 1]
ans = []
for i in range(N):
r = maxR[i + 1] if i + 1 < N else 0
l = maxL[i - 1] if i - 1 >= 0 else 0
if r + l < K:
ans.append(i + 1)
print(*ans, sep='\n')
|
N, K, C = map(int, input().split())
S = input()
L = [0] * K
k = 0
i = 0
rest = C
while k < K:
if rest >= C and S[i] == 'o':
L[k] = i
k += 1
rest = 0
else:
rest += 1
i += 1
R = [0] * K
k = K
i = N - 1
rest = C
while k > 0:
if rest >= C and S[i] == 'o':
R[k - 1] = i
k -= 1
rest = 0
else:
rest += 1
i -= 1
ans = []
for k in range(K):
if L[k] == R[k]:
ans.append(L[k] + 1)
print(*ans, sep='\n')
| 68 | 34 | 1,402 | 528 |
import sys
sys.setrecursionlimit(10**6)
def dfs(n, rest):
global C, N
rst = 0
if maxR[n] > 0:
rst = maxR[n]
elif rest >= C and S[n] == "o":
rst += 1
if n + (C + 1) < N:
rst += dfs(n + C + 1, C)
else:
if n + 1 < N:
rst += dfs(n + 1, rest + 1)
maxR[n] = rst
return rst
def dfs2(n, rest):
global C, N
rst = 0
if maxL[n] > 0:
rst = maxL[n]
elif rest >= C and S[n] == "o":
rst += 1
if n - (C + 1) >= 0:
rst += dfs2(n - (C + 1), C)
else:
if n - 1 >= 0:
rst += dfs2(n - 1, rest + 1)
maxL[n] = rst
return rst
N, K, C = map(int, input().split())
S = input()
maxR = [-1] * N
for i in range(N):
if maxR[i] == -1:
maxR[i] = dfs(i, C)
# if maxR[-1] == -1:
# maxR[-1] = 0
# for i in range(N - 2, -1, -1):
# if maxR[i] == -1:
# maxR[i] = maxR[i + 1]
maxL = [-1] * N
for i in range(N - 1, -1, -1):
if maxL[i] == -1:
maxL[i] = dfs2(i, C)
# if maxL[0] == -1:
# maxL[0] = 0
# for i in range(1, N):
# if maxL[i] == -1:
# maxL[i] = maxL[i - 1]
ans = []
for i in range(N):
r = maxR[i + 1] if i + 1 < N else 0
l = maxL[i - 1] if i - 1 >= 0 else 0
if r + l < K:
ans.append(i + 1)
print(*ans, sep="\n")
|
N, K, C = map(int, input().split())
S = input()
L = [0] * K
k = 0
i = 0
rest = C
while k < K:
if rest >= C and S[i] == "o":
L[k] = i
k += 1
rest = 0
else:
rest += 1
i += 1
R = [0] * K
k = K
i = N - 1
rest = C
while k > 0:
if rest >= C and S[i] == "o":
R[k - 1] = i
k -= 1
rest = 0
else:
rest += 1
i -= 1
ans = []
for k in range(K):
if L[k] == R[k]:
ans.append(L[k] + 1)
print(*ans, sep="\n")
| false | 50 |
[
"-import sys",
"-",
"-sys.setrecursionlimit(10**6)",
"-",
"-",
"-def dfs(n, rest):",
"- global C, N",
"- rst = 0",
"- if maxR[n] > 0:",
"- rst = maxR[n]",
"- elif rest >= C and S[n] == \"o\":",
"- rst += 1",
"- if n + (C + 1) < N:",
"- rst += dfs(n + C + 1, C)",
"- else:",
"- if n + 1 < N:",
"- rst += dfs(n + 1, rest + 1)",
"- maxR[n] = rst",
"- return rst",
"-",
"-",
"-def dfs2(n, rest):",
"- global C, N",
"- rst = 0",
"- if maxL[n] > 0:",
"- rst = maxL[n]",
"- elif rest >= C and S[n] == \"o\":",
"- rst += 1",
"- if n - (C + 1) >= 0:",
"- rst += dfs2(n - (C + 1), C)",
"- else:",
"- if n - 1 >= 0:",
"- rst += dfs2(n - 1, rest + 1)",
"- maxL[n] = rst",
"- return rst",
"-",
"-",
"-maxR = [-1] * N",
"-for i in range(N):",
"- if maxR[i] == -1:",
"- maxR[i] = dfs(i, C)",
"-# if maxR[-1] == -1:",
"-# maxR[-1] = 0",
"-# for i in range(N - 2, -1, -1):",
"-# if maxR[i] == -1:",
"-# maxR[i] = maxR[i + 1]",
"-maxL = [-1] * N",
"-for i in range(N - 1, -1, -1):",
"- if maxL[i] == -1:",
"- maxL[i] = dfs2(i, C)",
"-# if maxL[0] == -1:",
"-# maxL[0] = 0",
"-# for i in range(1, N):",
"-# if maxL[i] == -1:",
"-# maxL[i] = maxL[i - 1]",
"+L = [0] * K",
"+k = 0",
"+i = 0",
"+rest = C",
"+while k < K:",
"+ if rest >= C and S[i] == \"o\":",
"+ L[k] = i",
"+ k += 1",
"+ rest = 0",
"+ else:",
"+ rest += 1",
"+ i += 1",
"+R = [0] * K",
"+k = K",
"+i = N - 1",
"+rest = C",
"+while k > 0:",
"+ if rest >= C and S[i] == \"o\":",
"+ R[k - 1] = i",
"+ k -= 1",
"+ rest = 0",
"+ else:",
"+ rest += 1",
"+ i -= 1",
"-for i in range(N):",
"- r = maxR[i + 1] if i + 1 < N else 0",
"- l = maxL[i - 1] if i - 1 >= 0 else 0",
"- if r + l < K:",
"- ans.append(i + 1)",
"+for k in range(K):",
"+ if L[k] == R[k]:",
"+ ans.append(L[k] + 1)"
] | false | 0.040049 | 0.039805 | 1.006149 |
[
"s868676580",
"s740638830"
] |
u017415492
|
p03476
|
python
|
s363917726
|
s879475182
| 490 | 311 | 32,788 | 32,012 |
Accepted
|
Accepted
| 36.53 |
import itertools
n=int(eval(input()))
d=[list(map(int,input().split())) for i in range(n)]
sosuu=[1 for i in range(10**5+1)]
#sosuuのindexの値が1の時素数とする。
sosuu[0]=0
sosuu[1]=0
for i in range(2,10**5+1):
if sosuu[i]==0:continue
elif sosuu[i]==1:
for j in range(2*i,10**5+1,i):
sosuu[j]=0
like_n=[]
like_n+=sosuu
#奇数なので、2を削除。
like_n[2]=0
for i in range(3,10**5+1):
if sosuu[i]==0:continue
elif sosuu[i]==1 and sosuu[(i+1)//2]==0:
like_n[i]=0
ans= list(itertools.accumulate(like_n))
for ans_d in d:
print((ans[ans_d[1]]-ans[ans_d[0]-1]))
|
import itertools
n=int(eval(input()))
d=[list(map(int,input().split())) for i in range(n)]
sosuu=[1 for i in range(10**5+1)]
#sosuuのindexの値が1の時素数とする。
sosuu[0]=0
sosuu[1]=0
for i in range(2,int((10**5+1)**0.5)+1):
if sosuu[i]==0:continue
elif sosuu[i]==1:
for j in range(2*i,10**5+1,i):
sosuu[j]=0
like_n=[]
like_n+=sosuu
#奇数なので、2を削除。
like_n[2]=0
for i in range(3,10**5+1):
if sosuu[i]==0:continue
elif sosuu[i]==1 and sosuu[(i+1)//2]==0:
like_n[i]=0
ans= list(itertools.accumulate(like_n))
for ans_d in d:
print((ans[ans_d[1]]-ans[ans_d[0]-1]))
| 25 | 25 | 573 | 587 |
import itertools
n = int(eval(input()))
d = [list(map(int, input().split())) for i in range(n)]
sosuu = [1 for i in range(10**5 + 1)]
# sosuuのindexの値が1の時素数とする。
sosuu[0] = 0
sosuu[1] = 0
for i in range(2, 10**5 + 1):
if sosuu[i] == 0:
continue
elif sosuu[i] == 1:
for j in range(2 * i, 10**5 + 1, i):
sosuu[j] = 0
like_n = []
like_n += sosuu
# 奇数なので、2を削除。
like_n[2] = 0
for i in range(3, 10**5 + 1):
if sosuu[i] == 0:
continue
elif sosuu[i] == 1 and sosuu[(i + 1) // 2] == 0:
like_n[i] = 0
ans = list(itertools.accumulate(like_n))
for ans_d in d:
print((ans[ans_d[1]] - ans[ans_d[0] - 1]))
|
import itertools
n = int(eval(input()))
d = [list(map(int, input().split())) for i in range(n)]
sosuu = [1 for i in range(10**5 + 1)]
# sosuuのindexの値が1の時素数とする。
sosuu[0] = 0
sosuu[1] = 0
for i in range(2, int((10**5 + 1) ** 0.5) + 1):
if sosuu[i] == 0:
continue
elif sosuu[i] == 1:
for j in range(2 * i, 10**5 + 1, i):
sosuu[j] = 0
like_n = []
like_n += sosuu
# 奇数なので、2を削除。
like_n[2] = 0
for i in range(3, 10**5 + 1):
if sosuu[i] == 0:
continue
elif sosuu[i] == 1 and sosuu[(i + 1) // 2] == 0:
like_n[i] = 0
ans = list(itertools.accumulate(like_n))
for ans_d in d:
print((ans[ans_d[1]] - ans[ans_d[0] - 1]))
| false | 0 |
[
"-for i in range(2, 10**5 + 1):",
"+for i in range(2, int((10**5 + 1) ** 0.5) + 1):"
] | false | 0.179939 | 0.129891 | 1.385311 |
[
"s363917726",
"s879475182"
] |
u489959379
|
p02837
|
python
|
s008174779
|
s959310279
| 966 | 74 | 3,064 | 3,064 |
Accepted
|
Accepted
| 92.34 |
n = int(eval(input()))
evi_all = []
for _ in range(n):
evi = []
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
evi.append((x - 1, y))
evi_all.append(evi)
ans = 0
for mask in range(2 ** n):
flg = True
for bit in range(n):
if (mask >> bit) & 1:
for x, y in evi_all[bit]:
if (y == 1 and (mask >> x & 1) == 0) or (y == 0 and (mask >> x & 1) == 1):
flg = False
if flg:
cnt = 0
for bit_2 in range(n):
if (mask >> bit_2) & 1:
cnt += 1
ans = max(ans, cnt)
print(ans)
|
import sys
from itertools import product
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
query = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
query[i].append([x - 1, y])
res = 0
for pattern in product([0, 1], repeat=n):
for idx, p in enumerate(pattern):
if p == 1:
for x, y in query[idx]:
if pattern[x] != y:
break
else:
continue
break
else:
res = max(res, sum(pattern))
print(res)
if __name__ == '__main__':
resolve()
| 27 | 35 | 647 | 800 |
n = int(eval(input()))
evi_all = []
for _ in range(n):
evi = []
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
evi.append((x - 1, y))
evi_all.append(evi)
ans = 0
for mask in range(2**n):
flg = True
for bit in range(n):
if (mask >> bit) & 1:
for x, y in evi_all[bit]:
if (y == 1 and (mask >> x & 1) == 0) or (
y == 0 and (mask >> x & 1) == 1
):
flg = False
if flg:
cnt = 0
for bit_2 in range(n):
if (mask >> bit_2) & 1:
cnt += 1
ans = max(ans, cnt)
print(ans)
|
import sys
from itertools import product
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n = int(eval(input()))
query = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
query[i].append([x - 1, y])
res = 0
for pattern in product([0, 1], repeat=n):
for idx, p in enumerate(pattern):
if p == 1:
for x, y in query[idx]:
if pattern[x] != y:
break
else:
continue
break
else:
res = max(res, sum(pattern))
print(res)
if __name__ == "__main__":
resolve()
| false | 22.857143 |
[
"-n = int(eval(input()))",
"-evi_all = []",
"-for _ in range(n):",
"- evi = []",
"- for _ in range(int(eval(input()))):",
"- x, y = list(map(int, input().split()))",
"- evi.append((x - 1, y))",
"- evi_all.append(evi)",
"-ans = 0",
"-for mask in range(2**n):",
"- flg = True",
"- for bit in range(n):",
"- if (mask >> bit) & 1:",
"- for x, y in evi_all[bit]:",
"- if (y == 1 and (mask >> x & 1) == 0) or (",
"- y == 0 and (mask >> x & 1) == 1",
"- ):",
"- flg = False",
"- if flg:",
"- cnt = 0",
"- for bit_2 in range(n):",
"- if (mask >> bit_2) & 1:",
"- cnt += 1",
"- ans = max(ans, cnt)",
"-print(ans)",
"+import sys",
"+from itertools import product",
"+",
"+sys.setrecursionlimit(10**7)",
"+f_inf = float(\"inf\")",
"+mod = 10**9 + 7",
"+",
"+",
"+def resolve():",
"+ n = int(eval(input()))",
"+ query = [[] for _ in range(n)]",
"+ for i in range(n):",
"+ a = int(eval(input()))",
"+ for _ in range(a):",
"+ x, y = list(map(int, input().split()))",
"+ query[i].append([x - 1, y])",
"+ res = 0",
"+ for pattern in product([0, 1], repeat=n):",
"+ for idx, p in enumerate(pattern):",
"+ if p == 1:",
"+ for x, y in query[idx]:",
"+ if pattern[x] != y:",
"+ break",
"+ else:",
"+ continue",
"+ break",
"+ else:",
"+ res = max(res, sum(pattern))",
"+ print(res)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ resolve()"
] | false | 0.044728 | 0.037007 | 1.20862 |
[
"s008174779",
"s959310279"
] |
u577942884
|
p03408
|
python
|
s133919580
|
s552347377
| 177 | 17 | 38,896 | 3,064 |
Accepted
|
Accepted
| 90.4 |
n = int(eval(input()))
c = []
for i in range(n):
c.append(eval(input()))
d = []
m = int(eval(input()))
for i in range(m):
d.append(eval(input()))
scores = []
for i in c:
score = 0
for j in range(n):
if i == c[j]:
score += 1
for j in range(m):
if i == d[j]:
score -= 1
scores.append(score)
if max(scores) >= 0:
print((max(scores)))
else:
print((0))
|
n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
counts =0
max1 = 0
for i in set(s):
counts = s.count(i) - t.count(i)
max1 = max(max1,counts)
print(max1)
| 23 | 10 | 414 | 215 |
n = int(eval(input()))
c = []
for i in range(n):
c.append(eval(input()))
d = []
m = int(eval(input()))
for i in range(m):
d.append(eval(input()))
scores = []
for i in c:
score = 0
for j in range(n):
if i == c[j]:
score += 1
for j in range(m):
if i == d[j]:
score -= 1
scores.append(score)
if max(scores) >= 0:
print((max(scores)))
else:
print((0))
|
n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
counts = 0
max1 = 0
for i in set(s):
counts = s.count(i) - t.count(i)
max1 = max(max1, counts)
print(max1)
| false | 56.521739 |
[
"-c = []",
"-for i in range(n):",
"- c.append(eval(input()))",
"-d = []",
"+s = [eval(input()) for _ in range(n)]",
"-for i in range(m):",
"- d.append(eval(input()))",
"-scores = []",
"-for i in c:",
"- score = 0",
"- for j in range(n):",
"- if i == c[j]:",
"- score += 1",
"- for j in range(m):",
"- if i == d[j]:",
"- score -= 1",
"- scores.append(score)",
"-if max(scores) >= 0:",
"- print((max(scores)))",
"-else:",
"- print((0))",
"+t = [eval(input()) for _ in range(m)]",
"+counts = 0",
"+max1 = 0",
"+for i in set(s):",
"+ counts = s.count(i) - t.count(i)",
"+ max1 = max(max1, counts)",
"+print(max1)"
] | false | 0.070337 | 0.037395 | 1.880912 |
[
"s133919580",
"s552347377"
] |
u519939795
|
p02886
|
python
|
s961652897
|
s340170397
| 19 | 17 | 3,188 | 2,940 |
Accepted
|
Accepted
| 10.53 |
import itertools
n=int(eval(input()))
takoyaki=list(map(int,input().split()))
combs=list(itertools.combinations(takoyaki,2))
recovery=list(c[0]*c[1] for c in combs)
print((sum(recovery)))
|
n=int(eval(input()))
d=list(map(int,input().split()))
tot=sum(d)**2
for i in range(n):
tot-=d[i]**2
print((tot//2))
| 6 | 6 | 184 | 115 |
import itertools
n = int(eval(input()))
takoyaki = list(map(int, input().split()))
combs = list(itertools.combinations(takoyaki, 2))
recovery = list(c[0] * c[1] for c in combs)
print((sum(recovery)))
|
n = int(eval(input()))
d = list(map(int, input().split()))
tot = sum(d) ** 2
for i in range(n):
tot -= d[i] ** 2
print((tot // 2))
| false | 0 |
[
"-import itertools",
"-",
"-takoyaki = list(map(int, input().split()))",
"-combs = list(itertools.combinations(takoyaki, 2))",
"-recovery = list(c[0] * c[1] for c in combs)",
"-print((sum(recovery)))",
"+d = list(map(int, input().split()))",
"+tot = sum(d) ** 2",
"+for i in range(n):",
"+ tot -= d[i] ** 2",
"+print((tot // 2))"
] | false | 0.075317 | 0.075348 | 0.999595 |
[
"s961652897",
"s340170397"
] |
u617515020
|
p02813
|
python
|
s068637367
|
s646938616
| 47 | 34 | 8,180 | 13,888 |
Accepted
|
Accepted
| 27.66 |
from itertools import permutations
n=int(eval(input()))
p="".join(input().split())
q="".join(input().split())
N=""
for i in range(1,n+1):
N += str(i)
perms = list(permutations(N,n))
for i in range(len(perms)):
perms[i] = "".join(list(perms[i]))
print((abs(perms.index(p) - perms.index(q))))
|
from itertools import permutations
N=int(eval(input()))
P=list(map(int,input().split()))
Q=list(map(int,input().split()))
P=tuple([x-1 for x in P])
Q=tuple([x-1 for x in Q])
l=list(permutations(list(range(N))))
print((abs(l.index(P)-l.index(Q))))
| 12 | 8 | 298 | 247 |
from itertools import permutations
n = int(eval(input()))
p = "".join(input().split())
q = "".join(input().split())
N = ""
for i in range(1, n + 1):
N += str(i)
perms = list(permutations(N, n))
for i in range(len(perms)):
perms[i] = "".join(list(perms[i]))
print((abs(perms.index(p) - perms.index(q))))
|
from itertools import permutations
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
P = tuple([x - 1 for x in P])
Q = tuple([x - 1 for x in Q])
l = list(permutations(list(range(N))))
print((abs(l.index(P) - l.index(Q))))
| false | 33.333333 |
[
"-n = int(eval(input()))",
"-p = \"\".join(input().split())",
"-q = \"\".join(input().split())",
"-N = \"\"",
"-for i in range(1, n + 1):",
"- N += str(i)",
"-perms = list(permutations(N, n))",
"-for i in range(len(perms)):",
"- perms[i] = \"\".join(list(perms[i]))",
"-print((abs(perms.index(p) - perms.index(q))))",
"+N = int(eval(input()))",
"+P = list(map(int, input().split()))",
"+Q = list(map(int, input().split()))",
"+P = tuple([x - 1 for x in P])",
"+Q = tuple([x - 1 for x in Q])",
"+l = list(permutations(list(range(N))))",
"+print((abs(l.index(P) - l.index(Q))))"
] | false | 0.036471 | 0.034957 | 1.0433 |
[
"s068637367",
"s646938616"
] |
u548624367
|
p03329
|
python
|
s355213028
|
s370779440
| 271 | 246 | 2,940 | 3,864 |
Accepted
|
Accepted
| 9.23 |
def ds(a, b):
return a if a<b else ds(a//b,b)+a%b
ans = float('inf')
n = int(eval(input()))
for i in range(n+1):
ans = min(ans,ds(i,6)+ds(n-i,9))
print(ans)
|
def ds(a, b):
return a if a<b else ds(a//b,b)+a%b
n = int(eval(input()))
print((min([ds(i,6)+ds(n-i,9) for i in range(n+1)])))
| 7 | 4 | 158 | 122 |
def ds(a, b):
return a if a < b else ds(a // b, b) + a % b
ans = float("inf")
n = int(eval(input()))
for i in range(n + 1):
ans = min(ans, ds(i, 6) + ds(n - i, 9))
print(ans)
|
def ds(a, b):
return a if a < b else ds(a // b, b) + a % b
n = int(eval(input()))
print((min([ds(i, 6) + ds(n - i, 9) for i in range(n + 1)])))
| false | 42.857143 |
[
"-ans = float(\"inf\")",
"-for i in range(n + 1):",
"- ans = min(ans, ds(i, 6) + ds(n - i, 9))",
"-print(ans)",
"+print((min([ds(i, 6) + ds(n - i, 9) for i in range(n + 1)])))"
] | false | 0.121997 | 0.052278 | 2.333636 |
[
"s355213028",
"s370779440"
] |
u912237403
|
p00114
|
python
|
s703586504
|
s574306676
| 360 | 310 | 5,552 | 5,260 |
Accepted
|
Accepted
| 13.89 |
from functools import reduce
def f(a,b):
p,q=a,b
while q!=0: p,q=q,p%q
return a/p*b
while 1:
x=list(map(int,input().split()))
if any(x)==0: break
A=[]
for i in range(0,6,2):
a,b=x[i:i+2]
c=1
for j in range(1,b):
c*=a; c%=b
if c==1: break
A.append(j)
x=reduce(lambda a,b: f(a,b), A)
print(x)
|
def f(a,b):
p,q=a,b
while q!=0: p,q=q,p%q
return a/p*b
while 1:
x=list(map(int,input().split()))
if any(x)==0: break
A=[]
for i in range(0,6,2):
a,b=x[i:i+2]
c=1
for j in range(1,b):
c=(c*a)%b
if c==1: break
A.append(j)
a,b,c=A
print(f(f(a,b),c))
| 18 | 18 | 324 | 309 |
from functools import reduce
def f(a, b):
p, q = a, b
while q != 0:
p, q = q, p % q
return a / p * b
while 1:
x = list(map(int, input().split()))
if any(x) == 0:
break
A = []
for i in range(0, 6, 2):
a, b = x[i : i + 2]
c = 1
for j in range(1, b):
c *= a
c %= b
if c == 1:
break
A.append(j)
x = reduce(lambda a, b: f(a, b), A)
print(x)
|
def f(a, b):
p, q = a, b
while q != 0:
p, q = q, p % q
return a / p * b
while 1:
x = list(map(int, input().split()))
if any(x) == 0:
break
A = []
for i in range(0, 6, 2):
a, b = x[i : i + 2]
c = 1
for j in range(1, b):
c = (c * a) % b
if c == 1:
break
A.append(j)
a, b, c = A
print(f(f(a, b), c))
| false | 0 |
[
"-from functools import reduce",
"-",
"-",
"- c *= a",
"- c %= b",
"+ c = (c * a) % b",
"- x = reduce(lambda a, b: f(a, b), A)",
"- print(x)",
"+ a, b, c = A",
"+ print(f(f(a, b), c))"
] | false | 0.061049 | 0.050322 | 1.213169 |
[
"s703586504",
"s574306676"
] |
u796942881
|
p03221
|
python
|
s450751882
|
s298228208
| 612 | 489 | 30,672 | 30,640 |
Accepted
|
Accepted
| 20.1 |
N, M = list(map(int, input().split()))
Pm = [0] * M
Ym = [0] * M
ym = [0] * M
Am = [''] * M
Cn = [0] * N
D = {}
for i in range(M):
P, Y = list(map(int, input().split()))
Pm[i], Ym[i] = P, Y
ym[i] = Y
D[Y] = i
ym.sort()
for i in range(M):
k = D[ym[i]]
# 0-indexed
Cn[Pm[k] - 1] += 1
Am[k] = str(Pm[k]).rjust(6, '0') + str(Cn[Pm[k] - 1]).rjust(6, '0')
for i in range(M):
print((Am[i]))
|
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
Pm = [0] * M
Ym = [0] * M
ym = [0] * M
Am = [''] * M
Cn = [0] * N
D = {}
for i in range(M):
P, Y = list(map(int, input().split()))
Pm[i], Ym[i] = P, Y
ym[i] = Y
D[Y] = i
ym.sort()
for i in range(M):
k = D[ym[i]]
# 0-indexed
Cn[Pm[k] - 1] += 1
Am[k] = str(Pm[k]).rjust(6, '0') + str(Cn[Pm[k] - 1]).rjust(6, '0')
for i in range(M):
print((Am[i]))
| 31 | 35 | 447 | 491 |
N, M = list(map(int, input().split()))
Pm = [0] * M
Ym = [0] * M
ym = [0] * M
Am = [""] * M
Cn = [0] * N
D = {}
for i in range(M):
P, Y = list(map(int, input().split()))
Pm[i], Ym[i] = P, Y
ym[i] = Y
D[Y] = i
ym.sort()
for i in range(M):
k = D[ym[i]]
# 0-indexed
Cn[Pm[k] - 1] += 1
Am[k] = str(Pm[k]).rjust(6, "0") + str(Cn[Pm[k] - 1]).rjust(6, "0")
for i in range(M):
print((Am[i]))
|
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
Pm = [0] * M
Ym = [0] * M
ym = [0] * M
Am = [""] * M
Cn = [0] * N
D = {}
for i in range(M):
P, Y = list(map(int, input().split()))
Pm[i], Ym[i] = P, Y
ym[i] = Y
D[Y] = i
ym.sort()
for i in range(M):
k = D[ym[i]]
# 0-indexed
Cn[Pm[k] - 1] += 1
Am[k] = str(Pm[k]).rjust(6, "0") + str(Cn[Pm[k] - 1]).rjust(6, "0")
for i in range(M):
print((Am[i]))
| false | 11.428571 |
[
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.047826 | 0.047592 | 1.004909 |
[
"s450751882",
"s298228208"
] |
u604774382
|
p02412
|
python
|
s243494594
|
s254179045
| 450 | 20 | 6,724 | 4,216 |
Accepted
|
Accepted
| 95.56 |
import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
ave = x // 3
for i in range( 1, ave ):
for j in range( i+1, n ):
if x <= ( i+j ):
break
for k in range( j+1, n+1 ):
s = ( i + j + k )
if x == s:
cnt += 1
break
elif x < s:
break
print( cnt )
|
import sys
while True:
n, x = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == n and 0 == x:
break
cnt = 0
ave = x // 3
for i in range( 1, ave ):
ave2 = (x-i) // 2
for j in range( i+1, ave2+1 ):
k = x-i-j
if j < k and k <= n:
cnt += 1
print( cnt )
| 22 | 17 | 393 | 310 |
import sys
while True:
n, x = [int(val) for val in sys.stdin.readline().split(" ")]
if 0 == n and 0 == x:
break
cnt = 0
ave = x // 3
for i in range(1, ave):
for j in range(i + 1, n):
if x <= (i + j):
break
for k in range(j + 1, n + 1):
s = i + j + k
if x == s:
cnt += 1
break
elif x < s:
break
print(cnt)
|
import sys
while True:
n, x = [int(val) for val in sys.stdin.readline().split(" ")]
if 0 == n and 0 == x:
break
cnt = 0
ave = x // 3
for i in range(1, ave):
ave2 = (x - i) // 2
for j in range(i + 1, ave2 + 1):
k = x - i - j
if j < k and k <= n:
cnt += 1
print(cnt)
| false | 22.727273 |
[
"- for j in range(i + 1, n):",
"- if x <= (i + j):",
"- break",
"- for k in range(j + 1, n + 1):",
"- s = i + j + k",
"- if x == s:",
"- cnt += 1",
"- break",
"- elif x < s:",
"- break",
"+ ave2 = (x - i) // 2",
"+ for j in range(i + 1, ave2 + 1):",
"+ k = x - i - j",
"+ if j < k and k <= n:",
"+ cnt += 1"
] | false | 0.084085 | 0.036512 | 2.302962 |
[
"s243494594",
"s254179045"
] |
u038404105
|
p02684
|
python
|
s443833455
|
s108610368
| 150 | 136 | 32,360 | 32,256 |
Accepted
|
Accepted
| 9.33 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now=1
flg = 0
path = [1]
pathcheck ={1}
for i in range(k):
now = a[now-1]
if now in pathcheck:
flg = -1
path.append(now)
break
path.append(now)
pathcheck.add(now)
if flg == 0:
print(now)
exit()
x1 = path.index(now)
x2 = len(path)-1
x3 = (k-x1)%(x2-x1)
print((path[x1+x3]))
|
import sys
readline = sys.stdin.buffer.readline
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now=1
flg = 0
path = [1]
pathcheck ={1}
for i in range(k):
now = a[now-1]
if now in pathcheck:
flg = -1
path.append(now)
break
path.append(now)
pathcheck.add(now)
if flg == 0:
print(now)
exit()
x1 = path.index(now)
x2 = len(path)-1
x3 = (k-x1)%(x2-x1)
print((path[x1+x3]))
if __name__ == '__main__':
main()
| 25 | 32 | 415 | 606 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = 1
flg = 0
path = [1]
pathcheck = {1}
for i in range(k):
now = a[now - 1]
if now in pathcheck:
flg = -1
path.append(now)
break
path.append(now)
pathcheck.add(now)
if flg == 0:
print(now)
exit()
x1 = path.index(now)
x2 = len(path) - 1
x3 = (k - x1) % (x2 - x1)
print((path[x1 + x3]))
|
import sys
readline = sys.stdin.buffer.readline
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now = 1
flg = 0
path = [1]
pathcheck = {1}
for i in range(k):
now = a[now - 1]
if now in pathcheck:
flg = -1
path.append(now)
break
path.append(now)
pathcheck.add(now)
if flg == 0:
print(now)
exit()
x1 = path.index(now)
x2 = len(path) - 1
x3 = (k - x1) % (x2 - x1)
print((path[x1 + x3]))
if __name__ == "__main__":
main()
| false | 21.875 |
[
"-n, k = list(map(int, input().split()))",
"-a = list(map(int, input().split()))",
"-now = 1",
"-flg = 0",
"-path = [1]",
"-pathcheck = {1}",
"-for i in range(k):",
"- now = a[now - 1]",
"- if now in pathcheck:",
"- flg = -1",
"+import sys",
"+",
"+readline = sys.stdin.buffer.readline",
"+",
"+",
"+def main():",
"+ n, k = list(map(int, input().split()))",
"+ a = list(map(int, input().split()))",
"+ now = 1",
"+ flg = 0",
"+ path = [1]",
"+ pathcheck = {1}",
"+ for i in range(k):",
"+ now = a[now - 1]",
"+ if now in pathcheck:",
"+ flg = -1",
"+ path.append(now)",
"+ break",
"- break",
"- path.append(now)",
"- pathcheck.add(now)",
"-if flg == 0:",
"- print(now)",
"- exit()",
"-x1 = path.index(now)",
"-x2 = len(path) - 1",
"-x3 = (k - x1) % (x2 - x1)",
"-print((path[x1 + x3]))",
"+ pathcheck.add(now)",
"+ if flg == 0:",
"+ print(now)",
"+ exit()",
"+ x1 = path.index(now)",
"+ x2 = len(path) - 1",
"+ x3 = (k - x1) % (x2 - x1)",
"+ print((path[x1 + x3]))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.038969 | 0.038688 | 1.007267 |
[
"s443833455",
"s108610368"
] |
u644907318
|
p03486
|
python
|
s499002797
|
s149324269
| 101 | 65 | 61,696 | 61,544 |
Accepted
|
Accepted
| 35.64 |
s = list(eval(input()))
t = list(eval(input()))
s = sorted(s)
t = sorted(t,reverse=True)
if s<t:
print("Yes")
else:
print("No")
|
s = sorted(list(input().strip()))
t = sorted(list(input().strip()),reverse=True)
if s<t:
print("Yes")
else:
print("No")
| 8 | 6 | 130 | 132 |
s = list(eval(input()))
t = list(eval(input()))
s = sorted(s)
t = sorted(t, reverse=True)
if s < t:
print("Yes")
else:
print("No")
|
s = sorted(list(input().strip()))
t = sorted(list(input().strip()), reverse=True)
if s < t:
print("Yes")
else:
print("No")
| false | 25 |
[
"-s = list(eval(input()))",
"-t = list(eval(input()))",
"-s = sorted(s)",
"-t = sorted(t, reverse=True)",
"+s = sorted(list(input().strip()))",
"+t = sorted(list(input().strip()), reverse=True)"
] | false | 0.037779 | 0.069649 | 0.542416 |
[
"s499002797",
"s149324269"
] |
u980205854
|
p03785
|
python
|
s405659924
|
s775662069
| 251 | 186 | 7,388 | 80,900 |
Accepted
|
Accepted
| 25.9 |
# A - Airport Bus
N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
ans = 0
c = 0
dead_time = 0
for i in range(N):
if c==0 or T[i]>dead_time:
dead_time = T[i]+K
ans += 1
c = 0
c = (c+1)%C
print(ans)
|
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from math import *
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 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):
self.setdefault(x,0)
self[x] += 1
N,C,K = mint()
T = [int(input()) for _ in range(N)]
T.sort()
t0 = 0
i = 0
ans = 0
for t in T:
if i==0:
t0 = t
i = 1
ans += 1
elif t-t0>K:
t0 = t
i = 1
ans += 1
else:
i += 1
if i==C:
i = 0
print(ans)
| 17 | 56 | 281 | 1,204 |
# A - Airport Bus
N, C, K = list(map(int, input().split()))
T = [int(eval(input())) for i in range(N)]
T.sort()
ans = 0
c = 0
dead_time = 0
for i in range(N):
if c == 0 or T[i] > dead_time:
dead_time = T[i] + K
ans += 1
c = 0
c = (c + 1) % C
print(ans)
|
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right # func(リスト,値)
from heapq import heapify, heappop, heappush
from math import *
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 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):
self.setdefault(x, 0)
self[x] += 1
N, C, K = mint()
T = [int(input()) for _ in range(N)]
T.sort()
t0 = 0
i = 0
ans = 0
for t in T:
if i == 0:
t0 = t
i = 1
ans += 1
elif t - t0 > K:
t0 = t
i = 1
ans += 1
else:
i += 1
if i == C:
i = 0
print(ans)
| false | 69.642857 |
[
"-# A - Airport Bus",
"-N, C, K = list(map(int, input().split()))",
"-T = [int(eval(input())) for i in range(N)]",
"+import sys",
"+from sys import exit",
"+from collections import deque",
"+from bisect import bisect_left, bisect_right, insort_left, insort_right # func(リスト,値)",
"+from heapq import heapify, heappop, heappush",
"+from math import *",
"+",
"+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 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):",
"+ self.setdefault(x, 0)",
"+ self[x] += 1",
"+",
"+",
"+N, C, K = mint()",
"+T = [int(input()) for _ in range(N)]",
"+t0 = 0",
"+i = 0",
"-c = 0",
"-dead_time = 0",
"-for i in range(N):",
"- if c == 0 or T[i] > dead_time:",
"- dead_time = T[i] + K",
"+for t in T:",
"+ if i == 0:",
"+ t0 = t",
"+ i = 1",
"- c = 0",
"- c = (c + 1) % C",
"+ elif t - t0 > K:",
"+ t0 = t",
"+ i = 1",
"+ ans += 1",
"+ else:",
"+ i += 1",
"+ if i == C:",
"+ i = 0"
] | false | 0.041048 | 0.048031 | 0.854612 |
[
"s405659924",
"s775662069"
] |
u297574184
|
p03738
|
python
|
s814734596
|
s836593125
| 20 | 18 | 3,060 | 3,060 |
Accepted
|
Accepted
| 10 |
A = int(eval(input()))
B = int(eval(input()))
if A > B:
print('GREATER')
elif A < B:
print('LESS')
else:
print('EQUAL')
|
As = eval(input())
Bs = eval(input())
lenA, lenB = len(As), len(Bs)
if lenA > lenB:
print('GREATER')
elif lenA < lenB:
print('LESS')
else:
for A, B in zip(As, Bs):
A, B = int(A), int(B)
if A > B:
print('GREATER')
break
elif A < B:
print('LESS')
break
else:
print('EQUAL')
| 9 | 19 | 129 | 375 |
A = int(eval(input()))
B = int(eval(input()))
if A > B:
print("GREATER")
elif A < B:
print("LESS")
else:
print("EQUAL")
|
As = eval(input())
Bs = eval(input())
lenA, lenB = len(As), len(Bs)
if lenA > lenB:
print("GREATER")
elif lenA < lenB:
print("LESS")
else:
for A, B in zip(As, Bs):
A, B = int(A), int(B)
if A > B:
print("GREATER")
break
elif A < B:
print("LESS")
break
else:
print("EQUAL")
| false | 52.631579 |
[
"-A = int(eval(input()))",
"-B = int(eval(input()))",
"-if A > B:",
"+As = eval(input())",
"+Bs = eval(input())",
"+lenA, lenB = len(As), len(Bs)",
"+if lenA > lenB:",
"-elif A < B:",
"+elif lenA < lenB:",
"- print(\"EQUAL\")",
"+ for A, B in zip(As, Bs):",
"+ A, B = int(A), int(B)",
"+ if A > B:",
"+ print(\"GREATER\")",
"+ break",
"+ elif A < B:",
"+ print(\"LESS\")",
"+ break",
"+ else:",
"+ print(\"EQUAL\")"
] | false | 0.03608 | 0.03478 | 1.037395 |
[
"s814734596",
"s836593125"
] |
u761320129
|
p03356
|
python
|
s369387918
|
s282469929
| 1,007 | 767 | 93,312 | 25,176 |
Accepted
|
Accepted
| 23.83 |
N,M = list(map(int,input().split()))
P = list(map(int,input().split()))
XY = [tuple(map(int,input().split())) for i in range(M)]
class UnionFind:
def __init__(self,N):
self.parent = [i for i in range(N)]
self._size = [1] * N
self.count = 0
def root(self,a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self,a,b):
return self.root(a) == self.root(b)
def unite(self,a,b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self._size[ra] < self._size[rb]: ra,rb = rb,ra
self._size[ra] += self._size[rb]
self.parent[rb] = ra
self.count += 1
def size(self,a):
return self._size[self.root(a)]
uf = UnionFind(N)
for x,y in XY:
x,y = x-1,y-1
if uf.is_same(x,y): continue
uf.unite(x,y)
for i in range(N):
uf.root(i)
from collections import defaultdict
ps = defaultdict(lambda: set())
ids = defaultdict(lambda: set())
rs = set()
for i,p in enumerate(P):
r = uf.root(i)
ps[r].add(p-1)
ids[r].add(i)
rs.add(r)
ans = 0
for r in rs:
ans += len(ps[r] & ids[r])
print(ans)
|
N,M = list(map(int,input().split()))
P = list(map(int,input().split()))
XY = [tuple(map(int,input().split())) for i in range(M)]
class UnionFind:
def __init__(self,N):
self.parent = [i for i in range(N)]
self._size = [1] * N
self.count = 0
def root(self,a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self,a,b):
return self.root(a) == self.root(b)
def unite(self,a,b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self._size[ra] < self._size[rb]: ra,rb = rb,ra
self._size[ra] += self._size[rb]
self.parent[rb] = ra
self.count += 1
def size(self,a):
return self._size[self.root(a)]
uf = UnionFind(N)
for x,y in XY:
x,y = x-1,y-1
if not uf.is_same(x,y):
uf.unite(x,y)
ans = 0
for i,p in enumerate(P):
if uf.is_same(i,p-1):
ans += 1
print(ans)
| 50 | 38 | 1,288 | 1,056 |
N, M = list(map(int, input().split()))
P = list(map(int, input().split()))
XY = [tuple(map(int, input().split())) for i in range(M)]
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self._size = [1] * N
self.count = 0
def root(self, a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self, a, b):
return self.root(a) == self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb:
return
if self._size[ra] < self._size[rb]:
ra, rb = rb, ra
self._size[ra] += self._size[rb]
self.parent[rb] = ra
self.count += 1
def size(self, a):
return self._size[self.root(a)]
uf = UnionFind(N)
for x, y in XY:
x, y = x - 1, y - 1
if uf.is_same(x, y):
continue
uf.unite(x, y)
for i in range(N):
uf.root(i)
from collections import defaultdict
ps = defaultdict(lambda: set())
ids = defaultdict(lambda: set())
rs = set()
for i, p in enumerate(P):
r = uf.root(i)
ps[r].add(p - 1)
ids[r].add(i)
rs.add(r)
ans = 0
for r in rs:
ans += len(ps[r] & ids[r])
print(ans)
|
N, M = list(map(int, input().split()))
P = list(map(int, input().split()))
XY = [tuple(map(int, input().split())) for i in range(M)]
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self._size = [1] * N
self.count = 0
def root(self, a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self, a, b):
return self.root(a) == self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb:
return
if self._size[ra] < self._size[rb]:
ra, rb = rb, ra
self._size[ra] += self._size[rb]
self.parent[rb] = ra
self.count += 1
def size(self, a):
return self._size[self.root(a)]
uf = UnionFind(N)
for x, y in XY:
x, y = x - 1, y - 1
if not uf.is_same(x, y):
uf.unite(x, y)
ans = 0
for i, p in enumerate(P):
if uf.is_same(i, p - 1):
ans += 1
print(ans)
| false | 24 |
[
"- if uf.is_same(x, y):",
"- continue",
"- uf.unite(x, y)",
"-for i in range(N):",
"- uf.root(i)",
"-from collections import defaultdict",
"-",
"-ps = defaultdict(lambda: set())",
"-ids = defaultdict(lambda: set())",
"-rs = set()",
"+ if not uf.is_same(x, y):",
"+ uf.unite(x, y)",
"+ans = 0",
"- r = uf.root(i)",
"- ps[r].add(p - 1)",
"- ids[r].add(i)",
"- rs.add(r)",
"-ans = 0",
"-for r in rs:",
"- ans += len(ps[r] & ids[r])",
"+ if uf.is_same(i, p - 1):",
"+ ans += 1"
] | false | 0.043317 | 0.039042 | 1.109503 |
[
"s369387918",
"s282469929"
] |
u018679195
|
p03239
|
python
|
s293710561
|
s934638298
| 175 | 17 | 38,256 | 3,060 |
Accepted
|
Accepted
| 90.29 |
n,t = list(map(int,input().split()))
minc = -1
for i in range(n):
ci,ti = list(map(int,input().split()))
if ti <= t:
if minc == -1:
minc = ci
else:
minc = min(minc,ci)
if minc == -1:
print("TLE")
else:
print(minc)
|
a,b= list(map(int,input().split()))
e=[]
for i in range(a):
c,d=list(map(int,input().split()))
if b>=d:
e.append(c)
if e==[]:
print("TLE")
else:
print((min(e)))
| 15 | 10 | 259 | 179 |
n, t = list(map(int, input().split()))
minc = -1
for i in range(n):
ci, ti = list(map(int, input().split()))
if ti <= t:
if minc == -1:
minc = ci
else:
minc = min(minc, ci)
if minc == -1:
print("TLE")
else:
print(minc)
|
a, b = list(map(int, input().split()))
e = []
for i in range(a):
c, d = list(map(int, input().split()))
if b >= d:
e.append(c)
if e == []:
print("TLE")
else:
print((min(e)))
| false | 33.333333 |
[
"-n, t = list(map(int, input().split()))",
"-minc = -1",
"-for i in range(n):",
"- ci, ti = list(map(int, input().split()))",
"- if ti <= t:",
"- if minc == -1:",
"- minc = ci",
"- else:",
"- minc = min(minc, ci)",
"-if minc == -1:",
"+a, b = list(map(int, input().split()))",
"+e = []",
"+for i in range(a):",
"+ c, d = list(map(int, input().split()))",
"+ if b >= d:",
"+ e.append(c)",
"+if e == []:",
"- print(minc)",
"+ print((min(e)))"
] | false | 0.034651 | 0.035663 | 0.971624 |
[
"s293710561",
"s934638298"
] |
u353919145
|
p02959
|
python
|
s908329113
|
s162117113
| 279 | 206 | 82,148 | 18,468 |
Accepted
|
Accepted
| 26.16 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
res = 0
for i in range(n):
t1 = min(a[i], b[i])
a[i] -= t1
b[i] -= t1
res += t1
t2 = min(a[i+1], b[i])
a[i+1] -= t2
b[i] -= t2
res += t2
print(res)
|
n=int(eval(input()))
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
ans=0
for i in range(n):
m=min(a[i],b[i])
ans+=m
a[i]-=m
b[i]-=m
m=min(a[i+1],b[i])
a[i+1]-=m
b[i]-=m
ans+=m
print(ans)
| 14 | 15 | 282 | 262 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
res = 0
for i in range(n):
t1 = min(a[i], b[i])
a[i] -= t1
b[i] -= t1
res += t1
t2 = min(a[i + 1], b[i])
a[i + 1] -= t2
b[i] -= t2
res += t2
print(res)
|
n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
ans = 0
for i in range(n):
m = min(a[i], b[i])
ans += m
a[i] -= m
b[i] -= m
m = min(a[i + 1], b[i])
a[i + 1] -= m
b[i] -= m
ans += m
print(ans)
| false | 6.666667 |
[
"-a = list(map(int, input().split()))",
"-b = list(map(int, input().split()))",
"-res = 0",
"+a = [int(i) for i in input().split()]",
"+b = [int(i) for i in input().split()]",
"+ans = 0",
"- t1 = min(a[i], b[i])",
"- a[i] -= t1",
"- b[i] -= t1",
"- res += t1",
"- t2 = min(a[i + 1], b[i])",
"- a[i + 1] -= t2",
"- b[i] -= t2",
"- res += t2",
"-print(res)",
"+ m = min(a[i], b[i])",
"+ ans += m",
"+ a[i] -= m",
"+ b[i] -= m",
"+ m = min(a[i + 1], b[i])",
"+ a[i + 1] -= m",
"+ b[i] -= m",
"+ ans += m",
"+print(ans)"
] | false | 0.038612 | 0.036228 | 1.065812 |
[
"s908329113",
"s162117113"
] |
u573754721
|
p02886
|
python
|
s092604410
|
s922062337
| 186 | 17 | 38,768 | 3,064 |
Accepted
|
Accepted
| 90.86 |
n=int(eval(input()))
d=list(map(int,input().split()))
c=0
for i in range(n):
for j in range(i+1,n):
c+=d[i]*d[j]
print(c)
|
n=int(eval(input()))
L=list(map(int,input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
ans+=L[i]*L[j]
print(ans)
| 8 | 8 | 135 | 147 |
n = int(eval(input()))
d = list(map(int, input().split()))
c = 0
for i in range(n):
for j in range(i + 1, n):
c += d[i] * d[j]
print(c)
|
n = int(eval(input()))
L = list(map(int, input().split()))
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += L[i] * L[j]
print(ans)
| false | 0 |
[
"-d = list(map(int, input().split()))",
"-c = 0",
"+L = list(map(int, input().split()))",
"+ans = 0",
"- c += d[i] * d[j]",
"-print(c)",
"+ ans += L[i] * L[j]",
"+print(ans)"
] | false | 0.110652 | 0.043674 | 2.533589 |
[
"s092604410",
"s922062337"
] |
u621935300
|
p03634
|
python
|
s642462376
|
s504373184
| 940 | 323 | 61,216 | 67,484 |
Accepted
|
Accepted
| 65.64 |
# -*- coding: utf-8 -*-
#幅優先探索
#TLE
import sys
from collections import deque
N=eval(input())
a=[[] for i in range(N+1)]
#隣接リスト
for i in range(N-1):
x,y,z=list(map(int,input().split()))
a[x].append((y,z))
a[y].append((x,z))
#print a
Q,K=list(map(int,input().split()))
b=[]
for i in range(Q):
b.append(list(map(int, input().split())))
#print b
#訪問判別フラグ
F=(N+1)*[0]
#Queue
q=deque()
#距離
dist=[0 for i in range(N+1)]
length=0
#幅優先探索
q.append(K)
while len(q)!=0:
v=q.popleft()
F[v]=1
for u,length in a[v]:
if F[u]==0:
q.append(u)
dist[u]=dist[v]+length
#print dist
for x in range(len(b)):
print(dist[ b[x][0] ]+ dist[ b[x][1] ])
|
import sys
from collections import deque
N=eval(input())
nl=[ [] for i in range(N+1) ]
for _ in range(N-1):
a,b,c=list(map(int, sys.stdin.readline().split()))
nl[a].append( (b,c) )
nl[b].append( (a,c) )
Q,K=list(map(int, sys.stdin.readline().split()))
question=[ list(map(int, sys.stdin.readline().split())) for i in range(Q) ]
Visit=[ None for i in range(N+1) ]
Visit[K]=0
q=deque()
q.append(K)
while q:
fro=q.popleft()
for to,cost in nl[fro]:
if Visit[to] is None:
Visit[to]=Visit[fro]+cost
q.append(to)
for x, y in question:
print(Visit[x]+Visit[y])
| 56 | 32 | 713 | 587 |
# -*- coding: utf-8 -*-
# 幅優先探索
# TLE
import sys
from collections import deque
N = eval(input())
a = [[] for i in range(N + 1)]
# 隣接リスト
for i in range(N - 1):
x, y, z = list(map(int, input().split()))
a[x].append((y, z))
a[y].append((x, z))
# print a
Q, K = list(map(int, input().split()))
b = []
for i in range(Q):
b.append(list(map(int, input().split())))
# print b
# 訪問判別フラグ
F = (N + 1) * [0]
# Queue
q = deque()
# 距離
dist = [0 for i in range(N + 1)]
length = 0
# 幅優先探索
q.append(K)
while len(q) != 0:
v = q.popleft()
F[v] = 1
for u, length in a[v]:
if F[u] == 0:
q.append(u)
dist[u] = dist[v] + length
# print dist
for x in range(len(b)):
print(dist[b[x][0]] + dist[b[x][1]])
|
import sys
from collections import deque
N = eval(input())
nl = [[] for i in range(N + 1)]
for _ in range(N - 1):
a, b, c = list(map(int, sys.stdin.readline().split()))
nl[a].append((b, c))
nl[b].append((a, c))
Q, K = list(map(int, sys.stdin.readline().split()))
question = [list(map(int, sys.stdin.readline().split())) for i in range(Q)]
Visit = [None for i in range(N + 1)]
Visit[K] = 0
q = deque()
q.append(K)
while q:
fro = q.popleft()
for to, cost in nl[fro]:
if Visit[to] is None:
Visit[to] = Visit[fro] + cost
q.append(to)
for x, y in question:
print(Visit[x] + Visit[y])
| false | 42.857143 |
[
"-# -*- coding: utf-8 -*-",
"-# 幅優先探索",
"-# TLE",
"-a = [[] for i in range(N + 1)]",
"-# 隣接リスト",
"-for i in range(N - 1):",
"- x, y, z = list(map(int, input().split()))",
"- a[x].append((y, z))",
"- a[y].append((x, z))",
"-# print a",
"-Q, K = list(map(int, input().split()))",
"-b = []",
"-for i in range(Q):",
"- b.append(list(map(int, input().split())))",
"-# print b",
"-# 訪問判別フラグ",
"-F = (N + 1) * [0]",
"-# Queue",
"+nl = [[] for i in range(N + 1)]",
"+for _ in range(N - 1):",
"+ a, b, c = list(map(int, sys.stdin.readline().split()))",
"+ nl[a].append((b, c))",
"+ nl[b].append((a, c))",
"+Q, K = list(map(int, sys.stdin.readline().split()))",
"+question = [list(map(int, sys.stdin.readline().split())) for i in range(Q)]",
"+Visit = [None for i in range(N + 1)]",
"+Visit[K] = 0",
"-# 距離",
"-dist = [0 for i in range(N + 1)]",
"-length = 0",
"-# 幅優先探索",
"-while len(q) != 0:",
"- v = q.popleft()",
"- F[v] = 1",
"- for u, length in a[v]:",
"- if F[u] == 0:",
"- q.append(u)",
"- dist[u] = dist[v] + length",
"-# print dist",
"-for x in range(len(b)):",
"- print(dist[b[x][0]] + dist[b[x][1]])",
"+while q:",
"+ fro = q.popleft()",
"+ for to, cost in nl[fro]:",
"+ if Visit[to] is None:",
"+ Visit[to] = Visit[fro] + cost",
"+ q.append(to)",
"+for x, y in question:",
"+ print(Visit[x] + Visit[y])"
] | false | 0.069952 | 0.126224 | 0.554187 |
[
"s642462376",
"s504373184"
] |
u368796742
|
p03946
|
python
|
s163387499
|
s017720686
| 70 | 56 | 14,252 | 14,252 |
Accepted
|
Accepted
| 20 |
n,t = list(map(int,input().split()))
l = list(map(int,input().split()))
ans = []
check = l[0]
dis = 0
for i in l:
if i < check:
check = i
dis = 0
else:
dis = i-check
ans.append(dis)
print((ans.count(max(ans))))
|
def main():
import sys
input = sys.stdin.readline
n,t = list(map(int,input().split()))
l = list(map(int,input().split()))
ans = []
check = l[0]
for i in l:
if i < check:
check = i
else:
dis = i-check
ans.append(dis)
print((ans.count(max(ans))))
if __name__ == "__main__":
main()
| 17 | 19 | 274 | 389 |
n, t = list(map(int, input().split()))
l = list(map(int, input().split()))
ans = []
check = l[0]
dis = 0
for i in l:
if i < check:
check = i
dis = 0
else:
dis = i - check
ans.append(dis)
print((ans.count(max(ans))))
|
def main():
import sys
input = sys.stdin.readline
n, t = list(map(int, input().split()))
l = list(map(int, input().split()))
ans = []
check = l[0]
for i in l:
if i < check:
check = i
else:
dis = i - check
ans.append(dis)
print((ans.count(max(ans))))
if __name__ == "__main__":
main()
| false | 10.526316 |
[
"-n, t = list(map(int, input().split()))",
"-l = list(map(int, input().split()))",
"-ans = []",
"-check = l[0]",
"-dis = 0",
"-for i in l:",
"- if i < check:",
"- check = i",
"- dis = 0",
"- else:",
"- dis = i - check",
"- ans.append(dis)",
"-print((ans.count(max(ans))))",
"+def main():",
"+ import sys",
"+",
"+ input = sys.stdin.readline",
"+ n, t = list(map(int, input().split()))",
"+ l = list(map(int, input().split()))",
"+ ans = []",
"+ check = l[0]",
"+ for i in l:",
"+ if i < check:",
"+ check = i",
"+ else:",
"+ dis = i - check",
"+ ans.append(dis)",
"+ print((ans.count(max(ans))))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.039946 | 0.044029 | 0.907254 |
[
"s163387499",
"s017720686"
] |
u966695319
|
p03283
|
python
|
s417336087
|
s663439160
| 2,781 | 2,568 | 53,744 | 54,232 |
Accepted
|
Accepted
| 7.66 |
N, M, Q = list(map(int, input().split()))
bord = [[0 for _ in range(N + 2)] for _ in range(N + 2)]
for _ in range(M):
left, right = list(map(int, input().split()))
bord[left][right] += 1
# print(bord)
for i in range(1, N + 2):
for j in range(1, N + 2):
bord[i][j] += bord[i][j - 1]
# print(bord)
for _ in range(Q):
left, right = list(map(int, input().split()))
cost = 0
for i in range(left, right + 1):
cost += bord[i][right] - bord[i][left - 1]
print(cost)
|
N, M, Q = list(map(int, input().split()))
areas = [[0 for _ in range(N + 2)] for _ in range(N + 2)]
for _ in range(M):
left, right = list(map(int, input().split()))
areas[left][right] += 1
# print(areas)
for i in range(1, N + 2):
for j in range(1, N + 2):
areas[i][j] += areas[i][j - 1]
# print(areas)
for _ in range(Q):
left, right = list(map(int, input().split()))
cost = 0
for i in range(left, right + 1):
cost += areas[i][right] - areas[i][left - 1]
print(cost)
| 17 | 17 | 501 | 509 |
N, M, Q = list(map(int, input().split()))
bord = [[0 for _ in range(N + 2)] for _ in range(N + 2)]
for _ in range(M):
left, right = list(map(int, input().split()))
bord[left][right] += 1
# print(bord)
for i in range(1, N + 2):
for j in range(1, N + 2):
bord[i][j] += bord[i][j - 1]
# print(bord)
for _ in range(Q):
left, right = list(map(int, input().split()))
cost = 0
for i in range(left, right + 1):
cost += bord[i][right] - bord[i][left - 1]
print(cost)
|
N, M, Q = list(map(int, input().split()))
areas = [[0 for _ in range(N + 2)] for _ in range(N + 2)]
for _ in range(M):
left, right = list(map(int, input().split()))
areas[left][right] += 1
# print(areas)
for i in range(1, N + 2):
for j in range(1, N + 2):
areas[i][j] += areas[i][j - 1]
# print(areas)
for _ in range(Q):
left, right = list(map(int, input().split()))
cost = 0
for i in range(left, right + 1):
cost += areas[i][right] - areas[i][left - 1]
print(cost)
| false | 0 |
[
"-bord = [[0 for _ in range(N + 2)] for _ in range(N + 2)]",
"+areas = [[0 for _ in range(N + 2)] for _ in range(N + 2)]",
"- bord[left][right] += 1",
"-# print(bord)",
"+ areas[left][right] += 1",
"+# print(areas)",
"- bord[i][j] += bord[i][j - 1]",
"-# print(bord)",
"+ areas[i][j] += areas[i][j - 1]",
"+# print(areas)",
"- cost += bord[i][right] - bord[i][left - 1]",
"+ cost += areas[i][right] - areas[i][left - 1]"
] | false | 0.043165 | 0.043923 | 0.982742 |
[
"s417336087",
"s663439160"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.