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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u079022693
|
p03252
|
python
|
s990984217
|
s844403125
| 200 | 55 | 3,632 | 3,632 |
Accepted
|
Accepted
| 72.5 |
def main():
S=eval(input())
T=eval(input())
X=[]
Y=[]
flag=True
for i in range(len(S)):
al=False
if T[i] in Y:
al=True
if X[Y.index(T[i])]!=S[i]:
flag=False
break
if S[i] in X:
al=True
if Y[X.index(S[i])]!=T[i]:
flag=False
break
if al==False:
X.append(S[i])
Y.append(T[i])
if flag:
print("Yes")
else:
print("No")
if __name__=="__main__":
main()
|
from sys import stdin
def main():
#入力
readline=stdin.readline
S=readline().strip()
T=readline().strip()
d=dict()
for i in range(len(S)):
if S[i] not in d:
d[S[i]]=T[i]
else:
if d[S[i]]!=T[i]:
print("No")
break
else:
li=list(d.items())
d2=dict()
for cs in li:
c1=cs[0]
c2=cs[1]
if c2 not in d2:
d2[c2]=c1
else:
if d2[c2]!=c1:
print("No")
break
else:
print("Yes")
if __name__=="__main__":
main()
| 28 | 31 | 580 | 692 |
def main():
S = eval(input())
T = eval(input())
X = []
Y = []
flag = True
for i in range(len(S)):
al = False
if T[i] in Y:
al = True
if X[Y.index(T[i])] != S[i]:
flag = False
break
if S[i] in X:
al = True
if Y[X.index(S[i])] != T[i]:
flag = False
break
if al == False:
X.append(S[i])
Y.append(T[i])
if flag:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
from sys import stdin
def main():
# 入力
readline = stdin.readline
S = readline().strip()
T = readline().strip()
d = dict()
for i in range(len(S)):
if S[i] not in d:
d[S[i]] = T[i]
else:
if d[S[i]] != T[i]:
print("No")
break
else:
li = list(d.items())
d2 = dict()
for cs in li:
c1 = cs[0]
c2 = cs[1]
if c2 not in d2:
d2[c2] = c1
else:
if d2[c2] != c1:
print("No")
break
else:
print("Yes")
if __name__ == "__main__":
main()
| false | 9.677419 |
[
"+from sys import stdin",
"+",
"+",
"- S = eval(input())",
"- T = eval(input())",
"- X = []",
"- Y = []",
"- flag = True",
"+ # 入力",
"+ readline = stdin.readline",
"+ S = readline().strip()",
"+ T = readline().strip()",
"+ d = dict()",
"- al = False",
"- if T[i] in Y:",
"- al = True",
"- if X[Y.index(T[i])] != S[i]:",
"- flag = False",
"+ if S[i] not in d:",
"+ d[S[i]] = T[i]",
"+ else:",
"+ if d[S[i]] != T[i]:",
"+ print(\"No\")",
"- if S[i] in X:",
"- al = True",
"- if Y[X.index(S[i])] != T[i]:",
"- flag = False",
"- break",
"- if al == False:",
"- X.append(S[i])",
"- Y.append(T[i])",
"- if flag:",
"- print(\"Yes\")",
"- print(\"No\")",
"+ li = list(d.items())",
"+ d2 = dict()",
"+ for cs in li:",
"+ c1 = cs[0]",
"+ c2 = cs[1]",
"+ if c2 not in d2:",
"+ d2[c2] = c1",
"+ else:",
"+ if d2[c2] != c1:",
"+ print(\"No\")",
"+ break",
"+ else:",
"+ print(\"Yes\")"
] | false | 0.046413 | 0.089404 | 0.519135 |
[
"s990984217",
"s844403125"
] |
u469254913
|
p02819
|
python
|
s038897781
|
s145651431
| 45 | 18 | 4,200 | 3,060 |
Accepted
|
Accepted
| 60 |
# import numpy as np
import math
import sys
input = sys.stdin.readline
X = int(eval(input()))
if X == 2:
print(X)
sys.exit()
def segment_sieve(a,b):
ass = []
is_prime_small = [True] * (int(b**0.5)+1)
is_prime = [True] * (b-a)
for i in range(2,int(b**0.5)):
if is_prime_small[i]:
j = 2*i
while j**2 < b:
is_prime_small[j] = False
j += i
j = max(2*i,((a+i-1)//i)*i)
while j < b:
is_prime[j-a] = False
j += i
for i in range(len(is_prime)):
if is_prime[i]:
ass.append(a+i)
if ass[0] == 1:
del ass[0]
return ass
list = segment_sieve(X,100004)
res = list[0]
print(res)
|
# import numpy as np
import math
import sys
input = sys.stdin.readline
X = int(eval(input()))
def is_prime(x):
if x <= 1:
return False
for i in range(2,int(math.sqrt(x))+1):
if x % i == 0:
return False
return True
while not is_prime(X):
X += 1
print(X)
| 36 | 19 | 781 | 313 |
# import numpy as np
import math
import sys
input = sys.stdin.readline
X = int(eval(input()))
if X == 2:
print(X)
sys.exit()
def segment_sieve(a, b):
ass = []
is_prime_small = [True] * (int(b**0.5) + 1)
is_prime = [True] * (b - a)
for i in range(2, int(b**0.5)):
if is_prime_small[i]:
j = 2 * i
while j**2 < b:
is_prime_small[j] = False
j += i
j = max(2 * i, ((a + i - 1) // i) * i)
while j < b:
is_prime[j - a] = False
j += i
for i in range(len(is_prime)):
if is_prime[i]:
ass.append(a + i)
if ass[0] == 1:
del ass[0]
return ass
list = segment_sieve(X, 100004)
res = list[0]
print(res)
|
# import numpy as np
import math
import sys
input = sys.stdin.readline
X = int(eval(input()))
def is_prime(x):
if x <= 1:
return False
for i in range(2, int(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
while not is_prime(X):
X += 1
print(X)
| false | 47.222222 |
[
"-if X == 2:",
"- print(X)",
"- sys.exit()",
"-def segment_sieve(a, b):",
"- ass = []",
"- is_prime_small = [True] * (int(b**0.5) + 1)",
"- is_prime = [True] * (b - a)",
"- for i in range(2, int(b**0.5)):",
"- if is_prime_small[i]:",
"- j = 2 * i",
"- while j**2 < b:",
"- is_prime_small[j] = False",
"- j += i",
"- j = max(2 * i, ((a + i - 1) // i) * i)",
"- while j < b:",
"- is_prime[j - a] = False",
"- j += i",
"- for i in range(len(is_prime)):",
"- if is_prime[i]:",
"- ass.append(a + i)",
"- if ass[0] == 1:",
"- del ass[0]",
"- return ass",
"+def is_prime(x):",
"+ if x <= 1:",
"+ return False",
"+ for i in range(2, int(math.sqrt(x)) + 1):",
"+ if x % i == 0:",
"+ return False",
"+ return True",
"-list = segment_sieve(X, 100004)",
"-res = list[0]",
"-print(res)",
"+while not is_prime(X):",
"+ X += 1",
"+print(X)"
] | false | 0.233514 | 0.039492 | 5.912927 |
[
"s038897781",
"s145651431"
] |
u528470578
|
p03166
|
python
|
s469321733
|
s588607893
| 394 | 364 | 115,628 | 121,900 |
Accepted
|
Accepted
| 7.61 |
import sys
sys.setrecursionlimit(10000)
# Longest path
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
graph[x-1].append(y-1)
dp = [-1 for _ in range(N)]
def rec(c):
if dp[c] != -1:
return dp[c]
res = 0
for i in graph[c]:
res = max(res, rec(i) + 1)
dp[c] = res
return res
for i in range(N):
rec(i)
print((max(dp)))
|
import sys
sys.setrecursionlimit(10000)
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
dp = [-1 for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
graph[x-1].append(y-1)
def rec(v):
if dp[v] >= 0:
return dp[v]
temp = 0
for next in graph[v]:
temp = max(rec(next) + 1, temp)
dp[v] = temp
return temp
for i in range(N):
rec(i)
print((max(dp)))
| 22 | 22 | 451 | 447 |
import sys
sys.setrecursionlimit(10000)
# Longest path
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
graph[x - 1].append(y - 1)
dp = [-1 for _ in range(N)]
def rec(c):
if dp[c] != -1:
return dp[c]
res = 0
for i in graph[c]:
res = max(res, rec(i) + 1)
dp[c] = res
return res
for i in range(N):
rec(i)
print((max(dp)))
|
import sys
sys.setrecursionlimit(10000)
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
dp = [-1 for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
graph[x - 1].append(y - 1)
def rec(v):
if dp[v] >= 0:
return dp[v]
temp = 0
for next in graph[v]:
temp = max(rec(next) + 1, temp)
dp[v] = temp
return temp
for i in range(N):
rec(i)
print((max(dp)))
| false | 0 |
[
"-# Longest path",
"+dp = [-1 for _ in range(N)]",
"-dp = [-1 for _ in range(N)]",
"-def rec(c):",
"- if dp[c] != -1:",
"- return dp[c]",
"- res = 0",
"- for i in graph[c]:",
"- res = max(res, rec(i) + 1)",
"- dp[c] = res",
"- return res",
"+def rec(v):",
"+ if dp[v] >= 0:",
"+ return dp[v]",
"+ temp = 0",
"+ for next in graph[v]:",
"+ temp = max(rec(next) + 1, temp)",
"+ dp[v] = temp",
"+ return temp"
] | false | 0.043517 | 0.042301 | 1.028756 |
[
"s469321733",
"s588607893"
] |
u820351940
|
p03168
|
python
|
s081206915
|
s942698357
| 958 | 496 | 237,576 | 145,672 |
Accepted
|
Accepted
| 48.23 |
import sys
sys.setrecursionlimit(10 ** 6)
import functools
import operator
n = int(eval(input()))
p = list(map(float, input().split()))
half = n // 2 + 1
dp = [[None] * (n + 1) for _ in range(n + 1)]
# def dfs(n, depth=n - 1):
# if depth < 0:
# return 0
#
# if dp[n][depth] is not None:
# return dp[n][depth]
#
# if n == 0:
# r = functools.reduce(operator.mul, map(lambda x: 1 - x, p[:depth + 1]))
# elif (n - 1) == depth:
# r = functools.reduce(operator.mul, p[:depth + 1])
# else:
# r = dfs(n - 1, depth - 1) * p[depth] + dfs(n, depth - 1) * (1 - p[depth])
# dp[n][depth] = r
# return r
#
# print(sum(dfs(i) for i in range(half, n + 1)))
for i in range(0, n + 1):
for depth in range(-1, n):
if depth == -1:
dp[i][depth] = 0
elif i == 0:
dp[i][depth] = functools.reduce(operator.mul, [1 - x for x in p[:depth + 1]])
elif (i - 1) == depth:
dp[i][depth] = functools.reduce(operator.mul, p[:depth + 1])
else:
dp[i][depth] = dp[i - 1][depth - 1] * p[depth] + dp[i][depth - 1] * (1 - p[depth])
print((sum(dp[i][n - 1] for i in range(half, n + 1))))
|
n = int(eval(input()))
a = list(map(float, input().split()))
# dp = [[None] * 1501 for i in range(3000)]
# def dfs(i=0, at=(n + 1) // 2):
# if i == n:
# return int(at <= 0)
# at = max(at, 0)
# if dp[i][at] is not None:
# return dp[i][at]
#
# r = dfs(i + 1, at - 1) * a[i] + dfs(i + 1, at) * (1 - a[i])
# dp[i][at] = r
# return r
# print(dfs())
dp = [[0] * 1501 for i in range(3000)]
dp[n][0] = 1
for i in reversed(list(range(n))):
for at in reversed(list(range((n + 1) // 2 + 1))):
r = dp[i + 1][max(0, at - 1)] * a[i] + dp[i + 1][at] * (1 - a[i])
dp[i][at] = r
print((dp[0][(n + 1) // 2]))
| 40 | 25 | 1,237 | 659 |
import sys
sys.setrecursionlimit(10**6)
import functools
import operator
n = int(eval(input()))
p = list(map(float, input().split()))
half = n // 2 + 1
dp = [[None] * (n + 1) for _ in range(n + 1)]
# def dfs(n, depth=n - 1):
# if depth < 0:
# return 0
#
# if dp[n][depth] is not None:
# return dp[n][depth]
#
# if n == 0:
# r = functools.reduce(operator.mul, map(lambda x: 1 - x, p[:depth + 1]))
# elif (n - 1) == depth:
# r = functools.reduce(operator.mul, p[:depth + 1])
# else:
# r = dfs(n - 1, depth - 1) * p[depth] + dfs(n, depth - 1) * (1 - p[depth])
# dp[n][depth] = r
# return r
#
# print(sum(dfs(i) for i in range(half, n + 1)))
for i in range(0, n + 1):
for depth in range(-1, n):
if depth == -1:
dp[i][depth] = 0
elif i == 0:
dp[i][depth] = functools.reduce(
operator.mul, [1 - x for x in p[: depth + 1]]
)
elif (i - 1) == depth:
dp[i][depth] = functools.reduce(operator.mul, p[: depth + 1])
else:
dp[i][depth] = dp[i - 1][depth - 1] * p[depth] + dp[i][depth - 1] * (
1 - p[depth]
)
print((sum(dp[i][n - 1] for i in range(half, n + 1))))
|
n = int(eval(input()))
a = list(map(float, input().split()))
# dp = [[None] * 1501 for i in range(3000)]
# def dfs(i=0, at=(n + 1) // 2):
# if i == n:
# return int(at <= 0)
# at = max(at, 0)
# if dp[i][at] is not None:
# return dp[i][at]
#
# r = dfs(i + 1, at - 1) * a[i] + dfs(i + 1, at) * (1 - a[i])
# dp[i][at] = r
# return r
# print(dfs())
dp = [[0] * 1501 for i in range(3000)]
dp[n][0] = 1
for i in reversed(list(range(n))):
for at in reversed(list(range((n + 1) // 2 + 1))):
r = dp[i + 1][max(0, at - 1)] * a[i] + dp[i + 1][at] * (1 - a[i])
dp[i][at] = r
print((dp[0][(n + 1) // 2]))
| false | 37.5 |
[
"-import sys",
"-",
"-sys.setrecursionlimit(10**6)",
"-import functools",
"-import operator",
"-",
"-p = list(map(float, input().split()))",
"-half = n // 2 + 1",
"-dp = [[None] * (n + 1) for _ in range(n + 1)]",
"-# def dfs(n, depth=n - 1):",
"-# if depth < 0:",
"-# return 0",
"+a = list(map(float, input().split()))",
"+# dp = [[None] * 1501 for i in range(3000)]",
"+# def dfs(i=0, at=(n + 1) // 2):",
"+# if i == n:",
"+# return int(at <= 0)",
"+# at = max(at, 0)",
"+# if dp[i][at] is not None:",
"+# return dp[i][at]",
"-# if dp[n][depth] is not None:",
"-# return dp[n][depth]",
"-#",
"-# if n == 0:",
"-# r = functools.reduce(operator.mul, map(lambda x: 1 - x, p[:depth + 1]))",
"-# elif (n - 1) == depth:",
"-# r = functools.reduce(operator.mul, p[:depth + 1])",
"-# else:",
"-# r = dfs(n - 1, depth - 1) * p[depth] + dfs(n, depth - 1) * (1 - p[depth])",
"-# dp[n][depth] = r",
"+# r = dfs(i + 1, at - 1) * a[i] + dfs(i + 1, at) * (1 - a[i])",
"+# dp[i][at] = r",
"-#",
"-# print(sum(dfs(i) for i in range(half, n + 1)))",
"-for i in range(0, n + 1):",
"- for depth in range(-1, n):",
"- if depth == -1:",
"- dp[i][depth] = 0",
"- elif i == 0:",
"- dp[i][depth] = functools.reduce(",
"- operator.mul, [1 - x for x in p[: depth + 1]]",
"- )",
"- elif (i - 1) == depth:",
"- dp[i][depth] = functools.reduce(operator.mul, p[: depth + 1])",
"- else:",
"- dp[i][depth] = dp[i - 1][depth - 1] * p[depth] + dp[i][depth - 1] * (",
"- 1 - p[depth]",
"- )",
"-print((sum(dp[i][n - 1] for i in range(half, n + 1))))",
"+# print(dfs())",
"+dp = [[0] * 1501 for i in range(3000)]",
"+dp[n][0] = 1",
"+for i in reversed(list(range(n))):",
"+ for at in reversed(list(range((n + 1) // 2 + 1))):",
"+ r = dp[i + 1][max(0, at - 1)] * a[i] + dp[i + 1][at] * (1 - a[i])",
"+ dp[i][at] = r",
"+print((dp[0][(n + 1) // 2]))"
] | false | 0.03784 | 0.126102 | 0.300079 |
[
"s081206915",
"s942698357"
] |
u046187684
|
p02900
|
python
|
s369407940
|
s568536636
| 372 | 142 | 14,344 | 5,048 |
Accepted
|
Accepted
| 61.83 |
from fractions import gcd
import numpy as np
def get_primes(n):
ans = 1
m = int(n**0.5) + 1
flags = np.zeros(m + 1, dtype=bool)
for i in range(2, m + 1):
if flags[i]:
continue
if n % i == 0:
ans += 1
while n % i == 0:
n //= i
flags[i:m + 1:i] = 1
return ans + 1 if n > 1 else ans
def solve(string):
a, b = list(map(int, string.split()))
g = gcd(a, b)
return str(get_primes(g))
if __name__ == '__main__':
print((solve(eval(input()))))
|
from fractions import gcd
def get_primes(n):
ans = 1 if n % 2 else 2
while n % 2 == 0:
n //= 2
for i in range(3, int(n**0.5) + 1, 2):
if n % i == 0:
ans += 1
while n % i == 0:
n //= i
return ans + 1 if n > 1 else ans
def solve(string):
a, b = list(map(int, string.split()))
g = gcd(a, b)
return str(get_primes(g))
if __name__ == '__main__':
print((solve(eval(input()))))
| 27 | 23 | 556 | 465 |
from fractions import gcd
import numpy as np
def get_primes(n):
ans = 1
m = int(n**0.5) + 1
flags = np.zeros(m + 1, dtype=bool)
for i in range(2, m + 1):
if flags[i]:
continue
if n % i == 0:
ans += 1
while n % i == 0:
n //= i
flags[i : m + 1 : i] = 1
return ans + 1 if n > 1 else ans
def solve(string):
a, b = list(map(int, string.split()))
g = gcd(a, b)
return str(get_primes(g))
if __name__ == "__main__":
print((solve(eval(input()))))
|
from fractions import gcd
def get_primes(n):
ans = 1 if n % 2 else 2
while n % 2 == 0:
n //= 2
for i in range(3, int(n**0.5) + 1, 2):
if n % i == 0:
ans += 1
while n % i == 0:
n //= i
return ans + 1 if n > 1 else ans
def solve(string):
a, b = list(map(int, string.split()))
g = gcd(a, b)
return str(get_primes(g))
if __name__ == "__main__":
print((solve(eval(input()))))
| false | 14.814815 |
[
"-import numpy as np",
"- ans = 1",
"- m = int(n**0.5) + 1",
"- flags = np.zeros(m + 1, dtype=bool)",
"- for i in range(2, m + 1):",
"- if flags[i]:",
"- continue",
"+ ans = 1 if n % 2 else 2",
"+ while n % 2 == 0:",
"+ n //= 2",
"+ for i in range(3, int(n**0.5) + 1, 2):",
"- flags[i : m + 1 : i] = 1"
] | false | 0.200422 | 0.043845 | 4.57116 |
[
"s369407940",
"s568536636"
] |
u347640436
|
p03329
|
python
|
s612939459
|
s627279836
| 713 | 421 | 3,828 | 3,828 |
Accepted
|
Accepted
| 40.95 |
# DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
if i + j <= N:
dp[i + j] = min(dp[i + j], dp[i] + 1)
if i + j == N:
break
print((dp[N]))
|
# DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
t = i + j
if t <= N and dp[t] > dp[i] + 1:
dp[t] = dp[i] + 1
if t == N:
break
print((dp[N]))
| 24 | 25 | 368 | 381 |
# DP(配るDP)
INF = float("inf")
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
if i + j <= N:
dp[i + j] = min(dp[i + j], dp[i] + 1)
if i + j == N:
break
print((dp[N]))
|
# DP(配るDP)
INF = float("inf")
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
t = i + j
if t <= N and dp[t] > dp[i] + 1:
dp[t] = dp[i] + 1
if t == N:
break
print((dp[N]))
| false | 4 |
[
"- if i + j <= N:",
"- dp[i + j] = min(dp[i + j], dp[i] + 1)",
"- if i + j == N:",
"+ t = i + j",
"+ if t <= N and dp[t] > dp[i] + 1:",
"+ dp[t] = dp[i] + 1",
"+ if t == N:"
] | false | 0.244395 | 0.121032 | 2.019267 |
[
"s612939459",
"s627279836"
] |
u017810624
|
p02918
|
python
|
s307814297
|
s096595910
| 43 | 38 | 3,316 | 4,084 |
Accepted
|
Accepted
| 11.63 |
n,k=list(map(int,input().split()))
s=eval(input())
ct=0
for i in range(n-1):
if s[i]==s[i+1]:ct+=1
print((min(ct+2*k,n-1)))
|
n,k=list(map(int,input().split()))
s=list(eval(input()))
ct=0
for i in range(n-1):
if s[i]=='R' and s[i+1]=='L':
ct+=1
x=ct
ct-=min(ct,k)
ct*=2
if s[0]==s[n-1]:
ct+=1
elif s[0]=='L':
if x<k:
ct+=1
else:
ct+=2
else:
if x<=k:
ct+=1
print((n-ct))
| 6 | 20 | 116 | 274 |
n, k = list(map(int, input().split()))
s = eval(input())
ct = 0
for i in range(n - 1):
if s[i] == s[i + 1]:
ct += 1
print((min(ct + 2 * k, n - 1)))
|
n, k = list(map(int, input().split()))
s = list(eval(input()))
ct = 0
for i in range(n - 1):
if s[i] == "R" and s[i + 1] == "L":
ct += 1
x = ct
ct -= min(ct, k)
ct *= 2
if s[0] == s[n - 1]:
ct += 1
elif s[0] == "L":
if x < k:
ct += 1
else:
ct += 2
else:
if x <= k:
ct += 1
print((n - ct))
| false | 70 |
[
"-s = eval(input())",
"+s = list(eval(input()))",
"- if s[i] == s[i + 1]:",
"+ if s[i] == \"R\" and s[i + 1] == \"L\":",
"-print((min(ct + 2 * k, n - 1)))",
"+x = ct",
"+ct -= min(ct, k)",
"+ct *= 2",
"+if s[0] == s[n - 1]:",
"+ ct += 1",
"+elif s[0] == \"L\":",
"+ if x < k:",
"+ ct += 1",
"+ else:",
"+ ct += 2",
"+else:",
"+ if x <= k:",
"+ ct += 1",
"+print((n - ct))"
] | false | 0.041798 | 0.041773 | 1.00059 |
[
"s307814297",
"s096595910"
] |
u608088992
|
p03425
|
python
|
s686865280
|
s952357184
| 78 | 54 | 3,064 | 9,076 |
Accepted
|
Accepted
| 30.77 |
import sys
def solve():
input = sys.stdin.readline
nameCount = [0] * 5
N = int(eval(input()))
for _ in range(N):
s = input().strip("\n")
if s[0] == "M": nameCount[0] += 1
elif s[0] == "A": nameCount[1] += 1
elif s[0] == "R": nameCount[2] += 1
elif s[0] == "C": nameCount[3] += 1
elif s[0] == "H": nameCount[4] += 1
else: continue
Ans = 0
for i in range(3):
for j in range(i+1, 4):
for k in range(j + 1, 5):
Ans += nameCount[i] * nameCount[j] * nameCount[k]
print(Ans)
return 0
if __name__ == "__main__":
solve()
|
import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
D = dict()
W = ["M", "A", "R", "C", "H"]
for w in W: D[w] = 0
for _ in range(N):
S = input().strip("\n")
if S[0] in W:
D[S[0]] += 1
ans = 0
for i in range(3):
for j in range(i+1, 4):
for k in range(j+1, 5):
ans += D[W[i]] * D[W[j]] * D[W[k]]
print(ans)
return 0
if __name__ == "__main__":
solve()
| 26 | 24 | 662 | 503 |
import sys
def solve():
input = sys.stdin.readline
nameCount = [0] * 5
N = int(eval(input()))
for _ in range(N):
s = input().strip("\n")
if s[0] == "M":
nameCount[0] += 1
elif s[0] == "A":
nameCount[1] += 1
elif s[0] == "R":
nameCount[2] += 1
elif s[0] == "C":
nameCount[3] += 1
elif s[0] == "H":
nameCount[4] += 1
else:
continue
Ans = 0
for i in range(3):
for j in range(i + 1, 4):
for k in range(j + 1, 5):
Ans += nameCount[i] * nameCount[j] * nameCount[k]
print(Ans)
return 0
if __name__ == "__main__":
solve()
|
import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
D = dict()
W = ["M", "A", "R", "C", "H"]
for w in W:
D[w] = 0
for _ in range(N):
S = input().strip("\n")
if S[0] in W:
D[S[0]] += 1
ans = 0
for i in range(3):
for j in range(i + 1, 4):
for k in range(j + 1, 5):
ans += D[W[i]] * D[W[j]] * D[W[k]]
print(ans)
return 0
if __name__ == "__main__":
solve()
| false | 7.692308 |
[
"- nameCount = [0] * 5",
"+ D = dict()",
"+ W = [\"M\", \"A\", \"R\", \"C\", \"H\"]",
"+ for w in W:",
"+ D[w] = 0",
"- s = input().strip(\"\\n\")",
"- if s[0] == \"M\":",
"- nameCount[0] += 1",
"- elif s[0] == \"A\":",
"- nameCount[1] += 1",
"- elif s[0] == \"R\":",
"- nameCount[2] += 1",
"- elif s[0] == \"C\":",
"- nameCount[3] += 1",
"- elif s[0] == \"H\":",
"- nameCount[4] += 1",
"- else:",
"- continue",
"- Ans = 0",
"+ S = input().strip(\"\\n\")",
"+ if S[0] in W:",
"+ D[S[0]] += 1",
"+ ans = 0",
"- Ans += nameCount[i] * nameCount[j] * nameCount[k]",
"- print(Ans)",
"+ ans += D[W[i]] * D[W[j]] * D[W[k]]",
"+ print(ans)"
] | false | 0.097816 | 0.039395 | 2.482979 |
[
"s686865280",
"s952357184"
] |
u600402037
|
p03014
|
python
|
s407208019
|
s588416186
| 1,079 | 963 | 114,396 | 71,528 |
Accepted
|
Accepted
| 10.75 |
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
S = [list(sr()) for _ in range(H)]
S = np.array([[1 if x == '.' else 0 for x in row] for row in S], np.bool)
up = np.zeros((H, W), np.int32)
down = np.zeros((H, W), np.int32)
right = np.zeros((H, W), np.int32)
left = np.zeros((H, W), np.int32)
for i in range(H-1):
up[i+1] = (1+up[i]) * S[i]
for i in range(H-1, 0, -1):
down[i-1] = (1+down[i]) * S[i]
for i in range(W-1):
left[:, i+1] = (1+left[:, i]) * S[:, i]
for i in range(W-1, 0, -1):
right[:, i-1] = (1+right[:, i]) * S[:, i]
answer = ((up + down + left + right) * S).max() + 1
print(answer)
|
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
S = np.array(['#' * (W+2)] + ['#' + sr() + '#' for _ in range(H)] + ['#' * (W+2)])
S = np.array([[x == '.' for x in row] for row in S])
S = S.astype(np.int16)
left = S.copy(); right = S.copy(); up = S.copy(); down = S.copy()
for i in range(1, W+1):
left[:, i] += left[:, i-1]
left[:, i] *= S[:, i]
for i in range(W, 0, -1):
right[:, i] += right[:, i+1]
right[:, i] *= S[:, i]
for i in range(1, H+1):
up[i, :] += up[i-1, :]
up[i, :] *= S[i, :]
for i in range(H, 0, -1):
down[i, :] += down[i+1, :]
down[i, :] *= S[i, :]
answer = (left + right + up + down - 3).max()
print(answer)
| 26 | 28 | 758 | 806 |
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
S = [list(sr()) for _ in range(H)]
S = np.array([[1 if x == "." else 0 for x in row] for row in S], np.bool)
up = np.zeros((H, W), np.int32)
down = np.zeros((H, W), np.int32)
right = np.zeros((H, W), np.int32)
left = np.zeros((H, W), np.int32)
for i in range(H - 1):
up[i + 1] = (1 + up[i]) * S[i]
for i in range(H - 1, 0, -1):
down[i - 1] = (1 + down[i]) * S[i]
for i in range(W - 1):
left[:, i + 1] = (1 + left[:, i]) * S[:, i]
for i in range(W - 1, 0, -1):
right[:, i - 1] = (1 + right[:, i]) * S[:, i]
answer = ((up + down + left + right) * S).max() + 1
print(answer)
|
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
S = np.array(["#" * (W + 2)] + ["#" + sr() + "#" for _ in range(H)] + ["#" * (W + 2)])
S = np.array([[x == "." for x in row] for row in S])
S = S.astype(np.int16)
left = S.copy()
right = S.copy()
up = S.copy()
down = S.copy()
for i in range(1, W + 1):
left[:, i] += left[:, i - 1]
left[:, i] *= S[:, i]
for i in range(W, 0, -1):
right[:, i] += right[:, i + 1]
right[:, i] *= S[:, i]
for i in range(1, H + 1):
up[i, :] += up[i - 1, :]
up[i, :] *= S[i, :]
for i in range(H, 0, -1):
down[i, :] += down[i + 1, :]
down[i, :] *= S[i, :]
answer = (left + right + up + down - 3).max()
print(answer)
| false | 7.142857 |
[
"-S = [list(sr()) for _ in range(H)]",
"-S = np.array([[1 if x == \".\" else 0 for x in row] for row in S], np.bool)",
"-up = np.zeros((H, W), np.int32)",
"-down = np.zeros((H, W), np.int32)",
"-right = np.zeros((H, W), np.int32)",
"-left = np.zeros((H, W), np.int32)",
"-for i in range(H - 1):",
"- up[i + 1] = (1 + up[i]) * S[i]",
"-for i in range(H - 1, 0, -1):",
"- down[i - 1] = (1 + down[i]) * S[i]",
"-for i in range(W - 1):",
"- left[:, i + 1] = (1 + left[:, i]) * S[:, i]",
"-for i in range(W - 1, 0, -1):",
"- right[:, i - 1] = (1 + right[:, i]) * S[:, i]",
"-answer = ((up + down + left + right) * S).max() + 1",
"+S = np.array([\"#\" * (W + 2)] + [\"#\" + sr() + \"#\" for _ in range(H)] + [\"#\" * (W + 2)])",
"+S = np.array([[x == \".\" for x in row] for row in S])",
"+S = S.astype(np.int16)",
"+left = S.copy()",
"+right = S.copy()",
"+up = S.copy()",
"+down = S.copy()",
"+for i in range(1, W + 1):",
"+ left[:, i] += left[:, i - 1]",
"+ left[:, i] *= S[:, i]",
"+for i in range(W, 0, -1):",
"+ right[:, i] += right[:, i + 1]",
"+ right[:, i] *= S[:, i]",
"+for i in range(1, H + 1):",
"+ up[i, :] += up[i - 1, :]",
"+ up[i, :] *= S[i, :]",
"+for i in range(H, 0, -1):",
"+ down[i, :] += down[i + 1, :]",
"+ down[i, :] *= S[i, :]",
"+answer = (left + right + up + down - 3).max()"
] | false | 0.267913 | 0.325157 | 0.82395 |
[
"s407208019",
"s588416186"
] |
u987164499
|
p02820
|
python
|
s332338988
|
s656244009
| 202 | 117 | 9,504 | 5,556 |
Accepted
|
Accepted
| 42.08 |
from sys import stdin
from itertools import groupby
import math
n,k = [int(x) for x in stdin.readline().rstrip().split()]
r,s,p = [int(x) for x in stdin.readline().rstrip().split()]
t = stdin.readline().rstrip()
t = [i for i in t]
point = 0
for i in range(k):
li = t[i::k]
lin = []
for key, value in groupby(li):
lin.append((key,len(list(value))))
for j in lin:
if j[0] == "r":
point += math.ceil(j[1]/2)*p
elif j[0] == "s":
point += math.ceil(j[1]/2)*r
else:
point += math.ceil(j[1]/2)*s
print(point)
|
from itertools import groupby
n,k = list(map(int,input().split()))
r,s,p = list(map(int,input().split()))
t = list(eval(input()))
point = 0
for i in range(k):
li = ["x"]+t[i::k]
for j in range(1,len(li)):
if li[j-1] == li[j]:
li[j] = "x"
continue
if li[j] == "r":
point += p
elif li[j] == "s":
point += r
else:
point += s
print(point)
| 24 | 22 | 612 | 445 |
from sys import stdin
from itertools import groupby
import math
n, k = [int(x) for x in stdin.readline().rstrip().split()]
r, s, p = [int(x) for x in stdin.readline().rstrip().split()]
t = stdin.readline().rstrip()
t = [i for i in t]
point = 0
for i in range(k):
li = t[i::k]
lin = []
for key, value in groupby(li):
lin.append((key, len(list(value))))
for j in lin:
if j[0] == "r":
point += math.ceil(j[1] / 2) * p
elif j[0] == "s":
point += math.ceil(j[1] / 2) * r
else:
point += math.ceil(j[1] / 2) * s
print(point)
|
from itertools import groupby
n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = list(eval(input()))
point = 0
for i in range(k):
li = ["x"] + t[i::k]
for j in range(1, len(li)):
if li[j - 1] == li[j]:
li[j] = "x"
continue
if li[j] == "r":
point += p
elif li[j] == "s":
point += r
else:
point += s
print(point)
| false | 8.333333 |
[
"-from sys import stdin",
"-import math",
"-n, k = [int(x) for x in stdin.readline().rstrip().split()]",
"-r, s, p = [int(x) for x in stdin.readline().rstrip().split()]",
"-t = stdin.readline().rstrip()",
"-t = [i for i in t]",
"+n, k = list(map(int, input().split()))",
"+r, s, p = list(map(int, input().split()))",
"+t = list(eval(input()))",
"- li = t[i::k]",
"- lin = []",
"- for key, value in groupby(li):",
"- lin.append((key, len(list(value))))",
"- for j in lin:",
"- if j[0] == \"r\":",
"- point += math.ceil(j[1] / 2) * p",
"- elif j[0] == \"s\":",
"- point += math.ceil(j[1] / 2) * r",
"+ li = [\"x\"] + t[i::k]",
"+ for j in range(1, len(li)):",
"+ if li[j - 1] == li[j]:",
"+ li[j] = \"x\"",
"+ continue",
"+ if li[j] == \"r\":",
"+ point += p",
"+ elif li[j] == \"s\":",
"+ point += r",
"- point += math.ceil(j[1] / 2) * s",
"+ point += s"
] | false | 0.082646 | 0.037854 | 2.183291 |
[
"s332338988",
"s656244009"
] |
u893063840
|
p02937
|
python
|
s509961542
|
s412382448
| 236 | 180 | 12,020 | 12,276 |
Accepted
|
Accepted
| 23.73 |
from bisect import bisect_left
s = eval(input())
t = eval(input())
l = len(s)
ss = s * 2
let = [[] for _ in range(26)]
for i, e in enumerate(ss, 1):
idx = ord(e) - ord("a")
let[idx].append(i)
for e in t:
idx = ord(e) - ord("a")
if not let[idx]:
print((-1))
exit()
i = 1
times = 0
for e in t:
j = ord(e) - ord("a")
choose = bisect_left(let[j], i)
q, r = divmod(let[j][choose], l)
times += q
i = r + 1
ans = times * l + i - 1
print(ans)
|
from collections import Counter, defaultdict
from bisect import bisect_right
s = eval(input())
t = eval(input())
c = Counter(s)
for e in t:
if c[e] == 0:
print((-1))
exit()
ss = s + s
d = defaultdict(list)
for i, e in enumerate(ss):
d[e].append(i)
now = -1
ans = 0
for e in t:
i = bisect_right(d[e], now)
nxt = d[e][i]
ans += nxt - now
now = nxt % len(s)
print(ans)
| 30 | 26 | 508 | 422 |
from bisect import bisect_left
s = eval(input())
t = eval(input())
l = len(s)
ss = s * 2
let = [[] for _ in range(26)]
for i, e in enumerate(ss, 1):
idx = ord(e) - ord("a")
let[idx].append(i)
for e in t:
idx = ord(e) - ord("a")
if not let[idx]:
print((-1))
exit()
i = 1
times = 0
for e in t:
j = ord(e) - ord("a")
choose = bisect_left(let[j], i)
q, r = divmod(let[j][choose], l)
times += q
i = r + 1
ans = times * l + i - 1
print(ans)
|
from collections import Counter, defaultdict
from bisect import bisect_right
s = eval(input())
t = eval(input())
c = Counter(s)
for e in t:
if c[e] == 0:
print((-1))
exit()
ss = s + s
d = defaultdict(list)
for i, e in enumerate(ss):
d[e].append(i)
now = -1
ans = 0
for e in t:
i = bisect_right(d[e], now)
nxt = d[e][i]
ans += nxt - now
now = nxt % len(s)
print(ans)
| false | 13.333333 |
[
"-from bisect import bisect_left",
"+from collections import Counter, defaultdict",
"+from bisect import bisect_right",
"-l = len(s)",
"-ss = s * 2",
"-let = [[] for _ in range(26)]",
"-for i, e in enumerate(ss, 1):",
"- idx = ord(e) - ord(\"a\")",
"- let[idx].append(i)",
"+c = Counter(s)",
"- idx = ord(e) - ord(\"a\")",
"- if not let[idx]:",
"+ if c[e] == 0:",
"-i = 1",
"-times = 0",
"+ss = s + s",
"+d = defaultdict(list)",
"+for i, e in enumerate(ss):",
"+ d[e].append(i)",
"+now = -1",
"+ans = 0",
"- j = ord(e) - ord(\"a\")",
"- choose = bisect_left(let[j], i)",
"- q, r = divmod(let[j][choose], l)",
"- times += q",
"- i = r + 1",
"-ans = times * l + i - 1",
"+ i = bisect_right(d[e], now)",
"+ nxt = d[e][i]",
"+ ans += nxt - now",
"+ now = nxt % len(s)"
] | false | 0.037168 | 0.093522 | 0.397426 |
[
"s509961542",
"s412382448"
] |
u046187684
|
p02629
|
python
|
s663833111
|
s798832532
| 39 | 35 | 9,904 | 9,924 |
Accepted
|
Accepted
| 10.26 |
from string import ascii_lowercase
from itertools import accumulate
def solve(string):
n = int(string)
t = [0] + [len(ascii_lowercase)**i for i in range(1, 12)]
*t, = accumulate(t)
l = 0
ans = ""
while t[l] < n:
l += 1
n -= t[l - 1] + 1
for i in range(l - 1):
j, n = divmod(n, len(ascii_lowercase)**(l - i - 1))
ans += ascii_lowercase[j]
ans += ascii_lowercase[n]
return ans
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
|
from string import ascii_lowercase
def solve(string):
n = int(string)
ans = ""
while n:
n, c = divmod(n - 1, len(ascii_lowercase))
ans = ascii_lowercase[c] + ans
return ans
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
| 23 | 15 | 550 | 308 |
from string import ascii_lowercase
from itertools import accumulate
def solve(string):
n = int(string)
t = [0] + [len(ascii_lowercase) ** i for i in range(1, 12)]
(*t,) = accumulate(t)
l = 0
ans = ""
while t[l] < n:
l += 1
n -= t[l - 1] + 1
for i in range(l - 1):
j, n = divmod(n, len(ascii_lowercase) ** (l - i - 1))
ans += ascii_lowercase[j]
ans += ascii_lowercase[n]
return ans
if __name__ == "__main__":
import sys
print((solve(sys.stdin.read().strip())))
|
from string import ascii_lowercase
def solve(string):
n = int(string)
ans = ""
while n:
n, c = divmod(n - 1, len(ascii_lowercase))
ans = ascii_lowercase[c] + ans
return ans
if __name__ == "__main__":
import sys
print((solve(sys.stdin.read().strip())))
| false | 34.782609 |
[
"-from itertools import accumulate",
"- t = [0] + [len(ascii_lowercase) ** i for i in range(1, 12)]",
"- (*t,) = accumulate(t)",
"- l = 0",
"- while t[l] < n:",
"- l += 1",
"- n -= t[l - 1] + 1",
"- for i in range(l - 1):",
"- j, n = divmod(n, len(ascii_lowercase) ** (l - i - 1))",
"- ans += ascii_lowercase[j]",
"- ans += ascii_lowercase[n]",
"+ while n:",
"+ n, c = divmod(n - 1, len(ascii_lowercase))",
"+ ans = ascii_lowercase[c] + ans"
] | false | 0.054161 | 0.054803 | 0.98827 |
[
"s663833111",
"s798832532"
] |
u052499405
|
p03208
|
python
|
s367111548
|
s066191564
| 257 | 137 | 10,940 | 7,884 |
Accepted
|
Accepted
| 46.69 |
n,k = [int(item) for item in input().split()]
h = [int(eval(input())) for _ in range(n)]
h = sorted(h)
diff_h = []
for i in range(n-(k-1)):
diff_h.append(h[i+k-1] - h[i])
print((min(diff_h)))
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
h = []
for _ in range(n):
h.append(int(eval(input())))
h.sort()
min_diff = 10**9
for hl, hr in zip(h, h[k-1:]):
min_diff = min(min_diff, hr - hl)
print(min_diff)
| 10 | 14 | 199 | 272 |
n, k = [int(item) for item in input().split()]
h = [int(eval(input())) for _ in range(n)]
h = sorted(h)
diff_h = []
for i in range(n - (k - 1)):
diff_h.append(h[i + k - 1] - h[i])
print((min(diff_h)))
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
h = []
for _ in range(n):
h.append(int(eval(input())))
h.sort()
min_diff = 10**9
for hl, hr in zip(h, h[k - 1 :]):
min_diff = min(min_diff, hr - hl)
print(min_diff)
| false | 28.571429 |
[
"-n, k = [int(item) for item in input().split()]",
"-h = [int(eval(input())) for _ in range(n)]",
"-h = sorted(h)",
"-diff_h = []",
"-for i in range(n - (k - 1)):",
"- diff_h.append(h[i + k - 1] - h[i])",
"-print((min(diff_h)))",
"+#!/usr/bin/env python3",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+n, k = list(map(int, input().split()))",
"+h = []",
"+for _ in range(n):",
"+ h.append(int(eval(input())))",
"+h.sort()",
"+min_diff = 10**9",
"+for hl, hr in zip(h, h[k - 1 :]):",
"+ min_diff = min(min_diff, hr - hl)",
"+print(min_diff)"
] | false | 0.040724 | 0.035071 | 1.161184 |
[
"s367111548",
"s066191564"
] |
u342537066
|
p00009
|
python
|
s089648361
|
s596587406
| 2,260 | 690 | 14,584 | 14,560 |
Accepted
|
Accepted
| 69.47 |
lis=[True for i in range(int(1e6+1))]
lis[0]=lis[1]=False
end=int(1e6**0.5)
for i in range(end+1):
if lis[i]:
for j in range(i*2,int(1e6+1),i):
lis[j]=False
while True:
try:
n=int(eval(input()))
cnt=0
for i in range(n+1):
if lis[i]:cnt+=1
print(cnt)
except EOFError:
break
|
def sieve(n):
p=[True for i in range(n+1)]
p[0]=p[1]=False
end=int(n**0.5)
for i in range(2,end+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=False
return p
def solve(n):
if n<2:return 0
cnt=1
for i in range(3,n+1,2):
if p[i]:cnt+=1
return cnt
p=sieve(int(1e6))
while True:
try:
n=int(eval(input()))
print((solve(n)))
except:
break
| 20 | 28 | 389 | 467 |
lis = [True for i in range(int(1e6 + 1))]
lis[0] = lis[1] = False
end = int(1e6**0.5)
for i in range(end + 1):
if lis[i]:
for j in range(i * 2, int(1e6 + 1), i):
lis[j] = False
while True:
try:
n = int(eval(input()))
cnt = 0
for i in range(n + 1):
if lis[i]:
cnt += 1
print(cnt)
except EOFError:
break
|
def sieve(n):
p = [True for i in range(n + 1)]
p[0] = p[1] = False
end = int(n**0.5)
for i in range(2, end + 1):
if p[i]:
for j in range(i * i, n + 1, i):
p[j] = False
return p
def solve(n):
if n < 2:
return 0
cnt = 1
for i in range(3, n + 1, 2):
if p[i]:
cnt += 1
return cnt
p = sieve(int(1e6))
while True:
try:
n = int(eval(input()))
print((solve(n)))
except:
break
| false | 28.571429 |
[
"-lis = [True for i in range(int(1e6 + 1))]",
"-lis[0] = lis[1] = False",
"-end = int(1e6**0.5)",
"-for i in range(end + 1):",
"- if lis[i]:",
"- for j in range(i * 2, int(1e6 + 1), i):",
"- lis[j] = False",
"+def sieve(n):",
"+ p = [True for i in range(n + 1)]",
"+ p[0] = p[1] = False",
"+ end = int(n**0.5)",
"+ for i in range(2, end + 1):",
"+ if p[i]:",
"+ for j in range(i * i, n + 1, i):",
"+ p[j] = False",
"+ return p",
"+",
"+",
"+def solve(n):",
"+ if n < 2:",
"+ return 0",
"+ cnt = 1",
"+ for i in range(3, n + 1, 2):",
"+ if p[i]:",
"+ cnt += 1",
"+ return cnt",
"+",
"+",
"+p = sieve(int(1e6))",
"- cnt = 0",
"- for i in range(n + 1):",
"- if lis[i]:",
"- cnt += 1",
"- print(cnt)",
"- except EOFError:",
"+ print((solve(n)))",
"+ except:"
] | false | 0.604578 | 0.75304 | 0.80285 |
[
"s089648361",
"s596587406"
] |
u581511366
|
p02577
|
python
|
s803081427
|
s405282497
| 208 | 58 | 9,224 | 9,252 |
Accepted
|
Accepted
| 72.12 |
def main(n: int):
if n % 9 == 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main(int(eval(input())))
|
def main():
n = eval(input())
res = 0
for ni in n:
res = (res + int(ni)) % 9
print((('Yes', 'No')[res != 0]))
if __name__ == '__main__':
main()
| 9 | 11 | 148 | 177 |
def main(n: int):
if n % 9 == 0:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main(int(eval(input())))
|
def main():
n = eval(input())
res = 0
for ni in n:
res = (res + int(ni)) % 9
print((("Yes", "No")[res != 0]))
if __name__ == "__main__":
main()
| false | 18.181818 |
[
"-def main(n: int):",
"- if n % 9 == 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")",
"+def main():",
"+ n = eval(input())",
"+ res = 0",
"+ for ni in n:",
"+ res = (res + int(ni)) % 9",
"+ print(((\"Yes\", \"No\")[res != 0]))",
"- main(int(eval(input())))",
"+ main()"
] | false | 0.095784 | 0.076378 | 1.254076 |
[
"s803081427",
"s405282497"
] |
u989345508
|
p03610
|
python
|
s285879322
|
s289730381
| 36 | 17 | 3,188 | 3,188 |
Accepted
|
Accepted
| 52.78 |
s=eval(input())
l=len(s)
t=""
for i in range(l):
if i%2==0:
t+=s[i]
print(t)
|
s=eval(input())
print((s[0:len(s):2]))
| 7 | 2 | 89 | 32 |
s = eval(input())
l = len(s)
t = ""
for i in range(l):
if i % 2 == 0:
t += s[i]
print(t)
|
s = eval(input())
print((s[0 : len(s) : 2]))
| false | 71.428571 |
[
"-l = len(s)",
"-t = \"\"",
"-for i in range(l):",
"- if i % 2 == 0:",
"- t += s[i]",
"-print(t)",
"+print((s[0 : len(s) : 2]))"
] | false | 0.039043 | 0.041625 | 0.937968 |
[
"s285879322",
"s289730381"
] |
u368249389
|
p02780
|
python
|
s525071683
|
s979659344
| 691 | 247 | 71,792 | 71,792 |
Accepted
|
Accepted
| 64.25 |
N, K = list(map(int, input().split()))
p_list = list(map(int, input().split()))
loop_time = N - K
l_s = 0
l_e = K
max_score = 0
test_score = 0
# initial process
ans_list = p_list[l_s:l_e]
for j in ans_list:
max_score += sum(range(1,j+1)) / j
test_score = max_score
l_s = l_s + 1
for i in range(loop_time):
# pop process
pop_e = p_list[l_s-1]
test_score = test_score - sum(range(1,pop_e+1)) / pop_e
# push process
push_e = p_list[l_e]
test_score = test_score + sum(range(1,push_e+1)) / push_e
if test_score > max_score:
max_score = test_score
l_s = l_s + 1
l_e = l_e + 1
print(max_score)
|
# Problem D - Dice in Line
# input
N, K = list(map(int, input().split()))
p_list = list(map(int, input().split()))
# initialization
kitai_list = [0]*N
for i in range(N):
p = p_list[i]
p_sum = (1 + p)*p / 2
p_ave = p_sum / p
kitai_list[i] = p_ave
max_score = -1
# count
tmp = 0
for i in range(N):
if i-K<0:
tmp += kitai_list[i]
max_score = max(max_score, tmp)
else:
tmp -= kitai_list[i-K]
tmp += kitai_list[i]
max_score = max(max_score, tmp)
# output
print(max_score)
| 29 | 28 | 665 | 556 |
N, K = list(map(int, input().split()))
p_list = list(map(int, input().split()))
loop_time = N - K
l_s = 0
l_e = K
max_score = 0
test_score = 0
# initial process
ans_list = p_list[l_s:l_e]
for j in ans_list:
max_score += sum(range(1, j + 1)) / j
test_score = max_score
l_s = l_s + 1
for i in range(loop_time):
# pop process
pop_e = p_list[l_s - 1]
test_score = test_score - sum(range(1, pop_e + 1)) / pop_e
# push process
push_e = p_list[l_e]
test_score = test_score + sum(range(1, push_e + 1)) / push_e
if test_score > max_score:
max_score = test_score
l_s = l_s + 1
l_e = l_e + 1
print(max_score)
|
# Problem D - Dice in Line
# input
N, K = list(map(int, input().split()))
p_list = list(map(int, input().split()))
# initialization
kitai_list = [0] * N
for i in range(N):
p = p_list[i]
p_sum = (1 + p) * p / 2
p_ave = p_sum / p
kitai_list[i] = p_ave
max_score = -1
# count
tmp = 0
for i in range(N):
if i - K < 0:
tmp += kitai_list[i]
max_score = max(max_score, tmp)
else:
tmp -= kitai_list[i - K]
tmp += kitai_list[i]
max_score = max(max_score, tmp)
# output
print(max_score)
| false | 3.448276 |
[
"+# Problem D - Dice in Line",
"+# input",
"-loop_time = N - K",
"-l_s = 0",
"-l_e = K",
"-max_score = 0",
"-test_score = 0",
"-# initial process",
"-ans_list = p_list[l_s:l_e]",
"-for j in ans_list:",
"- max_score += sum(range(1, j + 1)) / j",
"- test_score = max_score",
"-l_s = l_s + 1",
"-for i in range(loop_time):",
"- # pop process",
"- pop_e = p_list[l_s - 1]",
"- test_score = test_score - sum(range(1, pop_e + 1)) / pop_e",
"- # push process",
"- push_e = p_list[l_e]",
"- test_score = test_score + sum(range(1, push_e + 1)) / push_e",
"- if test_score > max_score:",
"- max_score = test_score",
"- l_s = l_s + 1",
"- l_e = l_e + 1",
"+# initialization",
"+kitai_list = [0] * N",
"+for i in range(N):",
"+ p = p_list[i]",
"+ p_sum = (1 + p) * p / 2",
"+ p_ave = p_sum / p",
"+ kitai_list[i] = p_ave",
"+max_score = -1",
"+# count",
"+tmp = 0",
"+for i in range(N):",
"+ if i - K < 0:",
"+ tmp += kitai_list[i]",
"+ max_score = max(max_score, tmp)",
"+ else:",
"+ tmp -= kitai_list[i - K]",
"+ tmp += kitai_list[i]",
"+ max_score = max(max_score, tmp)",
"+# output"
] | false | 0.07052 | 0.036288 | 1.943344 |
[
"s525071683",
"s979659344"
] |
u761989513
|
p04045
|
python
|
s904619756
|
s023060383
| 125 | 85 | 2,940 | 2,940 |
Accepted
|
Accepted
| 32 |
n, k = list(map(int, input().split()))
d = input().split()
while len(set(str(n)) & set(d)) != 0:
n += 1
print(n)
|
n=int(input().split()[0])
d=set(eval(input()))
while len(set(str(n))&d):
n+=1
print(n)
| 5 | 5 | 112 | 86 |
n, k = list(map(int, input().split()))
d = input().split()
while len(set(str(n)) & set(d)) != 0:
n += 1
print(n)
|
n = int(input().split()[0])
d = set(eval(input()))
while len(set(str(n)) & d):
n += 1
print(n)
| false | 0 |
[
"-n, k = list(map(int, input().split()))",
"-d = input().split()",
"-while len(set(str(n)) & set(d)) != 0:",
"+n = int(input().split()[0])",
"+d = set(eval(input()))",
"+while len(set(str(n)) & d):"
] | false | 0.040582 | 0.037004 | 1.096707 |
[
"s904619756",
"s023060383"
] |
u906501980
|
p02712
|
python
|
s789388744
|
s495336614
| 110 | 99 | 30,128 | 29,976 |
Accepted
|
Accepted
| 10 |
def main():
n = int(eval(input()))
ans = sum([i for i in range(1, n+1) if i%3!=0 and i%5!=0])
print(ans)
if __name__ == "__main__":
main()
|
def main():
n = int(eval(input()))
print((sum([i for i in range(1, n+1) if i%3 and i%5])))
if __name__ == "__main__":
main()
| 7 | 6 | 155 | 135 |
def main():
n = int(eval(input()))
ans = sum([i for i in range(1, n + 1) if i % 3 != 0 and i % 5 != 0])
print(ans)
if __name__ == "__main__":
main()
|
def main():
n = int(eval(input()))
print((sum([i for i in range(1, n + 1) if i % 3 and i % 5])))
if __name__ == "__main__":
main()
| false | 14.285714 |
[
"- ans = sum([i for i in range(1, n + 1) if i % 3 != 0 and i % 5 != 0])",
"- print(ans)",
"+ print((sum([i for i in range(1, n + 1) if i % 3 and i % 5])))"
] | false | 0.099177 | 0.084414 | 1.174895 |
[
"s789388744",
"s495336614"
] |
u073852194
|
p03165
|
python
|
s391166340
|
s663939049
| 593 | 491 | 120,412 | 120,284 |
Accepted
|
Accepted
| 17.2 |
s = eval(input())
t = eval(input())
dp = [[0 for j in range(len(t)+1)] for i in range(len(s)+1)]
dp[0][0] = 0
for i in range(len(s)):
for j in range(len(t)):
if s[i] == t[j]:
dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j],dp[i][j]+1)
else:
dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j])
ans = ''
i,j = len(s),len(t)
while i>0 and j>0:
if dp[i][j] == dp[i-1][j]:
i -= 1
elif dp[i][j] == dp[i][j-1]:
j -= 1
else:
ans = s[i-1]+ans
i -= 1
j -= 1
print(ans)
|
def LCS(s,t,restore=False):
dp = [[0 for j in range(len(t)+1)] for i in range(len(s)+1)]
for i in range(len(s)):
for j in range(len(t)):
if s[i] == t[j]:
dp[i+1][j+1] = dp[i][j]+1
else:
dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1])
if restore:
lcs = []
stack = [(len(s),len(t))]
while stack:
x,y = stack.pop()
if dp[x][y] == 0:
break
if x-1 >= 0 and dp[x][y] == dp[x-1][y]:
stack.append((x-1,y))
elif y-1 >= 0 and dp[x][y] == dp[x][y-1]:
stack.append((x,y-1))
else:
lcs.append(s[x-1])
stack.append((x-1,y-1))
lcs = ''.join(lcs)[::-1]
return dp[-1][-1],lcs
return dp[-1][-1]
S = eval(input())
T = eval(input())
print((LCS(S,T,True)[1]))
| 27 | 30 | 564 | 910 |
s = eval(input())
t = eval(input())
dp = [[0 for j in range(len(t) + 1)] for i in range(len(s) + 1)]
dp[0][0] = 0
for i in range(len(s)):
for j in range(len(t)):
if s[i] == t[j]:
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j], dp[i][j] + 1)
else:
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])
ans = ""
i, j = len(s), len(t)
while i > 0 and j > 0:
if dp[i][j] == dp[i - 1][j]:
i -= 1
elif dp[i][j] == dp[i][j - 1]:
j -= 1
else:
ans = s[i - 1] + ans
i -= 1
j -= 1
print(ans)
|
def LCS(s, t, restore=False):
dp = [[0 for j in range(len(t) + 1)] for i in range(len(s) + 1)]
for i in range(len(s)):
for j in range(len(t)):
if s[i] == t[j]:
dp[i + 1][j + 1] = dp[i][j] + 1
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
if restore:
lcs = []
stack = [(len(s), len(t))]
while stack:
x, y = stack.pop()
if dp[x][y] == 0:
break
if x - 1 >= 0 and dp[x][y] == dp[x - 1][y]:
stack.append((x - 1, y))
elif y - 1 >= 0 and dp[x][y] == dp[x][y - 1]:
stack.append((x, y - 1))
else:
lcs.append(s[x - 1])
stack.append((x - 1, y - 1))
lcs = "".join(lcs)[::-1]
return dp[-1][-1], lcs
return dp[-1][-1]
S = eval(input())
T = eval(input())
print((LCS(S, T, True)[1]))
| false | 10 |
[
"-s = eval(input())",
"-t = eval(input())",
"-dp = [[0 for j in range(len(t) + 1)] for i in range(len(s) + 1)]",
"-dp[0][0] = 0",
"-for i in range(len(s)):",
"- for j in range(len(t)):",
"- if s[i] == t[j]:",
"- dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j], dp[i][j] + 1)",
"- else:",
"- dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])",
"-ans = \"\"",
"-i, j = len(s), len(t)",
"-while i > 0 and j > 0:",
"- if dp[i][j] == dp[i - 1][j]:",
"- i -= 1",
"- elif dp[i][j] == dp[i][j - 1]:",
"- j -= 1",
"- else:",
"- ans = s[i - 1] + ans",
"- i -= 1",
"- j -= 1",
"-print(ans)",
"+def LCS(s, t, restore=False):",
"+ dp = [[0 for j in range(len(t) + 1)] for i in range(len(s) + 1)]",
"+ for i in range(len(s)):",
"+ for j in range(len(t)):",
"+ if s[i] == t[j]:",
"+ dp[i + 1][j + 1] = dp[i][j] + 1",
"+ else:",
"+ dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])",
"+ if restore:",
"+ lcs = []",
"+ stack = [(len(s), len(t))]",
"+ while stack:",
"+ x, y = stack.pop()",
"+ if dp[x][y] == 0:",
"+ break",
"+ if x - 1 >= 0 and dp[x][y] == dp[x - 1][y]:",
"+ stack.append((x - 1, y))",
"+ elif y - 1 >= 0 and dp[x][y] == dp[x][y - 1]:",
"+ stack.append((x, y - 1))",
"+ else:",
"+ lcs.append(s[x - 1])",
"+ stack.append((x - 1, y - 1))",
"+ lcs = \"\".join(lcs)[::-1]",
"+ return dp[-1][-1], lcs",
"+ return dp[-1][-1]",
"+",
"+",
"+S = eval(input())",
"+T = eval(input())",
"+print((LCS(S, T, True)[1]))"
] | false | 0.042642 | 0.040826 | 1.04448 |
[
"s391166340",
"s663939049"
] |
u588341295
|
p03504
|
python
|
s750495722
|
s801524256
| 762 | 398 | 69,848 | 25,680 |
Accepted
|
Accepted
| 47.77 |
# -*- coding: utf-8 -*-
N, C = list(map(int, input().split()))
T = 10**5+2
c_ls = [[0] * T for _ in range(C)]
# いもす
for i in range(N):
s, t, c = list(map(int, input().split()))
c_ls[c-1][s] += 1
c_ls[c-1][t] -= 1
# 各チャンネル毎の累積和
for i in range(C):
for j in range(1, T):
c_ls[i][j] += c_ls[i][j-1]
# 他チャンネルとの重複を見るために開始を1早める
for i in range(C):
for j in range(1, T):
if c_ls[i][j] > c_ls[i][j-1]:
c_ls[i][j-1] += 1
# 全チャンネルを合計
sm = [0] * T
for i in range(C):
for j in range(T):
sm[j] += c_ls[i][j]
# 重複が一番多くなる箇所が答え
print((max(sm)))
|
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N, M = MAP()
C = [[] for i in range(M)]
for i in range(N):
l, r, c = MAP()
c -= 1
C[c].append((l, r))
# 同チャンネルで連続する区間をまとめる
LR = []
for i in range(M):
if C[i]:
C[i].sort()
LR.append(C[i][0])
for j in range(1, len(C[i])):
l1, r1 = C[i][j-1]
l2, r2 = C[i][j]
if r1 == l2:
LR.pop()
LR.append((l1, r2))
# 3連続以上を考慮して更新
C[i][j] = (l1, r2)
else:
LR.append((l2, r2))
# いもす法
MAX = 10 ** 5 + 7
imos = [0] * MAX
for l, r in LR:
imos[l-1] += 1
imos[r] -= 1
imos = list(accumulate(imos))
print((max(imos)))
| 27 | 53 | 601 | 1,431 |
# -*- coding: utf-8 -*-
N, C = list(map(int, input().split()))
T = 10**5 + 2
c_ls = [[0] * T for _ in range(C)]
# いもす
for i in range(N):
s, t, c = list(map(int, input().split()))
c_ls[c - 1][s] += 1
c_ls[c - 1][t] -= 1
# 各チャンネル毎の累積和
for i in range(C):
for j in range(1, T):
c_ls[i][j] += c_ls[i][j - 1]
# 他チャンネルとの重複を見るために開始を1早める
for i in range(C):
for j in range(1, T):
if c_ls[i][j] > c_ls[i][j - 1]:
c_ls[i][j - 1] += 1
# 全チャンネルを合計
sm = [0] * T
for i in range(C):
for j in range(T):
sm[j] += c_ls[i][j]
# 重複が一番多くなる箇所が答え
print((max(sm)))
|
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
N, M = MAP()
C = [[] for i in range(M)]
for i in range(N):
l, r, c = MAP()
c -= 1
C[c].append((l, r))
# 同チャンネルで連続する区間をまとめる
LR = []
for i in range(M):
if C[i]:
C[i].sort()
LR.append(C[i][0])
for j in range(1, len(C[i])):
l1, r1 = C[i][j - 1]
l2, r2 = C[i][j]
if r1 == l2:
LR.pop()
LR.append((l1, r2))
# 3連続以上を考慮して更新
C[i][j] = (l1, r2)
else:
LR.append((l2, r2))
# いもす法
MAX = 10**5 + 7
imos = [0] * MAX
for l, r in LR:
imos[l - 1] += 1
imos[r] -= 1
imos = list(accumulate(imos))
print((max(imos)))
| false | 49.056604 |
[
"-N, C = list(map(int, input().split()))",
"-T = 10**5 + 2",
"-c_ls = [[0] * T for _ in range(C)]",
"-# いもす",
"+import sys",
"+from itertools import accumulate",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def list2d(a, b, c):",
"+ return [[c] * b for i in range(a)]",
"+",
"+",
"+def list3d(a, b, c, d):",
"+ return [[[d] * c for j in range(b)] for i in range(a)]",
"+",
"+",
"+def list4d(a, b, c, d, e):",
"+ return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]",
"+",
"+",
"+def ceil(x, y=1):",
"+ return int(-(-x // y))",
"+",
"+",
"+def INT():",
"+ return int(eval(input()))",
"+",
"+",
"+def MAP():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LIST(N=None):",
"+ return list(MAP()) if N is None else [INT() for i in range(N)]",
"+",
"+",
"+def Yes():",
"+ print(\"Yes\")",
"+",
"+",
"+def No():",
"+ print(\"No\")",
"+",
"+",
"+def YES():",
"+ print(\"YES\")",
"+",
"+",
"+def NO():",
"+ print(\"NO\")",
"+",
"+",
"+sys.setrecursionlimit(10**9)",
"+INF = 10**18",
"+MOD = 10**9 + 7",
"+N, M = MAP()",
"+C = [[] for i in range(M)]",
"- s, t, c = list(map(int, input().split()))",
"- c_ls[c - 1][s] += 1",
"- c_ls[c - 1][t] -= 1",
"-# 各チャンネル毎の累積和",
"-for i in range(C):",
"- for j in range(1, T):",
"- c_ls[i][j] += c_ls[i][j - 1]",
"-# 他チャンネルとの重複を見るために開始を1早める",
"-for i in range(C):",
"- for j in range(1, T):",
"- if c_ls[i][j] > c_ls[i][j - 1]:",
"- c_ls[i][j - 1] += 1",
"-# 全チャンネルを合計",
"-sm = [0] * T",
"-for i in range(C):",
"- for j in range(T):",
"- sm[j] += c_ls[i][j]",
"-# 重複が一番多くなる箇所が答え",
"-print((max(sm)))",
"+ l, r, c = MAP()",
"+ c -= 1",
"+ C[c].append((l, r))",
"+# 同チャンネルで連続する区間をまとめる",
"+LR = []",
"+for i in range(M):",
"+ if C[i]:",
"+ C[i].sort()",
"+ LR.append(C[i][0])",
"+ for j in range(1, len(C[i])):",
"+ l1, r1 = C[i][j - 1]",
"+ l2, r2 = C[i][j]",
"+ if r1 == l2:",
"+ LR.pop()",
"+ LR.append((l1, r2))",
"+ # 3連続以上を考慮して更新",
"+ C[i][j] = (l1, r2)",
"+ else:",
"+ LR.append((l2, r2))",
"+# いもす法",
"+MAX = 10**5 + 7",
"+imos = [0] * MAX",
"+for l, r in LR:",
"+ imos[l - 1] += 1",
"+ imos[r] -= 1",
"+imos = list(accumulate(imos))",
"+print((max(imos)))"
] | false | 0.469523 | 0.04167 | 11.267506 |
[
"s750495722",
"s801524256"
] |
u186838327
|
p03672
|
python
|
s667944911
|
s229836215
| 167 | 69 | 38,512 | 61,612 |
Accepted
|
Accepted
| 58.68 |
s = list(str(eval(input())))
n = len(s)
for i in range(n):
s.pop()
#print(''.join(s))
if len(s)%2 != 0:
continue
else:
if s[0:len(s)//2]*2 == s:
#print(''.join(s))
print((len(s)))
exit()
|
s = list(str(eval(input())))
for i in range(len(s)):
s.pop()
if len(s)%2 == 1:
continue
t = s[0:len(s)//2]
u = s[len(s)//2:]
t = ''.join(t)
u = ''.join(u)
if t == u:
print((len(s)))
exit()
| 12 | 12 | 258 | 244 |
s = list(str(eval(input())))
n = len(s)
for i in range(n):
s.pop()
# print(''.join(s))
if len(s) % 2 != 0:
continue
else:
if s[0 : len(s) // 2] * 2 == s:
# print(''.join(s))
print((len(s)))
exit()
|
s = list(str(eval(input())))
for i in range(len(s)):
s.pop()
if len(s) % 2 == 1:
continue
t = s[0 : len(s) // 2]
u = s[len(s) // 2 :]
t = "".join(t)
u = "".join(u)
if t == u:
print((len(s)))
exit()
| false | 0 |
[
"-n = len(s)",
"-for i in range(n):",
"+for i in range(len(s)):",
"- # print(''.join(s))",
"- if len(s) % 2 != 0:",
"+ if len(s) % 2 == 1:",
"- else:",
"- if s[0 : len(s) // 2] * 2 == s:",
"- # print(''.join(s))",
"- print((len(s)))",
"- exit()",
"+ t = s[0 : len(s) // 2]",
"+ u = s[len(s) // 2 :]",
"+ t = \"\".join(t)",
"+ u = \"\".join(u)",
"+ if t == u:",
"+ print((len(s)))",
"+ exit()"
] | false | 0.036805 | 0.037219 | 0.98888 |
[
"s667944911",
"s229836215"
] |
u189487046
|
p03239
|
python
|
s180407271
|
s273247669
| 20 | 17 | 3,316 | 2,940 |
Accepted
|
Accepted
| 15 |
N, T = list(map(int, input().split()))
ans = 1001
for i in range(N):
tmp = list(map(int, input().split()))
if tmp[1] <= T:
ans = min(ans, tmp[0])
print((ans if ans != 1001 else "TLE"))
|
N, T = list(map(int, input().split()))
ans = 1001
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(c, ans)
if ans == 1001:
print('TLE')
else:
print(ans)
| 8 | 12 | 201 | 208 |
N, T = list(map(int, input().split()))
ans = 1001
for i in range(N):
tmp = list(map(int, input().split()))
if tmp[1] <= T:
ans = min(ans, tmp[0])
print((ans if ans != 1001 else "TLE"))
|
N, T = list(map(int, input().split()))
ans = 1001
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(c, ans)
if ans == 1001:
print("TLE")
else:
print(ans)
| false | 33.333333 |
[
"-for i in range(N):",
"- tmp = list(map(int, input().split()))",
"- if tmp[1] <= T:",
"- ans = min(ans, tmp[0])",
"-print((ans if ans != 1001 else \"TLE\"))",
"+for _ in range(N):",
"+ c, t = list(map(int, input().split()))",
"+ if t <= T:",
"+ ans = min(c, ans)",
"+if ans == 1001:",
"+ print(\"TLE\")",
"+else:",
"+ print(ans)"
] | false | 0.070817 | 0.069897 | 1.013156 |
[
"s180407271",
"s273247669"
] |
u432551953
|
p03353
|
python
|
s066467829
|
s178256312
| 236 | 187 | 48,092 | 40,560 |
Accepted
|
Accepted
| 20.76 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
import heapq
def main():
s = input().strip()
n = len(s)
stq = set()
k = int(input().strip())
for i in range(n):
for j in range(i+1, min(i+1+k+1, n+1)):
stq.add(s[i:j])
stq = list(stq)
heapq.heapify(stq)
for i in range(k):
ans = heapq.heappop(stq)
if i == k-1:
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def main():
s = input().strip()
k = int(input().strip())
n = len(s)
strs = set()
for i in range(n):
for j in range(1, k+1):
strs.add(s[i:min(i+j, n)])
strs = list(strs)
# print(sorted(strs))
print((sorted(strs)[k-1]))
if __name__ == '__main__':
main()
| 24 | 21 | 529 | 444 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
import heapq
def main():
s = input().strip()
n = len(s)
stq = set()
k = int(input().strip())
for i in range(n):
for j in range(i + 1, min(i + 1 + k + 1, n + 1)):
stq.add(s[i:j])
stq = list(stq)
heapq.heapify(stq)
for i in range(k):
ans = heapq.heappop(stq)
if i == k - 1:
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
def main():
s = input().strip()
k = int(input().strip())
n = len(s)
strs = set()
for i in range(n):
for j in range(1, k + 1):
strs.add(s[i : min(i + j, n)])
strs = list(strs)
# print(sorted(strs))
print((sorted(strs)[k - 1]))
if __name__ == "__main__":
main()
| false | 12.5 |
[
"-import heapq",
"+ k = int(input().strip())",
"- stq = set()",
"- k = int(input().strip())",
"+ strs = set()",
"- for j in range(i + 1, min(i + 1 + k + 1, n + 1)):",
"- stq.add(s[i:j])",
"- stq = list(stq)",
"- heapq.heapify(stq)",
"- for i in range(k):",
"- ans = heapq.heappop(stq)",
"- if i == k - 1:",
"- print(ans)",
"+ for j in range(1, k + 1):",
"+ strs.add(s[i : min(i + j, n)])",
"+ strs = list(strs)",
"+ # print(sorted(strs))",
"+ print((sorted(strs)[k - 1]))"
] | false | 0.042777 | 0.043783 | 0.977027 |
[
"s066467829",
"s178256312"
] |
u077291787
|
p03659
|
python
|
s249460014
|
s237411607
| 137 | 120 | 25,192 | 26,088 |
Accepted
|
Accepted
| 12.41 |
# ABC067C - Splitting Pile
def main():
n = int(eval(input()))
lst = tuple(map(int, input().rstrip().split()))
cur, total, ans = 0, sum(lst), float("inf")
for i in lst[:-1]:
cur += i
ans = min(ans, abs(total - cur * 2))
print(ans)
if __name__ == "__main__":
main()
|
# ARC078C - Splitting Pile (ABC067C)
from itertools import accumulate
def main():
n = int(eval(input()))
lst = tuple(accumulate(list(map(int, input().rstrip().split()))))
ans = min(abs(lst[-1] - i * 2) for i in lst[:-1])
print(ans)
if __name__ == "__main__":
main()
| 13 | 13 | 311 | 289 |
# ABC067C - Splitting Pile
def main():
n = int(eval(input()))
lst = tuple(map(int, input().rstrip().split()))
cur, total, ans = 0, sum(lst), float("inf")
for i in lst[:-1]:
cur += i
ans = min(ans, abs(total - cur * 2))
print(ans)
if __name__ == "__main__":
main()
|
# ARC078C - Splitting Pile (ABC067C)
from itertools import accumulate
def main():
n = int(eval(input()))
lst = tuple(accumulate(list(map(int, input().rstrip().split()))))
ans = min(abs(lst[-1] - i * 2) for i in lst[:-1])
print(ans)
if __name__ == "__main__":
main()
| false | 0 |
[
"-# ABC067C - Splitting Pile",
"+# ARC078C - Splitting Pile (ABC067C)",
"+from itertools import accumulate",
"+",
"+",
"- lst = tuple(map(int, input().rstrip().split()))",
"- cur, total, ans = 0, sum(lst), float(\"inf\")",
"- for i in lst[:-1]:",
"- cur += i",
"- ans = min(ans, abs(total - cur * 2))",
"+ lst = tuple(accumulate(list(map(int, input().rstrip().split()))))",
"+ ans = min(abs(lst[-1] - i * 2) for i in lst[:-1])"
] | false | 0.045836 | 0.046161 | 0.99296 |
[
"s249460014",
"s237411607"
] |
u806976856
|
p03045
|
python
|
s762001544
|
s482678243
| 407 | 357 | 83,204 | 80,792 |
Accepted
|
Accepted
| 12.29 |
n,m=list(map(int,input().split()))
import sys
sys.setrecursionlimit(10**9) #再帰の上限をあげる
root=[-1 for i in range(n+1)] #自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
def r(x): #親は誰？
if root[x]<0:
return x
else:
root[x]=r(root[x])
return root[x]
def unite(x,y):
x=r(x)
y=r(y)
if x==y:
return
if root[x]<root[y]:
x,y=y,x
root[x]+=root[y]
root[y]=x
for i in range(m):
x,y,z=list(map(int,input().split()))
unite(x,y)
g=[0]*(n+1)
for i in range(1,n+1):
g[r(i)]+=1
ans=0
for i in range(n+1):
if g[i]>0:
ans+=1
print(ans)
|
n,m=list(map(int,input().split()))
import sys
sys.setrecursionlimit(10**9) #再帰の上限をあげる
root=[-1 for i in range(n+1)] #自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
def r(x): #親は誰？
if root[x]<0:
return x
else:
return r(root[x])
def unite(x,y):
x=r(x)
y=r(y)
if x==y:
return
if root[x]>root[y]:
x,y=y,x
root[x]+=root[y]
root[y]=x
for i in range(m):
x,y,z=list(map(int,input().split()))
unite(x,y)
g=[0]*(n+1)
for i in range(1,n+1):
g[r(i)]+=1
ans=0
for i in range(n+1):
if g[i]>0:
ans+=1
print(ans)
| 38 | 38 | 636 | 621 |
n, m = list(map(int, input().split()))
import sys
sys.setrecursionlimit(10**9) # 再帰の上限をあげる
root = [-1 for i in range(n + 1)] # 自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
def r(x): # 親は誰？
if root[x] < 0:
return x
else:
root[x] = r(root[x])
return root[x]
def unite(x, y):
x = r(x)
y = r(y)
if x == y:
return
if root[x] < root[y]:
x, y = y, x
root[x] += root[y]
root[y] = x
for i in range(m):
x, y, z = list(map(int, input().split()))
unite(x, y)
g = [0] * (n + 1)
for i in range(1, n + 1):
g[r(i)] += 1
ans = 0
for i in range(n + 1):
if g[i] > 0:
ans += 1
print(ans)
|
n, m = list(map(int, input().split()))
import sys
sys.setrecursionlimit(10**9) # 再帰の上限をあげる
root = [-1 for i in range(n + 1)] # 自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
def r(x): # 親は誰？
if root[x] < 0:
return x
else:
return r(root[x])
def unite(x, y):
x = r(x)
y = r(y)
if x == y:
return
if root[x] > root[y]:
x, y = y, x
root[x] += root[y]
root[y] = x
for i in range(m):
x, y, z = list(map(int, input().split()))
unite(x, y)
g = [0] * (n + 1)
for i in range(1, n + 1):
g[r(i)] += 1
ans = 0
for i in range(n + 1):
if g[i] > 0:
ans += 1
print(ans)
| false | 0 |
[
"- root[x] = r(root[x])",
"- return root[x]",
"+ return r(root[x])",
"- if root[x] < root[y]:",
"+ if root[x] > root[y]:"
] | false | 0.139889 | 0.053956 | 2.592637 |
[
"s762001544",
"s482678243"
] |
u996665352
|
p02689
|
python
|
s278850846
|
s688203487
| 439 | 251 | 37,776 | 20,044 |
Accepted
|
Accepted
| 42.82 |
N,M=list(map(int,input().split()))
H = list(map(int,input().split()))
A,B=[],[]
good = N
for m in range(M):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
routes = [[] for i in range(N)]
for m in range(M):
routes[A[m]-1].append(B[m]-1)
routes[B[m]-1].append(A[m]-1)
for n in range(N):
L = len(routes[n])
for l in range(L):
if H[n] <= H[routes[n][l]]:
good -=1
break
print(good)
|
N,M=list(map(int,input().split()))
H = list(map(int,input().split()))
ans=[1]*N
for m in range(M):
a,b = list(map(int,input().split()))
if H[a-1]<H[b-1]:
ans[a-1]=0
elif H[a-1]>H[b-1]:
ans[b-1]=0
elif H[a-1]==H[b-1]:
ans[a-1]=0
ans[b-1]=0
print((ans.count(1)))
| 20 | 13 | 459 | 306 |
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
A, B = [], []
good = N
for m in range(M):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
routes = [[] for i in range(N)]
for m in range(M):
routes[A[m] - 1].append(B[m] - 1)
routes[B[m] - 1].append(A[m] - 1)
for n in range(N):
L = len(routes[n])
for l in range(L):
if H[n] <= H[routes[n][l]]:
good -= 1
break
print(good)
|
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
ans = [1] * N
for m in range(M):
a, b = list(map(int, input().split()))
if H[a - 1] < H[b - 1]:
ans[a - 1] = 0
elif H[a - 1] > H[b - 1]:
ans[b - 1] = 0
elif H[a - 1] == H[b - 1]:
ans[a - 1] = 0
ans[b - 1] = 0
print((ans.count(1)))
| false | 35 |
[
"-A, B = [], []",
"-good = N",
"+ans = [1] * N",
"- A.append(a)",
"- B.append(b)",
"-routes = [[] for i in range(N)]",
"-for m in range(M):",
"- routes[A[m] - 1].append(B[m] - 1)",
"- routes[B[m] - 1].append(A[m] - 1)",
"-for n in range(N):",
"- L = len(routes[n])",
"- for l in range(L):",
"- if H[n] <= H[routes[n][l]]:",
"- good -= 1",
"- break",
"-print(good)",
"+ if H[a - 1] < H[b - 1]:",
"+ ans[a - 1] = 0",
"+ elif H[a - 1] > H[b - 1]:",
"+ ans[b - 1] = 0",
"+ elif H[a - 1] == H[b - 1]:",
"+ ans[a - 1] = 0",
"+ ans[b - 1] = 0",
"+print((ans.count(1)))"
] | false | 0.043135 | 0.043122 | 1.000295 |
[
"s278850846",
"s688203487"
] |
u186838327
|
p02802
|
python
|
s237543506
|
s315626516
| 668 | 191 | 55,256 | 76,160 |
Accepted
|
Accepted
| 71.41 |
n, m = list(map(int, input().split()))
d = {}
s_ac = set()
ac = 0
pen = 0
for i in range(m):
p, s = list(map(str, input().split()))
p = int(p)
if s == 'AC':
if p not in s_ac:
ac += 1
s_ac.add(p)
if p in d:
pen += d[p]
else:
if p not in d:
d[p] = 1
else:
d[p] += 1
print((ac, pen))
|
n, m = list(map(int, input().split()))
a = [0]*n
b = [0]*n
for i in range(m):
p, s = list(map(str, input().split()))
p = int(p)
p -= 1
if s == 'AC':
a[p] = 1
else:
if a[p] == 0:
b[p] += 1
c = 0
d = 0
for i in range(n):
if a[i] != 0:
c += a[i]
d += b[i]
print((c, d))
| 20 | 22 | 402 | 345 |
n, m = list(map(int, input().split()))
d = {}
s_ac = set()
ac = 0
pen = 0
for i in range(m):
p, s = list(map(str, input().split()))
p = int(p)
if s == "AC":
if p not in s_ac:
ac += 1
s_ac.add(p)
if p in d:
pen += d[p]
else:
if p not in d:
d[p] = 1
else:
d[p] += 1
print((ac, pen))
|
n, m = list(map(int, input().split()))
a = [0] * n
b = [0] * n
for i in range(m):
p, s = list(map(str, input().split()))
p = int(p)
p -= 1
if s == "AC":
a[p] = 1
else:
if a[p] == 0:
b[p] += 1
c = 0
d = 0
for i in range(n):
if a[i] != 0:
c += a[i]
d += b[i]
print((c, d))
| false | 9.090909 |
[
"-d = {}",
"-s_ac = set()",
"-ac = 0",
"-pen = 0",
"+a = [0] * n",
"+b = [0] * n",
"+ p -= 1",
"- if p not in s_ac:",
"- ac += 1",
"- s_ac.add(p)",
"- if p in d:",
"- pen += d[p]",
"+ a[p] = 1",
"- if p not in d:",
"- d[p] = 1",
"- else:",
"- d[p] += 1",
"-print((ac, pen))",
"+ if a[p] == 0:",
"+ b[p] += 1",
"+c = 0",
"+d = 0",
"+for i in range(n):",
"+ if a[i] != 0:",
"+ c += a[i]",
"+ d += b[i]",
"+print((c, d))"
] | false | 0.076379 | 0.055601 | 1.373701 |
[
"s237543506",
"s315626516"
] |
u512212329
|
p02614
|
python
|
s357045975
|
s121130913
| 197 | 54 | 74,440 | 9,112 |
Accepted
|
Accepted
| 72.59 |
import copy
def main():
height, width, leave_black = [int(x) for x in input().split()]
table = [list(eval(input())) for _ in range(height)]
ans = 0
for num_h in range(2 ** height):
for num_w in range(2 ** width):
tmp = copy.deepcopy(table)
for bit_h in range(height):
if num_h >> bit_h & 1:
tmp[bit_h] = ['r'] * width
for bit_w in range(width):
if num_w >> bit_w & 1:
for row in tmp:
row[bit_w] = 'r'
# print(num_h, num_w, tmp)
if sum(c == '#' for row in tmp for c in row) == leave_black:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
def main():
height, width, leave_black = [int(x) for x in input().split()]
table = [eval(input()) for _ in range(height)]
ans = 0
for num_h in range(2 ** height):
for num_w in range(2 ** width):
black_count = 0
for bit_h in range(height):
for bit_w in range(width):
if num_h >> bit_h & 1 or num_w >> bit_w & 1:
continue
black_count += table[bit_h][bit_w] == '#'
ans += black_count == leave_black
print(ans)
if __name__ == '__main__':
main()
| 25 | 21 | 769 | 608 |
import copy
def main():
height, width, leave_black = [int(x) for x in input().split()]
table = [list(eval(input())) for _ in range(height)]
ans = 0
for num_h in range(2**height):
for num_w in range(2**width):
tmp = copy.deepcopy(table)
for bit_h in range(height):
if num_h >> bit_h & 1:
tmp[bit_h] = ["r"] * width
for bit_w in range(width):
if num_w >> bit_w & 1:
for row in tmp:
row[bit_w] = "r"
# print(num_h, num_w, tmp)
if sum(c == "#" for row in tmp for c in row) == leave_black:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
def main():
height, width, leave_black = [int(x) for x in input().split()]
table = [eval(input()) for _ in range(height)]
ans = 0
for num_h in range(2**height):
for num_w in range(2**width):
black_count = 0
for bit_h in range(height):
for bit_w in range(width):
if num_h >> bit_h & 1 or num_w >> bit_w & 1:
continue
black_count += table[bit_h][bit_w] == "#"
ans += black_count == leave_black
print(ans)
if __name__ == "__main__":
main()
| false | 16 |
[
"-import copy",
"-",
"-",
"- table = [list(eval(input())) for _ in range(height)]",
"+ table = [eval(input()) for _ in range(height)]",
"- tmp = copy.deepcopy(table)",
"+ black_count = 0",
"- if num_h >> bit_h & 1:",
"- tmp[bit_h] = [\"r\"] * width",
"- for bit_w in range(width):",
"- if num_w >> bit_w & 1:",
"- for row in tmp:",
"- row[bit_w] = \"r\"",
"- # print(num_h, num_w, tmp)",
"- if sum(c == \"#\" for row in tmp for c in row) == leave_black:",
"- ans += 1",
"+ for bit_w in range(width):",
"+ if num_h >> bit_h & 1 or num_w >> bit_w & 1:",
"+ continue",
"+ black_count += table[bit_h][bit_w] == \"#\"",
"+ ans += black_count == leave_black"
] | false | 0.143852 | 0.117628 | 1.222943 |
[
"s357045975",
"s121130913"
] |
u839675792
|
p03283
|
python
|
s900455575
|
s790344511
| 1,686 | 1,535 | 19,416 | 13,392 |
Accepted
|
Accepted
| 8.96 |
a = input().split()
n = int(a[0])
m = int(a[1])
qq = int(a[2])
x = [[0] * n for _ in range(n)]
for _ in range(m):
a = input().split()
x[int(a[0]) - 1][int(a[1]) - 1] += 1
c = list()
for i in range(n):
c.append(list())
for j in range(n):
a = x[i][j]
if 0 < j:
a += c[i][j - 1]
c[i].append(a)
z = list()
for i in range(n):
z.append(list())
for j in range(n):
a = c[i][j]
if 0 < i:
a += z[i - 1][j]
z[i].append(a)
for _ in range(qq):
r = 0
a = input().split()
p = int(a[0])
q = int(a[1])
if 0 < q:
r += z[q - 1][q - 1]
if 0 < q and 1 < p:
r -= z[q - 1][p - 2] + z[p - 2][q - 1]
if 1 < p:
r += z[p - 2][p - 2]
print(r)
|
a = input().split()
n = int(a[0])
m = int(a[1])
qq = int(a[2])
x = [[0] * n for _ in range(n)]
for _ in range(m):
a = input().split()
x[int(a[0]) - 1][int(a[1]) - 1] += 1
for i in range(n):
for j in range(1, n):
x[i][j] += x[i][j - 1]
for i in range(1, n):
for j in range(n):
x[i][j] += x[i - 1][j]
for _ in range(qq):
r = 0
a = input().split()
p = int(a[0])
q = int(a[1])
if 0 < q:
r += x[q - 1][q - 1]
if 0 < q and 1 < p:
r -= x[q - 1][p - 2] + x[p - 2][q - 1]
if 1 < p:
r += x[p - 2][p - 2]
print(r)
| 51 | 35 | 832 | 634 |
a = input().split()
n = int(a[0])
m = int(a[1])
qq = int(a[2])
x = [[0] * n for _ in range(n)]
for _ in range(m):
a = input().split()
x[int(a[0]) - 1][int(a[1]) - 1] += 1
c = list()
for i in range(n):
c.append(list())
for j in range(n):
a = x[i][j]
if 0 < j:
a += c[i][j - 1]
c[i].append(a)
z = list()
for i in range(n):
z.append(list())
for j in range(n):
a = c[i][j]
if 0 < i:
a += z[i - 1][j]
z[i].append(a)
for _ in range(qq):
r = 0
a = input().split()
p = int(a[0])
q = int(a[1])
if 0 < q:
r += z[q - 1][q - 1]
if 0 < q and 1 < p:
r -= z[q - 1][p - 2] + z[p - 2][q - 1]
if 1 < p:
r += z[p - 2][p - 2]
print(r)
|
a = input().split()
n = int(a[0])
m = int(a[1])
qq = int(a[2])
x = [[0] * n for _ in range(n)]
for _ in range(m):
a = input().split()
x[int(a[0]) - 1][int(a[1]) - 1] += 1
for i in range(n):
for j in range(1, n):
x[i][j] += x[i][j - 1]
for i in range(1, n):
for j in range(n):
x[i][j] += x[i - 1][j]
for _ in range(qq):
r = 0
a = input().split()
p = int(a[0])
q = int(a[1])
if 0 < q:
r += x[q - 1][q - 1]
if 0 < q and 1 < p:
r -= x[q - 1][p - 2] + x[p - 2][q - 1]
if 1 < p:
r += x[p - 2][p - 2]
print(r)
| false | 31.372549 |
[
"-c = list()",
"- c.append(list())",
"+ for j in range(1, n):",
"+ x[i][j] += x[i][j - 1]",
"+for i in range(1, n):",
"- a = x[i][j]",
"- if 0 < j:",
"- a += c[i][j - 1]",
"- c[i].append(a)",
"-z = list()",
"-for i in range(n):",
"- z.append(list())",
"- for j in range(n):",
"- a = c[i][j]",
"- if 0 < i:",
"- a += z[i - 1][j]",
"- z[i].append(a)",
"+ x[i][j] += x[i - 1][j]",
"- r += z[q - 1][q - 1]",
"+ r += x[q - 1][q - 1]",
"- r -= z[q - 1][p - 2] + z[p - 2][q - 1]",
"+ r -= x[q - 1][p - 2] + x[p - 2][q - 1]",
"- r += z[p - 2][p - 2]",
"+ r += x[p - 2][p - 2]"
] | false | 0.107095 | 0.036631 | 2.923596 |
[
"s900455575",
"s790344511"
] |
u869790980
|
p03042
|
python
|
s456279889
|
s780314883
| 38 | 35 | 27,884 | 28,012 |
Accepted
|
Accepted
| 7.89 |
def f(s):
m,y = int(s[:2]), int(s[2:])
return 0< m <= 12
def g(s):
y,m = int(s[:2]), int(s[2:])
return 0< m <= 12
s = input()
p,q = f(s), g(s)
if p and q:
print('AMBIGUOUS')
elif p and not(q):
print('MMYY')
elif q and not(p):
print('YYMM')
else:
print('NA')
|
def f(s):
m,y = int(s[:2]), int(s[2:])
return (0 < m <= 12,0 < y <= 12)
p,q = list(map(int,list(f(input()))))
print({(0,0):'NA', (0,1): 'YYMM', (1,0): 'MMYY', (1,1):'AMBIGUOUS'}[(p,q)])
| 19 | 6 | 298 | 193 |
def f(s):
m, y = int(s[:2]), int(s[2:])
return 0 < m <= 12
def g(s):
y, m = int(s[:2]), int(s[2:])
return 0 < m <= 12
s = input()
p, q = f(s), g(s)
if p and q:
print("AMBIGUOUS")
elif p and not (q):
print("MMYY")
elif q and not (p):
print("YYMM")
else:
print("NA")
|
def f(s):
m, y = int(s[:2]), int(s[2:])
return (0 < m <= 12, 0 < y <= 12)
p, q = list(map(int, list(f(input()))))
print({(0, 0): "NA", (0, 1): "YYMM", (1, 0): "MMYY", (1, 1): "AMBIGUOUS"}[(p, q)])
| false | 68.421053 |
[
"- return 0 < m <= 12",
"+ return (0 < m <= 12, 0 < y <= 12)",
"-def g(s):",
"- y, m = int(s[:2]), int(s[2:])",
"- return 0 < m <= 12",
"-",
"-",
"-s = input()",
"-p, q = f(s), g(s)",
"-if p and q:",
"- print(\"AMBIGUOUS\")",
"-elif p and not (q):",
"- print(\"MMYY\")",
"-elif q and not (p):",
"- print(\"YYMM\")",
"-else:",
"- print(\"NA\")",
"+p, q = list(map(int, list(f(input()))))",
"+print({(0, 0): \"NA\", (0, 1): \"YYMM\", (1, 0): \"MMYY\", (1, 1): \"AMBIGUOUS\"}[(p, q)])"
] | false | 0.043294 | 0.11454 | 0.377979 |
[
"s456279889",
"s780314883"
] |
u731436822
|
p03495
|
python
|
s585237009
|
s179233727
| 153 | 134 | 45,748 | 45,952 |
Accepted
|
Accepted
| 12.42 |
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
if len(set(A))<=k:
print((0))
else:
d = {i:0 for i in set(A)}
for a in A:
d[a] += 1
ans = list(d.values())
ans.sort(reverse = True)
print((sum(ans[k:])))
|
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
d = {i:0 for i in set(A)}
for a in A:
d[a] += 1
ans = list(d.values())
ans.sort(reverse = True)
print((sum(ans[k:])))
| 12 | 9 | 259 | 194 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
if len(set(A)) <= k:
print((0))
else:
d = {i: 0 for i in set(A)}
for a in A:
d[a] += 1
ans = list(d.values())
ans.sort(reverse=True)
print((sum(ans[k:])))
|
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
d = {i: 0 for i in set(A)}
for a in A:
d[a] += 1
ans = list(d.values())
ans.sort(reverse=True)
print((sum(ans[k:])))
| false | 25 |
[
"-if len(set(A)) <= k:",
"- print((0))",
"-else:",
"- d = {i: 0 for i in set(A)}",
"- for a in A:",
"- d[a] += 1",
"- ans = list(d.values())",
"- ans.sort(reverse=True)",
"- print((sum(ans[k:])))",
"+d = {i: 0 for i in set(A)}",
"+for a in A:",
"+ d[a] += 1",
"+ans = list(d.values())",
"+ans.sort(reverse=True)",
"+print((sum(ans[k:])))"
] | false | 0.042466 | 0.040894 | 1.038429 |
[
"s585237009",
"s179233727"
] |
u477319617
|
p02682
|
python
|
s761436360
|
s807108296
| 22 | 19 | 9,188 | 9,128 |
Accepted
|
Accepted
| 13.64 |
A,B,C,K=list(map(int,input().split(" ")))
sum = A+B
if(sum>=K):
if(A>K):
print(K)
else:
print((A*1+B*0))
elif (sum<K):
print((A*1+B*0+(K-(A+B))*-1))
|
A,B,C,K=list(map(int,input().split(" ")))
xa = min(A,K)
K -= xa
xb = min(B,K)
K -= xb
xc = min(C,K)
print((xa-xc))
| 9 | 9 | 174 | 116 |
A, B, C, K = list(map(int, input().split(" ")))
sum = A + B
if sum >= K:
if A > K:
print(K)
else:
print((A * 1 + B * 0))
elif sum < K:
print((A * 1 + B * 0 + (K - (A + B)) * -1))
|
A, B, C, K = list(map(int, input().split(" ")))
xa = min(A, K)
K -= xa
xb = min(B, K)
K -= xb
xc = min(C, K)
print((xa - xc))
| false | 0 |
[
"-sum = A + B",
"-if sum >= K:",
"- if A > K:",
"- print(K)",
"- else:",
"- print((A * 1 + B * 0))",
"-elif sum < K:",
"- print((A * 1 + B * 0 + (K - (A + B)) * -1))",
"+xa = min(A, K)",
"+K -= xa",
"+xb = min(B, K)",
"+K -= xb",
"+xc = min(C, K)",
"+print((xa - xc))"
] | false | 0.040982 | 0.041066 | 0.997952 |
[
"s761436360",
"s807108296"
] |
u057109575
|
p02954
|
python
|
s243779911
|
s351502332
| 322 | 95 | 52,572 | 73,304 |
Accepted
|
Accepted
| 70.5 |
from bisect import bisect
S = eval(input())
N = len(S)
r_idx = [i for i in range(N) if S[i] == 'R']
l_idx = [i for i in range(N) if S[i] == 'L']
ans = [0] * N
for i in range(N):
if S[i] == 'R':
j = l_idx[bisect(l_idx, i)]
if (j - i) % 2 == 0:
ans[j] += 1
else:
ans[j - 1] += 1
else:
j = r_idx[max(0, bisect(r_idx, i) - 1)]
if (i - j) % 2 == 0:
ans[j] += 1
else:
ans[j + 1] += 1
print((*ans))
|
S = eval(input())
n = len(S)
x = [1] * n
for i in range(n):
if S[i] == "R" and S[i + 1] == "R":
x[i + 2] += x[i]
x[i] = 0
for i in reversed(list(range(n))):
if S[i] == "L" and S[i - 1] == "L":
x[i - 2] += x[i]
x[i] = 0
print((*x))
| 23 | 15 | 525 | 286 |
from bisect import bisect
S = eval(input())
N = len(S)
r_idx = [i for i in range(N) if S[i] == "R"]
l_idx = [i for i in range(N) if S[i] == "L"]
ans = [0] * N
for i in range(N):
if S[i] == "R":
j = l_idx[bisect(l_idx, i)]
if (j - i) % 2 == 0:
ans[j] += 1
else:
ans[j - 1] += 1
else:
j = r_idx[max(0, bisect(r_idx, i) - 1)]
if (i - j) % 2 == 0:
ans[j] += 1
else:
ans[j + 1] += 1
print((*ans))
|
S = eval(input())
n = len(S)
x = [1] * n
for i in range(n):
if S[i] == "R" and S[i + 1] == "R":
x[i + 2] += x[i]
x[i] = 0
for i in reversed(list(range(n))):
if S[i] == "L" and S[i - 1] == "L":
x[i - 2] += x[i]
x[i] = 0
print((*x))
| false | 34.782609 |
[
"-from bisect import bisect",
"-",
"-N = len(S)",
"-r_idx = [i for i in range(N) if S[i] == \"R\"]",
"-l_idx = [i for i in range(N) if S[i] == \"L\"]",
"-ans = [0] * N",
"-for i in range(N):",
"- if S[i] == \"R\":",
"- j = l_idx[bisect(l_idx, i)]",
"- if (j - i) % 2 == 0:",
"- ans[j] += 1",
"- else:",
"- ans[j - 1] += 1",
"- else:",
"- j = r_idx[max(0, bisect(r_idx, i) - 1)]",
"- if (i - j) % 2 == 0:",
"- ans[j] += 1",
"- else:",
"- ans[j + 1] += 1",
"-print((*ans))",
"+n = len(S)",
"+x = [1] * n",
"+for i in range(n):",
"+ if S[i] == \"R\" and S[i + 1] == \"R\":",
"+ x[i + 2] += x[i]",
"+ x[i] = 0",
"+for i in reversed(list(range(n))):",
"+ if S[i] == \"L\" and S[i - 1] == \"L\":",
"+ x[i - 2] += x[i]",
"+ x[i] = 0",
"+print((*x))"
] | false | 0.037112 | 0.037422 | 0.991732 |
[
"s243779911",
"s351502332"
] |
u628285938
|
p03244
|
python
|
s921103672
|
s282703633
| 119 | 104 | 26,716 | 22,264 |
Accepted
|
Accepted
| 12.61 |
# -*- coding: utf-8 -*-
"""
Created on Thu Sep 17 20:29:30 2020
@author: liang
"""
n = int(eval(input()))
E = list()
O = list()
i = 0
for v in input().split():
if i%2 == 0:
E.append(int(v))
else:
O.append(int(v))
i += 1
#print(E)
#print(O)
edic = {-1:0}
odic = {-1:0}
for e in E:
if e not in list(edic.keys()):
edic[e] = 1
else:
edic[e] += 1
for o in O:
if o not in list(odic.keys()):
odic[o] = 1
else:
odic[o] += 1
etup = list()
otup = list()
for e in list(edic.keys()):
etup.append((e,edic[e]))
for o in list(odic.keys()):
otup.append((o,odic[o]))
etup.sort(reverse=True,key=lambda x:x[1])
otup.sort(reverse=True,key=lambda x:x[1])
#print(etup)
#print(otup)
i = 0
j = 0
while True:
ekey, etmp = etup[i]
okey, otmp = otup[j]
if ekey != okey:
break
if etup[i+1][1] < otup[j+1][1]:
j += 1
else:
i += 1
#rint("calc")
#print(edic)
ans = n - etmp - otmp
print(ans)
|
# -*- coding: utf-8 -*-
"""
Created on Thu Sep 17 21:11:38 2020
@author: liang
"""
"""
【２番目の取得】
"""
n = int(eval(input()))
E = list()
O = list()
i = 0
for v in input().split():
if i%2 == 0:
E.append(int(v))
else:
O.append(int(v))
i += 1
#print(E)
#print(O)
edic = {}
odic = {}
for e in E:
if e not in list(edic.keys()):
edic[e] = 1
else:
edic[e] += 1
for o in O:
if o not in list(odic.keys()):
odic[o] = 1
else:
odic[o] += 1
etmp = [(-1,0),(-1,0)]
otmp = [(-1,0),(-1,0)]
for key in list(edic.keys()):
#first
if edic[key] > etmp[0][1]:
etmp[1] = etmp[0]
etmp[0] = (key, edic[key])
#second
elif edic[key] > etmp[1][1]:
etmp[1] = (key,edic[key])
for key in list(odic.keys()):
#first
if odic[key] > otmp[0][1]:
otmp[1] = otmp[0]
otmp[0] = (key, odic[key])
#second
elif odic[key] > otmp[1][1]:
otmp[1] = (key,odic[key])
if etmp[0][0] == otmp[0][0]:
ans = max(etmp[0][1]+otmp[1][1],etmp[1][1]+otmp[0][1])
else:
ans = etmp[0][1]+otmp[0][1]
print((n-ans))
| 62 | 62 | 1,039 | 1,155 |
# -*- coding: utf-8 -*-
"""
Created on Thu Sep 17 20:29:30 2020
@author: liang
"""
n = int(eval(input()))
E = list()
O = list()
i = 0
for v in input().split():
if i % 2 == 0:
E.append(int(v))
else:
O.append(int(v))
i += 1
# print(E)
# print(O)
edic = {-1: 0}
odic = {-1: 0}
for e in E:
if e not in list(edic.keys()):
edic[e] = 1
else:
edic[e] += 1
for o in O:
if o not in list(odic.keys()):
odic[o] = 1
else:
odic[o] += 1
etup = list()
otup = list()
for e in list(edic.keys()):
etup.append((e, edic[e]))
for o in list(odic.keys()):
otup.append((o, odic[o]))
etup.sort(reverse=True, key=lambda x: x[1])
otup.sort(reverse=True, key=lambda x: x[1])
# print(etup)
# print(otup)
i = 0
j = 0
while True:
ekey, etmp = etup[i]
okey, otmp = otup[j]
if ekey != okey:
break
if etup[i + 1][1] < otup[j + 1][1]:
j += 1
else:
i += 1
# rint("calc")
# print(edic)
ans = n - etmp - otmp
print(ans)
|
# -*- coding: utf-8 -*-
"""
Created on Thu Sep 17 21:11:38 2020
@author: liang
"""
"""
【２番目の取得】
"""
n = int(eval(input()))
E = list()
O = list()
i = 0
for v in input().split():
if i % 2 == 0:
E.append(int(v))
else:
O.append(int(v))
i += 1
# print(E)
# print(O)
edic = {}
odic = {}
for e in E:
if e not in list(edic.keys()):
edic[e] = 1
else:
edic[e] += 1
for o in O:
if o not in list(odic.keys()):
odic[o] = 1
else:
odic[o] += 1
etmp = [(-1, 0), (-1, 0)]
otmp = [(-1, 0), (-1, 0)]
for key in list(edic.keys()):
# first
if edic[key] > etmp[0][1]:
etmp[1] = etmp[0]
etmp[0] = (key, edic[key])
# second
elif edic[key] > etmp[1][1]:
etmp[1] = (key, edic[key])
for key in list(odic.keys()):
# first
if odic[key] > otmp[0][1]:
otmp[1] = otmp[0]
otmp[0] = (key, odic[key])
# second
elif odic[key] > otmp[1][1]:
otmp[1] = (key, odic[key])
if etmp[0][0] == otmp[0][0]:
ans = max(etmp[0][1] + otmp[1][1], etmp[1][1] + otmp[0][1])
else:
ans = etmp[0][1] + otmp[0][1]
print((n - ans))
| false | 0 |
[
"-Created on Thu Sep 17 20:29:30 2020",
"+Created on Thu Sep 17 21:11:38 2020",
"+\"\"\"",
"+\"\"\"",
"+【２番目の取得】",
"-edic = {-1: 0}",
"-odic = {-1: 0}",
"+edic = {}",
"+odic = {}",
"-etup = list()",
"-otup = list()",
"-for e in list(edic.keys()):",
"- etup.append((e, edic[e]))",
"-for o in list(odic.keys()):",
"- otup.append((o, odic[o]))",
"-etup.sort(reverse=True, key=lambda x: x[1])",
"-otup.sort(reverse=True, key=lambda x: x[1])",
"-# print(etup)",
"-# print(otup)",
"-i = 0",
"-j = 0",
"-while True:",
"- ekey, etmp = etup[i]",
"- okey, otmp = otup[j]",
"- if ekey != okey:",
"- break",
"- if etup[i + 1][1] < otup[j + 1][1]:",
"- j += 1",
"- else:",
"- i += 1",
"- # rint(\"calc\")",
"-# print(edic)",
"-ans = n - etmp - otmp",
"-print(ans)",
"+etmp = [(-1, 0), (-1, 0)]",
"+otmp = [(-1, 0), (-1, 0)]",
"+for key in list(edic.keys()):",
"+ # first",
"+ if edic[key] > etmp[0][1]:",
"+ etmp[1] = etmp[0]",
"+ etmp[0] = (key, edic[key])",
"+ # second",
"+ elif edic[key] > etmp[1][1]:",
"+ etmp[1] = (key, edic[key])",
"+for key in list(odic.keys()):",
"+ # first",
"+ if odic[key] > otmp[0][1]:",
"+ otmp[1] = otmp[0]",
"+ otmp[0] = (key, odic[key])",
"+ # second",
"+ elif odic[key] > otmp[1][1]:",
"+ otmp[1] = (key, odic[key])",
"+if etmp[0][0] == otmp[0][0]:",
"+ ans = max(etmp[0][1] + otmp[1][1], etmp[1][1] + otmp[0][1])",
"+else:",
"+ ans = etmp[0][1] + otmp[0][1]",
"+print((n - ans))"
] | false | 0.035722 | 0.03675 | 0.972042 |
[
"s921103672",
"s282703633"
] |
u879870653
|
p03200
|
python
|
s067850434
|
s472686503
| 66 | 44 | 4,840 | 3,500 |
Accepted
|
Accepted
| 33.33 |
L = list(eval(input()))
memo = L.count("W")
ans = 0
for i in range(len(L)) :
if L[i] == "W" :
memo -= 1
else :
ans += memo
print(ans)
|
S = eval(input())
b = 0
ans = 0
for s in S :
if s == "B" :
b += 1
else :
ans += b
print(ans)
| 9 | 9 | 160 | 118 |
L = list(eval(input()))
memo = L.count("W")
ans = 0
for i in range(len(L)):
if L[i] == "W":
memo -= 1
else:
ans += memo
print(ans)
|
S = eval(input())
b = 0
ans = 0
for s in S:
if s == "B":
b += 1
else:
ans += b
print(ans)
| false | 0 |
[
"-L = list(eval(input()))",
"-memo = L.count(\"W\")",
"+S = eval(input())",
"+b = 0",
"-for i in range(len(L)):",
"- if L[i] == \"W\":",
"- memo -= 1",
"+for s in S:",
"+ if s == \"B\":",
"+ b += 1",
"- ans += memo",
"+ ans += b"
] | false | 0.037719 | 0.132841 | 0.283939 |
[
"s067850434",
"s472686503"
] |
u227082700
|
p03611
|
python
|
s641248176
|
s834237205
| 97 | 82 | 13,964 | 13,964 |
Accepted
|
Accepted
| 15.46 |
n,a=int(eval(input())),list(map(int,input().split()));c=[0]*(max(a)+1)
for i in a:
if i>0:c[i-1]+=1
if i<len(c)-1:c[i+1]+=1
c[i]+=1
print((max(c)))
|
n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]*100007
for i in a:
b[i-1]+=1
b[i]+=1
b[i+1]+=1
print((max(b)))
| 6 | 8 | 150 | 127 |
n, a = int(eval(input())), list(map(int, input().split()))
c = [0] * (max(a) + 1)
for i in a:
if i > 0:
c[i - 1] += 1
if i < len(c) - 1:
c[i + 1] += 1
c[i] += 1
print((max(c)))
|
n = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * 100007
for i in a:
b[i - 1] += 1
b[i] += 1
b[i + 1] += 1
print((max(b)))
| false | 25 |
[
"-n, a = int(eval(input())), list(map(int, input().split()))",
"-c = [0] * (max(a) + 1)",
"+n = int(eval(input()))",
"+a = list(map(int, input().split()))",
"+b = [0] * 100007",
"- if i > 0:",
"- c[i - 1] += 1",
"- if i < len(c) - 1:",
"- c[i + 1] += 1",
"- c[i] += 1",
"-print((max(c)))",
"+ b[i - 1] += 1",
"+ b[i] += 1",
"+ b[i + 1] += 1",
"+print((max(b)))"
] | false | 0.081936 | 0.095513 | 0.857847 |
[
"s641248176",
"s834237205"
] |
u129749062
|
p02612
|
python
|
s521689867
|
s085201775
| 28 | 24 | 9,096 | 9,020 |
Accepted
|
Accepted
| 14.29 |
N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
print((1000 - N % 1000))
|
N= int(eval(input()))
if N%1000==0:
print((0))
else:
print((1000-(N%1000)))
| 5 | 6 | 80 | 77 |
N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
print((1000 - N % 1000))
|
N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
print((1000 - (N % 1000)))
| false | 16.666667 |
[
"- print((1000 - N % 1000))",
"+ print((1000 - (N % 1000)))"
] | false | 0.038727 | 0.039451 | 0.98164 |
[
"s521689867",
"s085201775"
] |
u351892848
|
p02917
|
python
|
s778636321
|
s945573422
| 163 | 24 | 38,384 | 9,124 |
Accepted
|
Accepted
| 85.28 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
B = list(map(int, input().split()))
C = [None] * N
C[0] = B[0]
C[-1] = B[-1]
for i in range(1, N - 1):
C[i] = min(B[i - 1], B[i])
print((sum(C)))
|
N = int(eval(input()))
B = list(map(int, input().split()))
A = [None] * N
A[0] = B[0]
A[-1] = B[-1]
for i in range(1, len(B)):
A[i] = min(B[i], B[i - 1])
print((sum(A)))
| 14 | 11 | 219 | 179 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
B = list(map(int, input().split()))
C = [None] * N
C[0] = B[0]
C[-1] = B[-1]
for i in range(1, N - 1):
C[i] = min(B[i - 1], B[i])
print((sum(C)))
|
N = int(eval(input()))
B = list(map(int, input().split()))
A = [None] * N
A[0] = B[0]
A[-1] = B[-1]
for i in range(1, len(B)):
A[i] = min(B[i], B[i - 1])
print((sum(A)))
| false | 21.428571 |
[
"-import sys",
"-",
"-input = sys.stdin.readline",
"-C = [None] * N",
"-C[0] = B[0]",
"-C[-1] = B[-1]",
"-for i in range(1, N - 1):",
"- C[i] = min(B[i - 1], B[i])",
"-print((sum(C)))",
"+A = [None] * N",
"+A[0] = B[0]",
"+A[-1] = B[-1]",
"+for i in range(1, len(B)):",
"+ A[i] = min(B[i], B[i - 1])",
"+print((sum(A)))"
] | false | 0.007821 | 0.080416 | 0.097256 |
[
"s778636321",
"s945573422"
] |
u729133443
|
p02763
|
python
|
s928126879
|
s611486154
| 671 | 481 | 43,584 | 44,096 |
Accepted
|
Accepted
| 28.32 |
import sys
input=sys.stdin.buffer.readline
n=int(eval(input()))+1
data=[0]*n*2
def update(i,x):
i+=n
data[i]=x
i//=2
while i:
data[i]=data[i*2]|data[i*2+1]
i//=2
def query(l,r):
l+=n
r+=n
s=0
while l<r:
if l&1:
s|=data[l]
l+=1
if r&1:
r-=1
s|=data[r]
l//=2
r//=2
return sum(map(int,bin(s)[2:]))
for i,c in enumerate(input()[:-1],n):data[i]=2**(c-97)
for i in range(n-1,0,-1):data[i]=data[i*2]|data[i-~i]
for _ in range(int(eval(input()))):
q,a,b=input().split()
if q[0]>49:print((query(int(a)-1,int(b))))
else:update(int(a)-1,2**(b[0]-97))
|
def main():
import sys
input=sys.stdin.buffer.readline
n=int(eval(input()))+1
data=[0]*n*2
def update(i,x):
i+=n
data[i]=x
i//=2
while i:
data[i]=data[i*2]|data[i*2+1]
i//=2
def query(l,r):
l+=n
r+=n
s=0
while l<r:
if l&1:
s|=data[l]
l+=1
if r&1:
r-=1
s|=data[r]
l//=2
r//=2
return bin(s).count('1')
for i,c in enumerate(input()[:-1],n):data[i]=2**(c-97)
for i in range(n-1,0,-1):data[i]=data[i*2]|data[i-~i]
s=[]
for _ in range(int(eval(input()))):
q,a,b=input().split()
if q[0]>49:s+=query(int(a)-1,int(b)),
else:update(int(a)-1,2**(b[0]-97))
print(('\n'.join(map(str,s))))
main()
| 31 | 35 | 627 | 740 |
import sys
input = sys.stdin.buffer.readline
n = int(eval(input())) + 1
data = [0] * n * 2
def update(i, x):
i += n
data[i] = x
i //= 2
while i:
data[i] = data[i * 2] | data[i * 2 + 1]
i //= 2
def query(l, r):
l += n
r += n
s = 0
while l < r:
if l & 1:
s |= data[l]
l += 1
if r & 1:
r -= 1
s |= data[r]
l //= 2
r //= 2
return sum(map(int, bin(s)[2:]))
for i, c in enumerate(input()[:-1], n):
data[i] = 2 ** (c - 97)
for i in range(n - 1, 0, -1):
data[i] = data[i * 2] | data[i - ~i]
for _ in range(int(eval(input()))):
q, a, b = input().split()
if q[0] > 49:
print((query(int(a) - 1, int(b))))
else:
update(int(a) - 1, 2 ** (b[0] - 97))
|
def main():
import sys
input = sys.stdin.buffer.readline
n = int(eval(input())) + 1
data = [0] * n * 2
def update(i, x):
i += n
data[i] = x
i //= 2
while i:
data[i] = data[i * 2] | data[i * 2 + 1]
i //= 2
def query(l, r):
l += n
r += n
s = 0
while l < r:
if l & 1:
s |= data[l]
l += 1
if r & 1:
r -= 1
s |= data[r]
l //= 2
r //= 2
return bin(s).count("1")
for i, c in enumerate(input()[:-1], n):
data[i] = 2 ** (c - 97)
for i in range(n - 1, 0, -1):
data[i] = data[i * 2] | data[i - ~i]
s = []
for _ in range(int(eval(input()))):
q, a, b = input().split()
if q[0] > 49:
s += (query(int(a) - 1, int(b)),)
else:
update(int(a) - 1, 2 ** (b[0] - 97))
print(("\n".join(map(str, s))))
main()
| false | 11.428571 |
[
"-import sys",
"+def main():",
"+ import sys",
"-input = sys.stdin.buffer.readline",
"-n = int(eval(input())) + 1",
"-data = [0] * n * 2",
"+ input = sys.stdin.buffer.readline",
"+ n = int(eval(input())) + 1",
"+ data = [0] * n * 2",
"+",
"+ def update(i, x):",
"+ i += n",
"+ data[i] = x",
"+ i //= 2",
"+ while i:",
"+ data[i] = data[i * 2] | data[i * 2 + 1]",
"+ i //= 2",
"+",
"+ def query(l, r):",
"+ l += n",
"+ r += n",
"+ s = 0",
"+ while l < r:",
"+ if l & 1:",
"+ s |= data[l]",
"+ l += 1",
"+ if r & 1:",
"+ r -= 1",
"+ s |= data[r]",
"+ l //= 2",
"+ r //= 2",
"+ return bin(s).count(\"1\")",
"+",
"+ for i, c in enumerate(input()[:-1], n):",
"+ data[i] = 2 ** (c - 97)",
"+ for i in range(n - 1, 0, -1):",
"+ data[i] = data[i * 2] | data[i - ~i]",
"+ s = []",
"+ for _ in range(int(eval(input()))):",
"+ q, a, b = input().split()",
"+ if q[0] > 49:",
"+ s += (query(int(a) - 1, int(b)),)",
"+ else:",
"+ update(int(a) - 1, 2 ** (b[0] - 97))",
"+ print((\"\\n\".join(map(str, s))))",
"-def update(i, x):",
"- i += n",
"- data[i] = x",
"- i //= 2",
"- while i:",
"- data[i] = data[i * 2] | data[i * 2 + 1]",
"- i //= 2",
"-",
"-",
"-def query(l, r):",
"- l += n",
"- r += n",
"- s = 0",
"- while l < r:",
"- if l & 1:",
"- s |= data[l]",
"- l += 1",
"- if r & 1:",
"- r -= 1",
"- s |= data[r]",
"- l //= 2",
"- r //= 2",
"- return sum(map(int, bin(s)[2:]))",
"-",
"-",
"-for i, c in enumerate(input()[:-1], n):",
"- data[i] = 2 ** (c - 97)",
"-for i in range(n - 1, 0, -1):",
"- data[i] = data[i * 2] | data[i - ~i]",
"-for _ in range(int(eval(input()))):",
"- q, a, b = input().split()",
"- if q[0] > 49:",
"- print((query(int(a) - 1, int(b))))",
"- else:",
"- update(int(a) - 1, 2 ** (b[0] - 97))",
"+main()"
] | false | 0.043057 | 0.097028 | 0.443757 |
[
"s928126879",
"s611486154"
] |
u103341055
|
p03448
|
python
|
s892406364
|
s278320184
| 31 | 27 | 9,172 | 9,096 |
Accepted
|
Accepted
| 12.9 |
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
# これだとダメ
# for a in range(A+1):
# x = X - a*500
# for b in range(B+1):
# x -= b*100
# for c in range(C+1):
# x -= c*50
# print(a,b,c,x)
# if x == 0:
# ans += 1
# これはOK
# for a in range(A+1):
# for b in range(B+1):
# for c in range(C+1):
# if 500*a+100*b+50*c == X:
# ans += 1
# こう書くとfor文一回省ける
for a in range(A+1):
for b in range(B+1):
x = X - 500*a -100*b
if x%50 == 0 and x >=0:
if x//50 <= C:
ans += 1
print(ans)
#
|
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
# これだとダメ
# for a in range(A+1):
# x = X - a*500
# for b in range(B+1):
# x -= b*100
# for c in range(C+1):
# x -= c*50
# print(a,b,c,x)
# if x == 0:
# ans += 1
# これはOK
# for a in range(A+1):
# for b in range(B+1):
# for c in range(C+1):
# if 500*a+100*b+50*c == X:
# ans += 1
# こう書くとfor文一回省ける
for a in range(A+1):
if 500 * a > X:
break
for b in range(B+1):
if 500 * a + 100 * b > X:
break
x = X - 500*a -100*b
if x%50 == 0:
if x//50 <= C:
ans += 1
print(ans)
#
| 39 | 42 | 704 | 782 |
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
# これだとダメ
# for a in range(A+1):
# x = X - a*500
# for b in range(B+1):
# x -= b*100
# for c in range(C+1):
# x -= c*50
# print(a,b,c,x)
# if x == 0:
# ans += 1
# これはOK
# for a in range(A+1):
# for b in range(B+1):
# for c in range(C+1):
# if 500*a+100*b+50*c == X:
# ans += 1
# こう書くとfor文一回省ける
for a in range(A + 1):
for b in range(B + 1):
x = X - 500 * a - 100 * b
if x % 50 == 0 and x >= 0:
if x // 50 <= C:
ans += 1
print(ans)
#
|
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
# これだとダメ
# for a in range(A+1):
# x = X - a*500
# for b in range(B+1):
# x -= b*100
# for c in range(C+1):
# x -= c*50
# print(a,b,c,x)
# if x == 0:
# ans += 1
# これはOK
# for a in range(A+1):
# for b in range(B+1):
# for c in range(C+1):
# if 500*a+100*b+50*c == X:
# ans += 1
# こう書くとfor文一回省ける
for a in range(A + 1):
if 500 * a > X:
break
for b in range(B + 1):
if 500 * a + 100 * b > X:
break
x = X - 500 * a - 100 * b
if x % 50 == 0:
if x // 50 <= C:
ans += 1
print(ans)
#
| false | 7.142857 |
[
"+ if 500 * a > X:",
"+ break",
"+ if 500 * a + 100 * b > X:",
"+ break",
"- if x % 50 == 0 and x >= 0:",
"+ if x % 50 == 0:"
] | false | 0.083692 | 0.036757 | 2.276895 |
[
"s892406364",
"s278320184"
] |
u028973125
|
p02880
|
python
|
s382983788
|
s256286024
| 208 | 29 | 38,256 | 9,136 |
Accepted
|
Accepted
| 86.06 |
import sys
from pprint import pprint
def solve(n):
for i in range(1, 10):
for j in range(1, 10):
if n == i*j:
print("Yes")
return
print("No")
if __name__ == '__main__':
n = int(sys.stdin.readline().strip())
solve(n)
|
import sys
N = int(sys.stdin.readline())
for i in range(1, 10):
for j in range(1, 10):
if i * j == N:
print("Yes")
sys.exit()
print("No")
| 14 | 10 | 298 | 184 |
import sys
from pprint import pprint
def solve(n):
for i in range(1, 10):
for j in range(1, 10):
if n == i * j:
print("Yes")
return
print("No")
if __name__ == "__main__":
n = int(sys.stdin.readline().strip())
solve(n)
|
import sys
N = int(sys.stdin.readline())
for i in range(1, 10):
for j in range(1, 10):
if i * j == N:
print("Yes")
sys.exit()
print("No")
| false | 28.571429 |
[
"-from pprint import pprint",
"-",
"-def solve(n):",
"- for i in range(1, 10):",
"- for j in range(1, 10):",
"- if n == i * j:",
"- print(\"Yes\")",
"- return",
"- print(\"No\")",
"-",
"-",
"-if __name__ == \"__main__\":",
"- n = int(sys.stdin.readline().strip())",
"- solve(n)",
"+N = int(sys.stdin.readline())",
"+for i in range(1, 10):",
"+ for j in range(1, 10):",
"+ if i * j == N:",
"+ print(\"Yes\")",
"+ sys.exit()",
"+print(\"No\")"
] | false | 0.058426 | 0.144332 | 0.404805 |
[
"s382983788",
"s256286024"
] |
u644907318
|
p03628
|
python
|
s551160232
|
s177324599
| 168 | 63 | 38,384 | 61,920 |
Accepted
|
Accepted
| 62.5 |
p = 10**9+7
N = int(eval(input()))
S1 = input().strip()
S2 = input().strip()
cnt = 1
cur = 0
if N>=2 and S1[0]==S1[1]:
cnt = cnt*6
cur = 2
else:
cnt = cnt*3
cur = 1
while cur<N:
if cur<N-1 and S1[cur]==S1[cur+1]:
if S1[cur-1]==S2[cur-1]:
cnt = (cnt*2)%p
cur += 2
else:
cnt = (cnt*3)%p
cur += 2
elif S1[cur-1]==S2[cur-1]:
cnt = (cnt*2)%p
cur += 1
elif cur>=2 and S1[cur-2]==S1[cur-1]:
cur += 1
print(cnt)
|
p = 10**9+7
N = int(eval(input()))
S1 = input().strip()
S2 = input().strip()
cnt = 1
cur = 0
if S1[0]==S2[0]:
cnt = 3
cur += 1
else:
cnt = 6
cur += 2
while cur<N:
if S1[cur]==S2[cur]:
if S1[cur-1]==S2[cur-1]:
cnt = (cnt*2)%p
cur += 1
else:
if S1[cur-1]==S2[cur-1]:
cnt = (cnt*2)%p
else:
cnt = (cnt*3)%p
cur += 2
print(cnt)
| 26 | 24 | 542 | 447 |
p = 10**9 + 7
N = int(eval(input()))
S1 = input().strip()
S2 = input().strip()
cnt = 1
cur = 0
if N >= 2 and S1[0] == S1[1]:
cnt = cnt * 6
cur = 2
else:
cnt = cnt * 3
cur = 1
while cur < N:
if cur < N - 1 and S1[cur] == S1[cur + 1]:
if S1[cur - 1] == S2[cur - 1]:
cnt = (cnt * 2) % p
cur += 2
else:
cnt = (cnt * 3) % p
cur += 2
elif S1[cur - 1] == S2[cur - 1]:
cnt = (cnt * 2) % p
cur += 1
elif cur >= 2 and S1[cur - 2] == S1[cur - 1]:
cur += 1
print(cnt)
|
p = 10**9 + 7
N = int(eval(input()))
S1 = input().strip()
S2 = input().strip()
cnt = 1
cur = 0
if S1[0] == S2[0]:
cnt = 3
cur += 1
else:
cnt = 6
cur += 2
while cur < N:
if S1[cur] == S2[cur]:
if S1[cur - 1] == S2[cur - 1]:
cnt = (cnt * 2) % p
cur += 1
else:
if S1[cur - 1] == S2[cur - 1]:
cnt = (cnt * 2) % p
else:
cnt = (cnt * 3) % p
cur += 2
print(cnt)
| false | 7.692308 |
[
"-if N >= 2 and S1[0] == S1[1]:",
"- cnt = cnt * 6",
"- cur = 2",
"+if S1[0] == S2[0]:",
"+ cnt = 3",
"+ cur += 1",
"- cnt = cnt * 3",
"- cur = 1",
"+ cnt = 6",
"+ cur += 2",
"- if cur < N - 1 and S1[cur] == S1[cur + 1]:",
"+ if S1[cur] == S2[cur]:",
"- cur += 2",
"+ cur += 1",
"+ else:",
"+ if S1[cur - 1] == S2[cur - 1]:",
"+ cnt = (cnt * 2) % p",
"- cur += 2",
"- elif S1[cur - 1] == S2[cur - 1]:",
"- cnt = (cnt * 2) % p",
"- cur += 1",
"- elif cur >= 2 and S1[cur - 2] == S1[cur - 1]:",
"- cur += 1",
"+ cur += 2"
] | false | 0.045826 | 0.048519 | 0.944488 |
[
"s551160232",
"s177324599"
] |
u730769327
|
p03958
|
python
|
s919690073
|
s749969260
| 113 | 67 | 61,208 | 61,888 |
Accepted
|
Accepted
| 40.71 |
n,k=list(map(int,input().split()))
t=list(map(int,input().split()))
mt=max(t)
print((max(2*mt-n-1,0)))
|
n,k=list(map(int,input().split()))
print((max(2*max(list(map(int,input().split())))-n-1,0)))
| 4 | 2 | 97 | 85 |
n, k = list(map(int, input().split()))
t = list(map(int, input().split()))
mt = max(t)
print((max(2 * mt - n - 1, 0)))
|
n, k = list(map(int, input().split()))
print((max(2 * max(list(map(int, input().split()))) - n - 1, 0)))
| false | 50 |
[
"-t = list(map(int, input().split()))",
"-mt = max(t)",
"-print((max(2 * mt - n - 1, 0)))",
"+print((max(2 * max(list(map(int, input().split()))) - n - 1, 0)))"
] | false | 0.038827 | 0.037865 | 1.025405 |
[
"s919690073",
"s749969260"
] |
u875361824
|
p03294
|
python
|
s035735676
|
s002064486
| 170 | 18 | 5,204 | 3,316 |
Accepted
|
Accepted
| 89.41 |
def main():
"""
2 <= N <= 10^3
2 <= ai <= 10^5
非負整数 m に対して
f(m) = (m mod a1) + (m mod a2) + (m mod aN)
f_max
mの制約は問題文中には直接記述されていない
"""
N = int(input())
*A, = map(int, input().split())
ans = f(N, A)
print(ans)
def f(N, A):
"""
直感: 最小公倍数,最大公約数
最小公倍数のm ならすべてのaで割り切れる
つまり最小公倍数-1 ならすべてのaについて m mod ai = ai - 1
m=a_MAX-1, (m mod a_MAX) が最大
ただし他のa=a_MAX-1 の場合、f(m)は小さくなってしまう
aiに対して1 <= m <= a_Max-1 をすべて試す: 10^5 * 3 * 10^3 => TLE
"""
try:
# py3.5
from math import gcd
except:
from fractions import gcd
def lcm(x, y):
return x * y // gcd(x, y)
m1 = lcm(A[0], A[1])
for a in A[2:]:
m1 = lcm(m1, a)
m = m1 - 1
ans = sum(m % a for a in A)
return ans
def WA(N, A):
ans = 0
m_max = max(A) * 2 - 1
for m in range(1, m_max):
mods = [m % a for a in A]
tmp = sum(mods)
print(*(mods + [tmp]), sep="\t")
ans = max(ans, tmp)
return ans
if __name__ == '__main__':
main()
|
def main():
"""
2 <= N <= 10^3
2 <= ai <= 10^5
非負整数 m に対して
f(m) = (m mod a1) + (m mod a2) + (m mod aN)
f_max
mの制約は問題文中には直接記述されていない
"""
N = int(input())
*A, = map(int, input().split())
ans = editorial(N, A)
print(ans)
def f(N, A):
"""
直感: 最小公倍数,最大公約数
最小公倍数のm ならすべてのaで割り切れる
つまり最小公倍数-1 ならすべてのaについて m mod ai = ai - 1
m=a_MAX-1, (m mod a_MAX) が最大
ただし他のa=a_MAX-1 の場合、f(m)は小さくなってしまう
aiに対して1 <= m <= a_Max-1 をすべて試す: 10^5 * 3 * 10^3 => TLE
"""
try:
# py3.5
from math import gcd
except:
from fractions import gcd
def lcm(x, y):
return x * y // gcd(x, y)
m1 = lcm(A[0], A[1])
for a in A[2:]:
m1 = lcm(m1, a)
m = m1 - 1
ans = sum(m % a for a in A)
return ans
def editorial(N, A):
"""
lcm を求めなくても、ai - 1 であることはわかるので
lcm を計算しなくてよい
"""
return sum(a - 1 for a in A)
def WA(N, A):
ans = 0
m_max = max(A) * 2 - 1
for m in range(1, m_max):
mods = [m % a for a in A]
tmp = sum(mods)
print(*(mods + [tmp]), sep="\t")
ans = max(ans, tmp)
return ans
if __name__ == '__main__':
main()
| 61 | 69 | 1,138 | 1,279 |
def main():
"""
2 <= N <= 10^3
2 <= ai <= 10^5
非負整数 m に対して
f(m) = (m mod a1) + (m mod a2) + (m mod aN)
f_max
mの制約は問題文中には直接記述されていない
"""
N = int(input())
(*A,) = map(int, input().split())
ans = f(N, A)
print(ans)
def f(N, A):
"""
直感: 最小公倍数,最大公約数
最小公倍数のm ならすべてのaで割り切れる
つまり最小公倍数-1 ならすべてのaについて m mod ai = ai - 1
m=a_MAX-1, (m mod a_MAX) が最大
ただし他のa=a_MAX-1 の場合、f(m)は小さくなってしまう
aiに対して1 <= m <= a_Max-1 をすべて試す: 10^5 * 3 * 10^3 => TLE
"""
try:
# py3.5
from math import gcd
except:
from fractions import gcd
def lcm(x, y):
return x * y // gcd(x, y)
m1 = lcm(A[0], A[1])
for a in A[2:]:
m1 = lcm(m1, a)
m = m1 - 1
ans = sum(m % a for a in A)
return ans
def WA(N, A):
ans = 0
m_max = max(A) * 2 - 1
for m in range(1, m_max):
mods = [m % a for a in A]
tmp = sum(mods)
print(*(mods + [tmp]), sep="\t")
ans = max(ans, tmp)
return ans
if __name__ == "__main__":
main()
|
def main():
"""
2 <= N <= 10^3
2 <= ai <= 10^5
非負整数 m に対して
f(m) = (m mod a1) + (m mod a2) + (m mod aN)
f_max
mの制約は問題文中には直接記述されていない
"""
N = int(input())
(*A,) = map(int, input().split())
ans = editorial(N, A)
print(ans)
def f(N, A):
"""
直感: 最小公倍数,最大公約数
最小公倍数のm ならすべてのaで割り切れる
つまり最小公倍数-1 ならすべてのaについて m mod ai = ai - 1
m=a_MAX-1, (m mod a_MAX) が最大
ただし他のa=a_MAX-1 の場合、f(m)は小さくなってしまう
aiに対して1 <= m <= a_Max-1 をすべて試す: 10^5 * 3 * 10^3 => TLE
"""
try:
# py3.5
from math import gcd
except:
from fractions import gcd
def lcm(x, y):
return x * y // gcd(x, y)
m1 = lcm(A[0], A[1])
for a in A[2:]:
m1 = lcm(m1, a)
m = m1 - 1
ans = sum(m % a for a in A)
return ans
def editorial(N, A):
"""
lcm を求めなくても、ai - 1 であることはわかるので
lcm を計算しなくてよい
"""
return sum(a - 1 for a in A)
def WA(N, A):
ans = 0
m_max = max(A) * 2 - 1
for m in range(1, m_max):
mods = [m % a for a in A]
tmp = sum(mods)
print(*(mods + [tmp]), sep="\t")
ans = max(ans, tmp)
return ans
if __name__ == "__main__":
main()
| false | 11.594203 |
[
"- ans = f(N, A)",
"+ ans = editorial(N, A)",
"+def editorial(N, A):",
"+ \"\"\"",
"+ lcm を求めなくても、ai - 1 であることはわかるので",
"+ lcm を計算しなくてよい",
"+ \"\"\"",
"+ return sum(a - 1 for a in A)",
"+",
"+"
] | false | 0.04828 | 0.043046 | 1.121586 |
[
"s035735676",
"s002064486"
] |
u773265208
|
p02952
|
python
|
s248305222
|
s931174482
| 74 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 77.03 |
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if int(len(str(i))) % 2 == 1:
ans += 1
print(ans)
|
n = eval(input())
keta = len(n)
n = int(n)
ans = 0
for i in range(1,keta,2):
ans += 9 * (10 ** (i-1))
if keta % 2 == 0:
print(ans)
else:
ans += n - 10**(keta-1) + 1
print(ans)
| 9 | 13 | 111 | 188 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if int(len(str(i))) % 2 == 1:
ans += 1
print(ans)
|
n = eval(input())
keta = len(n)
n = int(n)
ans = 0
for i in range(1, keta, 2):
ans += 9 * (10 ** (i - 1))
if keta % 2 == 0:
print(ans)
else:
ans += n - 10 ** (keta - 1) + 1
print(ans)
| false | 30.769231 |
[
"-n = int(eval(input()))",
"+n = eval(input())",
"+keta = len(n)",
"+n = int(n)",
"-for i in range(1, n + 1):",
"- if int(len(str(i))) % 2 == 1:",
"- ans += 1",
"-print(ans)",
"+for i in range(1, keta, 2):",
"+ ans += 9 * (10 ** (i - 1))",
"+if keta % 2 == 0:",
"+ print(ans)",
"+else:",
"+ ans += n - 10 ** (keta - 1) + 1",
"+ print(ans)"
] | false | 0.058503 | 0.038066 | 1.536882 |
[
"s248305222",
"s931174482"
] |
u375750218
|
p03400
|
python
|
s882895368
|
s803084393
| 29 | 25 | 9,136 | 9,100 |
Accepted
|
Accepted
| 13.79 |
n=int(eval(input()))
d,x=list(map(int,input().split()))
a=[int(eval(input())) for i in range(n)]
ans=x
for i in range(n):
cnt=0
while cnt*a[i]+1<=d:
cnt+=1
ans+=cnt
print(ans)
|
n=int(eval(input()))
d,x=list(map(int,input().split()))
a=[int(eval(input())) for i in range(n)]
ans=[1+(d-1)//a[i] for i in range(n)]
print((x+sum(ans)))
| 10 | 6 | 186 | 141 |
n = int(eval(input()))
d, x = list(map(int, input().split()))
a = [int(eval(input())) for i in range(n)]
ans = x
for i in range(n):
cnt = 0
while cnt * a[i] + 1 <= d:
cnt += 1
ans += cnt
print(ans)
|
n = int(eval(input()))
d, x = list(map(int, input().split()))
a = [int(eval(input())) for i in range(n)]
ans = [1 + (d - 1) // a[i] for i in range(n)]
print((x + sum(ans)))
| false | 40 |
[
"-ans = x",
"-for i in range(n):",
"- cnt = 0",
"- while cnt * a[i] + 1 <= d:",
"- cnt += 1",
"- ans += cnt",
"-print(ans)",
"+ans = [1 + (d - 1) // a[i] for i in range(n)]",
"+print((x + sum(ans)))"
] | false | 0.03911 | 0.044232 | 0.884195 |
[
"s882895368",
"s803084393"
] |
u508732591
|
p02258
|
python
|
s636694502
|
s153999277
| 210 | 190 | 21,912 | 21,852 |
Accepted
|
Accepted
| 9.52 |
import sys
n = int(eval(input()))
minv = int(eval(input()))
v = int(eval(input()))
maxv = v-minv
if v < minv: minv = v
for r in map(int,sys.stdin.readlines()):
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv)
|
import sys
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif r-minv < 0:
minv = r
print(maxv)
| 19 | 16 | 289 | 264 |
import sys
n = int(eval(input()))
minv = int(eval(input()))
v = int(eval(input()))
maxv = v - minv
if v < minv:
minv = v
for r in map(int, sys.stdin.readlines()):
m = r - minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv)
|
import sys
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for r in map(int, sys.stdin.readlines()):
if maxv < r - minv < 0:
maxv = r - minv
minv = r
elif maxv < r - minv:
maxv = r - minv
elif r - minv < 0:
minv = r
print(maxv)
| false | 15.789474 |
[
"-v = int(eval(input()))",
"-maxv = v - minv",
"-if v < minv:",
"- minv = v",
"+maxv = -1000000000",
"- m = r - minv",
"- if maxv < m < 0:",
"- maxv = m",
"+ if maxv < r - minv < 0:",
"+ maxv = r - minv",
"- elif maxv < m:",
"- maxv = m",
"- elif m < 0:",
"+ elif maxv < r - minv:",
"+ maxv = r - minv",
"+ elif r - minv < 0:"
] | false | 0.044457 | 0.138077 | 0.321971 |
[
"s636694502",
"s153999277"
] |
u006425112
|
p03162
|
python
|
s142078614
|
s851965046
| 598 | 438 | 20,780 | 12,508 |
Accepted
|
Accepted
| 26.76 |
import sys
import numpy as np
n = int(eval(input()))
dp = list(map(int, input().split()))
for i in range(n-1):
a, b, c = list(map(int, input().split()))
dp0, dp1, dp2 = dp
dp[0] = max(dp1+a,dp2+a)
dp[1] = max(dp0+b,dp2+b)
dp[2] = max(dp0+c,dp1+c)
print((max(dp)))
|
import sys
import numpy as np
n = int(eval(input()))
dp = list(map(int, sys.stdin.readline().split()))
for i in range(n-1):
a, b, c = list(map(int, sys.stdin.readline().split()))
dp0, dp1, dp2 = dp
dp[0] = max(dp1+a,dp2+a)
dp[1] = max(dp0+b,dp2+b)
dp[2] = max(dp0+c,dp1+c)
print((max(dp)))
| 13 | 13 | 289 | 315 |
import sys
import numpy as np
n = int(eval(input()))
dp = list(map(int, input().split()))
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
dp0, dp1, dp2 = dp
dp[0] = max(dp1 + a, dp2 + a)
dp[1] = max(dp0 + b, dp2 + b)
dp[2] = max(dp0 + c, dp1 + c)
print((max(dp)))
|
import sys
import numpy as np
n = int(eval(input()))
dp = list(map(int, sys.stdin.readline().split()))
for i in range(n - 1):
a, b, c = list(map(int, sys.stdin.readline().split()))
dp0, dp1, dp2 = dp
dp[0] = max(dp1 + a, dp2 + a)
dp[1] = max(dp0 + b, dp2 + b)
dp[2] = max(dp0 + c, dp1 + c)
print((max(dp)))
| false | 0 |
[
"-dp = list(map(int, input().split()))",
"+dp = list(map(int, sys.stdin.readline().split()))",
"- a, b, c = list(map(int, input().split()))",
"+ a, b, c = list(map(int, sys.stdin.readline().split()))"
] | false | 0.036059 | 0.040746 | 0.884972 |
[
"s142078614",
"s851965046"
] |
u548252256
|
p02414
|
python
|
s672989491
|
s698577216
| 460 | 290 | 7,068 | 7,304 |
Accepted
|
Accepted
| 36.96 |
n1,n2,n3 = list(map(int,input().split(" ")))
list1 = [list(map(int,input().split(" "))) for _ in range(n1)]
list2 = [list(map(int,input().split(" "))) for _ in range(n2)]
mat = [[0 for _ in range(n3)] for _ in range(n1)]
for i in range(n1):
for j in range(n3):
for k in range(n2):
mat[i][j] += list1[i][k] * list2[k][j]
for m in mat:
print((*m))
|
n1,n2,n3 = list(map(int,input().split(" ")))
list1 = [list(map(int,input().split(" "))) for _ in range(n1)]
list2 = [list(map(int,input().split(" "))) for _ in range(n2)]
mat = [[0 for _ in range(n3)] for _ in range(n1)]
for i in range(n1):
for j in range(n3):
mat[i][j]= str(sum(list1[i][k] * list2[k][j] for k in range(n2)))
for m in mat:
print((*m))
| 15 | 14 | 364 | 367 |
n1, n2, n3 = list(map(int, input().split(" ")))
list1 = [list(map(int, input().split(" "))) for _ in range(n1)]
list2 = [list(map(int, input().split(" "))) for _ in range(n2)]
mat = [[0 for _ in range(n3)] for _ in range(n1)]
for i in range(n1):
for j in range(n3):
for k in range(n2):
mat[i][j] += list1[i][k] * list2[k][j]
for m in mat:
print((*m))
|
n1, n2, n3 = list(map(int, input().split(" ")))
list1 = [list(map(int, input().split(" "))) for _ in range(n1)]
list2 = [list(map(int, input().split(" "))) for _ in range(n2)]
mat = [[0 for _ in range(n3)] for _ in range(n1)]
for i in range(n1):
for j in range(n3):
mat[i][j] = str(sum(list1[i][k] * list2[k][j] for k in range(n2)))
for m in mat:
print((*m))
| false | 6.666667 |
[
"- for k in range(n2):",
"- mat[i][j] += list1[i][k] * list2[k][j]",
"+ mat[i][j] = str(sum(list1[i][k] * list2[k][j] for k in range(n2)))"
] | false | 0.036314 | 0.037607 | 0.965617 |
[
"s672989491",
"s698577216"
] |
u075012704
|
p03044
|
python
|
s380571198
|
s988371073
| 1,084 | 827 | 123,744 | 46,648 |
Accepted
|
Accepted
| 23.71 |
import sys
sys.setrecursionlimit(10 ** 9)
N = int(input())
T = [[] for i in range(N)]
for i in range(N - 1):
u, v, w = map(int, input().split())
u, v = u - 1, v - 1
T[u].append([v, w])
T[v].append([u, w])
visited = [False] * N
visited[0] = True
def dfs(n):
visited = [False] * N
stack = [[n, 0]]
longest = [-1, -1]
while stack:
node, weight = stack.pop()
if visited[node]:
continue
visited[node] = True
if longest[1] < weight:
longest = [node, weight]
for n, w in T[node]:
if not visited[n]:
stack.append([n, w + weight])
return longest
start, xw = dfs(0)
color = [None] * N
def dfs(n):
for to, weight in T[n]:
if color[to] is None:
if weight % 2 == 0:
color[to] = color[n]
dfs(to)
else:
color[to] = color[n] ^ 1
dfs(to)
color[start] = 0
dfs(start)
print(*color, sep='\n')
|
N = int(input())
T = [[] for i in range(N)]
for i in range(N - 1):
u, v, w = map(int, input().split())
u, v = u - 1, v - 1
T[u].append([v, w])
T[v].append([u, w])
color = [-1] * N
stack = [[0, 0]]
while stack:
n, w = stack.pop()
color[n] = w % 2
for to, to_w in T[n]:
if color[to] >= 0:
continue
stack.append([to, w + to_w])
print(*color, sep='\n')
| 56 | 22 | 1,072 | 431 |
import sys
sys.setrecursionlimit(10**9)
N = int(input())
T = [[] for i in range(N)]
for i in range(N - 1):
u, v, w = map(int, input().split())
u, v = u - 1, v - 1
T[u].append([v, w])
T[v].append([u, w])
visited = [False] * N
visited[0] = True
def dfs(n):
visited = [False] * N
stack = [[n, 0]]
longest = [-1, -1]
while stack:
node, weight = stack.pop()
if visited[node]:
continue
visited[node] = True
if longest[1] < weight:
longest = [node, weight]
for n, w in T[node]:
if not visited[n]:
stack.append([n, w + weight])
return longest
start, xw = dfs(0)
color = [None] * N
def dfs(n):
for to, weight in T[n]:
if color[to] is None:
if weight % 2 == 0:
color[to] = color[n]
dfs(to)
else:
color[to] = color[n] ^ 1
dfs(to)
color[start] = 0
dfs(start)
print(*color, sep="\n")
|
N = int(input())
T = [[] for i in range(N)]
for i in range(N - 1):
u, v, w = map(int, input().split())
u, v = u - 1, v - 1
T[u].append([v, w])
T[v].append([u, w])
color = [-1] * N
stack = [[0, 0]]
while stack:
n, w = stack.pop()
color[n] = w % 2
for to, to_w in T[n]:
if color[to] >= 0:
continue
stack.append([to, w + to_w])
print(*color, sep="\n")
| false | 60.714286 |
[
"-import sys",
"-",
"-sys.setrecursionlimit(10**9)",
"-visited = [False] * N",
"-visited[0] = True",
"-",
"-",
"-def dfs(n):",
"- visited = [False] * N",
"- stack = [[n, 0]]",
"- longest = [-1, -1]",
"- while stack:",
"- node, weight = stack.pop()",
"- if visited[node]:",
"+color = [-1] * N",
"+stack = [[0, 0]]",
"+while stack:",
"+ n, w = stack.pop()",
"+ color[n] = w % 2",
"+ for to, to_w in T[n]:",
"+ if color[to] >= 0:",
"- visited[node] = True",
"- if longest[1] < weight:",
"- longest = [node, weight]",
"- for n, w in T[node]:",
"- if not visited[n]:",
"- stack.append([n, w + weight])",
"- return longest",
"-",
"-",
"-start, xw = dfs(0)",
"-color = [None] * N",
"-",
"-",
"-def dfs(n):",
"- for to, weight in T[n]:",
"- if color[to] is None:",
"- if weight % 2 == 0:",
"- color[to] = color[n]",
"- dfs(to)",
"- else:",
"- color[to] = color[n] ^ 1",
"- dfs(to)",
"-",
"-",
"-color[start] = 0",
"-dfs(start)",
"+ stack.append([to, w + to_w])"
] | false | 0.079152 | 0.040754 | 1.942212 |
[
"s380571198",
"s988371073"
] |
u077291787
|
p02887
|
python
|
s236442907
|
s275548089
| 63 | 25 | 15,988 | 3,316 |
Accepted
|
Accepted
| 60.32 |
# ABC143C - Slimes
from itertools import groupby
def main():
N = int(eval(input()))
S = input().rstrip()
ans = len(tuple(groupby(S)))
print(ans)
if __name__ == "__main__":
main()
|
def main():
N = int(eval(input()))
S = input().rstrip()
S += "."
ans, cur = 0, S[0]
for s in S[1:]:
if s != cur:
ans += 1
cur = s
print(ans)
if __name__ == "__main__":
main()
| 13 | 14 | 208 | 239 |
# ABC143C - Slimes
from itertools import groupby
def main():
N = int(eval(input()))
S = input().rstrip()
ans = len(tuple(groupby(S)))
print(ans)
if __name__ == "__main__":
main()
|
def main():
N = int(eval(input()))
S = input().rstrip()
S += "."
ans, cur = 0, S[0]
for s in S[1:]:
if s != cur:
ans += 1
cur = s
print(ans)
if __name__ == "__main__":
main()
| false | 7.142857 |
[
"-# ABC143C - Slimes",
"-from itertools import groupby",
"-",
"-",
"- ans = len(tuple(groupby(S)))",
"+ S += \".\"",
"+ ans, cur = 0, S[0]",
"+ for s in S[1:]:",
"+ if s != cur:",
"+ ans += 1",
"+ cur = s"
] | false | 0.061608 | 0.069558 | 0.885704 |
[
"s236442907",
"s275548089"
] |
u347640436
|
p02695
|
python
|
s630685226
|
s053835289
| 1,196 | 1,047 | 15,820 | 9,132 |
Accepted
|
Accepted
| 12.46 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
m = M - 1
def f(s):
if len(s) == N:
return [s]
result = []
if s == '':
r = 0
else:
r = int(s[-1])
for i in range(r, m + 1):
result.extend(f(s + str(i)))
return result
result = 0
V = f('')
for s in V:
A = [int(c) + 1 for c in s]
t = 0
for a, b, c, d in abcd:
if A[b - 1] - A[a - 1] == c:
t += d
result = max(result, t)
print(result)
|
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
result = 0
for A in combinations_with_replacement(list(range(1, M + 1)), N):
t = 0
for a, b, c, d in abcd:
if A[b - 1] - A[a - 1] == c:
t += d
result = max(result, t)
print(result)
| 27 | 13 | 548 | 368 |
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
m = M - 1
def f(s):
if len(s) == N:
return [s]
result = []
if s == "":
r = 0
else:
r = int(s[-1])
for i in range(r, m + 1):
result.extend(f(s + str(i)))
return result
result = 0
V = f("")
for s in V:
A = [int(c) + 1 for c in s]
t = 0
for a, b, c, d in abcd:
if A[b - 1] - A[a - 1] == c:
t += d
result = max(result, t)
print(result)
|
from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
result = 0
for A in combinations_with_replacement(list(range(1, M + 1)), N):
t = 0
for a, b, c, d in abcd:
if A[b - 1] - A[a - 1] == c:
t += d
result = max(result, t)
print(result)
| false | 51.851852 |
[
"+from itertools import combinations_with_replacement",
"+",
"-m = M - 1",
"-",
"-",
"-def f(s):",
"- if len(s) == N:",
"- return [s]",
"- result = []",
"- if s == \"\":",
"- r = 0",
"- else:",
"- r = int(s[-1])",
"- for i in range(r, m + 1):",
"- result.extend(f(s + str(i)))",
"- return result",
"-",
"-",
"-V = f(\"\")",
"-for s in V:",
"- A = [int(c) + 1 for c in s]",
"+for A in combinations_with_replacement(list(range(1, M + 1)), N):"
] | false | 0.323061 | 0.134392 | 2.40388 |
[
"s630685226",
"s053835289"
] |
u410118019
|
p03634
|
python
|
s393430368
|
s094126933
| 1,570 | 612 | 91,168 | 81,476 |
Accepted
|
Accepted
| 61.02 |
n = int(eval(input()))
g = [[] for i in range(n)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
a-=1;b-=1
g[a].append([b,c])
g[b].append([a,c])
q,k = list(map(int,input().split()))
k -= 1
con = [-1] * n
con[k] = 0
stack = [k]
while stack:
cur = stack.pop()
for i,j in g[cur]:
if con[i] == -1:
con[i] = con[cur] + j
stack.append(i)
for i in range(q):
x,y = list(map(int,input().split()))
x-=1;y-=1
print((con[x]+con[y]))
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
g = [[] for i in range(n)]
for i in range(n-1):
a,b,c = list(map(int,input().split()))
a-=1;b-=1
g[a].append([b,c])
g[b].append([a,c])
q,k = list(map(int,input().split()))
k -= 1
con = [-1] * n
con[k] = 0
stack = [k]
while stack:
cur = stack.pop()
for i,j in g[cur]:
if con[i] == -1:
con[i] = con[cur] + j
stack.append(i)
for i in range(q):
x,y = list(map(int,input().split()))
x-=1;y-=1
print((con[x]+con[y]))
| 22 | 24 | 463 | 502 |
n = int(eval(input()))
g = [[] for i in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
g[a].append([b, c])
g[b].append([a, c])
q, k = list(map(int, input().split()))
k -= 1
con = [-1] * n
con[k] = 0
stack = [k]
while stack:
cur = stack.pop()
for i, j in g[cur]:
if con[i] == -1:
con[i] = con[cur] + j
stack.append(i)
for i in range(q):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
print((con[x] + con[y]))
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
g = [[] for i in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
g[a].append([b, c])
g[b].append([a, c])
q, k = list(map(int, input().split()))
k -= 1
con = [-1] * n
con[k] = 0
stack = [k]
while stack:
cur = stack.pop()
for i, j in g[cur]:
if con[i] == -1:
con[i] = con[cur] + j
stack.append(i)
for i in range(q):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
print((con[x] + con[y]))
| false | 8.333333 |
[
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.037358 | 0.036852 | 1.013741 |
[
"s393430368",
"s094126933"
] |
u794544096
|
p02812
|
python
|
s077442688
|
s047310911
| 172 | 67 | 38,384 | 61,752 |
Accepted
|
Accepted
| 61.05 |
n = int(eval(input()))
s = eval(input())
string = 'ABC'
count = 0
for i in range(n - 2):
if s[i:i+3] == string:
count += 1
print(count)
|
n = int(eval(input()))
s = eval(input())
l = 'ABC'
count = 0
for i in range(n-2):
if s[i: i+3] == l:
count += 1
print(count)
| 13 | 11 | 160 | 153 |
n = int(eval(input()))
s = eval(input())
string = "ABC"
count = 0
for i in range(n - 2):
if s[i : i + 3] == string:
count += 1
print(count)
|
n = int(eval(input()))
s = eval(input())
l = "ABC"
count = 0
for i in range(n - 2):
if s[i : i + 3] == l:
count += 1
print(count)
| false | 15.384615 |
[
"-string = \"ABC\"",
"+l = \"ABC\"",
"- if s[i : i + 3] == string:",
"+ if s[i : i + 3] == l:"
] | false | 0.071942 | 0.042244 | 1.703008 |
[
"s077442688",
"s047310911"
] |
u313111801
|
p02923
|
python
|
s520537581
|
s511649410
| 93 | 80 | 20,108 | 20,072 |
Accepted
|
Accepted
| 13.98 |
N=int(eval(input()))
H=[int(x) for x in input().split()]
ans=0
cur=0
for i,h in enumerate(H):
if i>=1 and h<=H[i-1]:
cur=cur+1
ans=max(ans,cur)
else:
cur=0
print(ans)
|
N=int(eval(input()))
H=[int(x) for x in input().split()]
cur=[0]*N
for i in range(1,N):
if H[i]<=H[i-1]:
cur[i]=cur[i-1]+1
print((max(cur)))
| 11 | 7 | 203 | 151 |
N = int(eval(input()))
H = [int(x) for x in input().split()]
ans = 0
cur = 0
for i, h in enumerate(H):
if i >= 1 and h <= H[i - 1]:
cur = cur + 1
ans = max(ans, cur)
else:
cur = 0
print(ans)
|
N = int(eval(input()))
H = [int(x) for x in input().split()]
cur = [0] * N
for i in range(1, N):
if H[i] <= H[i - 1]:
cur[i] = cur[i - 1] + 1
print((max(cur)))
| false | 36.363636 |
[
"-ans = 0",
"-cur = 0",
"-for i, h in enumerate(H):",
"- if i >= 1 and h <= H[i - 1]:",
"- cur = cur + 1",
"- ans = max(ans, cur)",
"- else:",
"- cur = 0",
"-print(ans)",
"+cur = [0] * N",
"+for i in range(1, N):",
"+ if H[i] <= H[i - 1]:",
"+ cur[i] = cur[i - 1] + 1",
"+print((max(cur)))"
] | false | 0.041618 | 0.056619 | 0.735055 |
[
"s520537581",
"s511649410"
] |
u123756661
|
p02838
|
python
|
s254548877
|
s634381797
| 1,971 | 1,639 | 207,308 | 207,308 |
Accepted
|
Accepted
| 16.84 |
mod=1000000007
ans=0
n=int(eval(input()))
a=[int(i) for i in input().split()]
x=[[0]*63 for i in range(n+1)]
l=[(2**i)%mod for i in range(63)]
for i in range(n):
d=a[i]
cnt=0
for j in range(63):
if d&1:
x[i+1][cnt]=x[i][cnt]+1
else:
x[i+1][cnt]=x[i][cnt]
cnt+=1
d=d>>1
for i in range(1,n):
for j in range(63):
p=x[i][j]-x[i-1][j]
if p:
ans+=l[j]*((n-i)-(x[-1][j]-x[i][j]))
else:
ans+=l[j]*(x[-1][j]-x[i][j])
ans%=mod
print(ans)
|
def sol():
mod=1000000007
ans=0
n=int(eval(input()))
a=[int(i) for i in input().split()]
x=[[0]*63 for i in range(n+1)]
l=[(2**i)%mod for i in range(63)]
for i in range(n):
d=a[i]
cnt=0
for j in range(63):
if d&1:
x[i+1][cnt]=x[i][cnt]+1
else:
x[i+1][cnt]=x[i][cnt]
cnt+=1
d=d>>1
for i in range(1,n):
for j in range(63):
p=x[i][j]-x[i-1][j]
if p:
ans+=l[j]*((n-i)-(x[-1][j]-x[i][j]))
else:
ans+=l[j]*(x[-1][j]-x[i][j])
ans%=mod
print(ans)
if __name__=="__main__":
sol()
| 27 | 31 | 577 | 728 |
mod = 1000000007
ans = 0
n = int(eval(input()))
a = [int(i) for i in input().split()]
x = [[0] * 63 for i in range(n + 1)]
l = [(2**i) % mod for i in range(63)]
for i in range(n):
d = a[i]
cnt = 0
for j in range(63):
if d & 1:
x[i + 1][cnt] = x[i][cnt] + 1
else:
x[i + 1][cnt] = x[i][cnt]
cnt += 1
d = d >> 1
for i in range(1, n):
for j in range(63):
p = x[i][j] - x[i - 1][j]
if p:
ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))
else:
ans += l[j] * (x[-1][j] - x[i][j])
ans %= mod
print(ans)
|
def sol():
mod = 1000000007
ans = 0
n = int(eval(input()))
a = [int(i) for i in input().split()]
x = [[0] * 63 for i in range(n + 1)]
l = [(2**i) % mod for i in range(63)]
for i in range(n):
d = a[i]
cnt = 0
for j in range(63):
if d & 1:
x[i + 1][cnt] = x[i][cnt] + 1
else:
x[i + 1][cnt] = x[i][cnt]
cnt += 1
d = d >> 1
for i in range(1, n):
for j in range(63):
p = x[i][j] - x[i - 1][j]
if p:
ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))
else:
ans += l[j] * (x[-1][j] - x[i][j])
ans %= mod
print(ans)
if __name__ == "__main__":
sol()
| false | 12.903226 |
[
"-mod = 1000000007",
"-ans = 0",
"-n = int(eval(input()))",
"-a = [int(i) for i in input().split()]",
"-x = [[0] * 63 for i in range(n + 1)]",
"-l = [(2**i) % mod for i in range(63)]",
"-for i in range(n):",
"- d = a[i]",
"- cnt = 0",
"- for j in range(63):",
"- if d & 1:",
"- x[i + 1][cnt] = x[i][cnt] + 1",
"- else:",
"- x[i + 1][cnt] = x[i][cnt]",
"- cnt += 1",
"- d = d >> 1",
"-for i in range(1, n):",
"- for j in range(63):",
"- p = x[i][j] - x[i - 1][j]",
"- if p:",
"- ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))",
"- else:",
"- ans += l[j] * (x[-1][j] - x[i][j])",
"- ans %= mod",
"-print(ans)",
"+def sol():",
"+ mod = 1000000007",
"+ ans = 0",
"+ n = int(eval(input()))",
"+ a = [int(i) for i in input().split()]",
"+ x = [[0] * 63 for i in range(n + 1)]",
"+ l = [(2**i) % mod for i in range(63)]",
"+ for i in range(n):",
"+ d = a[i]",
"+ cnt = 0",
"+ for j in range(63):",
"+ if d & 1:",
"+ x[i + 1][cnt] = x[i][cnt] + 1",
"+ else:",
"+ x[i + 1][cnt] = x[i][cnt]",
"+ cnt += 1",
"+ d = d >> 1",
"+ for i in range(1, n):",
"+ for j in range(63):",
"+ p = x[i][j] - x[i - 1][j]",
"+ if p:",
"+ ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))",
"+ else:",
"+ ans += l[j] * (x[-1][j] - x[i][j])",
"+ ans %= mod",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ sol()"
] | false | 0.071691 | 0.035597 | 2.013944 |
[
"s254548877",
"s634381797"
] |
u935558307
|
p03828
|
python
|
s428775135
|
s732725168
| 173 | 96 | 39,408 | 75,488 |
Accepted
|
Accepted
| 44.51 |
from collections import Counter
N = int(eval(input()))
factors = []
for i in range(N):
T = N-i
d = 2
while d**2<=T:
if T%d==0:
factors.append(d)
T//=d
else:
d+=1
if T!=1:
factors.append(T)
factors = Counter(factors)
ans = 1
for v in list(factors.values()):
ans *= (v+1)
mod = 10**9 +7
print((ans%mod))
|
"""
1~Nまでを素因数分解して、素因数の数を足し合わせればよい。
計算量としては、O(N*√N)
"""
from collections import Counter
N = int(eval(input()))
count = Counter([])
for i in range(1,N+1):
tmp = []
d = 2
while d**2 <= i:
if i%d == 0:
i //= d
tmp.append(d)
else:
d += 1
if i != 1:
tmp.append(i)
count += Counter(tmp)
mod = 10**9 +7
ans = 1
for v in list(count.values()):
ans *= (v+1)
ans %= mod
print(ans)
| 20 | 26 | 386 | 466 |
from collections import Counter
N = int(eval(input()))
factors = []
for i in range(N):
T = N - i
d = 2
while d**2 <= T:
if T % d == 0:
factors.append(d)
T //= d
else:
d += 1
if T != 1:
factors.append(T)
factors = Counter(factors)
ans = 1
for v in list(factors.values()):
ans *= v + 1
mod = 10**9 + 7
print((ans % mod))
|
"""
1~Nまでを素因数分解して、素因数の数を足し合わせればよい。
計算量としては、O(N*√N)
"""
from collections import Counter
N = int(eval(input()))
count = Counter([])
for i in range(1, N + 1):
tmp = []
d = 2
while d**2 <= i:
if i % d == 0:
i //= d
tmp.append(d)
else:
d += 1
if i != 1:
tmp.append(i)
count += Counter(tmp)
mod = 10**9 + 7
ans = 1
for v in list(count.values()):
ans *= v + 1
ans %= mod
print(ans)
| false | 23.076923 |
[
"+\"\"\"",
"+1~Nまでを素因数分解して、素因数の数を足し合わせればよい。",
"+計算量としては、O(N*√N)",
"+\"\"\"",
"-factors = []",
"-for i in range(N):",
"- T = N - i",
"+count = Counter([])",
"+for i in range(1, N + 1):",
"+ tmp = []",
"- while d**2 <= T:",
"- if T % d == 0:",
"- factors.append(d)",
"- T //= d",
"+ while d**2 <= i:",
"+ if i % d == 0:",
"+ i //= d",
"+ tmp.append(d)",
"- if T != 1:",
"- factors.append(T)",
"-factors = Counter(factors)",
"+ if i != 1:",
"+ tmp.append(i)",
"+ count += Counter(tmp)",
"+mod = 10**9 + 7",
"-for v in list(factors.values()):",
"+for v in list(count.values()):",
"-mod = 10**9 + 7",
"-print((ans % mod))",
"+ans %= mod",
"+print(ans)"
] | false | 0.059021 | 0.044424 | 1.328573 |
[
"s428775135",
"s732725168"
] |
u780342333
|
p02402
|
python
|
s267399420
|
s789613821
| 30 | 20 | 8,772 | 6,552 |
Accepted
|
Accepted
| 33.33 |
eval(input())
nums = [int(x) for x in input().split(" ")]
print(("{0} {1} {2}".format(min(nums), max(nums), sum(nums))))
|
line = eval(input())
nums = list(map(int, input().split()))
print(f"{min(nums)} {max(nums)} {sum(nums)}")
| 3 | 4 | 114 | 104 |
eval(input())
nums = [int(x) for x in input().split(" ")]
print(("{0} {1} {2}".format(min(nums), max(nums), sum(nums))))
|
line = eval(input())
nums = list(map(int, input().split()))
print(f"{min(nums)} {max(nums)} {sum(nums)}")
| false | 25 |
[
"-eval(input())",
"-nums = [int(x) for x in input().split(\" \")]",
"-print((\"{0} {1} {2}\".format(min(nums), max(nums), sum(nums))))",
"+line = eval(input())",
"+nums = list(map(int, input().split()))",
"+print(f\"{min(nums)} {max(nums)} {sum(nums)}\")"
] | false | 0.041051 | 0.040238 | 1.020188 |
[
"s267399420",
"s789613821"
] |
u780962115
|
p03061
|
python
|
s249674359
|
s583534197
| 726 | 642 | 92,008 | 92,392 |
Accepted
|
Accepted
| 11.57 |
# セグメント木。区間における要素の取得をO(logN)で行うことが可能である。
class SegTree():
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.func = function
self.basement = basement
self.seg = [basement]*2**(self.K+1)
for i in range(self.n):
self.seg[i+2**self.K-1] = lists[i]
for i in range(2**(self.K)-2, -1, -1):
self.seg[i] = self.func(self.seg[2*i+1], self.seg[2*i+2])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
k += 2**self.K-1
self.seg[k] = value
while k:
k = (k-1)//2
self.seg[k] = self.func(self.seg[k*2+1], self.seg[k*2+2])
def query(self, p, q):
# 0-indexで[p,q)の値を取得する
if q <= p:
return self.basement
num = 2**self.K
p += num-1
q += num-2
res = self.basement
while q-p > 1:
if p & 1 == 0:
res = self.func(res, self.seg[p])
if q & 1 == 1:
res = self.func(res, self.seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = self.func(res, self.seg[p])
else:
res = self.func(self.func(res, self.seg[p]), self.seg[q])
return res
#gcd on blackboard
#セグ木（区間gcd) verify
from fractions import gcd
N=int(eval(input()))
A=list(map(int,input().split()))
seg=SegTree(A,gcd,0)
ans=1
for i in range(-1,N):
v=gcd(seg.query(0,i),seg.query(i+1,N))
ans=max(v,ans)
print(ans)
|
class SegTree():
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.f = function
self.b = basement
self.seg = [basement]*2**(self.K+1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i+X-1] = v
for i in range(2*X-2, 0, -2):
self.seg[(i-1) >> 1] = self.f(self.seg[i], self.seg[i-1])
def update(self, k, value):
X = 2**self.K
k += X-1
self.seg[k] = value
while k:
k = (k-1) >> 1
self.seg[k] = self.f(self.seg[(k << 1)+1], self.seg[(k << 1)+2])
def query(self, L, R):
num = 2**self.K-1
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1 == 0:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1 == 0:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
#gcd on blackboard
#セグ木（区間gcd) verify
from fractions import gcd
N=int(eval(input()))
A=list(map(int,input().split()))
seg=SegTree(A,gcd,0)
ans=1
for i in range(-1,N):
v=gcd(seg.query(0,i),seg.query(i+1,N))
ans=max(v,ans)
print(ans)
| 57 | 51 | 1,621 | 1,350 |
# セグメント木。区間における要素の取得をO(logN)で行うことが可能である。
class SegTree:
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n - 1).bit_length()
self.func = function
self.basement = basement
self.seg = [basement] * 2 ** (self.K + 1)
for i in range(self.n):
self.seg[i + 2**self.K - 1] = lists[i]
for i in range(2 ** (self.K) - 2, -1, -1):
self.seg[i] = self.func(self.seg[2 * i + 1], self.seg[2 * i + 2])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
k += 2**self.K - 1
self.seg[k] = value
while k:
k = (k - 1) // 2
self.seg[k] = self.func(self.seg[k * 2 + 1], self.seg[k * 2 + 2])
def query(self, p, q):
# 0-indexで[p,q)の値を取得する
if q <= p:
return self.basement
num = 2**self.K
p += num - 1
q += num - 2
res = self.basement
while q - p > 1:
if p & 1 == 0:
res = self.func(res, self.seg[p])
if q & 1 == 1:
res = self.func(res, self.seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = self.func(res, self.seg[p])
else:
res = self.func(self.func(res, self.seg[p]), self.seg[q])
return res
# gcd on blackboard
# セグ木（区間gcd) verify
from fractions import gcd
N = int(eval(input()))
A = list(map(int, input().split()))
seg = SegTree(A, gcd, 0)
ans = 1
for i in range(-1, N):
v = gcd(seg.query(0, i), seg.query(i + 1, N))
ans = max(v, ans)
print(ans)
|
class SegTree:
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n - 1).bit_length()
self.f = function
self.b = basement
self.seg = [basement] * 2 ** (self.K + 1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i + X - 1] = v
for i in range(2 * X - 2, 0, -2):
self.seg[(i - 1) >> 1] = self.f(self.seg[i], self.seg[i - 1])
def update(self, k, value):
X = 2**self.K
k += X - 1
self.seg[k] = value
while k:
k = (k - 1) >> 1
self.seg[k] = self.f(self.seg[(k << 1) + 1], self.seg[(k << 1) + 2])
def query(self, L, R):
num = 2**self.K - 1
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1 == 0:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1 == 0:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
# gcd on blackboard
# セグ木（区間gcd) verify
from fractions import gcd
N = int(eval(input()))
A = list(map(int, input().split()))
seg = SegTree(A, gcd, 0)
ans = 1
for i in range(-1, N):
v = gcd(seg.query(0, i), seg.query(i + 1, N))
ans = max(v, ans)
print(ans)
| false | 10.526316 |
[
"-# セグメント木。区間における要素の取得をO(logN)で行うことが可能である。",
"- self.func = function",
"- self.basement = basement",
"+ self.f = function",
"+ self.b = basement",
"- for i in range(self.n):",
"- self.seg[i + 2**self.K - 1] = lists[i]",
"- for i in range(2 ** (self.K) - 2, -1, -1):",
"- self.seg[i] = self.func(self.seg[2 * i + 1], self.seg[2 * i + 2])",
"+ X = 2**self.K",
"+ for i, v in enumerate(lists):",
"+ self.seg[i + X - 1] = v",
"+ for i in range(2 * X - 2, 0, -2):",
"+ self.seg[(i - 1) >> 1] = self.f(self.seg[i], self.seg[i - 1])",
"- # 0-indexでa[k]の値をvalueに変更",
"- k += 2**self.K - 1",
"+ X = 2**self.K",
"+ k += X - 1",
"- k = (k - 1) // 2",
"- self.seg[k] = self.func(self.seg[k * 2 + 1], self.seg[k * 2 + 2])",
"+ k = (k - 1) >> 1",
"+ self.seg[k] = self.f(self.seg[(k << 1) + 1], self.seg[(k << 1) + 2])",
"- def query(self, p, q):",
"- # 0-indexで[p,q)の値を取得する",
"- if q <= p:",
"- return self.basement",
"- num = 2**self.K",
"- p += num - 1",
"- q += num - 2",
"- res = self.basement",
"- while q - p > 1:",
"- if p & 1 == 0:",
"- res = self.func(res, self.seg[p])",
"- if q & 1 == 1:",
"- res = self.func(res, self.seg[q])",
"- q -= 1",
"- p = p // 2",
"- q = (q - 1) // 2",
"- if p == q:",
"- res = self.func(res, self.seg[p])",
"- else:",
"- res = self.func(self.func(res, self.seg[p]), self.seg[q])",
"- return res",
"+ def query(self, L, R):",
"+ num = 2**self.K - 1",
"+ L += num",
"+ R += num",
"+ vL = self.b",
"+ vR = self.b",
"+ while L < R:",
"+ if L & 1 == 0:",
"+ vL = self.f(vL, self.seg[L])",
"+ L += 1",
"+ if R & 1 == 0:",
"+ R -= 1",
"+ vR = self.f(self.seg[R], vR)",
"+ L >>= 1",
"+ R >>= 1",
"+ return self.f(vL, vR)"
] | false | 0.047469 | 0.047022 | 1.009491 |
[
"s249674359",
"s583534197"
] |
u660912567
|
p00728
|
python
|
s577923093
|
s897160437
| 40 | 30 | 7,648 | 7,560 |
Accepted
|
Accepted
| 25 |
while True:
n = int(eval(input()))
if not(n): break
s = sum(sorted([int(eval(input())) for i in range(n)])[1:-1])
print((s//(n-2)))
|
while True:
n = int(eval(input()))
if n==0: break
a = sum(sorted([int(eval(input())) for _ in range(n)])[1:-1])//(n-2)
print(a)
| 5 | 5 | 137 | 135 |
while True:
n = int(eval(input()))
if not (n):
break
s = sum(sorted([int(eval(input())) for i in range(n)])[1:-1])
print((s // (n - 2)))
|
while True:
n = int(eval(input()))
if n == 0:
break
a = sum(sorted([int(eval(input())) for _ in range(n)])[1:-1]) // (n - 2)
print(a)
| false | 0 |
[
"- if not (n):",
"+ if n == 0:",
"- s = sum(sorted([int(eval(input())) for i in range(n)])[1:-1])",
"- print((s // (n - 2)))",
"+ a = sum(sorted([int(eval(input())) for _ in range(n)])[1:-1]) // (n - 2)",
"+ print(a)"
] | false | 0.045207 | 0.045204 | 1.000052 |
[
"s577923093",
"s897160437"
] |
u934442292
|
p03163
|
python
|
s573231018
|
s214894825
| 727 | 671 | 189,884 | 189,992 |
Accepted
|
Accepted
| 7.7 |
import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
@nb.njit("i8(i8, i8)")
def chmax(a, b):
if a > b:
return a
else:
return b
@nb.njit("i8(i8,i8,i8[:,:])")
def solve(N, W, wv):
dp = np.zeros(shape=(N + 1, W + 1), dtype=np.int64)
for i in range(1, N + 1):
w, v = wv[i - 1]
for j in range(1, W + 1):
if j < w:
dp[i, j] = dp[i - 1, j]
else:
dp[i, j] = chmax(dp[i - 1, j - w] + v, dp[i - 1, j])
return dp[-1, -1]
def main():
N, W = list(map(int, input().split()))
wv = np.zeros(shape=(N, 2), dtype=np.int64)
for i in range(N):
w, v = list(map(int, input().split()))
wv[i] = w, v
ans = solve(N, W, wv)
print(ans)
if __name__ == "__main__":
main()
|
import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
@nb.njit("i8(i8,i8,i8[:,:])")
def solve(N, W, wv):
dp = np.zeros(shape=(N + 1, W + 1), dtype=np.int64)
for i in range(1, N + 1):
w, v = wv[i - 1]
for j in range(1, W + 1):
if j < w:
dp[i, j] = dp[i - 1, j]
else:
dp[i, j] = max(dp[i - 1, j - w] + v, dp[i - 1, j])
return dp[-1, -1]
def main():
N, W = list(map(int, input().split()))
wv = np.zeros(shape=(N, 2), dtype=np.int64)
for i in range(N):
w, v = list(map(int, input().split()))
wv[i] = w, v
ans = solve(N, W, wv)
print(ans)
if __name__ == "__main__":
main()
| 42 | 34 | 854 | 744 |
import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
@nb.njit("i8(i8, i8)")
def chmax(a, b):
if a > b:
return a
else:
return b
@nb.njit("i8(i8,i8,i8[:,:])")
def solve(N, W, wv):
dp = np.zeros(shape=(N + 1, W + 1), dtype=np.int64)
for i in range(1, N + 1):
w, v = wv[i - 1]
for j in range(1, W + 1):
if j < w:
dp[i, j] = dp[i - 1, j]
else:
dp[i, j] = chmax(dp[i - 1, j - w] + v, dp[i - 1, j])
return dp[-1, -1]
def main():
N, W = list(map(int, input().split()))
wv = np.zeros(shape=(N, 2), dtype=np.int64)
for i in range(N):
w, v = list(map(int, input().split()))
wv[i] = w, v
ans = solve(N, W, wv)
print(ans)
if __name__ == "__main__":
main()
|
import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
@nb.njit("i8(i8,i8,i8[:,:])")
def solve(N, W, wv):
dp = np.zeros(shape=(N + 1, W + 1), dtype=np.int64)
for i in range(1, N + 1):
w, v = wv[i - 1]
for j in range(1, W + 1):
if j < w:
dp[i, j] = dp[i - 1, j]
else:
dp[i, j] = max(dp[i - 1, j - w] + v, dp[i - 1, j])
return dp[-1, -1]
def main():
N, W = list(map(int, input().split()))
wv = np.zeros(shape=(N, 2), dtype=np.int64)
for i in range(N):
w, v = list(map(int, input().split()))
wv[i] = w, v
ans = solve(N, W, wv)
print(ans)
if __name__ == "__main__":
main()
| false | 19.047619 |
[
"-",
"-",
"[email protected](\"i8(i8, i8)\")",
"-def chmax(a, b):",
"- if a > b:",
"- return a",
"- else:",
"- return b",
"- dp[i, j] = chmax(dp[i - 1, j - w] + v, dp[i - 1, j])",
"+ dp[i, j] = max(dp[i - 1, j - w] + v, dp[i - 1, j])"
] | false | 0.168341 | 0.038372 | 4.387102 |
[
"s573231018",
"s214894825"
] |
u660912567
|
p00740
|
python
|
s338248688
|
s778854687
| 4,600 | 4,190 | 7,544 | 7,552 |
Accepted
|
Accepted
| 8.91 |
while True:
n,p = list(map(int,input().split()))
if n==p==0: break
s,c = [0]*n,p
i = 0
while True:
if c:
c-=1
s[i%n]+=1
if s[i%n]==p: break
else:
c+=s[i%n]
s[i%n] = 0
i+=1
print((i%n))
|
while True:
n,p = list(map(int,input().split()))
if n==p==0: break
l = [0]*n
i,k = 0,p
while True:
i %= n
if k==0: k,l[i] = l[i],0
else:
k-=1
l[i]+=1
if l[i]==p: break
i+=1
print(i)
| 15 | 14 | 298 | 280 |
while True:
n, p = list(map(int, input().split()))
if n == p == 0:
break
s, c = [0] * n, p
i = 0
while True:
if c:
c -= 1
s[i % n] += 1
if s[i % n] == p:
break
else:
c += s[i % n]
s[i % n] = 0
i += 1
print((i % n))
|
while True:
n, p = list(map(int, input().split()))
if n == p == 0:
break
l = [0] * n
i, k = 0, p
while True:
i %= n
if k == 0:
k, l[i] = l[i], 0
else:
k -= 1
l[i] += 1
if l[i] == p:
break
i += 1
print(i)
| false | 6.666667 |
[
"- s, c = [0] * n, p",
"- i = 0",
"+ l = [0] * n",
"+ i, k = 0, p",
"- if c:",
"- c -= 1",
"- s[i % n] += 1",
"- if s[i % n] == p:",
"+ i %= n",
"+ if k == 0:",
"+ k, l[i] = l[i], 0",
"+ else:",
"+ k -= 1",
"+ l[i] += 1",
"+ if l[i] == p:",
"- else:",
"- c += s[i % n]",
"- s[i % n] = 0",
"- print((i % n))",
"+ print(i)"
] | false | 0.743269 | 0.602463 | 1.233717 |
[
"s338248688",
"s778854687"
] |
u186838327
|
p02995
|
python
|
s633329958
|
s290616967
| 302 | 69 | 65,132 | 67,396 |
Accepted
|
Accepted
| 77.15 |
a, b, c, d = list(map(int, input().split()))
import fractions
#import math
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
#return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
l = lcm_base(c, d)
i = b//c-(a-1)//c
j = b//d-(a-1)//d
k = b//l-(a-1)//l
#print(i, j, k)
ans = b-a+1-(i+j-k)
print(ans)
|
a, b, c, d = list(map(int, input().split()))
s = b//c-(a-1)//c
t = b//d-(a-1)//d
#import fractions
import math
from functools import reduce
def lcm_base(x, y):
#return (x * y) // fractions.gcd(x, y)
return (x * y) // math.gcd(x, y)
l = lcm_base(c, d)
r = b//l-(a-1)//l
#print(s, t, r)
ans = b-a+1-(s+t-r)
print(ans)
| 20 | 19 | 398 | 337 |
a, b, c, d = list(map(int, input().split()))
import fractions
# import math
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
# return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
l = lcm_base(c, d)
i = b // c - (a - 1) // c
j = b // d - (a - 1) // d
k = b // l - (a - 1) // l
# print(i, j, k)
ans = b - a + 1 - (i + j - k)
print(ans)
|
a, b, c, d = list(map(int, input().split()))
s = b // c - (a - 1) // c
t = b // d - (a - 1) // d
# import fractions
import math
from functools import reduce
def lcm_base(x, y):
# return (x * y) // fractions.gcd(x, y)
return (x * y) // math.gcd(x, y)
l = lcm_base(c, d)
r = b // l - (a - 1) // l
# print(s, t, r)
ans = b - a + 1 - (s + t - r)
print(ans)
| false | 5 |
[
"-import fractions",
"-",
"-# import math",
"+s = b // c - (a - 1) // c",
"+t = b // d - (a - 1) // d",
"+# import fractions",
"+import math",
"- return (x * y) // fractions.gcd(x, y)",
"- # return (x * y) // math.gcd(x, y)",
"-",
"-",
"-def lcm_list(numbers):",
"- return reduce(lcm_base, numbers, 1)",
"+ # return (x * y) // fractions.gcd(x, y)",
"+ return (x * y) // math.gcd(x, y)",
"-i = b // c - (a - 1) // c",
"-j = b // d - (a - 1) // d",
"-k = b // l - (a - 1) // l",
"-# print(i, j, k)",
"-ans = b - a + 1 - (i + j - k)",
"+r = b // l - (a - 1) // l",
"+# print(s, t, r)",
"+ans = b - a + 1 - (s + t - r)"
] | false | 0.047829 | 0.038665 | 1.237 |
[
"s633329958",
"s290616967"
] |
u333139319
|
p03161
|
python
|
s629317420
|
s923097062
| 461 | 344 | 58,208 | 52,320 |
Accepted
|
Accepted
| 25.38 |
#import numpy
[n,k] = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
dp = [0]
i_ls = []
now = 0
#dpのi番目の要素がi+1番目の足場までの最小コスト
for i in range(1,n):
#i番目の足場
if i < k:
for j in range(i):
i_ls.append(abs(a[i]-a[j])+dp[j])
#print("i<k")
else:
for j in range(i-k,i):
i_ls.append(abs(a[i]-a[j])+dp[j])
#print("i>=k")
dp.append(min(i_ls))
#print(i_ls)
i_ls = []
print((dp[n-1]))
|
[n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10 ** 9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2,n):
for j in range(1,min(i - 0,k)+1):
dp[i] =min(dp[i - j] + abs(h[i]-h[i - j]),dp[i])
print((dp[n-1]))
else:
print((dp[1]))
| 22 | 19 | 494 | 381 |
# import numpy
[n, k] = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
dp = [0]
i_ls = []
now = 0
# dpのi番目の要素がi+1番目の足場までの最小コスト
for i in range(1, n):
# i番目の足場
if i < k:
for j in range(i):
i_ls.append(abs(a[i] - a[j]) + dp[j])
# print("i<k")
else:
for j in range(i - k, i):
i_ls.append(abs(a[i] - a[j]) + dp[j])
# print("i>=k")
dp.append(min(i_ls))
# print(i_ls)
i_ls = []
print((dp[n - 1]))
|
[n, k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10**9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2, n):
for j in range(1, min(i - 0, k) + 1):
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i])
print((dp[n - 1]))
else:
print((dp[1]))
| false | 13.636364 |
[
"-# import numpy",
"-a = [int(i) for i in input().split()]",
"-dp = [0]",
"-i_ls = []",
"-now = 0",
"-# dpのi番目の要素がi+1番目の足場までの最小コスト",
"-for i in range(1, n):",
"- # i番目の足場",
"- if i < k:",
"- for j in range(i):",
"- i_ls.append(abs(a[i] - a[j]) + dp[j])",
"- # print(\"i<k\")",
"- else:",
"- for j in range(i - k, i):",
"- i_ls.append(abs(a[i] - a[j]) + dp[j])",
"- # print(\"i>=k\")",
"- dp.append(min(i_ls))",
"- # print(i_ls)",
"- i_ls = []",
"-print((dp[n - 1]))",
"+h = [int(i) for i in input().split()]",
"+\"\"\"",
"+初期条件",
"+dp[0] = 0",
"+dp[1] = h[1] - h[0]",
"+\"\"\"",
"+dp = [10**9 + 7] * n",
"+dp[0] = 0",
"+dp[1] = abs(h[1] - h[0])",
"+if n > 2:",
"+ for i in range(2, n):",
"+ for j in range(1, min(i - 0, k) + 1):",
"+ dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i])",
"+ print((dp[n - 1]))",
"+else:",
"+ print((dp[1]))"
] | false | 0.007456 | 0.112151 | 0.066478 |
[
"s629317420",
"s923097062"
] |
u729008627
|
p03061
|
python
|
s739169663
|
s072385953
| 1,279 | 95 | 14,400 | 14,428 |
Accepted
|
Accepted
| 92.57 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
def divisors(n):
div = set()
A = 1
while A*A <= n:
if n%A == 0:
if A*A == n:
div.add(A)
else:
B = n//A
div.add(A)
div.add(B)
A += 1
return div
div = list(divisors(A[0]) | divisors(A[1]))
m = 0
for x in div:
count = 0
for a in A:
if a%x != 0:
count += 1
if count > 1:
break
if count <= 1:
m = max(m, x)
print(m)
|
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
def divisors(n):
div = set()
A = 1
while A*A <= n:
if n%A == 0:
if A*A == n:
div.add(A)
else:
B = n//A
div.add(A)
div.add(B)
A += 1
return div
div = list(divisors(A[0]) | divisors(A[1]))
div.sort(reverse=True)
for x in div:
count = 0
for a in A:
if a%x != 0:
count += 1
if count > 1:
break
if count <= 1:
print(x)
break
| 28 | 28 | 579 | 596 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
def divisors(n):
div = set()
A = 1
while A * A <= n:
if n % A == 0:
if A * A == n:
div.add(A)
else:
B = n // A
div.add(A)
div.add(B)
A += 1
return div
div = list(divisors(A[0]) | divisors(A[1]))
m = 0
for x in div:
count = 0
for a in A:
if a % x != 0:
count += 1
if count > 1:
break
if count <= 1:
m = max(m, x)
print(m)
|
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
def divisors(n):
div = set()
A = 1
while A * A <= n:
if n % A == 0:
if A * A == n:
div.add(A)
else:
B = n // A
div.add(A)
div.add(B)
A += 1
return div
div = list(divisors(A[0]) | divisors(A[1]))
div.sort(reverse=True)
for x in div:
count = 0
for a in A:
if a % x != 0:
count += 1
if count > 1:
break
if count <= 1:
print(x)
break
| false | 0 |
[
"-m = 0",
"+div.sort(reverse=True)",
"- m = max(m, x)",
"-print(m)",
"+ print(x)",
"+ break"
] | false | 0.081234 | 0.041147 | 1.974211 |
[
"s739169663",
"s072385953"
] |
u334712262
|
p03074
|
python
|
s358128040
|
s531607430
| 168 | 111 | 11,624 | 7,136 |
Accepted
|
Accepted
| 33.93 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, K, S):
s1 = list(map(lambda x: len(x), filter(lambda x: x != '', S.split('0'))))
s0 = list(map(lambda x: len(x), filter(lambda x: x != '', S.split('1'))))
if len(s0) <= K:
return N
if S[0] == '0':
s1.insert(0, 0)
if S[-1] == '0':
s1.append(0)
s = []
i = 0
for i in range(len(s0)):
s.append(s1[i])
s.append(s0[i])
s.extend(s1[i+1:])
sa = [0]
for v in s:
sa.append(sa[-1]+v)
ans = 0
for i in range(0, len(sa), 2):
if i+2*K+1 < len(sa):
ans = max(ans, sa[i+2*K+1]-sa[i])
elif i+2*K < len(sa):
ans = max(ans, sa[i+2*K]-sa[i])
else:
break
return ans
def main():
N, K = read_int_n()
S = read_str()
rS = ''.join(['0' if c == '1' else '1' for c in S])
print(max(slv(N, K, S), slv(N, K-1, rS)))
# N = 20
# K = random.randint(1, 10)
# S = ''.join(random.choices('01', k=N))
# rS = ''.join(['0' if c == '1' else '1' for c in S])
# print(max(slv(N, K, S), slv(N, K-1, rS)))
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, K, S):
s1 = list(map(lambda x: len(x), filter(lambda x: x != '', S.split('0'))))
s0 = list(map(lambda x: len(x), filter(lambda x: x != '', S.split('1'))))
if len(s0) <= K:
return N
if S[0] == '0':
s1.insert(0, 0)
if S[-1] == '0':
s1.append(0)
q = deque()
q.append(s1.pop())
q.append(s0.pop())
q.append(s1.pop())
tmp = sum(q)
ans = tmp
while s1 or s0:
if len(q) >= 2*K + 1:
tmp -= q.popleft()
tmp -= q.popleft()
q.append(s0.pop())
tmp += q[-1]
q.append(s1.pop())
tmp += q[-1]
ans = max(ans, tmp)
return ans
def main():
N, K = read_int_n()
S = read_str()
print(slv(N, K, S))
# N = 20
# K = random.randint(1, 10)
# S = ''.join(random.choices('01', k=N))
# rS = ''.join(['0' if c == '1' else '1' for c in S])
# print(max(slv(N, K, S), slv(N, K-1, rS)))
if __name__ == '__main__':
main()
| 105 | 101 | 2,235 | 2,083 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, "sec")
return ret
return wrap
@mt
def slv(N, K, S):
s1 = list(map(lambda x: len(x), filter(lambda x: x != "", S.split("0"))))
s0 = list(map(lambda x: len(x), filter(lambda x: x != "", S.split("1"))))
if len(s0) <= K:
return N
if S[0] == "0":
s1.insert(0, 0)
if S[-1] == "0":
s1.append(0)
s = []
i = 0
for i in range(len(s0)):
s.append(s1[i])
s.append(s0[i])
s.extend(s1[i + 1 :])
sa = [0]
for v in s:
sa.append(sa[-1] + v)
ans = 0
for i in range(0, len(sa), 2):
if i + 2 * K + 1 < len(sa):
ans = max(ans, sa[i + 2 * K + 1] - sa[i])
elif i + 2 * K < len(sa):
ans = max(ans, sa[i + 2 * K] - sa[i])
else:
break
return ans
def main():
N, K = read_int_n()
S = read_str()
rS = "".join(["0" if c == "1" else "1" for c in S])
print(max(slv(N, K, S), slv(N, K - 1, rS)))
# N = 20
# K = random.randint(1, 10)
# S = ''.join(random.choices('01', k=N))
# rS = ''.join(['0' if c == '1' else '1' for c in S])
# print(max(slv(N, K, S), slv(N, K-1, rS)))
if __name__ == "__main__":
main()
|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, "sec")
return ret
return wrap
@mt
def slv(N, K, S):
s1 = list(map(lambda x: len(x), filter(lambda x: x != "", S.split("0"))))
s0 = list(map(lambda x: len(x), filter(lambda x: x != "", S.split("1"))))
if len(s0) <= K:
return N
if S[0] == "0":
s1.insert(0, 0)
if S[-1] == "0":
s1.append(0)
q = deque()
q.append(s1.pop())
q.append(s0.pop())
q.append(s1.pop())
tmp = sum(q)
ans = tmp
while s1 or s0:
if len(q) >= 2 * K + 1:
tmp -= q.popleft()
tmp -= q.popleft()
q.append(s0.pop())
tmp += q[-1]
q.append(s1.pop())
tmp += q[-1]
ans = max(ans, tmp)
return ans
def main():
N, K = read_int_n()
S = read_str()
print(slv(N, K, S))
# N = 20
# K = random.randint(1, 10)
# S = ''.join(random.choices('01', k=N))
# rS = ''.join(['0' if c == '1' else '1' for c in S])
# print(max(slv(N, K, S), slv(N, K-1, rS)))
if __name__ == "__main__":
main()
| false | 3.809524 |
[
"- s = []",
"- i = 0",
"- for i in range(len(s0)):",
"- s.append(s1[i])",
"- s.append(s0[i])",
"- s.extend(s1[i + 1 :])",
"- sa = [0]",
"- for v in s:",
"- sa.append(sa[-1] + v)",
"- ans = 0",
"- for i in range(0, len(sa), 2):",
"- if i + 2 * K + 1 < len(sa):",
"- ans = max(ans, sa[i + 2 * K + 1] - sa[i])",
"- elif i + 2 * K < len(sa):",
"- ans = max(ans, sa[i + 2 * K] - sa[i])",
"- else:",
"- break",
"+ q = deque()",
"+ q.append(s1.pop())",
"+ q.append(s0.pop())",
"+ q.append(s1.pop())",
"+ tmp = sum(q)",
"+ ans = tmp",
"+ while s1 or s0:",
"+ if len(q) >= 2 * K + 1:",
"+ tmp -= q.popleft()",
"+ tmp -= q.popleft()",
"+ q.append(s0.pop())",
"+ tmp += q[-1]",
"+ q.append(s1.pop())",
"+ tmp += q[-1]",
"+ ans = max(ans, tmp)",
"- rS = \"\".join([\"0\" if c == \"1\" else \"1\" for c in S])",
"- print(max(slv(N, K, S), slv(N, K - 1, rS)))",
"+ print(slv(N, K, S))"
] | false | 0.036403 | 0.037711 | 0.965324 |
[
"s358128040",
"s531607430"
] |
u256678932
|
p02422
|
python
|
s457963403
|
s663008306
| 30 | 20 | 7,732 | 5,616 |
Accepted
|
Accepted
| 33.33 |
def main():
s = eval(input())
n = int(eval(input()))
for i in range(n):
cmds = input().split(' ')
if 'reverse' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
s = s[:a]+''.join(reversed(s[a:b]))+s[b:]
if 'replace' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
res = cmds[3]
s = s[:a]+res+s[b:]
if 'print' == cmds[0]:
a = int(cmds[1])
b = int(cmds[2])+1
print((s[a:b]))
if __name__ == '__main__': main()
|
def print_text(text, a, b):
s = int(a)
e = int(b)+1
print((text[s:e]))
def reverse_text(text, a, b):
s = int(a)
e = int(b)+1
return text[:s] + text[s:e][::-1] + text[e:]
def replace_text(text, a, b, p):
s = int(a)
e = int(b)+1
return text[0:s] + p + text[e:]
def main():
text = eval(input())
q = int(eval(input()))
for _ in range(q):
op, *args = input().split()
if op == 'print':
print_text(text, *args)
elif op == 'reverse':
text = reverse_text(text, *args)
elif op == 'replace':
text = replace_text(text, *args)
if __name__ == '__main__':
main()
| 27 | 34 | 588 | 698 |
def main():
s = eval(input())
n = int(eval(input()))
for i in range(n):
cmds = input().split(" ")
if "reverse" == cmds[0]:
a = int(cmds[1])
b = int(cmds[2]) + 1
s = s[:a] + "".join(reversed(s[a:b])) + s[b:]
if "replace" == cmds[0]:
a = int(cmds[1])
b = int(cmds[2]) + 1
res = cmds[3]
s = s[:a] + res + s[b:]
if "print" == cmds[0]:
a = int(cmds[1])
b = int(cmds[2]) + 1
print((s[a:b]))
if __name__ == "__main__":
main()
|
def print_text(text, a, b):
s = int(a)
e = int(b) + 1
print((text[s:e]))
def reverse_text(text, a, b):
s = int(a)
e = int(b) + 1
return text[:s] + text[s:e][::-1] + text[e:]
def replace_text(text, a, b, p):
s = int(a)
e = int(b) + 1
return text[0:s] + p + text[e:]
def main():
text = eval(input())
q = int(eval(input()))
for _ in range(q):
op, *args = input().split()
if op == "print":
print_text(text, *args)
elif op == "reverse":
text = reverse_text(text, *args)
elif op == "replace":
text = replace_text(text, *args)
if __name__ == "__main__":
main()
| false | 20.588235 |
[
"+def print_text(text, a, b):",
"+ s = int(a)",
"+ e = int(b) + 1",
"+ print((text[s:e]))",
"+",
"+",
"+def reverse_text(text, a, b):",
"+ s = int(a)",
"+ e = int(b) + 1",
"+ return text[:s] + text[s:e][::-1] + text[e:]",
"+",
"+",
"+def replace_text(text, a, b, p):",
"+ s = int(a)",
"+ e = int(b) + 1",
"+ return text[0:s] + p + text[e:]",
"+",
"+",
"- s = eval(input())",
"- n = int(eval(input()))",
"- for i in range(n):",
"- cmds = input().split(\" \")",
"- if \"reverse\" == cmds[0]:",
"- a = int(cmds[1])",
"- b = int(cmds[2]) + 1",
"- s = s[:a] + \"\".join(reversed(s[a:b])) + s[b:]",
"- if \"replace\" == cmds[0]:",
"- a = int(cmds[1])",
"- b = int(cmds[2]) + 1",
"- res = cmds[3]",
"- s = s[:a] + res + s[b:]",
"- if \"print\" == cmds[0]:",
"- a = int(cmds[1])",
"- b = int(cmds[2]) + 1",
"- print((s[a:b]))",
"+ text = eval(input())",
"+ q = int(eval(input()))",
"+ for _ in range(q):",
"+ op, *args = input().split()",
"+ if op == \"print\":",
"+ print_text(text, *args)",
"+ elif op == \"reverse\":",
"+ text = reverse_text(text, *args)",
"+ elif op == \"replace\":",
"+ text = replace_text(text, *args)"
] | false | 0.038152 | 0.037418 | 1.019608 |
[
"s457963403",
"s663008306"
] |
u530844517
|
p02996
|
python
|
s712511521
|
s084264072
| 1,250 | 593 | 71,388 | 69,212 |
Accepted
|
Accepted
| 52.56 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
tasks = []
for _ in range(n):
a,b = list(map(int, input().split()))
tasks.append((a,b))
tasks.sort()
tasks = sorted( tasks, key = lambda a: a[1] )
time = 0
flg = 0
for task in tasks:
time += task[0]
if time > task[1]:
print('No')
break
else:
print( 'Yes' )
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
tasks = []
for _ in range(n):
a,b = list(map(int, input().split()))
tasks.append((a,b))
tasks = sorted( tasks, key = lambda a: a[1] )
time = 0
for task in tasks:
time += task[0]
if time > task[1]:
print('No')
break
else:
print( 'Yes' )
| 21 | 19 | 364 | 341 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
tasks = []
for _ in range(n):
a, b = list(map(int, input().split()))
tasks.append((a, b))
tasks.sort()
tasks = sorted(tasks, key=lambda a: a[1])
time = 0
flg = 0
for task in tasks:
time += task[0]
if time > task[1]:
print("No")
break
else:
print("Yes")
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
tasks = []
for _ in range(n):
a, b = list(map(int, input().split()))
tasks.append((a, b))
tasks = sorted(tasks, key=lambda a: a[1])
time = 0
for task in tasks:
time += task[0]
if time > task[1]:
print("No")
break
else:
print("Yes")
| false | 9.52381 |
[
"-tasks.sort()",
"-flg = 0"
] | false | 0.037003 | 0.035379 | 1.045914 |
[
"s712511521",
"s084264072"
] |
u848535504
|
p02832
|
python
|
s589908758
|
s467099019
| 111 | 93 | 32,372 | 32,368 |
Accepted
|
Accepted
| 16.22 |
N = int(eval(input()))
a = list(map(int,input().split()))
if not(1 in a):
print((-1))
exit(0)
l = []
min_num = 0
for i in a:
if i == min_num + 1:
l.append(i)
min_num += 1
print((N-len(l)))
|
N = int(eval(input()))
a = list(map(int,input().split()))
if not(1 in a):
print((-1))
exit(0)
cnt = 0
for i in a:
if i == cnt + 1:
cnt += 1
print((N-cnt))
| 15 | 13 | 223 | 179 |
N = int(eval(input()))
a = list(map(int, input().split()))
if not (1 in a):
print((-1))
exit(0)
l = []
min_num = 0
for i in a:
if i == min_num + 1:
l.append(i)
min_num += 1
print((N - len(l)))
|
N = int(eval(input()))
a = list(map(int, input().split()))
if not (1 in a):
print((-1))
exit(0)
cnt = 0
for i in a:
if i == cnt + 1:
cnt += 1
print((N - cnt))
| false | 13.333333 |
[
"-l = []",
"-min_num = 0",
"+cnt = 0",
"- if i == min_num + 1:",
"- l.append(i)",
"- min_num += 1",
"-print((N - len(l)))",
"+ if i == cnt + 1:",
"+ cnt += 1",
"+print((N - cnt))"
] | false | 0.096875 | 0.040302 | 2.403698 |
[
"s589908758",
"s467099019"
] |
u994988729
|
p03208
|
python
|
s329513100
|
s793871987
| 243 | 147 | 7,384 | 7,384 |
Accepted
|
Accepted
| 39.51 |
n,k=list(map(int,input().split()))
h=[int(eval(input())) for _ in range(n)]
h.sort()
ans=10**18
for i in range(n-k+1):
ans=min(ans, h[i+k-1]-h[i])
print(ans)
|
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = 10**18
for i in range(N - K + 1):
ans = min(ans, abs(H[i] - abs(H[i + K - 1])))
print(ans)
| 9 | 11 | 160 | 230 |
n, k = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(n)]
h.sort()
ans = 10**18
for i in range(n - k + 1):
ans = min(ans, h[i + k - 1] - h[i])
print(ans)
|
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = 10**18
for i in range(N - K + 1):
ans = min(ans, abs(H[i] - abs(H[i + K - 1])))
print(ans)
| false | 18.181818 |
[
"-n, k = list(map(int, input().split()))",
"-h = [int(eval(input())) for _ in range(n)]",
"-h.sort()",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+N, K = list(map(int, input().split()))",
"+H = [int(eval(input())) for _ in range(N)]",
"+H.sort()",
"-for i in range(n - k + 1):",
"- ans = min(ans, h[i + k - 1] - h[i])",
"+for i in range(N - K + 1):",
"+ ans = min(ans, abs(H[i] - abs(H[i + K - 1])))"
] | false | 0.037189 | 0.060359 | 0.616135 |
[
"s329513100",
"s793871987"
] |
u936985471
|
p03762
|
python
|
s572368346
|
s076193072
| 181 | 155 | 24,424 | 24,580 |
Accepted
|
Accepted
| 14.36 |
import sys
readline = sys.stdin.readline
N,M = list(map(int,readline().split()))
X = list(map(int,readline().split()))
Y = list(map(int,readline().split()))
DIV = 10 ** 9 + 7
# カウントする回数分X,Y軸ともに辺の長さを伸ばしていって巨大な長方形を作るイメージ
# X軸の、長さLの辺を3回数える場合、L * 2分X軸の辺の長さを伸ばす。
# X軸Y軸ともに各辺を数える回数が分かれば、巨大な長方形の面積はその積で求められる
#
# X軸について、i番目の辺は、((i - 1) + 1) * (N - i)回数える
# 例：4番目の辺の場合
# ...X..
# Xより左から4通り（0も含むため） * Xより右から3通り(0も含むため)
# この回数分、辺の長さを掛けることを全ての辺に対して行った総和がX軸の辺の総量
# Y軸についても同じものを求めて、掛け合わせたものが答え
xsum = 0
for i in range(1, len(X)):
# i番目の辺は、長さX[i] - X[i - 1]
edge = X[i] - X[i - 1]
# i番目の辺は((i - 1) + 1) * (N - i)回数える
times = i * (N - i)
xsum += ((edge % DIV) * (times % DIV)) % DIV
xsum %= DIV
ysum = 0
for i in range(1, len(Y)):
# i番目の辺は、長さY[i] - Y[i - 1]
edge = Y[i] - Y[i - 1]
# i番目の辺は((i - 1) + 1) * (M - i)回数える
times = i * (M - i)
ysum += ((edge % DIV) * (times % DIV)) % DIV
ysum %= DIV
print(((xsum * ysum) % DIV))
|
import sys
readline = sys.stdin.readline
N,M = list(map(int,readline().split()))
X = list(map(int,readline().split()))
Y = list(map(int,readline().split()))
DIV = 10 ** 9 + 7
def f(V):
vsum = 0
for i in range(1, len(V)):
vsum += (((V[i] - V[i - 1]) % DIV) * ((i * (len(V) - i)) % DIV)) % DIV
vsum %= DIV
return vsum
print(((f(X) * f(Y)) % DIV))
| 38 | 16 | 966 | 370 |
import sys
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
X = list(map(int, readline().split()))
Y = list(map(int, readline().split()))
DIV = 10**9 + 7
# カウントする回数分X,Y軸ともに辺の長さを伸ばしていって巨大な長方形を作るイメージ
# X軸の、長さLの辺を3回数える場合、L * 2分X軸の辺の長さを伸ばす。
# X軸Y軸ともに各辺を数える回数が分かれば、巨大な長方形の面積はその積で求められる
#
# X軸について、i番目の辺は、((i - 1) + 1) * (N - i)回数える
# 例：4番目の辺の場合
# ...X..
# Xより左から4通り（0も含むため） * Xより右から3通り(0も含むため)
# この回数分、辺の長さを掛けることを全ての辺に対して行った総和がX軸の辺の総量
# Y軸についても同じものを求めて、掛け合わせたものが答え
xsum = 0
for i in range(1, len(X)):
# i番目の辺は、長さX[i] - X[i - 1]
edge = X[i] - X[i - 1]
# i番目の辺は((i - 1) + 1) * (N - i)回数える
times = i * (N - i)
xsum += ((edge % DIV) * (times % DIV)) % DIV
xsum %= DIV
ysum = 0
for i in range(1, len(Y)):
# i番目の辺は、長さY[i] - Y[i - 1]
edge = Y[i] - Y[i - 1]
# i番目の辺は((i - 1) + 1) * (M - i)回数える
times = i * (M - i)
ysum += ((edge % DIV) * (times % DIV)) % DIV
ysum %= DIV
print(((xsum * ysum) % DIV))
|
import sys
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
X = list(map(int, readline().split()))
Y = list(map(int, readline().split()))
DIV = 10**9 + 7
def f(V):
vsum = 0
for i in range(1, len(V)):
vsum += (((V[i] - V[i - 1]) % DIV) * ((i * (len(V) - i)) % DIV)) % DIV
vsum %= DIV
return vsum
print(((f(X) * f(Y)) % DIV))
| false | 57.894737 |
[
"-# カウントする回数分X,Y軸ともに辺の長さを伸ばしていって巨大な長方形を作るイメージ",
"-# X軸の、長さLの辺を3回数える場合、L * 2分X軸の辺の長さを伸ばす。",
"-# X軸Y軸ともに各辺を数える回数が分かれば、巨大な長方形の面積はその積で求められる",
"-#",
"-# X軸について、i番目の辺は、((i - 1) + 1) * (N - i)回数える",
"-# 例：4番目の辺の場合",
"-# ...X..",
"-# Xより左から4通り（0も含むため） * Xより右から3通り(0も含むため)",
"-# この回数分、辺の長さを掛けることを全ての辺に対して行った総和がX軸の辺の総量",
"-# Y軸についても同じものを求めて、掛け合わせたものが答え",
"-xsum = 0",
"-for i in range(1, len(X)):",
"- # i番目の辺は、長さX[i] - X[i - 1]",
"- edge = X[i] - X[i - 1]",
"- # i番目の辺は((i - 1) + 1) * (N - i)回数える",
"- times = i * (N - i)",
"- xsum += ((edge % DIV) * (times % DIV)) % DIV",
"- xsum %= DIV",
"-ysum = 0",
"-for i in range(1, len(Y)):",
"- # i番目の辺は、長さY[i] - Y[i - 1]",
"- edge = Y[i] - Y[i - 1]",
"- # i番目の辺は((i - 1) + 1) * (M - i)回数える",
"- times = i * (M - i)",
"- ysum += ((edge % DIV) * (times % DIV)) % DIV",
"- ysum %= DIV",
"-print(((xsum * ysum) % DIV))",
"+",
"+",
"+def f(V):",
"+ vsum = 0",
"+ for i in range(1, len(V)):",
"+ vsum += (((V[i] - V[i - 1]) % DIV) * ((i * (len(V) - i)) % DIV)) % DIV",
"+ vsum %= DIV",
"+ return vsum",
"+",
"+",
"+print(((f(X) * f(Y)) % DIV))"
] | false | 0.04537 | 0.075714 | 0.599232 |
[
"s572368346",
"s076193072"
] |
u037430802
|
p03525
|
python
|
s944966356
|
s996730342
| 23 | 21 | 3,444 | 3,316 |
Accepted
|
Accepted
| 8.7 |
from collections import Counter
from collections import defaultdict
N = list(map(int, input().split()))
D = list(map(int, input().split()))
c = Counter(D)
# 高橋君と同じ時間帯の人が一人でもいれば、時差の最小は常に0
if c[0] >= 2:
print((0))
exit(0)
# 高橋君との時差がdの人が3人以上いる場合も、時差の最小は常に0（同じ時間帯の都市に二人以上いることになるから）
for i in list(c.values()):
if i >= 3:
print((0))
exit()
times = defaultdict(int)
c[0] += 1
# 0時との時間差をとるときに24がいたほうがよいか？なくてもいいか。
c[24] += 1
before_12 = True
D.sort()
for d in D:
if before_12:
times[d] += 1
before_12 = False
else:
times[24-d] += 1
before_12 = True
# 高橋君との時差で答えを初期化
ans = min(D)
tlst = list(times.keys())
tlst.sort()
for a,b in zip(tlst, tlst[1:]):
ans = min(ans, b - a)
print(ans)
|
from collections import Counter
from collections import defaultdict
N = list(map(int, input().split()))
D = list(map(int, input().split()))
c = Counter(D)
c[0] += 1
# 高橋君と同じ時間帯の人が一人でもいれば、時差の最小は常に0
if c[0] >= 2:
print((0))
exit(0)
# 高橋君との時差がdの人が3人以上いる場合も、時差の最小は常に0（同じ時間帯の都市に二人以上いることになるから）
for i in list(c.values()):
if i >= 3:
print((0))
exit()
times = defaultdict(int)
# 0時との時間差をとるときに24がいたほうがよいか？なくてもいいか。
c[24] += 1
before_12 = True
D.sort()
for d in D:
if before_12:
times[d] += 1
before_12 = False
else:
times[24-d] += 1
before_12 = True
# 高橋君との時差で答えを初期化
ans = min(D)
tlst = list(times.keys())
tlst.sort()
for a,b in zip(tlst, tlst[1:]):
ans = min(ans, b - a)
print(ans)
| 51 | 51 | 796 | 796 |
from collections import Counter
from collections import defaultdict
N = list(map(int, input().split()))
D = list(map(int, input().split()))
c = Counter(D)
# 高橋君と同じ時間帯の人が一人でもいれば、時差の最小は常に0
if c[0] >= 2:
print((0))
exit(0)
# 高橋君との時差がdの人が3人以上いる場合も、時差の最小は常に0（同じ時間帯の都市に二人以上いることになるから）
for i in list(c.values()):
if i >= 3:
print((0))
exit()
times = defaultdict(int)
c[0] += 1
# 0時との時間差をとるときに24がいたほうがよいか？なくてもいいか。
c[24] += 1
before_12 = True
D.sort()
for d in D:
if before_12:
times[d] += 1
before_12 = False
else:
times[24 - d] += 1
before_12 = True
# 高橋君との時差で答えを初期化
ans = min(D)
tlst = list(times.keys())
tlst.sort()
for a, b in zip(tlst, tlst[1:]):
ans = min(ans, b - a)
print(ans)
|
from collections import Counter
from collections import defaultdict
N = list(map(int, input().split()))
D = list(map(int, input().split()))
c = Counter(D)
c[0] += 1
# 高橋君と同じ時間帯の人が一人でもいれば、時差の最小は常に0
if c[0] >= 2:
print((0))
exit(0)
# 高橋君との時差がdの人が3人以上いる場合も、時差の最小は常に0（同じ時間帯の都市に二人以上いることになるから）
for i in list(c.values()):
if i >= 3:
print((0))
exit()
times = defaultdict(int)
# 0時との時間差をとるときに24がいたほうがよいか？なくてもいいか。
c[24] += 1
before_12 = True
D.sort()
for d in D:
if before_12:
times[d] += 1
before_12 = False
else:
times[24 - d] += 1
before_12 = True
# 高橋君との時差で答えを初期化
ans = min(D)
tlst = list(times.keys())
tlst.sort()
for a, b in zip(tlst, tlst[1:]):
ans = min(ans, b - a)
print(ans)
| false | 0 |
[
"+c[0] += 1",
"-c[0] += 1"
] | false | 0.111868 | 0.037949 | 2.947873 |
[
"s944966356",
"s996730342"
] |
u484229314
|
p03329
|
python
|
s007936873
|
s855847409
| 943 | 768 | 83,028 | 25,332 |
Accepted
|
Accepted
| 18.56 |
import numpy as np
N = int(eval(input()))
def make_array(shape, defval=0, dtype=int):
res = np.zeros(shape, dtype)
res[:] = defval
return res.tolist()
memo = make_array((15, N + 1), N * 2)
memo[0][0] = 0
values = []
i = 1
while i <= N:
values.append(i)
i *= 6
i = 9
while i <= N:
values.append(i)
i *= 9
for i in range(len(values)):
v = values[i]
for w in range(N + 1):
if v > w:
memo[i + 1][w] = memo[i][w]
else:
memo[i + 1][w] = min(memo[i][w], memo[i + 1][w - v] + 1)
print((memo[len(values)][N]))
|
N = int(eval(input()))
# def make_array(shape, defval=0, dtype=int):
# res = np.zeros(shape, dtype)
# res[:] = defval
# return res.tolist()
# memo = make_array((15, N + 1), N * 2)
memo = [[N * 2] * (N + 1) for _ in range(15)]
memo[0][0] = 0
values = []
i = 1
while i <= N:
values.append(i)
i *= 6
i = 9
while i <= N:
values.append(i)
i *= 9
for i in range(len(values)):
v = values[i]
for w in range(N + 1):
if v > w:
memo[i + 1][w] = memo[i][w]
else:
memo[i + 1][w] = min(memo[i][w], memo[i + 1][w - v] + 1)
print((memo[len(values)][N]))
| 33 | 31 | 609 | 641 |
import numpy as np
N = int(eval(input()))
def make_array(shape, defval=0, dtype=int):
res = np.zeros(shape, dtype)
res[:] = defval
return res.tolist()
memo = make_array((15, N + 1), N * 2)
memo[0][0] = 0
values = []
i = 1
while i <= N:
values.append(i)
i *= 6
i = 9
while i <= N:
values.append(i)
i *= 9
for i in range(len(values)):
v = values[i]
for w in range(N + 1):
if v > w:
memo[i + 1][w] = memo[i][w]
else:
memo[i + 1][w] = min(memo[i][w], memo[i + 1][w - v] + 1)
print((memo[len(values)][N]))
|
N = int(eval(input()))
# def make_array(shape, defval=0, dtype=int):
# res = np.zeros(shape, dtype)
# res[:] = defval
# return res.tolist()
# memo = make_array((15, N + 1), N * 2)
memo = [[N * 2] * (N + 1) for _ in range(15)]
memo[0][0] = 0
values = []
i = 1
while i <= N:
values.append(i)
i *= 6
i = 9
while i <= N:
values.append(i)
i *= 9
for i in range(len(values)):
v = values[i]
for w in range(N + 1):
if v > w:
memo[i + 1][w] = memo[i][w]
else:
memo[i + 1][w] = min(memo[i][w], memo[i + 1][w - v] + 1)
print((memo[len(values)][N]))
| false | 6.060606 |
[
"-import numpy as np",
"-",
"-",
"-",
"-def make_array(shape, defval=0, dtype=int):",
"- res = np.zeros(shape, dtype)",
"- res[:] = defval",
"- return res.tolist()",
"-",
"-",
"-memo = make_array((15, N + 1), N * 2)",
"+# def make_array(shape, defval=0, dtype=int):",
"+# res = np.zeros(shape, dtype)",
"+# res[:] = defval",
"+# return res.tolist()",
"+# memo = make_array((15, N + 1), N * 2)",
"+memo = [[N * 2] * (N + 1) for _ in range(15)]"
] | false | 0.787887 | 0.536785 | 1.467788 |
[
"s007936873",
"s855847409"
] |
u357751375
|
p03798
|
python
|
s655175280
|
s849490837
| 169 | 137 | 11,416 | 11,468 |
Accepted
|
Accepted
| 18.93 |
n = int(eval(input()))
s = list(eval(input()))
for i in range(4):
# 1,2 = 羊,羊 の場合
ans = ['?'] * n
flg = True
if i == 0:
ans[0] = 'S'
ans[1] = 'S'
if s[0] == 'o':
ans[-1] = 'S'
else:
ans[-1] = 'W'
if s[1] == 'o':
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
else:
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
# 1,2 = 羊,狼 の場合
if i == 1:
ans[0] = 'S'
ans[1] = 'W'
if s[0] == 'o':
ans[-1] = 'W'
else:
ans[-1] = 'S'
if s[1] == 'o':
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
else:
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
# 1,2 = 狼,羊 の場合
if i == 2:
ans[0] = 'W'
ans[1] = 'S'
if s[0] == 'o':
ans[-1] = 'W'
else:
ans[-1] = 'S'
if s[1] == 'o':
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
else:
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
# 1,2 = 狼,狼 の場合
if i == 3:
ans[0] = 'W'
ans[1] = 'W'
if s[0] == 'o':
ans[-1] = 'S'
else:
ans[-1] = 'W'
if s[1] == 'o':
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
else:
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
if flg:
for i in range(2,n-1):
if ans[i] == 'S':
if s[i] == 'o':
if ans[i-1] == 'S':
if ans[i+1] == 'W':
flg = False
else:
ans[i+1] = 'S'
else:
if ans[i+1] == 'S':
flg = False
else:
ans[i+1] = 'W'
else:
if ans[i-1] == 'S':
if ans[i+1] == 'S':
flg = False
else:
ans[i+1] = 'W'
else:
if ans[i+1] == 'W':
flg = False
else:
ans[i+1] = 'S'
else:
if s[i] == 'o':
if ans[i-1] == 'S':
if ans[i+1] == 'S':
flg = False
else:
ans[i+1] = 'W'
else:
if ans[i+1] == 'W':
flg = False
else:
ans[i+1] = 'S'
else:
if ans[i-1] == 'S':
if ans[i+1] == 'W':
flg = False
else:
ans[i+1] = 'S'
else:
if ans[i+1] == 'S':
flg = False
else:
ans[i+1] = 'W'
if ans[-1] == 'S':
if s[-1] == 'o':
if ans[-2] != ans[0]:
flg = False
else:
if ans[-2] == ans[0]:
flg = False
else:
if s[-1] == 'o':
if ans[-2] == ans[0]:
flg = False
else:
if ans[-2] != ans[0]:
flg = False
if flg:
print((''.join(ans)))
exit(0)
print((-1))
|
n = int(eval(input()))
s = list(eval(input()))
for i in range(4):
ans = ['?'] * n
flg = True
# 1,2 = 羊,羊 の場合
if i == 0:
ans[0] = 'S'
ans[1] = 'S'
if s[0] == 'o':
ans[-1] = 'S'
else:
ans[-1] = 'W'
if s[1] == 'o':
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
else:
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
# 1,2 = 羊,狼 の場合
if i == 1:
ans[0] = 'S'
ans[1] = 'W'
if s[0] == 'o':
ans[-1] = 'W'
else:
ans[-1] = 'S'
if s[1] == 'o':
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
else:
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
# 1,2 = 狼,羊 の場合
if i == 2:
ans[0] = 'W'
ans[1] = 'S'
if s[0] == 'o':
ans[-1] = 'W'
else:
ans[-1] = 'S'
if s[1] == 'o':
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
else:
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
# 1,2 = 狼,狼 の場合
if i == 3:
ans[0] = 'W'
ans[1] = 'W'
if s[0] == 'o':
ans[-1] = 'S'
else:
ans[-1] = 'W'
if s[1] == 'o':
if ans[2] == 'W':
flg = False
else:
ans[2] = 'S'
else:
if ans[2] == 'S':
flg = False
else:
ans[2] = 'W'
for i in range(2,n-2):
if ans[i] == 'S':
if s[i] == 'o':
if ans[i-1] == 'S':
ans[i+1] = 'S'
else:
ans[i+1] = 'W'
else:
if ans[i-1] == 'S':
ans[i+1] = 'W'
else:
ans[i+1] = 'S'
else:
if s[i] == 'o':
if ans[i-1] == 'S':
ans[i+1] = 'W'
else:
ans[i+1] = 'S'
else:
if ans[i-1] == 'S':
ans[i+1] = 'S'
else:
ans[i+1] = 'W'
if ans[-2] == 'S':
if s[-2] == 'o':
if ans[-3] != ans[-1]:
flg = False
else:
if ans[-3] == ans[-1]:
flg = False
else:
if s[-2] == 'o':
if ans[-3] == ans[-1]:
flg = False
else:
if ans[-3] != ans[-1]:
flg = False
if ans[-1] == 'S':
if s[-1] == 'o':
if ans[-2] != ans[0]:
flg = False
else:
if ans[-2] == ans[0]:
flg = False
else:
if s[-1] == 'o':
if ans[-2] == ans[0]:
flg = False
else:
if ans[-2] != ans[0]:
flg = False
if flg:
print((''.join(ans)))
exit(0)
print((-1))
| 143 | 132 | 4,074 | 3,322 |
n = int(eval(input()))
s = list(eval(input()))
for i in range(4):
# 1,2 = 羊,羊 の場合
ans = ["?"] * n
flg = True
if i == 0:
ans[0] = "S"
ans[1] = "S"
if s[0] == "o":
ans[-1] = "S"
else:
ans[-1] = "W"
if s[1] == "o":
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
else:
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
# 1,2 = 羊,狼 の場合
if i == 1:
ans[0] = "S"
ans[1] = "W"
if s[0] == "o":
ans[-1] = "W"
else:
ans[-1] = "S"
if s[1] == "o":
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
else:
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
# 1,2 = 狼,羊 の場合
if i == 2:
ans[0] = "W"
ans[1] = "S"
if s[0] == "o":
ans[-1] = "W"
else:
ans[-1] = "S"
if s[1] == "o":
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
else:
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
# 1,2 = 狼,狼 の場合
if i == 3:
ans[0] = "W"
ans[1] = "W"
if s[0] == "o":
ans[-1] = "S"
else:
ans[-1] = "W"
if s[1] == "o":
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
else:
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
if flg:
for i in range(2, n - 1):
if ans[i] == "S":
if s[i] == "o":
if ans[i - 1] == "S":
if ans[i + 1] == "W":
flg = False
else:
ans[i + 1] = "S"
else:
if ans[i + 1] == "S":
flg = False
else:
ans[i + 1] = "W"
else:
if ans[i - 1] == "S":
if ans[i + 1] == "S":
flg = False
else:
ans[i + 1] = "W"
else:
if ans[i + 1] == "W":
flg = False
else:
ans[i + 1] = "S"
else:
if s[i] == "o":
if ans[i - 1] == "S":
if ans[i + 1] == "S":
flg = False
else:
ans[i + 1] = "W"
else:
if ans[i + 1] == "W":
flg = False
else:
ans[i + 1] = "S"
else:
if ans[i - 1] == "S":
if ans[i + 1] == "W":
flg = False
else:
ans[i + 1] = "S"
else:
if ans[i + 1] == "S":
flg = False
else:
ans[i + 1] = "W"
if ans[-1] == "S":
if s[-1] == "o":
if ans[-2] != ans[0]:
flg = False
else:
if ans[-2] == ans[0]:
flg = False
else:
if s[-1] == "o":
if ans[-2] == ans[0]:
flg = False
else:
if ans[-2] != ans[0]:
flg = False
if flg:
print(("".join(ans)))
exit(0)
print((-1))
|
n = int(eval(input()))
s = list(eval(input()))
for i in range(4):
ans = ["?"] * n
flg = True
# 1,2 = 羊,羊 の場合
if i == 0:
ans[0] = "S"
ans[1] = "S"
if s[0] == "o":
ans[-1] = "S"
else:
ans[-1] = "W"
if s[1] == "o":
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
else:
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
# 1,2 = 羊,狼 の場合
if i == 1:
ans[0] = "S"
ans[1] = "W"
if s[0] == "o":
ans[-1] = "W"
else:
ans[-1] = "S"
if s[1] == "o":
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
else:
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
# 1,2 = 狼,羊 の場合
if i == 2:
ans[0] = "W"
ans[1] = "S"
if s[0] == "o":
ans[-1] = "W"
else:
ans[-1] = "S"
if s[1] == "o":
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
else:
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
# 1,2 = 狼,狼 の場合
if i == 3:
ans[0] = "W"
ans[1] = "W"
if s[0] == "o":
ans[-1] = "S"
else:
ans[-1] = "W"
if s[1] == "o":
if ans[2] == "W":
flg = False
else:
ans[2] = "S"
else:
if ans[2] == "S":
flg = False
else:
ans[2] = "W"
for i in range(2, n - 2):
if ans[i] == "S":
if s[i] == "o":
if ans[i - 1] == "S":
ans[i + 1] = "S"
else:
ans[i + 1] = "W"
else:
if ans[i - 1] == "S":
ans[i + 1] = "W"
else:
ans[i + 1] = "S"
else:
if s[i] == "o":
if ans[i - 1] == "S":
ans[i + 1] = "W"
else:
ans[i + 1] = "S"
else:
if ans[i - 1] == "S":
ans[i + 1] = "S"
else:
ans[i + 1] = "W"
if ans[-2] == "S":
if s[-2] == "o":
if ans[-3] != ans[-1]:
flg = False
else:
if ans[-3] == ans[-1]:
flg = False
else:
if s[-2] == "o":
if ans[-3] == ans[-1]:
flg = False
else:
if ans[-3] != ans[-1]:
flg = False
if ans[-1] == "S":
if s[-1] == "o":
if ans[-2] != ans[0]:
flg = False
else:
if ans[-2] == ans[0]:
flg = False
else:
if s[-1] == "o":
if ans[-2] == ans[0]:
flg = False
else:
if ans[-2] != ans[0]:
flg = False
if flg:
print(("".join(ans)))
exit(0)
print((-1))
| false | 7.692308 |
[
"- # 1,2 = 羊,羊 の場合",
"+ # 1,2 = 羊,羊 の場合",
"- if flg:",
"- for i in range(2, n - 1):",
"- if ans[i] == \"S\":",
"- if s[i] == \"o\":",
"- if ans[i - 1] == \"S\":",
"- if ans[i + 1] == \"W\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"S\"",
"- else:",
"- if ans[i + 1] == \"S\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"W\"",
"+ for i in range(2, n - 2):",
"+ if ans[i] == \"S\":",
"+ if s[i] == \"o\":",
"+ if ans[i - 1] == \"S\":",
"+ ans[i + 1] = \"S\"",
"- if ans[i - 1] == \"S\":",
"- if ans[i + 1] == \"S\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"W\"",
"- else:",
"- if ans[i + 1] == \"W\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"S\"",
"+ ans[i + 1] = \"W\"",
"- if s[i] == \"o\":",
"- if ans[i - 1] == \"S\":",
"- if ans[i + 1] == \"S\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"W\"",
"- else:",
"- if ans[i + 1] == \"W\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"S\"",
"+ if ans[i - 1] == \"S\":",
"+ ans[i + 1] = \"W\"",
"- if ans[i - 1] == \"S\":",
"- if ans[i + 1] == \"W\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"S\"",
"- else:",
"- if ans[i + 1] == \"S\":",
"- flg = False",
"- else:",
"- ans[i + 1] = \"W\"",
"- if ans[-1] == \"S\":",
"- if s[-1] == \"o\":",
"- if ans[-2] != ans[0]:",
"- flg = False",
"+ ans[i + 1] = \"S\"",
"+ else:",
"+ if s[i] == \"o\":",
"+ if ans[i - 1] == \"S\":",
"+ ans[i + 1] = \"W\"",
"+ else:",
"+ ans[i + 1] = \"S\"",
"- if ans[-2] == ans[0]:",
"- flg = False",
"+ if ans[i - 1] == \"S\":",
"+ ans[i + 1] = \"S\"",
"+ else:",
"+ ans[i + 1] = \"W\"",
"+ if ans[-2] == \"S\":",
"+ if s[-2] == \"o\":",
"+ if ans[-3] != ans[-1]:",
"+ flg = False",
"- if s[-1] == \"o\":",
"- if ans[-2] == ans[0]:",
"- flg = False",
"- else:",
"- if ans[-2] != ans[0]:",
"- flg = False",
"+ if ans[-3] == ans[-1]:",
"+ flg = False",
"+ else:",
"+ if s[-2] == \"o\":",
"+ if ans[-3] == ans[-1]:",
"+ flg = False",
"+ else:",
"+ if ans[-3] != ans[-1]:",
"+ flg = False",
"+ if ans[-1] == \"S\":",
"+ if s[-1] == \"o\":",
"+ if ans[-2] != ans[0]:",
"+ flg = False",
"+ else:",
"+ if ans[-2] == ans[0]:",
"+ flg = False",
"+ else:",
"+ if s[-1] == \"o\":",
"+ if ans[-2] == ans[0]:",
"+ flg = False",
"+ else:",
"+ if ans[-2] != ans[0]:",
"+ flg = False"
] | false | 0.050923 | 0.049953 | 1.019411 |
[
"s655175280",
"s849490837"
] |
u981931040
|
p03062
|
python
|
s134156755
|
s082663139
| 115 | 80 | 14,284 | 14,412 |
Accepted
|
Accepted
| 30.43 |
N = int(eval(input()))
A = list(map(int ,input().split()))
cnt = 0
for i in range(N):
if A[i] < 0:
cnt += 1
A[i] = -1 * A[i]
if cnt % 2 == 0:
print((sum(A)))
else:
A.sort()
print((sum(A) - A[0] * 2))
|
N = int(eval(input()))
A = list(map(int, input().split()))
minus_cnt = 0
for i in range(len(A)):
if A[i] < 0:
minus_cnt += 1
A[i] = -A[i]
if minus_cnt % 2 == 0:
print((sum(A)))
else:
tmp = float("inf")
for a in A:
if tmp > abs(a):
tmp = a
print((sum(A) - 2 * tmp))
| 13 | 15 | 234 | 325 |
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] < 0:
cnt += 1
A[i] = -1 * A[i]
if cnt % 2 == 0:
print((sum(A)))
else:
A.sort()
print((sum(A) - A[0] * 2))
|
N = int(eval(input()))
A = list(map(int, input().split()))
minus_cnt = 0
for i in range(len(A)):
if A[i] < 0:
minus_cnt += 1
A[i] = -A[i]
if minus_cnt % 2 == 0:
print((sum(A)))
else:
tmp = float("inf")
for a in A:
if tmp > abs(a):
tmp = a
print((sum(A) - 2 * tmp))
| false | 13.333333 |
[
"-cnt = 0",
"-for i in range(N):",
"+minus_cnt = 0",
"+for i in range(len(A)):",
"- cnt += 1",
"- A[i] = -1 * A[i]",
"-if cnt % 2 == 0:",
"+ minus_cnt += 1",
"+ A[i] = -A[i]",
"+if minus_cnt % 2 == 0:",
"- A.sort()",
"- print((sum(A) - A[0] * 2))",
"+ tmp = float(\"inf\")",
"+ for a in A:",
"+ if tmp > abs(a):",
"+ tmp = a",
"+ print((sum(A) - 2 * tmp))"
] | false | 0.074112 | 0.039328 | 1.884436 |
[
"s134156755",
"s082663139"
] |
u763968347
|
p03599
|
python
|
s848790067
|
s734780431
| 1,544 | 43 | 3,064 | 3,064 |
Accepted
|
Accepted
| 97.22 |
A,B,C,D,E,F = list(map(int,input().split()))
ans_con = -1
max_con = E/(100+E)*100
a = 0
while F >= 100*A*a:
b = 0
while F-100*A*a >= 100*B*b:
water = 100*(A*a+B*b)
c = 0
while F-water >= C*c:
d = 0
while F-water-C*c >= D*d:
sugar = C*c+D*d
mass = water + sugar
if 0 < mass <= F:
con = sugar/mass*100
if ans_con < con <= max_con:
ans_con = con
ans_mass = mass
ans_sugar = sugar
d += 1
c += 1
b += 1
a += 1
print((int(ans_mass), int(ans_sugar)))
|
A,B,C,D,E,F = list(map(int,input().split()))
ans_con = -1
max_con = E/(100+E)*100
a = 0
while F >= 100*A*a:
b = 0
while F-100*A*a >= 100*B*b:
water = 100*(A*a+B*b)
c = 0
while F-water >= C*c:
sugar = C*c+D*max(min(((F-water-C*c)//D),(water*E/100-C*c)//D),0)
mass = water + sugar
if 0 < mass <= F:
con = sugar/mass*100
if ans_con < con <= max_con:
ans_con = con
ans_mass = mass
ans_sugar = sugar
c += 1
b += 1
a += 1
print((int(ans_mass), int(ans_sugar)))
| 28 | 25 | 721 | 657 |
A, B, C, D, E, F = list(map(int, input().split()))
ans_con = -1
max_con = E / (100 + E) * 100
a = 0
while F >= 100 * A * a:
b = 0
while F - 100 * A * a >= 100 * B * b:
water = 100 * (A * a + B * b)
c = 0
while F - water >= C * c:
d = 0
while F - water - C * c >= D * d:
sugar = C * c + D * d
mass = water + sugar
if 0 < mass <= F:
con = sugar / mass * 100
if ans_con < con <= max_con:
ans_con = con
ans_mass = mass
ans_sugar = sugar
d += 1
c += 1
b += 1
a += 1
print((int(ans_mass), int(ans_sugar)))
|
A, B, C, D, E, F = list(map(int, input().split()))
ans_con = -1
max_con = E / (100 + E) * 100
a = 0
while F >= 100 * A * a:
b = 0
while F - 100 * A * a >= 100 * B * b:
water = 100 * (A * a + B * b)
c = 0
while F - water >= C * c:
sugar = C * c + D * max(
min(((F - water - C * c) // D), (water * E / 100 - C * c) // D), 0
)
mass = water + sugar
if 0 < mass <= F:
con = sugar / mass * 100
if ans_con < con <= max_con:
ans_con = con
ans_mass = mass
ans_sugar = sugar
c += 1
b += 1
a += 1
print((int(ans_mass), int(ans_sugar)))
| false | 10.714286 |
[
"- d = 0",
"- while F - water - C * c >= D * d:",
"- sugar = C * c + D * d",
"- mass = water + sugar",
"- if 0 < mass <= F:",
"- con = sugar / mass * 100",
"- if ans_con < con <= max_con:",
"- ans_con = con",
"- ans_mass = mass",
"- ans_sugar = sugar",
"- d += 1",
"+ sugar = C * c + D * max(",
"+ min(((F - water - C * c) // D), (water * E / 100 - C * c) // D), 0",
"+ )",
"+ mass = water + sugar",
"+ if 0 < mass <= F:",
"+ con = sugar / mass * 100",
"+ if ans_con < con <= max_con:",
"+ ans_con = con",
"+ ans_mass = mass",
"+ ans_sugar = sugar"
] | false | 0.659062 | 0.046378 | 14.210807 |
[
"s848790067",
"s734780431"
] |
u952708174
|
p03660
|
python
|
s847477615
|
s998156498
| 590 | 511 | 47,988 | 48,272 |
Accepted
|
Accepted
| 13.39 |
def d_fennec_vs_snuke(N, E): # N:マスの個数, E:道の情報
# 隣接リストの作成
edge = [[] for _ in range(N)]
for a, b in E:
a -= 1
b -= 1
edge[a].append(b)
edge[b].append(a)
# 幅優先探索
def bfs(N, adjacent, V):
# 木のある頂点Vからの距離を求める
dist = [0 for i in range(N)] # 頂点Vからの距離
isVisit = [False for i in range(N)] # ある頂点が探索済か
queue = [V - 1] # 幅探索用キュー(配列が0-indexedのため-1する)
isVisit[V - 1] = True
while queue:
u = queue.pop()
for p in adjacent[u]:
if not isVisit[p]:
isVisit[p] = True
dist[p] = dist[u] + 1
queue.append(p)
return dist
fennec_dist = bfs(N, edge, 1) # フェネック(頂点1スタート)から各頂点の距離
snuke_dist = bfs(N, edge, N) # すぬけ(頂点Nスタート)
fennec_point, snuke_point = 0, 0 # 自分が色を塗れたマスの数
for idx in range(N):
if fennec_dist[idx] <= snuke_dist[idx]:
fennec_point += 1
else:
snuke_point += 1
if fennec_point > snuke_point:
return 'Fennec'
else:
return 'Snuke'
return None
N = int(eval(input()))
E = [[int(i) for i in input().split()] for j in range(N-1)]
print((d_fennec_vs_snuke(N, E)))
|
def d_fennec_vs_snuke():
from collections import deque
N = int(eval(input()))
Edges = [[int(i) for i in input().split()] for j in range(N - 1)]
graph = [[] for _ in range(N)]
for a, b in Edges:
graph[a - 1].append(b - 1)
graph[b - 1].append(a - 1)
def bfs(start, tree_size=N, tree=graph):
"""木のある頂点 start からの距離を求める (start は 0-origin)"""
dist = [0] * tree_size
is_visited = [False] * tree_size
is_visited[start] = True
queue = deque([start])
while queue:
current = queue.pop()
for child in tree[current]:
if is_visited[child]:
continue
is_visited[child] = True
dist[child] = dist[current] + 1
queue.appendleft(child)
return dist
fennec_dist, snuke_dist = bfs(0), bfs(N - 1)
fennec_point, snuke_point = 0, 0 # 各々が色を塗れたマスの数
for fennec, snuke in zip(fennec_dist, snuke_dist):
if fennec <= snuke:
fennec_point += 1
else:
snuke_point += 1
return 'Fennec' if fennec_point > snuke_point else 'Snuke'
print((d_fennec_vs_snuke()))
| 43 | 38 | 1,281 | 1,216 |
def d_fennec_vs_snuke(N, E): # N:マスの個数, E:道の情報
# 隣接リストの作成
edge = [[] for _ in range(N)]
for a, b in E:
a -= 1
b -= 1
edge[a].append(b)
edge[b].append(a)
# 幅優先探索
def bfs(N, adjacent, V):
# 木のある頂点Vからの距離を求める
dist = [0 for i in range(N)] # 頂点Vからの距離
isVisit = [False for i in range(N)] # ある頂点が探索済か
queue = [V - 1] # 幅探索用キュー(配列が0-indexedのため-1する)
isVisit[V - 1] = True
while queue:
u = queue.pop()
for p in adjacent[u]:
if not isVisit[p]:
isVisit[p] = True
dist[p] = dist[u] + 1
queue.append(p)
return dist
fennec_dist = bfs(N, edge, 1) # フェネック(頂点1スタート)から各頂点の距離
snuke_dist = bfs(N, edge, N) # すぬけ(頂点Nスタート)
fennec_point, snuke_point = 0, 0 # 自分が色を塗れたマスの数
for idx in range(N):
if fennec_dist[idx] <= snuke_dist[idx]:
fennec_point += 1
else:
snuke_point += 1
if fennec_point > snuke_point:
return "Fennec"
else:
return "Snuke"
return None
N = int(eval(input()))
E = [[int(i) for i in input().split()] for j in range(N - 1)]
print((d_fennec_vs_snuke(N, E)))
|
def d_fennec_vs_snuke():
from collections import deque
N = int(eval(input()))
Edges = [[int(i) for i in input().split()] for j in range(N - 1)]
graph = [[] for _ in range(N)]
for a, b in Edges:
graph[a - 1].append(b - 1)
graph[b - 1].append(a - 1)
def bfs(start, tree_size=N, tree=graph):
"""木のある頂点 start からの距離を求める (start は 0-origin)"""
dist = [0] * tree_size
is_visited = [False] * tree_size
is_visited[start] = True
queue = deque([start])
while queue:
current = queue.pop()
for child in tree[current]:
if is_visited[child]:
continue
is_visited[child] = True
dist[child] = dist[current] + 1
queue.appendleft(child)
return dist
fennec_dist, snuke_dist = bfs(0), bfs(N - 1)
fennec_point, snuke_point = 0, 0 # 各々が色を塗れたマスの数
for fennec, snuke in zip(fennec_dist, snuke_dist):
if fennec <= snuke:
fennec_point += 1
else:
snuke_point += 1
return "Fennec" if fennec_point > snuke_point else "Snuke"
print((d_fennec_vs_snuke()))
| false | 11.627907 |
[
"-def d_fennec_vs_snuke(N, E): # N:マスの個数, E:道の情報",
"- # 隣接リストの作成",
"- edge = [[] for _ in range(N)]",
"- for a, b in E:",
"- a -= 1",
"- b -= 1",
"- edge[a].append(b)",
"- edge[b].append(a)",
"- # 幅優先探索",
"- def bfs(N, adjacent, V):",
"- # 木のある頂点Vからの距離を求める",
"- dist = [0 for i in range(N)] # 頂点Vからの距離",
"- isVisit = [False for i in range(N)] # ある頂点が探索済か",
"- queue = [V - 1] # 幅探索用キュー(配列が0-indexedのため-1する)",
"- isVisit[V - 1] = True",
"+def d_fennec_vs_snuke():",
"+ from collections import deque",
"+",
"+ N = int(eval(input()))",
"+ Edges = [[int(i) for i in input().split()] for j in range(N - 1)]",
"+ graph = [[] for _ in range(N)]",
"+ for a, b in Edges:",
"+ graph[a - 1].append(b - 1)",
"+ graph[b - 1].append(a - 1)",
"+",
"+ def bfs(start, tree_size=N, tree=graph):",
"+ \"\"\"木のある頂点 start からの距離を求める (start は 0-origin)\"\"\"",
"+ dist = [0] * tree_size",
"+ is_visited = [False] * tree_size",
"+ is_visited[start] = True",
"+ queue = deque([start])",
"- u = queue.pop()",
"- for p in adjacent[u]:",
"- if not isVisit[p]:",
"- isVisit[p] = True",
"- dist[p] = dist[u] + 1",
"- queue.append(p)",
"+ current = queue.pop()",
"+ for child in tree[current]:",
"+ if is_visited[child]:",
"+ continue",
"+ is_visited[child] = True",
"+ dist[child] = dist[current] + 1",
"+ queue.appendleft(child)",
"- fennec_dist = bfs(N, edge, 1) # フェネック(頂点1スタート)から各頂点の距離",
"- snuke_dist = bfs(N, edge, N) # すぬけ(頂点Nスタート)",
"- fennec_point, snuke_point = 0, 0 # 自分が色を塗れたマスの数",
"- for idx in range(N):",
"- if fennec_dist[idx] <= snuke_dist[idx]:",
"+ fennec_dist, snuke_dist = bfs(0), bfs(N - 1)",
"+ fennec_point, snuke_point = 0, 0 # 各々が色を塗れたマスの数",
"+ for fennec, snuke in zip(fennec_dist, snuke_dist):",
"+ if fennec <= snuke:",
"- if fennec_point > snuke_point:",
"- return \"Fennec\"",
"- else:",
"- return \"Snuke\"",
"- return None",
"+ return \"Fennec\" if fennec_point > snuke_point else \"Snuke\"",
"-N = int(eval(input()))",
"-E = [[int(i) for i in input().split()] for j in range(N - 1)]",
"-print((d_fennec_vs_snuke(N, E)))",
"+print((d_fennec_vs_snuke()))"
] | false | 0.046485 | 0.044904 | 1.03521 |
[
"s847477615",
"s998156498"
] |
u648212584
|
p03332
|
python
|
s256632910
|
s571529784
| 1,120 | 775 | 39,232 | 27,336 |
Accepted
|
Accepted
| 30.8 |
import sys
input = sys.stdin.buffer.readline
import copy
def main():
N,A,B,K = list(map(int,input().split()))
MOD = 998244353
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
inv = copy.deepcopy(fac)
invfac = copy.deepcopy(fac)
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
inv[i] = MOD-(MOD//i)*inv[MOD%i]%MOD
invfac[i] = (invfac[i-1]*inv[i])%MOD
def coef(x,y):
num = (((fac[x]*invfac[y])%MOD)*invfac[x-y]%MOD)
return num
ans = 0
for i in range(min(K//max(A,B),N)+1):
rest = K-i*max(A,B)
if rest%min(A,B) == 0:
j = rest//min(A,B)
if j <= N:
ans += coef(N,i)*coef(N,j)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.buffer.readline
import copy
def main():
N,A,B,K = list(map(int,input().split()))
MOD = 998244353
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
invfac = copy.deepcopy(fac)
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
invfac[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(N,0,-1):
invfac[i-1] = (invfac[i]*i)%MOD
def coef(x,y):
num = (((fac[x]*invfac[y])%MOD)*invfac[x-y]%MOD)
return num
ans = 0
for i in range(min(K//max(A,B),N)+1):
rest = K-i*max(A,B)
if rest%min(A,B) == 0:
j = rest//min(A,B)
if j <= N:
ans += coef(N,i)*coef(N,j)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| 35 | 36 | 858 | 845 |
import sys
input = sys.stdin.buffer.readline
import copy
def main():
N, A, B, K = list(map(int, input().split()))
MOD = 998244353
fac = [0 for _ in range(N + 1)]
fac[0], fac[1] = 1, 1
inv = copy.deepcopy(fac)
invfac = copy.deepcopy(fac)
for i in range(2, N + 1):
fac[i] = (fac[i - 1] * i) % MOD
inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD
invfac[i] = (invfac[i - 1] * inv[i]) % MOD
def coef(x, y):
num = ((fac[x] * invfac[y]) % MOD) * invfac[x - y] % MOD
return num
ans = 0
for i in range(min(K // max(A, B), N) + 1):
rest = K - i * max(A, B)
if rest % min(A, B) == 0:
j = rest // min(A, B)
if j <= N:
ans += coef(N, i) * coef(N, j)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.buffer.readline
import copy
def main():
N, A, B, K = list(map(int, input().split()))
MOD = 998244353
fac = [0 for _ in range(N + 1)]
fac[0], fac[1] = 1, 1
invfac = copy.deepcopy(fac)
for i in range(2, N + 1):
fac[i] = (fac[i - 1] * i) % MOD
invfac[-1] = pow(fac[-1], MOD - 2, MOD)
for i in range(N, 0, -1):
invfac[i - 1] = (invfac[i] * i) % MOD
def coef(x, y):
num = ((fac[x] * invfac[y]) % MOD) * invfac[x - y] % MOD
return num
ans = 0
for i in range(min(K // max(A, B), N) + 1):
rest = K - i * max(A, B)
if rest % min(A, B) == 0:
j = rest // min(A, B)
if j <= N:
ans += coef(N, i) * coef(N, j)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| false | 2.777778 |
[
"- inv = copy.deepcopy(fac)",
"- inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD",
"- invfac[i] = (invfac[i - 1] * inv[i]) % MOD",
"+ invfac[-1] = pow(fac[-1], MOD - 2, MOD)",
"+ for i in range(N, 0, -1):",
"+ invfac[i - 1] = (invfac[i] * i) % MOD"
] | false | 0.157643 | 0.466084 | 0.338228 |
[
"s256632910",
"s571529784"
] |
u836737505
|
p03107
|
python
|
s463119795
|
s580885841
| 22 | 18 | 3,956 | 3,188 |
Accepted
|
Accepted
| 18.18 |
s = list(eval(input()))
print((min(s.count("1"),s.count("0"))*2))
|
s = eval(input())
print((min(s.count("1"),s.count("0"))*2))
| 2 | 2 | 58 | 52 |
s = list(eval(input()))
print((min(s.count("1"), s.count("0")) * 2))
|
s = eval(input())
print((min(s.count("1"), s.count("0")) * 2))
| false | 0 |
[
"-s = list(eval(input()))",
"+s = eval(input())"
] | false | 0.036354 | 0.03662 | 0.992738 |
[
"s463119795",
"s580885841"
] |
u827885761
|
p03074
|
python
|
s556895348
|
s427815228
| 111 | 98 | 10,484 | 10,484 |
Accepted
|
Accepted
| 11.71 |
n, k = list(map(int,input().split()))
s = eval(input()) + '1'
l = []
i = 0
d = []
while i <= n:
if s[i] == '0':
d.append(i)
else:
if d != []:
l.append(d)
d = []
i += 1
#print(l)
m = 0
nl = len(l)
for i in range(max(nl - k + 1, 1)):
start = l[i - 1][-1] + 1 if i != 0 else 0
goal = l[min(i + k, nl - 1)][0] - 1 if not i + k > nl - 1 else n - 1
#print(start, goal)
m = max(m, goal - start + 1)
print(m)
|
n, k = list(map(int,input().split()))
s = eval(input()) + '1'
L = []
i = 0
d = []
while i <= n:
if s[i] == '0':
d.append(i)
else:
if d != []:
L.append(d)
d = []
i += 1
ans = 0
nl = len(L)
if nl <= k:
print(n)
else:
for i in range(nl - k + 1):
if i == 0:
sta = 0
else:
sta = L[i - 1][-1] + 1
if i == nl - k:
end = n - 1
else:
end = L[i + k][0] - 1
ans = max(ans, end - sta + 1)
print(ans)
| 28 | 37 | 490 | 572 |
n, k = list(map(int, input().split()))
s = eval(input()) + "1"
l = []
i = 0
d = []
while i <= n:
if s[i] == "0":
d.append(i)
else:
if d != []:
l.append(d)
d = []
i += 1
# print(l)
m = 0
nl = len(l)
for i in range(max(nl - k + 1, 1)):
start = l[i - 1][-1] + 1 if i != 0 else 0
goal = l[min(i + k, nl - 1)][0] - 1 if not i + k > nl - 1 else n - 1
# print(start, goal)
m = max(m, goal - start + 1)
print(m)
|
n, k = list(map(int, input().split()))
s = eval(input()) + "1"
L = []
i = 0
d = []
while i <= n:
if s[i] == "0":
d.append(i)
else:
if d != []:
L.append(d)
d = []
i += 1
ans = 0
nl = len(L)
if nl <= k:
print(n)
else:
for i in range(nl - k + 1):
if i == 0:
sta = 0
else:
sta = L[i - 1][-1] + 1
if i == nl - k:
end = n - 1
else:
end = L[i + k][0] - 1
ans = max(ans, end - sta + 1)
print(ans)
| false | 24.324324 |
[
"-l = []",
"+L = []",
"- l.append(d)",
"+ L.append(d)",
"-# print(l)",
"-m = 0",
"-nl = len(l)",
"-for i in range(max(nl - k + 1, 1)):",
"- start = l[i - 1][-1] + 1 if i != 0 else 0",
"- goal = l[min(i + k, nl - 1)][0] - 1 if not i + k > nl - 1 else n - 1",
"- # print(start, goal)",
"- m = max(m, goal - start + 1)",
"-print(m)",
"+ans = 0",
"+nl = len(L)",
"+if nl <= k:",
"+ print(n)",
"+else:",
"+ for i in range(nl - k + 1):",
"+ if i == 0:",
"+ sta = 0",
"+ else:",
"+ sta = L[i - 1][-1] + 1",
"+ if i == nl - k:",
"+ end = n - 1",
"+ else:",
"+ end = L[i + k][0] - 1",
"+ ans = max(ans, end - sta + 1)",
"+ print(ans)"
] | false | 0.040657 | 0.041328 | 0.983756 |
[
"s556895348",
"s427815228"
] |
u395202850
|
p03325
|
python
|
s506142683
|
s520620696
| 199 | 129 | 4,148 | 4,148 |
Accepted
|
Accepted
| 35.18 |
import math
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
aMax, aNum, aMaxSum = 0, 0, 0
for i in range(n):
aNum, aCnt = a[i], 0
while aNum % 2 == 0 and aNum / 2 == aNum // 2:
aCnt += 1
aNum /= 2
aMaxSum += aCnt
print(aMaxSum)
|
n = int(eval(input()))
a = list(map(int, input().split()))
aMax, aCnt = 0, 0
for i in range(n):
while a[i] % 2 == 0:
aCnt += 1
a[i] /= 2
print(aCnt)
| 14 | 10 | 285 | 174 |
import math
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
aMax, aNum, aMaxSum = 0, 0, 0
for i in range(n):
aNum, aCnt = a[i], 0
while aNum % 2 == 0 and aNum / 2 == aNum // 2:
aCnt += 1
aNum /= 2
aMaxSum += aCnt
print(aMaxSum)
|
n = int(eval(input()))
a = list(map(int, input().split()))
aMax, aCnt = 0, 0
for i in range(n):
while a[i] % 2 == 0:
aCnt += 1
a[i] /= 2
print(aCnt)
| false | 28.571429 |
[
"-import math",
"-",
"-a = sorted(list(map(int, input().split())))",
"-aMax, aNum, aMaxSum = 0, 0, 0",
"+a = list(map(int, input().split()))",
"+aMax, aCnt = 0, 0",
"- aNum, aCnt = a[i], 0",
"- while aNum % 2 == 0 and aNum / 2 == aNum // 2:",
"+ while a[i] % 2 == 0:",
"- aNum /= 2",
"- aMaxSum += aCnt",
"-print(aMaxSum)",
"+ a[i] /= 2",
"+print(aCnt)"
] | false | 0.081883 | 0.036968 | 2.214971 |
[
"s506142683",
"s520620696"
] |
u945181840
|
p03007
|
python
|
s048048951
|
s340374687
| 282 | 174 | 19,196 | 20,184 |
Accepted
|
Accepted
| 38.3 |
import sys
from bisect import bisect_left
read = sys.stdin.read
N, *A = list(map(int, read().split()))
A.sort()
zero = bisect_left(A, 0)
xy = []
for i in range(1, N - 1):
if i < zero:
xy.append((A[-1], A[i]))
A[-1] -= A[i]
else:
xy.append((A[0], A[i]))
A[0] -= A[i]
print((A[-1] - A[0]))
for x, y in xy:
print((x, y))
print((A[-1], A[0]))
|
import sys
from bisect import bisect_left
read = sys.stdin.read
N, *A = list(map(int, read().split()))
A.sort()
zero = bisect_left(A, 0)
xy = []
minimum = A[0]
maximum = A[-1]
for i in range(1, N - 1):
if i < zero:
xy.append(str(maximum) + ' ' + str(A[i]))
maximum -= A[i]
else:
xy.append((str(minimum) + ' ' + str(A[i])))
minimum -= A[i]
else:
xy.append(str(maximum) + ' ' + str(minimum))
print((maximum - minimum))
print(('\n'.join(xy)))
| 20 | 22 | 391 | 496 |
import sys
from bisect import bisect_left
read = sys.stdin.read
N, *A = list(map(int, read().split()))
A.sort()
zero = bisect_left(A, 0)
xy = []
for i in range(1, N - 1):
if i < zero:
xy.append((A[-1], A[i]))
A[-1] -= A[i]
else:
xy.append((A[0], A[i]))
A[0] -= A[i]
print((A[-1] - A[0]))
for x, y in xy:
print((x, y))
print((A[-1], A[0]))
|
import sys
from bisect import bisect_left
read = sys.stdin.read
N, *A = list(map(int, read().split()))
A.sort()
zero = bisect_left(A, 0)
xy = []
minimum = A[0]
maximum = A[-1]
for i in range(1, N - 1):
if i < zero:
xy.append(str(maximum) + " " + str(A[i]))
maximum -= A[i]
else:
xy.append((str(minimum) + " " + str(A[i])))
minimum -= A[i]
else:
xy.append(str(maximum) + " " + str(minimum))
print((maximum - minimum))
print(("\n".join(xy)))
| false | 9.090909 |
[
"+minimum = A[0]",
"+maximum = A[-1]",
"- xy.append((A[-1], A[i]))",
"- A[-1] -= A[i]",
"+ xy.append(str(maximum) + \" \" + str(A[i]))",
"+ maximum -= A[i]",
"- xy.append((A[0], A[i]))",
"- A[0] -= A[i]",
"-print((A[-1] - A[0]))",
"-for x, y in xy:",
"- print((x, y))",
"-print((A[-1], A[0]))",
"+ xy.append((str(minimum) + \" \" + str(A[i])))",
"+ minimum -= A[i]",
"+else:",
"+ xy.append(str(maximum) + \" \" + str(minimum))",
"+print((maximum - minimum))",
"+print((\"\\n\".join(xy)))"
] | false | 0.038504 | 0.04587 | 0.839412 |
[
"s048048951",
"s340374687"
] |
u687041133
|
p03371
|
python
|
s363966945
|
s049158232
| 125 | 18 | 3,064 | 3,064 |
Accepted
|
Accepted
| 85.6 |
A, B, C, X, Y = list(map(int, input().split()))
AB = A + B
num_A = 0
num_B = 0
num_C = 0
ans_cost = 5000 * 2 * 10**5
if 2 * C > AB:
num_A = X
num_B = Y
num_C = 0
ans_cost = int(A*num_A + B*num_B + C*num_C)
else:
min_C = min(X,Y) *2
max_C = max(X,Y) *2
for i in range(min_C, max_C+1, 2):
num_A = X - i / 2
num_B = Y - i / 2
if num_A < 1:
num_A = 0
if num_B < 1:
num_B = 0
total_cost = int(A*num_A + B*num_B + C*i)
if total_cost < ans_cost:
ans_cost = total_cost
print(ans_cost)
|
A, B, C, X, Y = list(map(int, input().split()))
min_cost = 0
if X - Y > 0:
temp_cost = 2 * C * Y
temp_cost += A * (X - Y)
temp_cost2 = 2 * C * X
if temp_cost > temp_cost2:
min_cost = temp_cost2
else:
min_cost = temp_cost
else:
temp_cost = 2 * C * X
temp_cost += B * (Y - X)
temp_cost2 = 2 * C * Y
if temp_cost > temp_cost2:
min_cost = temp_cost2
else:
min_cost = temp_cost
temp_cost3 = A * X + B *Y
if temp_cost3 < min_cost:
min_cost = temp_cost3
print(min_cost)
| 30 | 35 | 628 | 584 |
A, B, C, X, Y = list(map(int, input().split()))
AB = A + B
num_A = 0
num_B = 0
num_C = 0
ans_cost = 5000 * 2 * 10**5
if 2 * C > AB:
num_A = X
num_B = Y
num_C = 0
ans_cost = int(A * num_A + B * num_B + C * num_C)
else:
min_C = min(X, Y) * 2
max_C = max(X, Y) * 2
for i in range(min_C, max_C + 1, 2):
num_A = X - i / 2
num_B = Y - i / 2
if num_A < 1:
num_A = 0
if num_B < 1:
num_B = 0
total_cost = int(A * num_A + B * num_B + C * i)
if total_cost < ans_cost:
ans_cost = total_cost
print(ans_cost)
|
A, B, C, X, Y = list(map(int, input().split()))
min_cost = 0
if X - Y > 0:
temp_cost = 2 * C * Y
temp_cost += A * (X - Y)
temp_cost2 = 2 * C * X
if temp_cost > temp_cost2:
min_cost = temp_cost2
else:
min_cost = temp_cost
else:
temp_cost = 2 * C * X
temp_cost += B * (Y - X)
temp_cost2 = 2 * C * Y
if temp_cost > temp_cost2:
min_cost = temp_cost2
else:
min_cost = temp_cost
temp_cost3 = A * X + B * Y
if temp_cost3 < min_cost:
min_cost = temp_cost3
print(min_cost)
| false | 14.285714 |
[
"-AB = A + B",
"-num_A = 0",
"-num_B = 0",
"-num_C = 0",
"-ans_cost = 5000 * 2 * 10**5",
"-if 2 * C > AB:",
"- num_A = X",
"- num_B = Y",
"- num_C = 0",
"- ans_cost = int(A * num_A + B * num_B + C * num_C)",
"+min_cost = 0",
"+if X - Y > 0:",
"+ temp_cost = 2 * C * Y",
"+ temp_cost += A * (X - Y)",
"+ temp_cost2 = 2 * C * X",
"+ if temp_cost > temp_cost2:",
"+ min_cost = temp_cost2",
"+ else:",
"+ min_cost = temp_cost",
"- min_C = min(X, Y) * 2",
"- max_C = max(X, Y) * 2",
"- for i in range(min_C, max_C + 1, 2):",
"- num_A = X - i / 2",
"- num_B = Y - i / 2",
"- if num_A < 1:",
"- num_A = 0",
"- if num_B < 1:",
"- num_B = 0",
"- total_cost = int(A * num_A + B * num_B + C * i)",
"- if total_cost < ans_cost:",
"- ans_cost = total_cost",
"-print(ans_cost)",
"+ temp_cost = 2 * C * X",
"+ temp_cost += B * (Y - X)",
"+ temp_cost2 = 2 * C * Y",
"+ if temp_cost > temp_cost2:",
"+ min_cost = temp_cost2",
"+ else:",
"+ min_cost = temp_cost",
"+temp_cost3 = A * X + B * Y",
"+if temp_cost3 < min_cost:",
"+ min_cost = temp_cost3",
"+print(min_cost)"
] | false | 0.048785 | 0.107543 | 0.453631 |
[
"s363966945",
"s049158232"
] |
u296518383
|
p03160
|
python
|
s641070986
|
s894616703
| 142 | 131 | 13,900 | 13,928 |
Accepted
|
Accepted
| 7.75 |
N=int(eval(input()))
h=list(map(int,input().split()))
c=[0]*N
c[1]=abs(h[1]-h[0])
for i in range(2,N):
c[i]=min(c[i-2]+abs(h[i]-h[i-2]),c[i-1]+abs(h[i]-h[i-1]))
print((c[-1]))
|
# 埋める配列
# dp[x] = 足場0からスタートして足場xに着地するときに足場xまでに払うコストの最小値
# 計算方法
# dp[0] = 0
# dp[x] = min(dp[x - 1] + |h[x] - h[x - 1]|, dp[x - 2] + |h[x] - h[x - 2]|)
# 埋める順番
# xが小さい順
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [0] * (N + 5)
for i in range(1, N):
if i == 1:
dp[i] = dp[i - 1] + abs(H[i] - H[i - 1])
else:
dp[i] = min(dp[i - 1] + abs(H[i] - H[i - 1]),
dp[i - 2] + abs(H[i] - H[i - 2]))
print((dp[N - 1]))
| 8 | 23 | 177 | 480 |
N = int(eval(input()))
h = list(map(int, input().split()))
c = [0] * N
c[1] = abs(h[1] - h[0])
for i in range(2, N):
c[i] = min(c[i - 2] + abs(h[i] - h[i - 2]), c[i - 1] + abs(h[i] - h[i - 1]))
print((c[-1]))
|
# 埋める配列
# dp[x] = 足場0からスタートして足場xに着地するときに足場xまでに払うコストの最小値
# 計算方法
# dp[0] = 0
# dp[x] = min(dp[x - 1] + |h[x] - h[x - 1]|, dp[x - 2] + |h[x] - h[x - 2]|)
# 埋める順番
# xが小さい順
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [0] * (N + 5)
for i in range(1, N):
if i == 1:
dp[i] = dp[i - 1] + abs(H[i] - H[i - 1])
else:
dp[i] = min(dp[i - 1] + abs(H[i] - H[i - 1]), dp[i - 2] + abs(H[i] - H[i - 2]))
print((dp[N - 1]))
| false | 65.217391 |
[
"+# 埋める配列",
"+# dp[x] = 足場0からスタートして足場xに着地するときに足場xまでに払うコストの最小値",
"+# 計算方法",
"+# dp[0] = 0",
"+# dp[x] = min(dp[x - 1] + |h[x] - h[x - 1]|, dp[x - 2] + |h[x] - h[x - 2]|)",
"+# 埋める順番",
"+# xが小さい順",
"-h = list(map(int, input().split()))",
"-c = [0] * N",
"-c[1] = abs(h[1] - h[0])",
"-for i in range(2, N):",
"- c[i] = min(c[i - 2] + abs(h[i] - h[i - 2]), c[i - 1] + abs(h[i] - h[i - 1]))",
"-print((c[-1]))",
"+H = list(map(int, input().split()))",
"+dp = [0] * (N + 5)",
"+for i in range(1, N):",
"+ if i == 1:",
"+ dp[i] = dp[i - 1] + abs(H[i] - H[i - 1])",
"+ else:",
"+ dp[i] = min(dp[i - 1] + abs(H[i] - H[i - 1]), dp[i - 2] + abs(H[i] - H[i - 2]))",
"+print((dp[N - 1]))"
] | false | 0.034979 | 0.034405 | 1.016687 |
[
"s641070986",
"s894616703"
] |
u727717182
|
p02707
|
python
|
s506669859
|
s136816290
| 154 | 130 | 91,260 | 109,804 |
Accepted
|
Accepted
| 15.58 |
from sys import stdin
def main():
input = stdin.readline
N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0] * N
for i in range(N-1):
ans[A[i]-1] += 1
for i in ans:
print(i)
if __name__ == "__main__":
main()
|
from sys import stdin
def main():
input = stdin.readline
N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0] * N
for i in range(N-1):
ans[A[i]-1] += 1
print(('\n'.join(map(str,ans))))
if __name__ == "__main__":
main()
| 19 | 17 | 290 | 287 |
from sys import stdin
def main():
input = stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * N
for i in range(N - 1):
ans[A[i] - 1] += 1
for i in ans:
print(i)
if __name__ == "__main__":
main()
|
from sys import stdin
def main():
input = stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * N
for i in range(N - 1):
ans[A[i] - 1] += 1
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main()
| false | 10.526316 |
[
"- for i in ans:",
"- print(i)",
"+ print((\"\\n\".join(map(str, ans))))"
] | false | 0.040484 | 0.040252 | 1.005761 |
[
"s506669859",
"s136816290"
] |
u816631826
|
p02690
|
python
|
s930964703
|
s122139027
| 301 | 41 | 8,900 | 9,052 |
Accepted
|
Accepted
| 86.38 |
x = int(eval(input()))
for a in range(-500, 500):
for b in range(-500, 500):
if a**5 - b**5 == x:
print((a, b))
break
else:
continue
break
|
import math
x = int(eval(input()))
for i in range(1, 121):
for j in range(-120, 121):
if i**5 - j**5 == x:
print((i, j))
quit(0)
| 9 | 8 | 191 | 165 |
x = int(eval(input()))
for a in range(-500, 500):
for b in range(-500, 500):
if a**5 - b**5 == x:
print((a, b))
break
else:
continue
break
|
import math
x = int(eval(input()))
for i in range(1, 121):
for j in range(-120, 121):
if i**5 - j**5 == x:
print((i, j))
quit(0)
| false | 11.111111 |
[
"+import math",
"+",
"-for a in range(-500, 500):",
"- for b in range(-500, 500):",
"- if a**5 - b**5 == x:",
"- print((a, b))",
"- break",
"- else:",
"- continue",
"- break",
"+for i in range(1, 121):",
"+ for j in range(-120, 121):",
"+ if i**5 - j**5 == x:",
"+ print((i, j))",
"+ quit(0)"
] | false | 0.430572 | 0.044389 | 9.699888 |
[
"s930964703",
"s122139027"
] |
u456353530
|
p02982
|
python
|
s762547785
|
s227538897
| 167 | 17 | 38,384 | 3,064 |
Accepted
|
Accepted
| 89.82 |
N, D = list(map(int, input().split()))
X = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
for j in range(i + 1, N):
d = 0
for k in range(D):
d += pow(X[i][k] - X[j][k], 2)
if pow(int(d ** 0.5), 2) == d:
ans += 1
print(ans)
|
N, D = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
def nasu(x, y):
t = 0
for i in range(D):
t += (X[x][i] - X[y][i]) ** 2
t **= (1 / 2)
if t == int(t):
return 1
else:
return 0
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
ans += nasu(i, j)
print(ans)
| 13 | 20 | 294 | 356 |
N, D = list(map(int, input().split()))
X = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
for j in range(i + 1, N):
d = 0
for k in range(D):
d += pow(X[i][k] - X[j][k], 2)
if pow(int(d**0.5), 2) == d:
ans += 1
print(ans)
|
N, D = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
def nasu(x, y):
t = 0
for i in range(D):
t += (X[x][i] - X[y][i]) ** 2
t **= 1 / 2
if t == int(t):
return 1
else:
return 0
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
ans += nasu(i, j)
print(ans)
| false | 35 |
[
"-X = [list(map(int, input().split())) for i in range(N)]",
"+X = [list(map(int, input().split())) for _ in range(N)]",
"+",
"+",
"+def nasu(x, y):",
"+ t = 0",
"+ for i in range(D):",
"+ t += (X[x][i] - X[y][i]) ** 2",
"+ t **= 1 / 2",
"+ if t == int(t):",
"+ return 1",
"+ else:",
"+ return 0",
"+",
"+",
"-for i in range(N):",
"+for i in range(N - 1):",
"- d = 0",
"- for k in range(D):",
"- d += pow(X[i][k] - X[j][k], 2)",
"- if pow(int(d**0.5), 2) == d:",
"- ans += 1",
"+ ans += nasu(i, j)"
] | false | 0.040251 | 0.040221 | 1.000749 |
[
"s762547785",
"s227538897"
] |
u836737505
|
p03319
|
python
|
s100569241
|
s928685936
| 51 | 40 | 13,812 | 13,812 |
Accepted
|
Accepted
| 21.57 |
import math
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
for i in range(n):
if n/(k+((k-1)*i)) <= 1:
print((i+1))
break
|
import math
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
print((math.ceil(((n-k)/(k-1)))+1))
| 7 | 4 | 165 | 115 |
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
if n / (k + ((k - 1) * i)) <= 1:
print((i + 1))
break
|
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print((math.ceil(((n - k) / (k - 1))) + 1))
| false | 42.857143 |
[
"-for i in range(n):",
"- if n / (k + ((k - 1) * i)) <= 1:",
"- print((i + 1))",
"- break",
"+print((math.ceil(((n - k) / (k - 1))) + 1))"
] | false | 0.090774 | 0.049486 | 1.834327 |
[
"s100569241",
"s928685936"
] |
u531599639
|
p02684
|
python
|
s238706876
|
s546194772
| 194 | 169 | 32,304 | 32,300 |
Accepted
|
Accepted
| 12.89 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
visited = [-1]*(N+1)
path = []
at = 1
count = 0
while True:
if visited[at] != -1:
loop = count-visited[at]
if K < count: # (K-visited[at])//loopが1以上であることを保証
print((path[K])) # 条件 K < visited[at]なら、(K-visited[at])//loopが0以上であることを保証。どっちでもよさそう。
else:
print((path[(K-visited[at])%loop+visited[at]]))
break
visited[at] = count
count += 1
path.append(at)
at = A[at-1]
|
n, k = list(map(int, input().split()))
q = list(map(int, input().split()))
v = [-1]*(n+1)
p = []
a = 1
c = 0
while 1:
if v[a] != -1:
l = c-v[a]
if k < c:
print((p[k]))
else:
print((p[(k-v[a])%l+v[a]]))
break
v[a] = c
c += 1
p.append(a)
a = q[a-1]
| 18 | 18 | 519 | 329 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
visited = [-1] * (N + 1)
path = []
at = 1
count = 0
while True:
if visited[at] != -1:
loop = count - visited[at]
if K < count: # (K-visited[at])//loopが1以上であることを保証
print(
(path[K])
) # 条件 K < visited[at]なら、(K-visited[at])//loopが0以上であることを保証。どっちでもよさそう。
else:
print((path[(K - visited[at]) % loop + visited[at]]))
break
visited[at] = count
count += 1
path.append(at)
at = A[at - 1]
|
n, k = list(map(int, input().split()))
q = list(map(int, input().split()))
v = [-1] * (n + 1)
p = []
a = 1
c = 0
while 1:
if v[a] != -1:
l = c - v[a]
if k < c:
print((p[k]))
else:
print((p[(k - v[a]) % l + v[a]]))
break
v[a] = c
c += 1
p.append(a)
a = q[a - 1]
| false | 0 |
[
"-N, K = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"-visited = [-1] * (N + 1)",
"-path = []",
"-at = 1",
"-count = 0",
"-while True:",
"- if visited[at] != -1:",
"- loop = count - visited[at]",
"- if K < count: # (K-visited[at])//loopが1以上であることを保証",
"- print(",
"- (path[K])",
"- ) # 条件 K < visited[at]なら、(K-visited[at])//loopが0以上であることを保証。どっちでもよさそう。",
"+n, k = list(map(int, input().split()))",
"+q = list(map(int, input().split()))",
"+v = [-1] * (n + 1)",
"+p = []",
"+a = 1",
"+c = 0",
"+while 1:",
"+ if v[a] != -1:",
"+ l = c - v[a]",
"+ if k < c:",
"+ print((p[k]))",
"- print((path[(K - visited[at]) % loop + visited[at]]))",
"+ print((p[(k - v[a]) % l + v[a]]))",
"- visited[at] = count",
"- count += 1",
"- path.append(at)",
"- at = A[at - 1]",
"+ v[a] = c",
"+ c += 1",
"+ p.append(a)",
"+ a = q[a - 1]"
] | false | 0.047209 | 0.04691 | 1.006392 |
[
"s238706876",
"s546194772"
] |
u318427318
|
p02675
|
python
|
s880657280
|
s588329084
| 22 | 19 | 9,124 | 9,108 |
Accepted
|
Accepted
| 13.64 |
#-*-coding:utf-8-*-
def main():
N = eval(input())
if len(N)==3:
if int(N[2])==3:
print("bon")
elif int(N[2])==0 or int(N[2])==1 or int(N[2])==6 or int(N[2])==8:
print("pon")
else:
print("hon")
elif len(N)==2:
if int(N[1])==3:
print("bon")
elif int(N[1])==0 or int(N[1])==1 or int(N[1])==6 or int(N[1])==8:
print("pon")
else:
print("hon")
else:
if int(N[0])==3:
print("bon")
elif int(N[0])==0 or int(N[0])==1 or int(N[0])==6 or int(N[0])==8:
print("pon")
else:
print("hon")
if __name__=="__main__":
main()
|
#-*-coding:utf-8-*-
def main2():
N = int(eval(input()))
modN=N%10
print(("pphbhhphph"[modN]+"on"))
if __name__=="__main__":
main2()
| 28 | 9 | 727 | 149 |
# -*-coding:utf-8-*-
def main():
N = eval(input())
if len(N) == 3:
if int(N[2]) == 3:
print("bon")
elif int(N[2]) == 0 or int(N[2]) == 1 or int(N[2]) == 6 or int(N[2]) == 8:
print("pon")
else:
print("hon")
elif len(N) == 2:
if int(N[1]) == 3:
print("bon")
elif int(N[1]) == 0 or int(N[1]) == 1 or int(N[1]) == 6 or int(N[1]) == 8:
print("pon")
else:
print("hon")
else:
if int(N[0]) == 3:
print("bon")
elif int(N[0]) == 0 or int(N[0]) == 1 or int(N[0]) == 6 or int(N[0]) == 8:
print("pon")
else:
print("hon")
if __name__ == "__main__":
main()
|
# -*-coding:utf-8-*-
def main2():
N = int(eval(input()))
modN = N % 10
print(("pphbhhphph"[modN] + "on"))
if __name__ == "__main__":
main2()
| false | 67.857143 |
[
"-def main():",
"- N = eval(input())",
"- if len(N) == 3:",
"- if int(N[2]) == 3:",
"- print(\"bon\")",
"- elif int(N[2]) == 0 or int(N[2]) == 1 or int(N[2]) == 6 or int(N[2]) == 8:",
"- print(\"pon\")",
"- else:",
"- print(\"hon\")",
"- elif len(N) == 2:",
"- if int(N[1]) == 3:",
"- print(\"bon\")",
"- elif int(N[1]) == 0 or int(N[1]) == 1 or int(N[1]) == 6 or int(N[1]) == 8:",
"- print(\"pon\")",
"- else:",
"- print(\"hon\")",
"- else:",
"- if int(N[0]) == 3:",
"- print(\"bon\")",
"- elif int(N[0]) == 0 or int(N[0]) == 1 or int(N[0]) == 6 or int(N[0]) == 8:",
"- print(\"pon\")",
"- else:",
"- print(\"hon\")",
"+def main2():",
"+ N = int(eval(input()))",
"+ modN = N % 10",
"+ print((\"pphbhhphph\"[modN] + \"on\"))",
"- main()",
"+ main2()"
] | false | 0.038739 | 0.043969 | 0.881054 |
[
"s880657280",
"s588329084"
] |
u125205981
|
p03331
|
python
|
s129141563
|
s833744714
| 167 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 89.82 |
def main():
N = int(eval(input()))
total = float('inf')
for a in range(1, N):
b = N - a
n = 0
while a > 0:
n += a % 10
a //= 10
while b > 0:
n += b % 10
b //= 10
total = min(total, n)
print(total)
main()
|
def main():
N = int(eval(input()))
ans = 0
while N > 0:
ans += N % 10
N //= 10
if ans == 1:
print((10))
else:
print(ans)
main()
| 18 | 13 | 322 | 186 |
def main():
N = int(eval(input()))
total = float("inf")
for a in range(1, N):
b = N - a
n = 0
while a > 0:
n += a % 10
a //= 10
while b > 0:
n += b % 10
b //= 10
total = min(total, n)
print(total)
main()
|
def main():
N = int(eval(input()))
ans = 0
while N > 0:
ans += N % 10
N //= 10
if ans == 1:
print((10))
else:
print(ans)
main()
| false | 27.777778 |
[
"- total = float(\"inf\")",
"- for a in range(1, N):",
"- b = N - a",
"- n = 0",
"- while a > 0:",
"- n += a % 10",
"- a //= 10",
"- while b > 0:",
"- n += b % 10",
"- b //= 10",
"- total = min(total, n)",
"- print(total)",
"+ ans = 0",
"+ while N > 0:",
"+ ans += N % 10",
"+ N //= 10",
"+ if ans == 1:",
"+ print((10))",
"+ else:",
"+ print(ans)"
] | false | 0.244583 | 0.04349 | 5.623883 |
[
"s129141563",
"s833744714"
] |
u107639613
|
p03612
|
python
|
s808359337
|
s791026481
| 99 | 86 | 85,484 | 85,540 |
Accepted
|
Accepted
| 13.13 |
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
same = deque()
for i in range(1, N + 1):
if i == P[i]: same.append(i)
if not same:
print((0))
return
ans = 0
x = same.popleft()
if not same:
print((1))
return
while same:
if same[0] - x == 1:
same.popleft()
ans += 1
if same:
x = same.popleft()
if not same:
ans += 1
break
else:
ans += 1
x = same.popleft()
if not same:
ans += 1
break
print(ans)
if __name__ == "__main__":
main()
|
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
ans = 0
for i in range(1, N):
if i == P[i]:
P[i + 1] = P[i]
ans += 1
if N == P[N]: ans += 1
print(ans)
if __name__ == "__main__":
main()
| 40 | 20 | 856 | 382 |
import sys
from collections import deque
def input():
return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
same = deque()
for i in range(1, N + 1):
if i == P[i]:
same.append(i)
if not same:
print((0))
return
ans = 0
x = same.popleft()
if not same:
print((1))
return
while same:
if same[0] - x == 1:
same.popleft()
ans += 1
if same:
x = same.popleft()
if not same:
ans += 1
break
else:
ans += 1
x = same.popleft()
if not same:
ans += 1
break
print(ans)
if __name__ == "__main__":
main()
|
import sys
from collections import deque
def input():
return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
P = [0] + list(map(int, input().split()))
ans = 0
for i in range(1, N):
if i == P[i]:
P[i + 1] = P[i]
ans += 1
if N == P[N]:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 50 |
[
"- same = deque()",
"- for i in range(1, N + 1):",
"+ ans = 0",
"+ for i in range(1, N):",
"- same.append(i)",
"- if not same:",
"- print((0))",
"- return",
"- ans = 0",
"- x = same.popleft()",
"- if not same:",
"- print((1))",
"- return",
"- while same:",
"- if same[0] - x == 1:",
"- same.popleft()",
"+ P[i + 1] = P[i]",
"- if same:",
"- x = same.popleft()",
"- if not same:",
"- ans += 1",
"- break",
"- else:",
"- ans += 1",
"- x = same.popleft()",
"- if not same:",
"- ans += 1",
"- break",
"+ if N == P[N]:",
"+ ans += 1"
] | false | 0.146098 | 0.043364 | 3.369088 |
[
"s808359337",
"s791026481"
] |
u887207211
|
p03607
|
python
|
s590537212
|
s376935890
| 222 | 202 | 15,068 | 16,636 |
Accepted
|
Accepted
| 9.01 |
N = int(eval(input()))
memo = {}
for i in range(N):
A = int(eval(input()))
if(A in memo):
memo[A] += 1
else:
memo[A] = 1
cnt = 0
for k, v in list(memo.items()):
cnt += v%2
print(cnt)
|
from collections import Counter
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
a = Counter(A)
res = 0
for v in list(a.values()):
if(v%2 == 1):
res += 1
print(res)
| 12 | 11 | 191 | 181 |
N = int(eval(input()))
memo = {}
for i in range(N):
A = int(eval(input()))
if A in memo:
memo[A] += 1
else:
memo[A] = 1
cnt = 0
for k, v in list(memo.items()):
cnt += v % 2
print(cnt)
|
from collections import Counter
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
a = Counter(A)
res = 0
for v in list(a.values()):
if v % 2 == 1:
res += 1
print(res)
| false | 8.333333 |
[
"+from collections import Counter",
"+",
"-memo = {}",
"-for i in range(N):",
"- A = int(eval(input()))",
"- if A in memo:",
"- memo[A] += 1",
"- else:",
"- memo[A] = 1",
"-cnt = 0",
"-for k, v in list(memo.items()):",
"- cnt += v % 2",
"-print(cnt)",
"+A = [int(eval(input())) for _ in range(N)]",
"+a = Counter(A)",
"+res = 0",
"+for v in list(a.values()):",
"+ if v % 2 == 1:",
"+ res += 1",
"+print(res)"
] | false | 0.042108 | 0.039031 | 1.078826 |
[
"s590537212",
"s376935890"
] |
u411923565
|
p03013
|
python
|
s989516382
|
s252591190
| 174 | 153 | 90,656 | 18,980 |
Accepted
|
Accepted
| 12.07 |
# C - Typical Stairs
N,M = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(M)]
A = set(A)
# dp[i]: i 段目まで来た時の移動方法の総数
dp = [0]*(N+1)
# 初期条件
dp[0] = 1
for v in range(1,N+1):
if v in A:
continue
dp[v] = (dp[v] + dp[v-1])%(1000000007)
if v > 1:
dp[v] = (dp[v] + dp[v-2])%(1000000007)
print((dp[N]))
|
#96 C - Typical Stairs
N,M = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(M)]
A = set(A)
MOD = 1000000007
dp = [0]*(N+1)
dp[0] = 1
for i in range(1,N+1):
if i in A:
continue
dp[i] = (dp[i-1] + dp[i-2])%MOD
print((dp[N]))
| 18 | 13 | 350 | 260 |
# C - Typical Stairs
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
A = set(A)
# dp[i]: i 段目まで来た時の移動方法の総数
dp = [0] * (N + 1)
# 初期条件
dp[0] = 1
for v in range(1, N + 1):
if v in A:
continue
dp[v] = (dp[v] + dp[v - 1]) % (1000000007)
if v > 1:
dp[v] = (dp[v] + dp[v - 2]) % (1000000007)
print((dp[N]))
|
# 96 C - Typical Stairs
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
A = set(A)
MOD = 1000000007
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[N]))
| false | 27.777778 |
[
"-# C - Typical Stairs",
"+# 96 C - Typical Stairs",
"-# dp[i]: i 段目まで来た時の移動方法の総数",
"+MOD = 1000000007",
"-# 初期条件",
"-for v in range(1, N + 1):",
"- if v in A:",
"+for i in range(1, N + 1):",
"+ if i in A:",
"- dp[v] = (dp[v] + dp[v - 1]) % (1000000007)",
"- if v > 1:",
"- dp[v] = (dp[v] + dp[v - 2]) % (1000000007)",
"+ dp[i] = (dp[i - 1] + dp[i - 2]) % MOD"
] | false | 0.043951 | 0.007898 | 5.565087 |
[
"s989516382",
"s252591190"
] |
u600402037
|
p02793
|
python
|
s314136990
|
s976343616
| 1,982 | 1,740 | 4,208 | 272,076 |
Accepted
|
Accepted
| 12.21 |
import sys
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def gcd(a, b):
while b:
a, b = b, a%b
return a
#リストの最小公倍数
def lcm(a):
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
def main():
N = ir()
A = lr()
A.sort()
if N == 1:
print((1))
exit()
MOD = 10 ** 9 + 7
l = []
first = A[0]
l = [x//gcd(x, first) for x in A[1:]]
x = lcm(l) #B[0]
answer = x%MOD
for i in range(1, N):
answer += first * x // A[i]
print((answer%MOD))
if __name__ == '__main__':
main()
|
import sys
import numpy as np
from fractions import gcd
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
MOD = 10 ** 9 + 7
lcm = 1
for a in A:
lcm *= a // gcd(lcm, a)
A = np.array(A)
B = lcm // A
answer = np.sum(B) % MOD
print(answer)
| 39 | 19 | 732 | 337 |
import sys
sys.setrecursionlimit(10**7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
# リストの最小公倍数
def lcm(a):
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
def main():
N = ir()
A = lr()
A.sort()
if N == 1:
print((1))
exit()
MOD = 10**9 + 7
l = []
first = A[0]
l = [x // gcd(x, first) for x in A[1:]]
x = lcm(l) # B[0]
answer = x % MOD
for i in range(1, N):
answer += first * x // A[i]
print((answer % MOD))
if __name__ == "__main__":
main()
|
import sys
import numpy as np
from fractions import gcd
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
MOD = 10**9 + 7
lcm = 1
for a in A:
lcm *= a // gcd(lcm, a)
A = np.array(A)
B = lcm // A
answer = np.sum(B) % MOD
print(answer)
| false | 51.282051 |
[
"+import numpy as np",
"+from fractions import gcd",
"-sys.setrecursionlimit(10**7)",
"-",
"-",
"-def gcd(a, b):",
"- while b:",
"- a, b = b, a % b",
"- return a",
"-",
"-",
"-# リストの最小公倍数",
"-def lcm(a):",
"- x = a[0]",
"- for i in range(1, len(a)):",
"- x = (x * a[i]) // gcd(x, a[i])",
"- return x",
"-",
"-",
"-def main():",
"- N = ir()",
"- A = lr()",
"- A.sort()",
"- if N == 1:",
"- print((1))",
"- exit()",
"- MOD = 10**9 + 7",
"- l = []",
"- first = A[0]",
"- l = [x // gcd(x, first) for x in A[1:]]",
"- x = lcm(l) # B[0]",
"- answer = x % MOD",
"- for i in range(1, N):",
"- answer += first * x // A[i]",
"- print((answer % MOD))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+N = ir()",
"+A = lr()",
"+MOD = 10**9 + 7",
"+lcm = 1",
"+for a in A:",
"+ lcm *= a // gcd(lcm, a)",
"+A = np.array(A)",
"+B = lcm // A",
"+answer = np.sum(B) % MOD",
"+print(answer)"
] | false | 0.044226 | 0.339786 | 0.130159 |
[
"s314136990",
"s976343616"
] |
u886274153
|
p03998
|
python
|
s163563675
|
s546965707
| 20 | 18 | 3,064 | 2,940 |
Accepted
|
Accepted
| 10 |
sa, sb, sc = [eval(input()) for i in range(3)]
sa = [str(i) for i in sa]
sb = [str(i) for i in sb]
sc = [str(i) for i in sc]
play = len(sa+sb+sc)
next = eval("s" + sa.pop(0))
for i in range(1, play+1):
if next == []:
last = next
break
next = eval("s" + next.pop(0))
if last is sa:
print("A")
elif last is sb:
print("B")
else:
print("C")
|
s = {"a": list(eval(input())), "b": list(eval(input())), "c": list(eval(input()))}
next = "a"
while s[next] != []:
next = s[next].pop(0)
print((next.upper()))
| 20 | 7 | 393 | 151 |
sa, sb, sc = [eval(input()) for i in range(3)]
sa = [str(i) for i in sa]
sb = [str(i) for i in sb]
sc = [str(i) for i in sc]
play = len(sa + sb + sc)
next = eval("s" + sa.pop(0))
for i in range(1, play + 1):
if next == []:
last = next
break
next = eval("s" + next.pop(0))
if last is sa:
print("A")
elif last is sb:
print("B")
else:
print("C")
|
s = {"a": list(eval(input())), "b": list(eval(input())), "c": list(eval(input()))}
next = "a"
while s[next] != []:
next = s[next].pop(0)
print((next.upper()))
| false | 65 |
[
"-sa, sb, sc = [eval(input()) for i in range(3)]",
"-sa = [str(i) for i in sa]",
"-sb = [str(i) for i in sb]",
"-sc = [str(i) for i in sc]",
"-play = len(sa + sb + sc)",
"-next = eval(\"s\" + sa.pop(0))",
"-for i in range(1, play + 1):",
"- if next == []:",
"- last = next",
"- break",
"- next = eval(\"s\" + next.pop(0))",
"-if last is sa:",
"- print(\"A\")",
"-elif last is sb:",
"- print(\"B\")",
"-else:",
"- print(\"C\")",
"+s = {\"a\": list(eval(input())), \"b\": list(eval(input())), \"c\": list(eval(input()))}",
"+next = \"a\"",
"+while s[next] != []:",
"+ next = s[next].pop(0)",
"+print((next.upper()))"
] | false | 0.297349 | 0.053422 | 5.56604 |
[
"s163563675",
"s546965707"
] |
u968166680
|
p03713
|
python
|
s817858490
|
s283447786
| 338 | 88 | 80,612 | 73,692 |
Accepted
|
Accepted
| 73.96 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def core(h, H, W):
if W % 2 == 0:
return abs(h * W - (H - h) * (W // 2))
else:
a, b, c = h * W, (H - h) * (W // 2), (H - h) * (W // 2 + 1)
return max(abs(a - b), abs(b - c), abs(c - a))
def solve(H, W):
ans = abs((H // 3) * W - ((H + 2) // 3) * W)
if H % 3 == 0:
ans = min(ans, core(H // 3, H, W))
else:
ans = min(ans, core(H // 3, H, W), core(H // 3 + 1, H, W))
return ans
def main():
H, W = list(map(int, readline().split()))
ans = min(solve(H, W), solve(W, H))
print(ans)
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def solve(H, W):
ans = INF
for h in range(H + 1):
a, b, c = h * W, (H - h) // 2 * W, (H - h + 1) // 2 * W
ans1 = max(abs(a - b), abs(b - c), abs(c - a))
a, b, c = h * W, (H - h) * (W // 2), (H - h) * ((W + 1) // 2)
ans2 = max(abs(a - b), abs(b - c), abs(c - a))
if ans > min(ans1, ans2):
ans = min(ans1, ans2)
return ans
def main():
H, W = list(map(int, readline().split()))
ans = min(solve(H, W), solve(W, H))
print(ans)
return
if __name__ == '__main__':
main()
| 40 | 34 | 803 | 741 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def core(h, H, W):
if W % 2 == 0:
return abs(h * W - (H - h) * (W // 2))
else:
a, b, c = h * W, (H - h) * (W // 2), (H - h) * (W // 2 + 1)
return max(abs(a - b), abs(b - c), abs(c - a))
def solve(H, W):
ans = abs((H // 3) * W - ((H + 2) // 3) * W)
if H % 3 == 0:
ans = min(ans, core(H // 3, H, W))
else:
ans = min(ans, core(H // 3, H, W), core(H // 3 + 1, H, W))
return ans
def main():
H, W = list(map(int, readline().split()))
ans = min(solve(H, W), solve(W, H))
print(ans)
return
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def solve(H, W):
ans = INF
for h in range(H + 1):
a, b, c = h * W, (H - h) // 2 * W, (H - h + 1) // 2 * W
ans1 = max(abs(a - b), abs(b - c), abs(c - a))
a, b, c = h * W, (H - h) * (W // 2), (H - h) * ((W + 1) // 2)
ans2 = max(abs(a - b), abs(b - c), abs(c - a))
if ans > min(ans1, ans2):
ans = min(ans1, ans2)
return ans
def main():
H, W = list(map(int, readline().split()))
ans = min(solve(H, W), solve(W, H))
print(ans)
return
if __name__ == "__main__":
main()
| false | 15 |
[
"-def core(h, H, W):",
"- if W % 2 == 0:",
"- return abs(h * W - (H - h) * (W // 2))",
"- else:",
"- a, b, c = h * W, (H - h) * (W // 2), (H - h) * (W // 2 + 1)",
"- return max(abs(a - b), abs(b - c), abs(c - a))",
"-",
"-",
"- ans = abs((H // 3) * W - ((H + 2) // 3) * W)",
"- if H % 3 == 0:",
"- ans = min(ans, core(H // 3, H, W))",
"- else:",
"- ans = min(ans, core(H // 3, H, W), core(H // 3 + 1, H, W))",
"+ ans = INF",
"+ for h in range(H + 1):",
"+ a, b, c = h * W, (H - h) // 2 * W, (H - h + 1) // 2 * W",
"+ ans1 = max(abs(a - b), abs(b - c), abs(c - a))",
"+ a, b, c = h * W, (H - h) * (W // 2), (H - h) * ((W + 1) // 2)",
"+ ans2 = max(abs(a - b), abs(b - c), abs(c - a))",
"+ if ans > min(ans1, ans2):",
"+ ans = min(ans1, ans2)"
] | false | 0.042308 | 0.575574 | 0.073506 |
[
"s817858490",
"s283447786"
] |
u847467233
|
p02443
|
python
|
s372490354
|
s990044041
| 50 | 20 | 5,816 | 5,804 |
Accepted
|
Accepted
| 60 |
# AOJ ITP2_4_A: Reverse
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
for i in range(q):
b, e = list(map(int, input().split()))
s = a[b:e]
s = s[::-1]
for j in range(e-b): a[b+j] = s[j]
print((*a))
|
# AOJ ITP2_4_A: Reverse
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
for i in range(q):
b, e = list(map(int, input().split()))
a = a[:b] + a[b:e][::-1] + a[e:]
print((*a))
| 12 | 10 | 256 | 227 |
# AOJ ITP2_4_A: Reverse
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
for i in range(q):
b, e = list(map(int, input().split()))
s = a[b:e]
s = s[::-1]
for j in range(e - b):
a[b + j] = s[j]
print((*a))
|
# AOJ ITP2_4_A: Reverse
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
for i in range(q):
b, e = list(map(int, input().split()))
a = a[:b] + a[b:e][::-1] + a[e:]
print((*a))
| false | 16.666667 |
[
"- s = a[b:e]",
"- s = s[::-1]",
"- for j in range(e - b):",
"- a[b + j] = s[j]",
"+ a = a[:b] + a[b:e][::-1] + a[e:]"
] | false | 0.101066 | 0.046919 | 2.15408 |
[
"s372490354",
"s990044041"
] |
u263830634
|
p04045
|
python
|
s345445532
|
s947545685
| 103 | 89 | 3,060 | 3,060 |
Accepted
|
Accepted
| 13.59 |
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
#使うことのできるリストの作成
d = []
for i in range(10):
if i in D:
pass
else:
d += [i]
def check(i): #数値iがdのリストだけで書くことができるかを判定
I = str(i) #文字列に変換
# print (I)
n = len(I) #桁数の取得
for j in range(n): #全桁で確認
# print (I[j])
if int(I[j]) in d: #大丈夫ならスルー
pass
else: #一つでも不適ならFalseを返す
return False
return True
# print (check(2000))
for i in range(N, 10**5 + 1): #小さい数から全探索
if i >= N: #大きさを確認
if check(i): #dの中だけで書けるかをチェック
print (i) #書くことができるなら出力して終了
exit()
|
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
#使うことのできるリストの作成
d = []
for i in range(10):
if i in D:
pass
else:
d += [i]
def check(i): #数値iがdのリストだけで書くことができるかを判定
I = str(i) #文字列に変換
# print (I)
n = len(I) #桁数の取得
for j in range(n): #全桁で確認
# print (I[j])
if int(I[j]) in d: #大丈夫ならスルー
pass
else: #一つでも不適ならFalseを返す
return False
return True
# print (check(2000))
for i in range(N, 10**5 + 1): #小さい数から全探索
if check(i): #dの中だけで書けるかをチェック
print (i) #書くことができるなら出力して終了
exit()
| 30 | 29 | 664 | 628 |
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
# 使うことのできるリストの作成
d = []
for i in range(10):
if i in D:
pass
else:
d += [i]
def check(i): # 数値iがdのリストだけで書くことができるかを判定
I = str(i) # 文字列に変換
# print (I)
n = len(I) # 桁数の取得
for j in range(n): # 全桁で確認
# print (I[j])
if int(I[j]) in d: # 大丈夫ならスルー
pass
else: # 一つでも不適ならFalseを返す
return False
return True
# print (check(2000))
for i in range(N, 10**5 + 1): # 小さい数から全探索
if i >= N: # 大きさを確認
if check(i): # dの中だけで書けるかをチェック
print(i) # 書くことができるなら出力して終了
exit()
|
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
# 使うことのできるリストの作成
d = []
for i in range(10):
if i in D:
pass
else:
d += [i]
def check(i): # 数値iがdのリストだけで書くことができるかを判定
I = str(i) # 文字列に変換
# print (I)
n = len(I) # 桁数の取得
for j in range(n): # 全桁で確認
# print (I[j])
if int(I[j]) in d: # 大丈夫ならスルー
pass
else: # 一つでも不適ならFalseを返す
return False
return True
# print (check(2000))
for i in range(N, 10**5 + 1): # 小さい数から全探索
if check(i): # dの中だけで書けるかをチェック
print(i) # 書くことができるなら出力して終了
exit()
| false | 3.333333 |
[
"- if i >= N: # 大きさを確認",
"- if check(i): # dの中だけで書けるかをチェック",
"- print(i) # 書くことができるなら出力して終了",
"- exit()",
"+ if check(i): # dの中だけで書けるかをチェック",
"+ print(i) # 書くことができるなら出力して終了",
"+ exit()"
] | false | 0.043868 | 0.040672 | 1.078583 |
[
"s345445532",
"s947545685"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.