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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u393253137 | p03578 | python | s152714845 | s739388220 | 300 | 261 | 59,492 | 59,108 | Accepted | Accepted | 13 | from collections import Counter
def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
C = Counter(D)
for t in T:
if t not in C or C[t] == 0:
print('NO')
return
else:
C[t] -= 1
print('YES')
main() | def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
if dic.get(d):
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print('NO')
return
else:
dic[t] -= 1
print('YES')
main() | 15 | 22 | 341 | 467 | from collections import Counter
def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
C = Counter(D)
for t in T:
if t not in C or C[t] == 0:
print("NO")
return
else:
C[t] -= 1
print("YES")
main()
| def main():
n = int(eval(input()))
D = list(map(int, input().split()))
m = int(eval(input()))
T = list(map(int, input().split()))
dic = dict()
# 辞書はDだけで十分.Counterより速い.
for d in D:
if dic.get(d):
dic[d] += 1
else:
dic[d] = 1
for t in T:
if t not in dic or dic[t] == 0:
print("NO")
return
else:
dic[t] -= 1
print("YES")
main()
| false | 31.818182 | [
"-from collections import Counter",
"-",
"-",
"- C = Counter(D)",
"+ dic = dict()",
"+ # 辞書はDだけで十分.Counterより速い.",
"+ for d in D:",
"+ if dic.get(d):",
"+ dic[d] += 1",
"+ else:",
"+ dic[d] = 1",
"- if t not in C or C[t] == 0:",
"+ ... | false | 0.065853 | 0.122327 | 0.538339 | [
"s152714845",
"s739388220"
] |
u620084012 | p03993 | python | s291130396 | s528804543 | 265 | 74 | 71,728 | 14,008 | Accepted | Accepted | 72.08 | N = int(eval(input()))
a = list(map(int,input().split()))
l = [set([]) for k in range(N+1)]
ans = 0
for k in range(N):
if k+1 in l[a[k]]:
ans += 1
l[k+1].add(a[k])
print(ans)
| N = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
for k in range(N):
if a[a[k]-1] == k+1:
ans += 1
print((ans//2))
| 9 | 7 | 193 | 141 | N = int(eval(input()))
a = list(map(int, input().split()))
l = [set([]) for k in range(N + 1)]
ans = 0
for k in range(N):
if k + 1 in l[a[k]]:
ans += 1
l[k + 1].add(a[k])
print(ans)
| N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for k in range(N):
if a[a[k] - 1] == k + 1:
ans += 1
print((ans // 2))
| false | 22.222222 | [
"-l = [set([]) for k in range(N + 1)]",
"- if k + 1 in l[a[k]]:",
"+ if a[a[k] - 1] == k + 1:",
"- l[k + 1].add(a[k])",
"-print(ans)",
"+print((ans // 2))"
] | false | 0.084274 | 0.05193 | 1.622853 | [
"s291130396",
"s528804543"
] |
u905582793 | p03645 | python | s785496673 | s319799476 | 763 | 455 | 37,688 | 37,688 | Accepted | Accepted | 40.37 | n,m=list(map(int,input().split()))
tr=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
if a!=1 and b!=n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2,n):
if len(tr[i])==2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
tr=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
if a!=1 and b!=n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2,n):
if len(tr[i])==2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| 14 | 16 | 290 | 328 | n, m = list(map(int, input().split()))
tr = [[] for i in range(n + 1)]
for i in range(m):
a, b = list(map(int, input().split()))
if a != 1 and b != n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2, n):
if len(tr[i]) == 2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
tr = [[] for i in range(n + 1)]
for i in range(m):
a, b = list(map(int, input().split()))
if a != 1 and b != n:
continue
tr[a].append(b)
tr[b].append(a)
for i in range(2, n):
if len(tr[i]) == 2:
print("POSSIBLE")
break
else:
print("IMPOSSIBLE")
| false | 12.5 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.070366 | 0.038321 | 1.836201 | [
"s785496673",
"s319799476"
] |
u256678932 | p02385 | python | s571376672 | s752433299 | 30 | 20 | 7,896 | 5,580 | Accepted | Accepted | 33.33 | def main():
labels1 = list(map(int, input().split(' ')))
labels2 = list(map(int, input().split(' ')))
dice1 = Dice(labels1)
dice2 = Dice(labels2)
print(('Yes' if equals(dice1, dice2) else 'No'))
def equals(d1, d2):
for i in range(4):
for j in range(4):
if d1.equals(d2):
return True
d2.toE()
d2.toN()
d2.toE().toN()
for i in range(2):
for j in range(4):
if d1.equals(d2):
return True
d2.toE()
d2.toN().toN()
return False
class Dice:
def __init__(self, labels):
self.labels = labels
self._tb = (0, 5)
self._fb = (1, 4)
self._lr = (3, 2)
def toN(self):
tb = self._tb
self._tb = self._fb
self._fb = tuple(reversed(tb))
return self
def toS(self):
tb = self._tb
self._tb = tuple(reversed(self._fb))
self._fb = tb
return self
def toW(self):
tb = self._tb
self._tb = tuple(reversed(self._lr))
self._lr = tb
return self
def toE(self):
tb = self._tb
self._tb = self._lr
self._lr = tuple(reversed(tb))
return self
def get_top(self):
return self.labels[self._tb[0]]
def get_bottom(self):
return self.labels[self._tb[1]]
def get_front(self):
return self.labels[self._fb[0]]
def get_back(self):
return self.labels[self._fb[1]]
def get_left(self):
return self.labels[self._lr[0]]
def get_right(self):
return self.labels[self._lr[1]]
top = property(get_top)
bottom = property(get_bottom)
front = property(get_front)
back = property(get_back)
left = property(get_left)
right = property(get_right)
def equals(self, other):
if not (self.top == other.top and self.bottom == other.bottom):
return False
if not (self.front == other.front and self.back == other.back):
return False
if not (self.left == other.left and self.right == other.right):
return False
return True
def __str__(self):
return str([self.top, self.front, self.right, self.left, self.back, self.bottom])
if __name__ == '__main__':
main() | class Dice:
def __init__(self, nums):
self.top = nums[0]
self.front = nums[1]
self.right = nums[2]
self.left = nums[3]
self.back = nums[4]
self.bottom = nums[5]
def toN(self):
tmp = self.top
self.top = self.front
self.front = self.bottom
self.bottom = self.back
self.back = tmp
def toS(self):
tmp = self.top
self.top = self.back
self.back = self.bottom
self.bottom = self.front
self.front = tmp
def toE(self):
tmp = self.top
self.top = self.left
self.left = self.bottom
self.bottom = self.right
self.right = tmp
def toW(self):
tmp = self.top
self.top = self.right
self.right = self.bottom
self.bottom = self.left
self.left = tmp
def moveTo(self, ds):
for d in ds:
if d == 'N':
self.toN()
if d == 'S':
self.toS()
if d == 'E':
self.toE()
if d == 'W':
self.toW()
def getTop(self):
return self.top
def getBottom(self):
return self.bottom
def getFront(self):
return self.front
def getBack(self):
return self.back
def getLeft(self):
return self.left
def getRight(self):
return self.right
def __eq__(self, other):
if self.top != other.top:
return False
if self.bottom != other.bottom:
return False
if self.front != other.front:
return False
if self.back != other.back:
return False
if self.left != other.left:
return False
if self.right != other.right:
return False
return True
def moveTo(dice, top, front):
if dice.getFront() != front:
if dice.getTop() == front:
dice.moveTo("S")
elif dice.getBottom() == front:
dice.moveTo("N")
elif dice.getBack() == front:
dice.moveTo("NN")
elif dice.getLeft() == front:
dice.moveTo("ES")
elif dice.getRight() == front:
dice.moveTo("WS")
if dice.getTop() != top:
if dice.getBottom() == top:
dice.moveTo("EE")
elif dice.getLeft() == top:
dice.moveTo("E")
elif dice.getRight() == top:
dice.moveTo("W")
return dice
def equalDice(dice1, dice2):
dice2 = moveTo(dice2, dice1.getTop(), dice1.getFront())
return dice1 == dice2
def main():
dice1 = Dice(input().split())
dice2 = Dice(input().split())
if equalDice(dice1, dice2):
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| 106 | 121 | 2,436 | 2,953 | def main():
labels1 = list(map(int, input().split(" ")))
labels2 = list(map(int, input().split(" ")))
dice1 = Dice(labels1)
dice2 = Dice(labels2)
print(("Yes" if equals(dice1, dice2) else "No"))
def equals(d1, d2):
for i in range(4):
for j in range(4):
if d1.equals(d2):
return True
d2.toE()
d2.toN()
d2.toE().toN()
for i in range(2):
for j in range(4):
if d1.equals(d2):
return True
d2.toE()
d2.toN().toN()
return False
class Dice:
def __init__(self, labels):
self.labels = labels
self._tb = (0, 5)
self._fb = (1, 4)
self._lr = (3, 2)
def toN(self):
tb = self._tb
self._tb = self._fb
self._fb = tuple(reversed(tb))
return self
def toS(self):
tb = self._tb
self._tb = tuple(reversed(self._fb))
self._fb = tb
return self
def toW(self):
tb = self._tb
self._tb = tuple(reversed(self._lr))
self._lr = tb
return self
def toE(self):
tb = self._tb
self._tb = self._lr
self._lr = tuple(reversed(tb))
return self
def get_top(self):
return self.labels[self._tb[0]]
def get_bottom(self):
return self.labels[self._tb[1]]
def get_front(self):
return self.labels[self._fb[0]]
def get_back(self):
return self.labels[self._fb[1]]
def get_left(self):
return self.labels[self._lr[0]]
def get_right(self):
return self.labels[self._lr[1]]
top = property(get_top)
bottom = property(get_bottom)
front = property(get_front)
back = property(get_back)
left = property(get_left)
right = property(get_right)
def equals(self, other):
if not (self.top == other.top and self.bottom == other.bottom):
return False
if not (self.front == other.front and self.back == other.back):
return False
if not (self.left == other.left and self.right == other.right):
return False
return True
def __str__(self):
return str(
[self.top, self.front, self.right, self.left, self.back, self.bottom]
)
if __name__ == "__main__":
main()
| class Dice:
def __init__(self, nums):
self.top = nums[0]
self.front = nums[1]
self.right = nums[2]
self.left = nums[3]
self.back = nums[4]
self.bottom = nums[5]
def toN(self):
tmp = self.top
self.top = self.front
self.front = self.bottom
self.bottom = self.back
self.back = tmp
def toS(self):
tmp = self.top
self.top = self.back
self.back = self.bottom
self.bottom = self.front
self.front = tmp
def toE(self):
tmp = self.top
self.top = self.left
self.left = self.bottom
self.bottom = self.right
self.right = tmp
def toW(self):
tmp = self.top
self.top = self.right
self.right = self.bottom
self.bottom = self.left
self.left = tmp
def moveTo(self, ds):
for d in ds:
if d == "N":
self.toN()
if d == "S":
self.toS()
if d == "E":
self.toE()
if d == "W":
self.toW()
def getTop(self):
return self.top
def getBottom(self):
return self.bottom
def getFront(self):
return self.front
def getBack(self):
return self.back
def getLeft(self):
return self.left
def getRight(self):
return self.right
def __eq__(self, other):
if self.top != other.top:
return False
if self.bottom != other.bottom:
return False
if self.front != other.front:
return False
if self.back != other.back:
return False
if self.left != other.left:
return False
if self.right != other.right:
return False
return True
def moveTo(dice, top, front):
if dice.getFront() != front:
if dice.getTop() == front:
dice.moveTo("S")
elif dice.getBottom() == front:
dice.moveTo("N")
elif dice.getBack() == front:
dice.moveTo("NN")
elif dice.getLeft() == front:
dice.moveTo("ES")
elif dice.getRight() == front:
dice.moveTo("WS")
if dice.getTop() != top:
if dice.getBottom() == top:
dice.moveTo("EE")
elif dice.getLeft() == top:
dice.moveTo("E")
elif dice.getRight() == top:
dice.moveTo("W")
return dice
def equalDice(dice1, dice2):
dice2 = moveTo(dice2, dice1.getTop(), dice1.getFront())
return dice1 == dice2
def main():
dice1 = Dice(input().split())
dice2 = Dice(input().split())
if equalDice(dice1, dice2):
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| false | 12.396694 | [
"-def main():",
"- labels1 = list(map(int, input().split(\" \")))",
"- labels2 = list(map(int, input().split(\" \")))",
"- dice1 = Dice(labels1)",
"- dice2 = Dice(labels2)",
"- print((\"Yes\" if equals(dice1, dice2) else \"No\"))",
"-",
"-",
"-def equals(d1, d2):",
"- for i in ra... | false | 0.03842 | 0.037926 | 1.01302 | [
"s571376672",
"s752433299"
] |
u620868411 | p03716 | python | s495681916 | s355726525 | 497 | 412 | 37,212 | 38,148 | Accepted | Accepted | 17.1 | # -*- coding: utf-8 -*-
from heapq import heappush,heappushpop,heapify
n = int(eval(input()))
a = [int(x) for x in input().split()]
q = []
s = 0
for i in range(n):
heappush(q, a[i])
s += a[i]
left = [s]
for k in range(n):
x = heappushpop(q, a[n+k])
s = s - x + a[n+k]
left.append(s)
q = []
s = 0
for i in range(n):
heappush(q, -1*a[3*n-1-i])
s += a[3*n-1-i]
right = [0 for _ in range(n+1)]
right[n] = s
for k in range(n):
x = heappushpop(q, -1*a[2*n-1-k])
s = s - (-1*x) + a[2*n-1-k]
right[n-1-k] = s
m = None
for k in range(n+1):
if m is None:
m = left[k] - right[k]
else:
m = max(m, left[k]-right[k])
print(m)
| # -*- coding: utf-8 -*-
import heapq
n = int(eval(input()))
al = list(map(int, input().split()))
q = al[:n]
heapq.heapify(q)
s = sum(al[:n])
ll = [s]
for i in range(n,2*n):
a = al[i]
s += a
a = heapq.heappushpop(q, a)
s -= a
ll.append(s)
s = 0
q = []
heapq.heapify(q)
for i in range(2*n, 3*n):
s -= al[i]
heapq.heappush(q, -al[i])
rl = [-s]
for i in range(2*n-1,n-1,-1):
a = al[i]
s += -a
a = heapq.heappushpop(q, -a)
s -= a
rl.append(-s)
rl.reverse()
res = ll[0]-rl[0]
for i in range(1,n+1):
res = max(res, ll[i]-rl[i])
print(res)
| 37 | 38 | 711 | 621 | # -*- coding: utf-8 -*-
from heapq import heappush, heappushpop, heapify
n = int(eval(input()))
a = [int(x) for x in input().split()]
q = []
s = 0
for i in range(n):
heappush(q, a[i])
s += a[i]
left = [s]
for k in range(n):
x = heappushpop(q, a[n + k])
s = s - x + a[n + k]
left.append(s)
q = []
s = 0
for i in range(n):
heappush(q, -1 * a[3 * n - 1 - i])
s += a[3 * n - 1 - i]
right = [0 for _ in range(n + 1)]
right[n] = s
for k in range(n):
x = heappushpop(q, -1 * a[2 * n - 1 - k])
s = s - (-1 * x) + a[2 * n - 1 - k]
right[n - 1 - k] = s
m = None
for k in range(n + 1):
if m is None:
m = left[k] - right[k]
else:
m = max(m, left[k] - right[k])
print(m)
| # -*- coding: utf-8 -*-
import heapq
n = int(eval(input()))
al = list(map(int, input().split()))
q = al[:n]
heapq.heapify(q)
s = sum(al[:n])
ll = [s]
for i in range(n, 2 * n):
a = al[i]
s += a
a = heapq.heappushpop(q, a)
s -= a
ll.append(s)
s = 0
q = []
heapq.heapify(q)
for i in range(2 * n, 3 * n):
s -= al[i]
heapq.heappush(q, -al[i])
rl = [-s]
for i in range(2 * n - 1, n - 1, -1):
a = al[i]
s += -a
a = heapq.heappushpop(q, -a)
s -= a
rl.append(-s)
rl.reverse()
res = ll[0] - rl[0]
for i in range(1, n + 1):
res = max(res, ll[i] - rl[i])
print(res)
| false | 2.631579 | [
"-from heapq import heappush, heappushpop, heapify",
"+import heapq",
"-a = [int(x) for x in input().split()]",
"+al = list(map(int, input().split()))",
"+q = al[:n]",
"+heapq.heapify(q)",
"+s = sum(al[:n])",
"+ll = [s]",
"+for i in range(n, 2 * n):",
"+ a = al[i]",
"+ s += a",
"+ a =... | false | 0.044961 | 0.043671 | 1.029535 | [
"s495681916",
"s355726525"
] |
u597374218 | p03150 | python | s305077675 | s384630870 | 22 | 19 | 3,188 | 3,188 | Accepted | Accepted | 13.64 | import re
s=eval(input())
if re.match("^keyence.*",s) or re.match(".*keyence$",s) or re.match("^k.*eyence$",s) or re.match("^ke.*yence$",s) or re.match("^key.*ence$",s) or re.match("^keye.*nce$",s) or re.match("^keyen.*ce$",s)or re.match("^keyenc.*e$",s) or re.match("^keyence$",s) :
print("YES")
else:print("NO") | import re
s=eval(input())
if re.match(".*keyence$",s) or re.match("^k.*eyence$",s) or re.match("^ke.*yence$",s) or re.match("^key.*ence$",s) or re.match("^keye.*nce$",s) or re.match("^keyen.*ce$",s)or re.match("^keyenc.*e$",s):
print("YES")
else:print("NO") | 5 | 5 | 316 | 260 | import re
s = eval(input())
if (
re.match("^keyence.*", s)
or re.match(".*keyence$", s)
or re.match("^k.*eyence$", s)
or re.match("^ke.*yence$", s)
or re.match("^key.*ence$", s)
or re.match("^keye.*nce$", s)
or re.match("^keyen.*ce$", s)
or re.match("^keyenc.*e$", s)
or re.match("^keyence$", s)
):
print("YES")
else:
print("NO")
| import re
s = eval(input())
if (
re.match(".*keyence$", s)
or re.match("^k.*eyence$", s)
or re.match("^ke.*yence$", s)
or re.match("^key.*ence$", s)
or re.match("^keye.*nce$", s)
or re.match("^keyen.*ce$", s)
or re.match("^keyenc.*e$", s)
):
print("YES")
else:
print("NO")
| false | 0 | [
"- re.match(\"^keyence.*\", s)",
"- or re.match(\".*keyence$\", s)",
"+ re.match(\".*keyence$\", s)",
"- or re.match(\"^keyence$\", s)"
] | false | 0.096471 | 0.049206 | 1.960565 | [
"s305077675",
"s384630870"
] |
u826785572 | p03408 | python | s070076839 | s015551022 | 29 | 18 | 3,700 | 3,060 | Accepted | Accepted | 37.93 | from collections import Counter
n = int(eval(input()))
s = Counter([eval(input()) for _ in range(n)])
m = int(eval(input()))
t = Counter([eval(input()) for _ in range(m)])
ans = 0
key = ''
for i in list(s.keys()):
ans = max((s[i]-t[i]), ans)
print(ans)
| n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
ans = 0
for i in s:
a = s.count(i)
b = t.count(i)
ans = max(a-b, ans)
print(ans)
| 14 | 14 | 244 | 208 | from collections import Counter
n = int(eval(input()))
s = Counter([eval(input()) for _ in range(n)])
m = int(eval(input()))
t = Counter([eval(input()) for _ in range(m)])
ans = 0
key = ""
for i in list(s.keys()):
ans = max((s[i] - t[i]), ans)
print(ans)
| n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
ans = 0
for i in s:
a = s.count(i)
b = t.count(i)
ans = max(a - b, ans)
print(ans)
| false | 0 | [
"-from collections import Counter",
"-",
"-s = Counter([eval(input()) for _ in range(n)])",
"+s = [eval(input()) for _ in range(n)]",
"-t = Counter([eval(input()) for _ in range(m)])",
"+t = [eval(input()) for _ in range(m)]",
"-key = \"\"",
"-for i in list(s.keys()):",
"- ans = max((s[i] - t[i])... | false | 0.03901 | 0.038594 | 1.010779 | [
"s070076839",
"s015551022"
] |
u287132915 | p03127 | python | s411405420 | s743051699 | 335 | 109 | 88,428 | 87,484 | Accepted | Accepted | 67.46 | import fractions
from functools import reduce
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
n = int(eval(input()))
a = list(map(int, input().split()))
print((gcd(*a))) | n = int(eval(input()))
a = list(map(int, input().split()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
print((gcd(*a))) | 13 | 13 | 255 | 240 | import fractions
from functools import reduce
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
n = int(eval(input()))
a = list(map(int, input().split()))
print((gcd(*a)))
| n = int(eval(input()))
a = list(map(int, input().split()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
print((gcd(*a)))
| false | 0 | [
"-import fractions",
"+n = int(eval(input()))",
"+a = list(map(int, input().split()))",
"+import math",
"- return reduce(fractions.gcd, numbers)",
"+ return reduce(math.gcd, numbers)",
"- return reduce(fractions.gcd, numbers)",
"+ return reduce(math.gcd, numbers)",
"-n = int(eval(input()... | false | 0.055412 | 0.03752 | 1.476848 | [
"s411405420",
"s743051699"
] |
u794544096 | p03042 | python | s866986099 | s658661656 | 88 | 64 | 61,080 | 61,824 | Accepted | Accepted | 27.27 | s = eval(input())
s1 = s[:2]
s2 = s[2:]
if 1 <=int(s1) <= 12:
if 1 <= int(s2) <= 12:
print('AMBIGUOUS')
else:
print('MMYY')
else:
if 1 <= int(s2) <= 12:
print('YYMM')
else:
print('NA') | s = eval(input())
if 1 <= int(s[:2]) <= 12:
if 1 <= int(s[2:]) <= 12:
print('AMBIGUOUS')
else:
print('MMYY')
else:
if 1 <= int(s[2:]) <= 12:
print('YYMM')
else:
print('NA') | 14 | 12 | 240 | 226 | s = eval(input())
s1 = s[:2]
s2 = s[2:]
if 1 <= int(s1) <= 12:
if 1 <= int(s2) <= 12:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if 1 <= int(s2) <= 12:
print("YYMM")
else:
print("NA")
| s = eval(input())
if 1 <= int(s[:2]) <= 12:
if 1 <= int(s[2:]) <= 12:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if 1 <= int(s[2:]) <= 12:
print("YYMM")
else:
print("NA")
| false | 14.285714 | [
"-s1 = s[:2]",
"-s2 = s[2:]",
"-if 1 <= int(s1) <= 12:",
"- if 1 <= int(s2) <= 12:",
"+if 1 <= int(s[:2]) <= 12:",
"+ if 1 <= int(s[2:]) <= 12:",
"- if 1 <= int(s2) <= 12:",
"+ if 1 <= int(s[2:]) <= 12:"
] | false | 0.036675 | 0.041676 | 0.879994 | [
"s866986099",
"s658661656"
] |
u086056891 | p02572 | python | s450112027 | s842496969 | 173 | 121 | 31,368 | 31,576 | Accepted | Accepted | 30.06 | from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
s = list(accumulate(a))
MOD = 10 ** 9 + 7
ans = 0
for i in range(n):
ans += a[i] * (s[n - 1] - s[i])
ans %= MOD
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
MOD = 10 ** 9 + 7
s = sum(a) ** 2
t = sum(ai ** 2 for ai in a)
ans = (s - t) * pow(2, MOD - 2, MOD)
ans %= MOD
print(ans) | 13 | 9 | 231 | 183 | from itertools import accumulate
n = int(eval(input()))
a = list(map(int, input().split()))
s = list(accumulate(a))
MOD = 10**9 + 7
ans = 0
for i in range(n):
ans += a[i] * (s[n - 1] - s[i])
ans %= MOD
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
MOD = 10**9 + 7
s = sum(a) ** 2
t = sum(ai**2 for ai in a)
ans = (s - t) * pow(2, MOD - 2, MOD)
ans %= MOD
print(ans)
| false | 30.769231 | [
"-from itertools import accumulate",
"-",
"-s = list(accumulate(a))",
"-ans = 0",
"-for i in range(n):",
"- ans += a[i] * (s[n - 1] - s[i])",
"- ans %= MOD",
"+s = sum(a) ** 2",
"+t = sum(ai**2 for ai in a)",
"+ans = (s - t) * pow(2, MOD - 2, MOD)",
"+ans %= MOD"
] | false | 0.043169 | 0.037742 | 1.143796 | [
"s450112027",
"s842496969"
] |
u614314290 | p03329 | python | s726056256 | s330186159 | 684 | 304 | 4,596 | 3,828 | Accepted | Accepted | 55.56 | N = int(eval(input()))
l = [1] + [6 ** x for x in range(1, 7)] + [9 ** x for x in range(1, 6)]
l.sort()
INF = 10 ** 3
dp = [0] + [INF] * N
for n in range(1, N + 1):
#for f in [1, 6, 9, 6 ** 2, 9 ** 2, 6 ** 3, 9 ** 3]:
for f in l:
if 0 <= n - f:
dp[n] = min([dp[n], dp[n - f] + 1])
#print(dp)
print((dp[-1]))
| N = int(eval(input()))
l = [1] + [6 ** x for x in range(1, 7)] + [9 ** x for x in range(1, 6)]
l.sort()
INF = 10 ** 3
dp = [0] * (N + 1)
for n in range(1, N + 1):
dp[n] = min([dp[n - f] + 1 if 0 <= n - f else INF for f in l])
#print(dp)
print((dp[-1]))
| 15 | 12 | 327 | 261 | N = int(eval(input()))
l = [1] + [6**x for x in range(1, 7)] + [9**x for x in range(1, 6)]
l.sort()
INF = 10**3
dp = [0] + [INF] * N
for n in range(1, N + 1):
# for f in [1, 6, 9, 6 ** 2, 9 ** 2, 6 ** 3, 9 ** 3]:
for f in l:
if 0 <= n - f:
dp[n] = min([dp[n], dp[n - f] + 1])
# print(dp)
print((dp[-1]))
| N = int(eval(input()))
l = [1] + [6**x for x in range(1, 7)] + [9**x for x in range(1, 6)]
l.sort()
INF = 10**3
dp = [0] * (N + 1)
for n in range(1, N + 1):
dp[n] = min([dp[n - f] + 1 if 0 <= n - f else INF for f in l])
# print(dp)
print((dp[-1]))
| false | 20 | [
"-dp = [0] + [INF] * N",
"+dp = [0] * (N + 1)",
"- # for f in [1, 6, 9, 6 ** 2, 9 ** 2, 6 ** 3, 9 ** 3]:",
"- for f in l:",
"- if 0 <= n - f:",
"- dp[n] = min([dp[n], dp[n - f] + 1])",
"- # print(dp)",
"+ dp[n] = min([dp[n - f] + 1 if 0 <= n - f else INF for f in ... | false | 0.095112 | 0.093592 | 1.016235 | [
"s726056256",
"s330186159"
] |
u876438858 | p02549 | python | s573913430 | s872012555 | 1,627 | 475 | 29,640 | 109,232 | Accepted | Accepted | 70.81 | #!/usr/bin/env python3
import sys
import numpy as np
# import numba
# from numba import njit, b1, i4, i8, f8
input = sys.stdin.readline
mod = 998244353
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
# @njit((i8, i8[:]), cache=True)
def main(N, steps):
dp = np.zeros(N + 1, np.int64)
dpsum = np.zeros(N + 1, np.int64)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for l, r in steps:
li = i - r
ri = i - l
if ri < 0:
continue
li = max(li, 1)
dp[i] += dpsum[ri] - dpsum[li - 1]
dp[i] %= mod
dpsum[i] = dpsum[i - 1] + dp[i]
dpsum[i] %= mod
return dp[N]
N, K = MI()
steps = []
for _ in range(K):
l, r = MI()
steps.append((l, r))
print((main(N, steps)))
| #!/usr/bin/env python3
import sys
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
input = sys.stdin.buffer.readline
mod = 998244353
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
@njit((i8, i8[:]), cache=True)
def main(N, LR):
L, R = LR[::2], LR[1::2]
K = len(L)
dp = np.zeros(N + 1, np.int64)
dpsum = np.zeros(N + 1, np.int64)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for k in range(K):
li = i - R[k]
ri = i - L[k]
if ri < 0:
continue
li = max(li, 1)
dp[i] += dpsum[ri] - dpsum[li - 1]
dp[i] %= mod
dpsum[i] = dpsum[i - 1] + dp[i]
dpsum[i] %= mod
return dp[N]
N, K = MI()
LR = np.array(sys.stdin.buffer.read().split(), np.int64)
print((main(N, LR)))
| 49 | 47 | 888 | 916 | #!/usr/bin/env python3
import sys
import numpy as np
# import numba
# from numba import njit, b1, i4, i8, f8
input = sys.stdin.readline
mod = 998244353
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
# @njit((i8, i8[:]), cache=True)
def main(N, steps):
dp = np.zeros(N + 1, np.int64)
dpsum = np.zeros(N + 1, np.int64)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for l, r in steps:
li = i - r
ri = i - l
if ri < 0:
continue
li = max(li, 1)
dp[i] += dpsum[ri] - dpsum[li - 1]
dp[i] %= mod
dpsum[i] = dpsum[i - 1] + dp[i]
dpsum[i] %= mod
return dp[N]
N, K = MI()
steps = []
for _ in range(K):
l, r = MI()
steps.append((l, r))
print((main(N, steps)))
| #!/usr/bin/env python3
import sys
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
input = sys.stdin.buffer.readline
mod = 998244353
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
@njit((i8, i8[:]), cache=True)
def main(N, LR):
L, R = LR[::2], LR[1::2]
K = len(L)
dp = np.zeros(N + 1, np.int64)
dpsum = np.zeros(N + 1, np.int64)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for k in range(K):
li = i - R[k]
ri = i - L[k]
if ri < 0:
continue
li = max(li, 1)
dp[i] += dpsum[ri] - dpsum[li - 1]
dp[i] %= mod
dpsum[i] = dpsum[i - 1] + dp[i]
dpsum[i] %= mod
return dp[N]
N, K = MI()
LR = np.array(sys.stdin.buffer.read().split(), np.int64)
print((main(N, LR)))
| false | 4.081633 | [
"+import numba",
"+from numba import njit, b1, i4, i8, f8",
"-# import numba",
"-# from numba import njit, b1, i4, i8, f8",
"-input = sys.stdin.readline",
"+input = sys.stdin.buffer.readline",
"-# @njit((i8, i8[:]), cache=True)",
"-def main(N, steps):",
"+@njit((i8, i8[:]), cache=True)",
"+def mai... | false | 0.195461 | 0.267069 | 0.731876 | [
"s573913430",
"s872012555"
] |
u186082958 | p00991 | python | s018375266 | s361856510 | 60 | 30 | 8,164 | 7,800 | Accepted | Accepted | 50 | def func (x):
if x:
return int(x)*func(x-1)
else:
return (1)
def comb (x,y):
return func(x)//func(x-y)//func(y)
import sys
sys.setrecursionlimit(10000)
w,h,ax,ay,bx,by=list(map(int,input().split()))
dx=min(w-abs(ax-bx),abs(ax-bx))
dy=min(h-abs(ay-by),abs(ay-by))
ans=1
if dx*2==w:ans*=2
if dy*2==h:ans*=2
ans*=comb(dx+dy,dx)
print((ans%100000007)) | import sys
from math import factorial
sys.setrecursionlimit(10000)
def comb (x,y):
return factorial(x)//factorial(x-y)//factorial(y)
w,h,ax,ay,bx,by=list(map(int,input().split()))
dx=min(w-abs(ax-bx),abs(ax-bx))
dy=min(h-abs(ay-by),abs(ay-by))
ans=1
if dx*2==w:ans*=2
if dy*2==h:ans*=2
ans*=comb(dx+dy,dx)
print((ans%100000007)) | 18 | 14 | 364 | 335 | def func(x):
if x:
return int(x) * func(x - 1)
else:
return 1
def comb(x, y):
return func(x) // func(x - y) // func(y)
import sys
sys.setrecursionlimit(10000)
w, h, ax, ay, bx, by = list(map(int, input().split()))
dx = min(w - abs(ax - bx), abs(ax - bx))
dy = min(h - abs(ay - by), abs(ay - by))
ans = 1
if dx * 2 == w:
ans *= 2
if dy * 2 == h:
ans *= 2
ans *= comb(dx + dy, dx)
print((ans % 100000007))
| import sys
from math import factorial
sys.setrecursionlimit(10000)
def comb(x, y):
return factorial(x) // factorial(x - y) // factorial(y)
w, h, ax, ay, bx, by = list(map(int, input().split()))
dx = min(w - abs(ax - bx), abs(ax - bx))
dy = min(h - abs(ay - by), abs(ay - by))
ans = 1
if dx * 2 == w:
ans *= 2
if dy * 2 == h:
ans *= 2
ans *= comb(dx + dy, dx)
print((ans % 100000007))
| false | 22.222222 | [
"-def func(x):",
"- if x:",
"- return int(x) * func(x - 1)",
"- else:",
"- return 1",
"+import sys",
"+from math import factorial",
"+",
"+sys.setrecursionlimit(10000)",
"- return func(x) // func(x - y) // func(y)",
"+ return factorial(x) // factorial(x - y) // factoria... | false | 0.172373 | 0.046277 | 3.724788 | [
"s018375266",
"s361856510"
] |
u677523557 | p03081 | python | s772766110 | s457790436 | 625 | 376 | 88,232 | 17,840 | Accepted | Accepted | 39.84 | import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
S = input().rstrip()
TD = [list(map(str, input().split())) for _ in range(Q)]
l = 0
r = N
while r - l > 1:
m = (l+r)//2
right_over = False
pl = m
for t, d in TD:
if S[pl] == t:
if d == 'L':
pl -= 1
if pl == -1:
break
else:
pl += 1
if pl == N:
right_over = True
break
if right_over:
r = m
else:
l = m
right = l
l = 0
r = N
while r - l > 1:
m = (l+r)//2
left_over = False
pl = m
for t, d in TD:
if S[pl] == t:
if d == 'L':
pl -= 1
if pl == -1:
left_over = True
break
else:
pl += 1
if pl == N:
break
if left_over:
l = m
else:
r = m
left = l
print((right-left)) | import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
S = input().rstrip()
Query = []
for _ in range(Q):
Alp, LR = list(map(str, input().rstrip().split()))
Query.append((Alp, LR))
S = "a" + S + "a"
left = 1
for Alp, LR in reversed(Query):
if S[left-1] == Alp and LR == "R":
left -= 1
elif S[left] == Alp and LR == "L":
left += 1
right = 1
for Alp, LR in reversed(Query):
if S[-right] == Alp and LR == "L":
right -= 1
elif S[-1-right] == Alp and LR == "R":
right += 1
print((max(0, N+2-left-right))) | 56 | 27 | 1,079 | 594 | import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
S = input().rstrip()
TD = [list(map(str, input().split())) for _ in range(Q)]
l = 0
r = N
while r - l > 1:
m = (l + r) // 2
right_over = False
pl = m
for t, d in TD:
if S[pl] == t:
if d == "L":
pl -= 1
if pl == -1:
break
else:
pl += 1
if pl == N:
right_over = True
break
if right_over:
r = m
else:
l = m
right = l
l = 0
r = N
while r - l > 1:
m = (l + r) // 2
left_over = False
pl = m
for t, d in TD:
if S[pl] == t:
if d == "L":
pl -= 1
if pl == -1:
left_over = True
break
else:
pl += 1
if pl == N:
break
if left_over:
l = m
else:
r = m
left = l
print((right - left))
| import sys
input = sys.stdin.readline
N, Q = list(map(int, input().split()))
S = input().rstrip()
Query = []
for _ in range(Q):
Alp, LR = list(map(str, input().rstrip().split()))
Query.append((Alp, LR))
S = "a" + S + "a"
left = 1
for Alp, LR in reversed(Query):
if S[left - 1] == Alp and LR == "R":
left -= 1
elif S[left] == Alp and LR == "L":
left += 1
right = 1
for Alp, LR in reversed(Query):
if S[-right] == Alp and LR == "L":
right -= 1
elif S[-1 - right] == Alp and LR == "R":
right += 1
print((max(0, N + 2 - left - right)))
| false | 51.785714 | [
"-TD = [list(map(str, input().split())) for _ in range(Q)]",
"-l = 0",
"-r = N",
"-while r - l > 1:",
"- m = (l + r) // 2",
"- right_over = False",
"- pl = m",
"- for t, d in TD:",
"- if S[pl] == t:",
"- if d == \"L\":",
"- pl -= 1",
"- ... | false | 0.050341 | 0.038186 | 1.318309 | [
"s772766110",
"s457790436"
] |
u581187895 | p02952 | python | s375647163 | s828028596 | 57 | 47 | 2,940 | 2,940 | Accepted | Accepted | 17.54 | N = int(eval(input()))
count = 0
for i in range(1, N+1):
if len(str(i)) % 2 == 1:
count += 1
print(count) | def resolve():
N = int(input())
ans = 0
for i in range(1, N+1):
s = str(i)
if len(s)%2 == 0:
continue
ans += 1
return print(ans)
if __name__ == "__main__":
resolve()
| 7 | 12 | 116 | 233 | N = int(eval(input()))
count = 0
for i in range(1, N + 1):
if len(str(i)) % 2 == 1:
count += 1
print(count)
| def resolve():
N = int(input())
ans = 0
for i in range(1, N + 1):
s = str(i)
if len(s) % 2 == 0:
continue
ans += 1
return print(ans)
if __name__ == "__main__":
resolve()
| false | 41.666667 | [
"-N = int(eval(input()))",
"-count = 0",
"-for i in range(1, N + 1):",
"- if len(str(i)) % 2 == 1:",
"- count += 1",
"-print(count)",
"+def resolve():",
"+ N = int(input())",
"+ ans = 0",
"+ for i in range(1, N + 1):",
"+ s = str(i)",
"+ if len(s) % 2 == 0:",
... | false | 0.057015 | 0.05505 | 1.035707 | [
"s375647163",
"s828028596"
] |
u227082700 | p03576 | python | s596212434 | s825536226 | 803 | 399 | 3,064 | 9,148 | Accepted | Accepted | 50.31 | n,h=list(map(int,input().split()))
p,x,y=[],[],[]
z=float("inf")
for i in range(n):
a,b=list(map(int,input().split()))
p.append((a,b))
x.append(a)
y.append(b)
x.sort()
y.sort()
for i in range(n-1):
for j in range(i,n):
for k in range(n-1):
lx,rx,dy=x[i],x[j],y[k]
c=0
t=[]
for a,b in p:
if x[i]<=a<=x[j] and y[k]<=b:c+=1;t.append(b)
if h<=c:z=min(z,(x[j]-x[i])*(sorted(t)[h-1]-y[k]))
print(z) | n,k=list(map(int,input().split()))
x=[]
y=[]
xy=[]
for _ in range(n):
xx,yy=list(map(int,input().split()))
xy.append((xx,yy))
x.append(xx)
y.append(yy)
xx=sorted(x)
yy=sorted(y)
ans=10**20
for sxi in range(n-1):
for syi in range(n-1):
for tyi in range(1,n):
sx,sy,ty=xx[sxi],yy[syi],yy[tyi]
ax=sorted([xxx for xxx,yyy in xy if sx<=xxx and sy<=yyy<=ty])
if len(ax)<k:continue
tx=ax[k-1]
ans=min(ans,(tx-sx)*(ty-sy))
print(ans) | 20 | 21 | 451 | 477 | n, h = list(map(int, input().split()))
p, x, y = [], [], []
z = float("inf")
for i in range(n):
a, b = list(map(int, input().split()))
p.append((a, b))
x.append(a)
y.append(b)
x.sort()
y.sort()
for i in range(n - 1):
for j in range(i, n):
for k in range(n - 1):
lx, rx, dy = x[i], x[j], y[k]
c = 0
t = []
for a, b in p:
if x[i] <= a <= x[j] and y[k] <= b:
c += 1
t.append(b)
if h <= c:
z = min(z, (x[j] - x[i]) * (sorted(t)[h - 1] - y[k]))
print(z)
| n, k = list(map(int, input().split()))
x = []
y = []
xy = []
for _ in range(n):
xx, yy = list(map(int, input().split()))
xy.append((xx, yy))
x.append(xx)
y.append(yy)
xx = sorted(x)
yy = sorted(y)
ans = 10**20
for sxi in range(n - 1):
for syi in range(n - 1):
for tyi in range(1, n):
sx, sy, ty = xx[sxi], yy[syi], yy[tyi]
ax = sorted([xxx for xxx, yyy in xy if sx <= xxx and sy <= yyy <= ty])
if len(ax) < k:
continue
tx = ax[k - 1]
ans = min(ans, (tx - sx) * (ty - sy))
print(ans)
| false | 4.761905 | [
"-n, h = list(map(int, input().split()))",
"-p, x, y = [], [], []",
"-z = float(\"inf\")",
"-for i in range(n):",
"- a, b = list(map(int, input().split()))",
"- p.append((a, b))",
"- x.append(a)",
"- y.append(b)",
"-x.sort()",
"-y.sort()",
"-for i in range(n - 1):",
"- for j in ... | false | 0.055836 | 0.039398 | 1.417236 | [
"s596212434",
"s825536226"
] |
u858136677 | p03697 | python | s160191621 | s802961377 | 21 | 17 | 2,940 | 2,940 | Accepted | Accepted | 19.05 | a,b = list(map(int,input().split()))
if a + b >= 10:
print('error')
else:
print((a+b)) | a,b = list(map(int,input().split()))
if a+b < 10:
print((a+b))
else:
print('error') | 5 | 5 | 84 | 81 | a, b = list(map(int, input().split()))
if a + b >= 10:
print("error")
else:
print((a + b))
| a, b = list(map(int, input().split()))
if a + b < 10:
print((a + b))
else:
print("error")
| false | 0 | [
"-if a + b >= 10:",
"+if a + b < 10:",
"+ print((a + b))",
"+else:",
"-else:",
"- print((a + b))"
] | false | 0.129119 | 0.152387 | 0.847308 | [
"s160191621",
"s802961377"
] |
u888092736 | p02586 | python | s816235851 | s854746365 | 951 | 799 | 483,572 | 203,024 | Accepted | Accepted | 15.98 | import numpy as np
from numba import njit, i8
@njit(i8(i8, i8, i8[:, :]), cache=True)
def solve(R, C, items):
dp = np.zeros((R + 1, C + 1, 4), dtype=np.int64)
for i in range(R):
for j in range(C):
for k in range(2, -1, -1):
dp[i][j][k + 1] = max(dp[i][j][k + 1], dp[i][j][k] + items[i][j])
for k in range(4):
dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k])
dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k])
return dp[R][C - 1][0]
R, C, K, *rcv = list(map(int, open(0).read().split()))
items = np.zeros((R + 1, C + 1), dtype=np.int64)
for r, c, v in zip(*[iter(rcv)] * 3):
items[r - 1][c - 1] = v
print((solve(R, C, items)))
| import numpy as np
from numba import njit, i8
@njit(i8[:](i8[:]), cache=True)
def max_acc(li):
res = li.copy()
cur_max = res[0]
for i in range(len(li)):
if res[i] > cur_max:
cur_max = res[i]
res[i] = cur_max
return res
@njit(i8(i8, i8, i8[:, :]), cache=True)
def solve(R, C, goods):
dp = np.zeros(C + 1, dtype=np.int64)
for i in range(R):
dp[1:] += goods[i]
dp = max_acc(dp)
for _ in range(2):
dp[1:] = np.maximum(dp[:-1] + goods[i], dp[1:])
dp = max_acc(dp)
return dp[-1]
R, C, K, *rcv = list(map(int, open(0).read().split()))
goods = np.zeros((R, C), dtype=np.int64)
for r, c, v in zip(*[iter(rcv)] * 3):
goods[r - 1][c - 1] = v
print((solve(R, C, goods)))
| 22 | 32 | 743 | 796 | import numpy as np
from numba import njit, i8
@njit(i8(i8, i8, i8[:, :]), cache=True)
def solve(R, C, items):
dp = np.zeros((R + 1, C + 1, 4), dtype=np.int64)
for i in range(R):
for j in range(C):
for k in range(2, -1, -1):
dp[i][j][k + 1] = max(dp[i][j][k + 1], dp[i][j][k] + items[i][j])
for k in range(4):
dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k])
dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k])
return dp[R][C - 1][0]
R, C, K, *rcv = list(map(int, open(0).read().split()))
items = np.zeros((R + 1, C + 1), dtype=np.int64)
for r, c, v in zip(*[iter(rcv)] * 3):
items[r - 1][c - 1] = v
print((solve(R, C, items)))
| import numpy as np
from numba import njit, i8
@njit(i8[:](i8[:]), cache=True)
def max_acc(li):
res = li.copy()
cur_max = res[0]
for i in range(len(li)):
if res[i] > cur_max:
cur_max = res[i]
res[i] = cur_max
return res
@njit(i8(i8, i8, i8[:, :]), cache=True)
def solve(R, C, goods):
dp = np.zeros(C + 1, dtype=np.int64)
for i in range(R):
dp[1:] += goods[i]
dp = max_acc(dp)
for _ in range(2):
dp[1:] = np.maximum(dp[:-1] + goods[i], dp[1:])
dp = max_acc(dp)
return dp[-1]
R, C, K, *rcv = list(map(int, open(0).read().split()))
goods = np.zeros((R, C), dtype=np.int64)
for r, c, v in zip(*[iter(rcv)] * 3):
goods[r - 1][c - 1] = v
print((solve(R, C, goods)))
| false | 31.25 | [
"+@njit(i8[:](i8[:]), cache=True)",
"+def max_acc(li):",
"+ res = li.copy()",
"+ cur_max = res[0]",
"+ for i in range(len(li)):",
"+ if res[i] > cur_max:",
"+ cur_max = res[i]",
"+ res[i] = cur_max",
"+ return res",
"+",
"+",
"-def solve(R, C, items):",
"... | false | 0.385178 | 0.279091 | 1.380116 | [
"s816235851",
"s854746365"
] |
u757274384 | p02831 | python | s335848745 | s101899389 | 38 | 35 | 5,304 | 5,048 | Accepted | Accepted | 7.89 | import fractions
a,b = list(map(int, input().split()))
k = fractions.gcd(a,b)
print((a * b // k)) | from fractions import gcd
a,b = list(map(int, input().split()))
print((a*b//gcd(a,b))) | 4 | 4 | 92 | 82 | import fractions
a, b = list(map(int, input().split()))
k = fractions.gcd(a, b)
print((a * b // k))
| from fractions import gcd
a, b = list(map(int, input().split()))
print((a * b // gcd(a, b)))
| false | 0 | [
"-import fractions",
"+from fractions import gcd",
"-k = fractions.gcd(a, b)",
"-print((a * b // k))",
"+print((a * b // gcd(a, b)))"
] | false | 0.052919 | 0.120842 | 0.43792 | [
"s335848745",
"s101899389"
] |
u995861601 | p04031 | python | s659480111 | s574869164 | 198 | 23 | 38,640 | 3,060 | Accepted | Accepted | 88.38 | n = int(eval(input()))
l = list(map(int, input().split()))
mn = min(l)
mx = max(l)
ms = 10**9
ll = [0]*n
for j in range(mn, mx+1):
for i in range(n):
ll[i] = (l[i]-j)**2
s = sum(ll)
ms = min(ms, s)
print(ms) | n = int(eval(input()))
l = list(map(int, input().split()))
mn = min(l)
mx = max(l)
ms = 10**9
for j in range(mn, mx+1):
s = sum([(i-j)**2 for i in l])
ms = min(ms, s)
print(ms) | 16 | 12 | 252 | 196 | n = int(eval(input()))
l = list(map(int, input().split()))
mn = min(l)
mx = max(l)
ms = 10**9
ll = [0] * n
for j in range(mn, mx + 1):
for i in range(n):
ll[i] = (l[i] - j) ** 2
s = sum(ll)
ms = min(ms, s)
print(ms)
| n = int(eval(input()))
l = list(map(int, input().split()))
mn = min(l)
mx = max(l)
ms = 10**9
for j in range(mn, mx + 1):
s = sum([(i - j) ** 2 for i in l])
ms = min(ms, s)
print(ms)
| false | 25 | [
"-ll = [0] * n",
"- for i in range(n):",
"- ll[i] = (l[i] - j) ** 2",
"- s = sum(ll)",
"+ s = sum([(i - j) ** 2 for i in l])"
] | false | 0.033921 | 0.043513 | 0.779562 | [
"s659480111",
"s574869164"
] |
u724844363 | p02726 | python | s506364219 | s305074521 | 320 | 274 | 47,068 | 45,532 | Accepted | Accepted | 14.37 | import sys
input = sys.stdin.readline
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n+1):
for j in range(1, n+1):
if i < j:
# iとjを固定、rangeでi<jを表現
d = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(x-j)+1)
# 長さを示すところに+１
ans[d-1] += 1
print(*ans, sep="\n")
| import sys
input = sys.stdin.readline
n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n+1):
for j in range(1, n+1):
if i < j:
# iとjを固定、rangeでi<jを表現
d = min(j-i, abs(x-i)+abs(j-y)+1)
# 長さを示すところに+１
ans[d-1] += 1
print(*ans, sep="\n")
| 13 | 13 | 349 | 328 | import sys
input = sys.stdin.readline
n, x, y = map(int, input().split())
ans = [0] * (n - 1)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i < j:
# iとjを固定、rangeでi<jを表現
d = min(j - i, abs(x - i) + abs(j - y) + 1, abs(y - i) + abs(x - j) + 1)
# 長さを示すところに+１
ans[d - 1] += 1
print(*ans, sep="\n")
| import sys
input = sys.stdin.readline
n, x, y = map(int, input().split())
ans = [0] * (n - 1)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i < j:
# iとjを固定、rangeでi<jを表現
d = min(j - i, abs(x - i) + abs(j - y) + 1)
# 長さを示すところに+１
ans[d - 1] += 1
print(*ans, sep="\n")
| false | 0 | [
"- d = min(j - i, abs(x - i) + abs(j - y) + 1, abs(y - i) + abs(x - j) + 1)",
"+ d = min(j - i, abs(x - i) + abs(j - y) + 1)"
] | false | 0.042642 | 0.036012 | 1.184086 | [
"s506364219",
"s305074521"
] |
u698868214 | p02952 | python | s595487957 | s290960337 | 58 | 25 | 2,940 | 9,176 | Accepted | Accepted | 56.9 | N = int(eval(input()))
count = 0
for i in range(1,N+1):
len_i = len(str(i))
if len_i%2 == 1:
count += 1
print(count) | N = int(eval(input()))
if N <= 9:
print(N)
elif N <= 99:
print((9))
elif N <= 999:
print((9+(N-99)))
elif N <= 9999:
print((909))
elif N <= 99999:
print((909+(N-9999)))
elif N == 100000:
print((90909)) | 7 | 14 | 124 | 211 | N = int(eval(input()))
count = 0
for i in range(1, N + 1):
len_i = len(str(i))
if len_i % 2 == 1:
count += 1
print(count)
| N = int(eval(input()))
if N <= 9:
print(N)
elif N <= 99:
print((9))
elif N <= 999:
print((9 + (N - 99)))
elif N <= 9999:
print((909))
elif N <= 99999:
print((909 + (N - 9999)))
elif N == 100000:
print((90909))
| false | 50 | [
"-count = 0",
"-for i in range(1, N + 1):",
"- len_i = len(str(i))",
"- if len_i % 2 == 1:",
"- count += 1",
"-print(count)",
"+if N <= 9:",
"+ print(N)",
"+elif N <= 99:",
"+ print((9))",
"+elif N <= 999:",
"+ print((9 + (N - 99)))",
"+elif N <= 9999:",
"+ print((... | false | 0.043293 | 0.045812 | 0.945006 | [
"s595487957",
"s290960337"
] |
u879870653 | p03043 | python | s741798114 | s591864762 | 48 | 43 | 2,940 | 2,940 | Accepted | Accepted | 10.42 | N,K = list(map(int,input().split()))
ans = 0
for i in range(1,N+1) :
pr = 1/N
score = i
while score <= K-1 :
pr *= (1/2)
score *= 2
ans += pr
print(ans) | N,K = list(map(int,input().split()))
ans = 0
for i in range(1,N+1) :
pr = (1/N)
score = i
while score <= K-1 :
score *= 2
pr *= 0.5
ans += pr
print(ans)
| 14 | 15 | 203 | 206 | N, K = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
pr = 1 / N
score = i
while score <= K - 1:
pr *= 1 / 2
score *= 2
ans += pr
print(ans)
| N, K = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
pr = 1 / N
score = i
while score <= K - 1:
score *= 2
pr *= 0.5
ans += pr
print(ans)
| false | 6.666667 | [
"- pr *= 1 / 2",
"+ pr *= 0.5"
] | false | 0.108258 | 0.062873 | 1.721862 | [
"s741798114",
"s591864762"
] |
u780475861 | p03683 | python | s234771918 | s497313710 | 254 | 40 | 61,384 | 3,064 | Accepted | Accepted | 84.25 | import numpy as np
n, m = list(map(int, input().split()))
if abs(n - m) > 1:
print((0))
quit()
mod = 10 ** 9 + 7
def cumprod(L, mod=mod):
A = np.arange(L, dtype=np.int64)
A[0] = 1
Lsq = int(L**.5 + 1)
A = np.resize(A, Lsq**2).reshape(Lsq, Lsq)
for n in range(1, Lsq):
A[:, n] *= A[:, n - 1]
A[:, n] %= mod
for n in range(1, Lsq):
A[n] *= A[n - 1, -1]
A[n] %= mod
return A.ravel()[:L]
fact = cumprod(2 * 10**6 + 10, mod)
res = fact[n] * fact[m]
if n == m:
res *= 2
print((res % mod)) | n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
n, m = max(n, m), min(n, m)
if n - m > 1:
print((0))
quit()
res = 1
for i in range(1, m + 1):
res *= i
res %= mod
if n - m:
res *= res * n
else:
res *= res * 2
print((res % mod)) | 27 | 15 | 568 | 251 | import numpy as np
n, m = list(map(int, input().split()))
if abs(n - m) > 1:
print((0))
quit()
mod = 10**9 + 7
def cumprod(L, mod=mod):
A = np.arange(L, dtype=np.int64)
A[0] = 1
Lsq = int(L**0.5 + 1)
A = np.resize(A, Lsq**2).reshape(Lsq, Lsq)
for n in range(1, Lsq):
A[:, n] *= A[:, n - 1]
A[:, n] %= mod
for n in range(1, Lsq):
A[n] *= A[n - 1, -1]
A[n] %= mod
return A.ravel()[:L]
fact = cumprod(2 * 10**6 + 10, mod)
res = fact[n] * fact[m]
if n == m:
res *= 2
print((res % mod))
| n, m = list(map(int, input().split()))
mod = 10**9 + 7
n, m = max(n, m), min(n, m)
if n - m > 1:
print((0))
quit()
res = 1
for i in range(1, m + 1):
res *= i
res %= mod
if n - m:
res *= res * n
else:
res *= res * 2
print((res % mod))
| false | 44.444444 | [
"-import numpy as np",
"-",
"-if abs(n - m) > 1:",
"+mod = 10**9 + 7",
"+n, m = max(n, m), min(n, m)",
"+if n - m > 1:",
"-mod = 10**9 + 7",
"-",
"-",
"-def cumprod(L, mod=mod):",
"- A = np.arange(L, dtype=np.int64)",
"- A[0] = 1",
"- Lsq = int(L**0.5 + 1)",
"- A = np.resize(A,... | false | 0.375685 | 0.049068 | 7.656406 | [
"s234771918",
"s497313710"
] |
u928385607 | p03455 | python | s717869381 | s368962931 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | ab = eval(input())
ab = ab.split()
a = int(ab[0])
b = int(ab[1])
if a*b%2 == 0:
print('Even')
else:
print('Odd')
| a, b = list(map(int, input().split()))
if a*b%2 == 0:
print('Even')
else:
print('Odd')
| 12 | 6 | 124 | 95 | ab = eval(input())
ab = ab.split()
a = int(ab[0])
b = int(ab[1])
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| false | 50 | [
"-ab = eval(input())",
"-ab = ab.split()",
"-a = int(ab[0])",
"-b = int(ab[1])",
"+a, b = list(map(int, input().split()))"
] | false | 0.04497 | 0.045605 | 0.986091 | [
"s717869381",
"s368962931"
] |
u094191970 | p03611 | python | s840708317 | s106864676 | 165 | 128 | 14,564 | 21,032 | Accepted | Accepted | 22.42 | from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
min_v=min(a)
max_v=max(a)
c=Counter(a)
ans=0
for i in range(min_v,max_v+1):
t_ans=c[i-1]+c[i]+c[i+1]
ans=max(ans,t_ans)
print(ans) | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from collections import Counter
n=int(eval(input()))
a=lnii()
c=Counter(a)
a_max=max(a)
ans=0
for i in range(a_max+1):
t_ans=c[i-1]+c[i]+c[i+1]
ans=max(ans,t_ans)
print(ans) | 16 | 17 | 234 | 310 | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
min_v = min(a)
max_v = max(a)
c = Counter(a)
ans = 0
for i in range(min_v, max_v + 1):
t_ans = c[i - 1] + c[i] + c[i + 1]
ans = max(ans, t_ans)
print(ans)
| from sys import stdin
nii = lambda: list(map(int, stdin.readline().split()))
lnii = lambda: list(map(int, stdin.readline().split()))
from collections import Counter
n = int(eval(input()))
a = lnii()
c = Counter(a)
a_max = max(a)
ans = 0
for i in range(a_max + 1):
t_ans = c[i - 1] + c[i] + c[i + 1]
ans = max(ans, t_ans)
print(ans)
| false | 5.882353 | [
"+from sys import stdin",
"+",
"+nii = lambda: list(map(int, stdin.readline().split()))",
"+lnii = lambda: list(map(int, stdin.readline().split()))",
"-a = list(map(int, input().split()))",
"-min_v = min(a)",
"-max_v = max(a)",
"+a = lnii()",
"+a_max = max(a)",
"-for i in range(min_v, max_v + 1):"... | false | 0.071967 | 0.039168 | 1.837398 | [
"s840708317",
"s106864676"
] |
u788137651 | p03372 | python | s843633504 | s593482645 | 1,077 | 479 | 66,968 | 93,664 | Accepted | Accepted | 55.52 | import numpy as np
N, C = map(int, input().split())
XV = [list(map(int, input().split())) for i in range(N)]
V_minus_X = [XV[i][1]-(XV[i][0]-XV[i-1][0])
for i in range(1, N)] # i==0なら見ない それ以外ならXV[i-1][0]足して上げる
V_minus_X.insert(0, XV[0][1]-XV[0][0])
cum_ = np.cumsum(V_minus_X)
V_minus_X_reverse = [XV[i][1]-(XV[i+1][0]-XV[i][0])
for i in range(0, N-1)]
V_minus_X_reverse.append(XV[-1][1]-(C-XV[-1][0]))
V_minus_X_reverse.reverse()
cum_reverse = np.cumsum(V_minus_X_reverse)
m_ = []
m_reverse = []
maxim = 0
maxim_reverse = 0
maxim_where = 0
maxim_reverse_where = 0
# print("print")
for i in range(N-1):
if maxim < cum_[i]:
maxim = cum_[i]
maxim_where = XV[i][0]
if maxim_reverse < cum_reverse[i]:
maxim_reverse = cum_reverse[i]
maxim_reverse_where = C - XV[-i - 1][0]
m_.append((maxim, maxim_where))
m_reverse.append((maxim_reverse, maxim_reverse_where))
ans = 0
for i in range(N - 1):
next = m_[i][0] + m_reverse[-i - 1][0] - \
min(m_[i][1], m_reverse[-i - 1][1])
ans = max(next, ans)
print(max(ans, max(cum_), max(cum_reverse)))
| #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
N,C=MI()
XV=LLIN(N)
DP1 = [0]*(N+1)
DP2 = [0]*(N+1)
before = 0
for i,(x,v) in enumerate(XV):
DP1[i+1]=DP1[i]+v-(abs(x-before))
before = x
before = C
for i,(x,v) in enumerate(XV[::-1]):
DP2[i+1]=DP2[i]+v-(abs(x-before))
before = x
ans = max(max(DP1),max(DP2))
now = 0
DP1_ = [d-XV[i][0] for i,d in enumerate(DP1[1:])]
DP2_ = [d-(C-XV[~i][0]) for i,d in enumerate(DP2[1:])]
for i in range(N-1):
if(DP2_[i+1]<DP2_[i]):
DP2_[i+1] = DP2_[i]
if(DP1_[i+1]<DP1_[i]):
DP1_[i+1] = DP1_[i]
now1 = 0
now2 = 0
for i in range(N):
idx = N-1-i
# print(DP1[i],DP2_[idx])
# print(DP2[i],DP1_[idx])
ans = max(ans,DP1[i]+DP2_[idx])
ans = max(ans,DP2[idx]+DP1_[i])
# print(ans)
# print(DP1)
# print(DP2)
# print(DP1_)
# print(DP2_)
print(ans)
if __name__ == '__main__':
main()
| 42 | 81 | 1,179 | 2,317 | import numpy as np
N, C = map(int, input().split())
XV = [list(map(int, input().split())) for i in range(N)]
V_minus_X = [
XV[i][1] - (XV[i][0] - XV[i - 1][0]) for i in range(1, N)
] # i==0なら見ない それ以外ならXV[i-1][0]足して上げる
V_minus_X.insert(0, XV[0][1] - XV[0][0])
cum_ = np.cumsum(V_minus_X)
V_minus_X_reverse = [XV[i][1] - (XV[i + 1][0] - XV[i][0]) for i in range(0, N - 1)]
V_minus_X_reverse.append(XV[-1][1] - (C - XV[-1][0]))
V_minus_X_reverse.reverse()
cum_reverse = np.cumsum(V_minus_X_reverse)
m_ = []
m_reverse = []
maxim = 0
maxim_reverse = 0
maxim_where = 0
maxim_reverse_where = 0
# print("print")
for i in range(N - 1):
if maxim < cum_[i]:
maxim = cum_[i]
maxim_where = XV[i][0]
if maxim_reverse < cum_reverse[i]:
maxim_reverse = cum_reverse[i]
maxim_reverse_where = C - XV[-i - 1][0]
m_.append((maxim, maxim_where))
m_reverse.append((maxim_reverse, maxim_reverse_where))
ans = 0
for i in range(N - 1):
next = m_[i][0] + m_reverse[-i - 1][0] - min(m_[i][1], m_reverse[-i - 1][1])
ans = max(next, ans)
print(max(ans, max(cum_), max(cum_reverse)))
| #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import (
accumulate,
permutations,
combinations,
product,
combinations_with_replacement,
)
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a, b):
return (a + b - 1) // b
inf = float("inf")
mod = 10**9 + 7
def pprint(*A):
for a in A:
print(*a, sep="\n")
def INT_(n):
return int(n) - 1
def MI():
return map(int, input().split())
def MF():
return map(float, input().split())
def MI_():
return map(INT_, input().split())
def LI():
return list(MI())
def LI_():
return [int(x) - 1 for x in input().split()]
def LF():
return list(MF())
def LIN(n: int):
return [I() for _ in range(n)]
def LLIN(n: int):
return [LI() for _ in range(n)]
def LLIN_(n: int):
return [LI_() for _ in range(n)]
def LLI():
return [list(map(int, l.split())) for l in input()]
def I():
return int(input())
def F():
return float(input())
def ST():
return input().replace("\n", "")
def main():
N, C = MI()
XV = LLIN(N)
DP1 = [0] * (N + 1)
DP2 = [0] * (N + 1)
before = 0
for i, (x, v) in enumerate(XV):
DP1[i + 1] = DP1[i] + v - (abs(x - before))
before = x
before = C
for i, (x, v) in enumerate(XV[::-1]):
DP2[i + 1] = DP2[i] + v - (abs(x - before))
before = x
ans = max(max(DP1), max(DP2))
now = 0
DP1_ = [d - XV[i][0] for i, d in enumerate(DP1[1:])]
DP2_ = [d - (C - XV[~i][0]) for i, d in enumerate(DP2[1:])]
for i in range(N - 1):
if DP2_[i + 1] < DP2_[i]:
DP2_[i + 1] = DP2_[i]
if DP1_[i + 1] < DP1_[i]:
DP1_[i + 1] = DP1_[i]
now1 = 0
now2 = 0
for i in range(N):
idx = N - 1 - i
# print(DP1[i],DP2_[idx])
# print(DP2[i],DP1_[idx])
ans = max(ans, DP1[i] + DP2_[idx])
ans = max(ans, DP2[idx] + DP1_[i])
# print(ans)
# print(DP1)
# print(DP2)
# print(DP1_)
# print(DP2_)
print(ans)
if __name__ == "__main__":
main()
| false | 48.148148 | [
"-import numpy as np",
"+#",
"+# ⋀_⋀",
"+# (･ω･)",
"+# .／ Ｕ ∽ Ｕ＼",
"+# │＊ 合 ＊│",
"+# │＊ 格 ＊│",
"+# │＊ 祈 ＊│",
"+# │＊ 願 ＊│",
"+# │＊ ＊│",
"+# ￣",
"+#",
"+import sys",
"-N, C = map(int, input().split())",
"-XV = [list(map(int, input().split())) for i in range(N)]",
"-V_... | false | 0.082927 | 0.038128 | 2.17496 | [
"s843633504",
"s593482645"
] |
u724687935 | p03854 | python | s882020867 | s102854961 | 182 | 31 | 40,304 | 3,316 | Accepted | Accepted | 82.97 | S = eval(input())
cursor = len(S)
while cursor:
if S[cursor - 5: cursor] in ['dream', 'erase']:
cursor -= 5
continue
elif S[cursor - 6: cursor] in ['eraser']:
cursor -= 6
continue
elif S[cursor - 7: cursor] in ['dreamer']:
cursor -= 7
else:
break
if cursor == 0:
print('YES')
else:
print('NO')
| A = ['maerd', 'remaerd', 'esare', 'resare']
S = input()[::-1]
cur = 0
N = len(S)
ans = 'YES'
while cur < N:
if S[cur: cur + 7] in A:
cur += 7
elif S[cur: cur + 6] in A:
cur += 6
elif S[cur: cur + 5] in A:
cur += 5
else:
ans = 'NO'
break
print(ans)
| 20 | 17 | 382 | 321 | S = eval(input())
cursor = len(S)
while cursor:
if S[cursor - 5 : cursor] in ["dream", "erase"]:
cursor -= 5
continue
elif S[cursor - 6 : cursor] in ["eraser"]:
cursor -= 6
continue
elif S[cursor - 7 : cursor] in ["dreamer"]:
cursor -= 7
else:
break
if cursor == 0:
print("YES")
else:
print("NO")
| A = ["maerd", "remaerd", "esare", "resare"]
S = input()[::-1]
cur = 0
N = len(S)
ans = "YES"
while cur < N:
if S[cur : cur + 7] in A:
cur += 7
elif S[cur : cur + 6] in A:
cur += 6
elif S[cur : cur + 5] in A:
cur += 5
else:
ans = "NO"
break
print(ans)
| false | 15 | [
"-S = eval(input())",
"-cursor = len(S)",
"-while cursor:",
"- if S[cursor - 5 : cursor] in [\"dream\", \"erase\"]:",
"- cursor -= 5",
"- continue",
"- elif S[cursor - 6 : cursor] in [\"eraser\"]:",
"- cursor -= 6",
"- continue",
"- elif S[cursor - 7 : cursor] ... | false | 0.076661 | 0.03543 | 2.163747 | [
"s882020867",
"s102854961"
] |
u934442292 | p02624 | python | s579072451 | s493243839 | 2,846 | 2,069 | 266,300 | 189,048 | Accepted | Accepted | 27.3 | import sys
from numba import njit
input = sys.stdin.readline
@njit
def make_n_divisor_table(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
return table
def main():
N = int(eval(input()))
table = make_n_divisor_table(N)
ans = 0
for i, v in enumerate(table):
ans += i * v
print(ans)
if __name__ == "__main__":
main()
| import sys
import numba as nb
input = sys.stdin.readline
@nb.njit
def solve(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
ans = 0
for i, v in enumerate(table):
ans += i * v
return ans
def main():
N = int(eval(input()))
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
| 30 | 29 | 461 | 424 | import sys
from numba import njit
input = sys.stdin.readline
@njit
def make_n_divisor_table(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
return table
def main():
N = int(eval(input()))
table = make_n_divisor_table(N)
ans = 0
for i, v in enumerate(table):
ans += i * v
print(ans)
if __name__ == "__main__":
main()
| import sys
import numba as nb
input = sys.stdin.readline
@nb.njit
def solve(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
ans = 0
for i, v in enumerate(table):
ans += i * v
return ans
def main():
N = int(eval(input()))
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
| false | 3.333333 | [
"-from numba import njit",
"+import numba as nb",
"-@njit",
"-def make_n_divisor_table(n):",
"+@nb.njit",
"+def solve(n):",
"- return table",
"+ ans = 0",
"+ for i, v in enumerate(table):",
"+ ans += i * v",
"+ return ans",
"- table = make_n_divisor_table(N)",
"- ans... | false | 0.035549 | 0.057714 | 0.615961 | [
"s579072451",
"s493243839"
] |
u493491792 | p03470 | python | s420586144 | s052171409 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | N=int(eval(input()))
d=[eval(input()) for i in range(N)]
print((len(set(d)))) | n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
print((len(set(a))))
| 3 | 4 | 65 | 80 | N = int(eval(input()))
d = [eval(input()) for i in range(N)]
print((len(set(d))))
| n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
print((len(set(a))))
| false | 25 | [
"-N = int(eval(input()))",
"-d = [eval(input()) for i in range(N)]",
"-print((len(set(d))))",
"+n = int(eval(input()))",
"+a = [int(eval(input())) for i in range(n)]",
"+print((len(set(a))))"
] | false | 0.007261 | 0.043436 | 0.167158 | [
"s420586144",
"s052171409"
] |
u480138356 | p03659 | python | s114325428 | s843477622 | 264 | 161 | 28,664 | 23,800 | Accepted | Accepted | 39.02 | N = int(eval(input()))
a= list(map(int, input().split()))
left = [0] * N
right = [0] * N
left[0] = a[0]
right[-1] = a[-1]
for i in range(1, N):
left[i] = a[i] + left[i-1]
for i in range(N-2, -1, -1):
right[i] = a[i] + right[i+1]
# print(left)
# print(right)
ans = abs(left[0] - right[1])
for i in range(1, N-1):
ans = min(ans, abs(left[i] - right[i+1]))
print(ans)
| import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
left = [0] * N
left[0] = a[0]
for i in range(1, N):
left[i] = left[i-1] + a[i]
# print(left)
ans = abs(left[-1] - 2 * left[0])
for i in range(1, N-1):
ans = min(ans, abs(left[-1] - 2 * left[i]))
print(ans)
if __name__ == "__main__":
main() | 19 | 19 | 392 | 419 | N = int(eval(input()))
a = list(map(int, input().split()))
left = [0] * N
right = [0] * N
left[0] = a[0]
right[-1] = a[-1]
for i in range(1, N):
left[i] = a[i] + left[i - 1]
for i in range(N - 2, -1, -1):
right[i] = a[i] + right[i + 1]
# print(left)
# print(right)
ans = abs(left[0] - right[1])
for i in range(1, N - 1):
ans = min(ans, abs(left[i] - right[i + 1]))
print(ans)
| import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
left = [0] * N
left[0] = a[0]
for i in range(1, N):
left[i] = left[i - 1] + a[i]
# print(left)
ans = abs(left[-1] - 2 * left[0])
for i in range(1, N - 1):
ans = min(ans, abs(left[-1] - 2 * left[i]))
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"-N = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-left = [0] * N",
"-right = [0] * N",
"-left[0] = a[0]",
"-right[-1] = a[-1]",
"-for i in range(1, N):",
"- left[i] = a[i] + left[i - 1]",
"-for i in range(N - 2, -1, -1):",
"- right[i] = a[i] + right[i + 1]",
"-# print(le... | false | 0.041529 | 0.085972 | 0.483051 | [
"s114325428",
"s843477622"
] |
u972591645 | p02572 | python | s393431338 | s473785772 | 289 | 141 | 104,932 | 31,536 | Accepted | Accepted | 51.21 | n = int(eval(input()))
a = list(map(int, input().split()))
b = 10**9+7
s = sum(a)
ans = 0
for i in range(n-1):
s -= a[i]
ans += a[i]*(s%b)
ans %= b
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
b = 10**9+7
ans = 0
for i in a:
s -= i
ans += i*(s%b)
ans %= b
print(ans) | 11 | 11 | 175 | 154 | n = int(eval(input()))
a = list(map(int, input().split()))
b = 10**9 + 7
s = sum(a)
ans = 0
for i in range(n - 1):
s -= a[i]
ans += a[i] * (s % b)
ans %= b
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
b = 10**9 + 7
ans = 0
for i in a:
s -= i
ans += i * (s % b)
ans %= b
print(ans)
| false | 0 | [
"+s = sum(a)",
"-s = sum(a)",
"-for i in range(n - 1):",
"- s -= a[i]",
"- ans += a[i] * (s % b)",
"+for i in a:",
"+ s -= i",
"+ ans += i * (s % b)"
] | false | 0.125466 | 0.194785 | 0.644128 | [
"s393431338",
"s473785772"
] |
u775681539 | p02803 | python | s066018411 | s657572700 | 580 | 379 | 3,316 | 3,316 | Accepted | Accepted | 34.66 | #python3
from collections import deque
INF = int(1e20)
di = [1, 0, -1, 0]
dj = [0, 1, 0, -1]
def main():
h, w = list(map(int, input().split()))
maze = [eval(input()) for i in range(h)]
ans = 0
for si in range(h):
for sj in range(w):
if maze[si][sj] == '#':
continue
dist = [[INF for i in range(w)] for j in range(h)]
q = deque()
def update(i, j, x):
if dist[i][j] != INF:
return None
dist[i][j] = x
q.append((i,j))
update(si, sj, 0)
while len(q) != 0:
i, j = q.popleft()
for dir in range(4):
ni = i+di[dir]
nj = j+dj[dir]
if (ni<0)|(ni>=h)|(nj<0)|(nj>=w):
continue
if maze[ni][nj] == '#':
continue
update(ni, nj, dist[i][j]+1)
for i in range(h):
for j in range(w):
if dist[i][j] == INF:
continue
ans = max(ans, dist[i][j])
print(ans)
main() | #python3
from collections import deque
INF = int(1e9)
d = [(1, 0), (-1, 0), (0, 1), (0, -1)]
def main():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
ans = -1
for si in range(h):
for sj in range(w):
if maze[si][sj] == '#':
continue
dist = [[INF for _ in range(w)] for _ in range(h)]
Q = deque()
Q.append((si, sj))
dist[si][sj] = 0
while len(Q) > 0:
pi, pj = Q.popleft()
for di, dj in d:
x = pi + di
y = pj + dj
if (x < 0) | (y < 0) | (x >= h) | (y >= w):
continue
if maze[x][y] == '#':
continue
if dist[x][y] != INF:
continue
Q.append((x, y))
dist[x][y] = dist[pi][pj] + 1
for i in range(h):
for j in range(w):
if dist[i][j] == INF:
continue
ans = max(ans, dist[i][j])
print(ans)
main() | 46 | 44 | 1,257 | 1,257 | # python3
from collections import deque
INF = int(1e20)
di = [1, 0, -1, 0]
dj = [0, 1, 0, -1]
def main():
h, w = list(map(int, input().split()))
maze = [eval(input()) for i in range(h)]
ans = 0
for si in range(h):
for sj in range(w):
if maze[si][sj] == "#":
continue
dist = [[INF for i in range(w)] for j in range(h)]
q = deque()
def update(i, j, x):
if dist[i][j] != INF:
return None
dist[i][j] = x
q.append((i, j))
update(si, sj, 0)
while len(q) != 0:
i, j = q.popleft()
for dir in range(4):
ni = i + di[dir]
nj = j + dj[dir]
if (ni < 0) | (ni >= h) | (nj < 0) | (nj >= w):
continue
if maze[ni][nj] == "#":
continue
update(ni, nj, dist[i][j] + 1)
for i in range(h):
for j in range(w):
if dist[i][j] == INF:
continue
ans = max(ans, dist[i][j])
print(ans)
main()
| # python3
from collections import deque
INF = int(1e9)
d = [(1, 0), (-1, 0), (0, 1), (0, -1)]
def main():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
ans = -1
for si in range(h):
for sj in range(w):
if maze[si][sj] == "#":
continue
dist = [[INF for _ in range(w)] for _ in range(h)]
Q = deque()
Q.append((si, sj))
dist[si][sj] = 0
while len(Q) > 0:
pi, pj = Q.popleft()
for di, dj in d:
x = pi + di
y = pj + dj
if (x < 0) | (y < 0) | (x >= h) | (y >= w):
continue
if maze[x][y] == "#":
continue
if dist[x][y] != INF:
continue
Q.append((x, y))
dist[x][y] = dist[pi][pj] + 1
for i in range(h):
for j in range(w):
if dist[i][j] == INF:
continue
ans = max(ans, dist[i][j])
print(ans)
main()
| false | 4.347826 | [
"-INF = int(1e20)",
"-di = [1, 0, -1, 0]",
"-dj = [0, 1, 0, -1]",
"+INF = int(1e9)",
"+d = [(1, 0), (-1, 0), (0, 1), (0, -1)]",
"- maze = [eval(input()) for i in range(h)]",
"- ans = 0",
"+ maze = [eval(input()) for _ in range(h)]",
"+ ans = -1",
"- dist = [[INF for i in ran... | false | 0.038238 | 0.036907 | 1.036077 | [
"s066018411",
"s657572700"
] |
u270681687 | p03449 | python | s184087680 | s550444761 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | n = int(eval(input()))
a1 = [int(i) for i in input().split()]
a2 = [int(i) for i in input().split()]
num = a1[0] + a2[n-1]
def f(i):
if n == 1:
return 0
elif i < n-2:
return max(sum(a2[i:n - 1]), a1[i + 1] + f(i + 1))
else:
return max(a1[n-1], a2[n-2])
print((f(0) + num))
| n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(2)]
dp = [[0 for i in range(2)] for j in range(n)]
dp[0][0] = a[0][0]
dp[0][1] = a[0][0] + a[1][0]
for i in range(n-1):
dp[i+1][0] = dp[i][0] + a[0][i+1]
dp[i+1][1] = max(dp[i][1] + a[1][i+1], dp[i+1][0] + a[1][i+1])
print((dp[n-1][1])) | 17 | 12 | 322 | 325 | n = int(eval(input()))
a1 = [int(i) for i in input().split()]
a2 = [int(i) for i in input().split()]
num = a1[0] + a2[n - 1]
def f(i):
if n == 1:
return 0
elif i < n - 2:
return max(sum(a2[i : n - 1]), a1[i + 1] + f(i + 1))
else:
return max(a1[n - 1], a2[n - 2])
print((f(0) + num))
| n = int(eval(input()))
a = [list(map(int, input().split())) for i in range(2)]
dp = [[0 for i in range(2)] for j in range(n)]
dp[0][0] = a[0][0]
dp[0][1] = a[0][0] + a[1][0]
for i in range(n - 1):
dp[i + 1][0] = dp[i][0] + a[0][i + 1]
dp[i + 1][1] = max(dp[i][1] + a[1][i + 1], dp[i + 1][0] + a[1][i + 1])
print((dp[n - 1][1]))
| false | 29.411765 | [
"-a1 = [int(i) for i in input().split()]",
"-a2 = [int(i) for i in input().split()]",
"-num = a1[0] + a2[n - 1]",
"-",
"-",
"-def f(i):",
"- if n == 1:",
"- return 0",
"- elif i < n - 2:",
"- return max(sum(a2[i : n - 1]), a1[i + 1] + f(i + 1))",
"- else:",
"- ret... | false | 0.040962 | 0.039458 | 1.038114 | [
"s184087680",
"s550444761"
] |
u821588465 | p02607 | python | s024290029 | s948985675 | 33 | 30 | 9,176 | 9,056 | Accepted | Accepted | 9.09 | N = int(eval(input()))
list = list(map(int, input().split()))
cnt = 0
li = []
for count, i in enumerate(list):
if count %2 ==0:
li.append(i)
for j in range(len(li)):
if li[j] %2 ==1:
cnt +=1
print(cnt)
| n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(1,len(a)+1):
if i %2 == 1 and a[i-1] %2 ==1:
cnt += 1
print(cnt)
| 12 | 10 | 232 | 165 | N = int(eval(input()))
list = list(map(int, input().split()))
cnt = 0
li = []
for count, i in enumerate(list):
if count % 2 == 0:
li.append(i)
for j in range(len(li)):
if li[j] % 2 == 1:
cnt += 1
print(cnt)
| n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(1, len(a) + 1):
if i % 2 == 1 and a[i - 1] % 2 == 1:
cnt += 1
print(cnt)
| false | 16.666667 | [
"-N = int(eval(input()))",
"-list = list(map(int, input().split()))",
"+n = int(eval(input()))",
"+a = list(map(int, input().split()))",
"-li = []",
"-for count, i in enumerate(list):",
"- if count % 2 == 0:",
"- li.append(i)",
"-for j in range(len(li)):",
"- if li[j] % 2 == 1:",
"+... | false | 0.044368 | 0.154572 | 0.28704 | [
"s024290029",
"s948985675"
] |
u730769327 | p03836 | python | s048103257 | s110799321 | 176 | 94 | 38,256 | 61,504 | Accepted | Accepted | 46.59 | sx,sy,tx,ty=list(map(int,input().split()))
d=tx-sx
h=ty-sy
s='U'*h+'R'*d+'D'*h+'L'*(1+d)+'U'*(1+h)+'R'*(1+d)+'D'+'R'+'D'*(h+1)+'L'*(d+1)+'U'
print(s)
| sx,sy,tx,ty=list(map(int,input().split()))
print(('U'*(ty-sy)+'R'*(tx-sx)+'D'*(ty-sy)+'L'*(tx-sx+1)+'U'*(ty-sy+1)+'R'*(tx-sx+1)+'D'+'R'+'D'*(ty-sy+1)+'L'*(tx-sx+1)+'U')) | 6 | 2 | 192 | 162 | sx, sy, tx, ty = list(map(int, input().split()))
d = tx - sx
h = ty - sy
s = (
"U" * h
+ "R" * d
+ "D" * h
+ "L" * (1 + d)
+ "U" * (1 + h)
+ "R" * (1 + d)
+ "D"
+ "R"
+ "D" * (h + 1)
+ "L" * (d + 1)
+ "U"
)
print(s)
| sx, sy, tx, ty = list(map(int, input().split()))
print(
(
"U" * (ty - sy)
+ "R" * (tx - sx)
+ "D" * (ty - sy)
+ "L" * (tx - sx + 1)
+ "U" * (ty - sy + 1)
+ "R" * (tx - sx + 1)
+ "D"
+ "R"
+ "D" * (ty - sy + 1)
+ "L" * (tx - sx + 1)
+ "U"
)
)
| false | 66.666667 | [
"-d = tx - sx",
"-h = ty - sy",
"-s = (",
"- \"U\" * h",
"- + \"R\" * d",
"- + \"D\" * h",
"- + \"L\" * (1 + d)",
"- + \"U\" * (1 + h)",
"- + \"R\" * (1 + d)",
"- + \"D\"",
"- + \"R\"",
"- + \"D\" * (h + 1)",
"- + \"L\" * (d + 1)",
"- + \"U\"",
"+print(",... | false | 0.078389 | 0.036474 | 2.149204 | [
"s048103257",
"s110799321"
] |
u893962649 | p03434 | python | s414737334 | s250768792 | 30 | 24 | 9,048 | 9,020 | Accepted | Accepted | 20 | """abc088_b"""
N = int(eval(input()))
A = list(map(int, input().split()))
alice = 0
bob = 0
a_desc = sorted(A, reverse=True)
for i, a in enumerate(a_desc):
if i % 2 == 0:
alice += a
else:
bob += a
print((alice - bob))
| """abc088_b"""
N = int(eval(input()))
A = list(map(int, input().split()))
a_desc = sorted(A, reverse=True)
print((sum(a_desc[0::2])-sum(a_desc[1::2])))
| 16 | 6 | 253 | 150 | """abc088_b"""
N = int(eval(input()))
A = list(map(int, input().split()))
alice = 0
bob = 0
a_desc = sorted(A, reverse=True)
for i, a in enumerate(a_desc):
if i % 2 == 0:
alice += a
else:
bob += a
print((alice - bob))
| """abc088_b"""
N = int(eval(input()))
A = list(map(int, input().split()))
a_desc = sorted(A, reverse=True)
print((sum(a_desc[0::2]) - sum(a_desc[1::2])))
| false | 62.5 | [
"-alice = 0",
"-bob = 0",
"-for i, a in enumerate(a_desc):",
"- if i % 2 == 0:",
"- alice += a",
"- else:",
"- bob += a",
"-print((alice - bob))",
"+print((sum(a_desc[0::2]) - sum(a_desc[1::2])))"
] | false | 0.03903 | 0.081016 | 0.481753 | [
"s414737334",
"s250768792"
] |
u372550522 | p02830 | python | s124572445 | s887874408 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | n = int(eval(input()))
s, t = input().split()
print((''.join([s[i]+t[i] for i in range(n)]))) | n=eval(input())
S,T=input().split()
print((''.join([s+t for s,t in zip(S,T)]))) | 3 | 3 | 87 | 73 | n = int(eval(input()))
s, t = input().split()
print(("".join([s[i] + t[i] for i in range(n)])))
| n = eval(input())
S, T = input().split()
print(("".join([s + t for s, t in zip(S, T)])))
| false | 0 | [
"-n = int(eval(input()))",
"-s, t = input().split()",
"-print((\"\".join([s[i] + t[i] for i in range(n)])))",
"+n = eval(input())",
"+S, T = input().split()",
"+print((\"\".join([s + t for s, t in zip(S, T)])))"
] | false | 0.037326 | 0.037667 | 0.990931 | [
"s124572445",
"s887874408"
] |
u350093546 | p02596 | python | s827431022 | s085448787 | 212 | 64 | 9,116 | 63,480 | Accepted | Accepted | 69.81 | k=int(eval(input()))
ans='-1'
a=7
for i in range(1,10**6+1):
if a%k==0:
ans=i
break
a=((10*a)+7)%k
print(ans) | k=int(eval(input()))
if k%2==0:
print((-1))
exit()
ans=1
pin=7
mod=k
for i in range(1000000):
if pin%k==0:
print(ans)
exit()
ans+=1
pin*=10
pin+=7
pin%=mod
print('-1')
| 11 | 22 | 131 | 218 | k = int(eval(input()))
ans = "-1"
a = 7
for i in range(1, 10**6 + 1):
if a % k == 0:
ans = i
break
a = ((10 * a) + 7) % k
print(ans)
| k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
ans = 1
pin = 7
mod = k
for i in range(1000000):
if pin % k == 0:
print(ans)
exit()
ans += 1
pin *= 10
pin += 7
pin %= mod
print("-1")
| false | 50 | [
"-ans = \"-1\"",
"-a = 7",
"-for i in range(1, 10**6 + 1):",
"- if a % k == 0:",
"- ans = i",
"- break",
"- a = ((10 * a) + 7) % k",
"-print(ans)",
"+if k % 2 == 0:",
"+ print((-1))",
"+ exit()",
"+ans = 1",
"+pin = 7",
"+mod = k",
"+for i in range(1000000):",
... | false | 0.093823 | 0.138156 | 0.679109 | [
"s827431022",
"s085448787"
] |
u014333473 | p03547 | python | s255550921 | s018845077 | 33 | 30 | 9,076 | 9,100 | Accepted | Accepted | 9.09 | n,m=[ord(i) for i in input().split()];n-=m;print((['<','>'][n>0] if n else'=')) | n,m=input().split();print((['=',['<','>'][n>m]][n!=m])) | 1 | 1 | 77 | 53 | n, m = [ord(i) for i in input().split()]
n -= m
print((["<", ">"][n > 0] if n else "="))
| n, m = input().split()
print((["=", ["<", ">"][n > m]][n != m]))
| false | 0 | [
"-n, m = [ord(i) for i in input().split()]",
"-n -= m",
"-print(([\"<\", \">\"][n > 0] if n else \"=\"))",
"+n, m = input().split()",
"+print(([\"=\", [\"<\", \">\"][n > m]][n != m]))"
] | false | 0.077327 | 0.10022 | 0.77157 | [
"s255550921",
"s018845077"
] |
u506086925 | p03416 | python | s618472026 | s693958032 | 223 | 197 | 3,060 | 3,060 | Accepted | Accepted | 11.66 | A, B = list(map(int, input().split()))
count = 0
for num in range(A, B+1):
nl = list(str(num))
kai = [nl[-i] for i in range(1, len(nl)+1)]
if int("".join(kai))==num:
count += 1
print(count) | A, B = list(map(int, input().split()))
count = 0
for num in range(A, B+1):
nl = str(num)
kai = [nl[-i] for i in range(1, len(nl)+1)]
if int("".join(kai))==num:
count += 1
print(count) | 8 | 8 | 210 | 204 | A, B = list(map(int, input().split()))
count = 0
for num in range(A, B + 1):
nl = list(str(num))
kai = [nl[-i] for i in range(1, len(nl) + 1)]
if int("".join(kai)) == num:
count += 1
print(count)
| A, B = list(map(int, input().split()))
count = 0
for num in range(A, B + 1):
nl = str(num)
kai = [nl[-i] for i in range(1, len(nl) + 1)]
if int("".join(kai)) == num:
count += 1
print(count)
| false | 0 | [
"- nl = list(str(num))",
"+ nl = str(num)"
] | false | 0.093723 | 0.076957 | 1.217857 | [
"s618472026",
"s693958032"
] |
u690536347 | p03181 | python | s755483150 | s476435939 | 1,399 | 438 | 256,304 | 149,316 | Accepted | Accepted | 68.69 | from collections import defaultdict
from operator import add, mul
import sys
input=sys.stdin.readline
class Reroot:
def __init__(self, N, M):
self.G = defaultdict(list)
self.parents = [-1]*(N+1)
self.dp = defaultdict(lambda: defaultdict(int))
self.ans = [0]*(N+1)
self.merge = lambda x,y:mul(x, y)
self.add_root = lambda x:x#+1
self.e = 1
self.M = M
def add_edge(self, s, t):
self.G[s].append(t)
def build(self):
self.dfs1(1)
self.dfs2(1)
return self.ans
def dfs1(self, s):
l = []
q = [1]
while q:
s = q.pop()
l.append(s)
for t in self.G[s]:
if t == self.parents[s]:
continue
self.parents[t] = s
q.append(t)
for s in l[::-1]:
v = self.e
for t in self.G[s]:
if t == self.parents[s]:
continue
v = self.merge(v, self.dp[s][t]+1)
self.dp[self.parents[s]][s] = self.add_root(v)
def dfs2(self, s):
q = [(s, self.e)]
while q:
s, dp_p = q.pop()
par = self.parents[s]
for t in self.G[s]:
if t == par:
self.dp[s][t] = dp_p
size = len(self.G[s])
ac_l = [self.e] * (size+1)
ac_r = [self.e] * (size+1)
for i, t in enumerate(self.G[s]):
ac_l[i+1] = self.merge(ac_l[i], self.dp[s][t]+1)%self.M
for i, t in enumerate(self.G[s][::-1]):
ac_r[size-i-1] = self.merge(ac_r[size-i], self.dp[s][t]+1)%self.M
self.ans[s] = self.add_root(ac_l[size])
for i, t in enumerate(self.G[s]):
if t == par:
continue
q.append((t, self.add_root(self.merge(ac_l[i], ac_r[i+1])%self.M)))
def solve():
N, M = list(map(int, input().split()))
tree = Reroot(N, M)
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree.add_edge(a, b)
tree.add_edge(b, a)
ans = tree.build()
for i in range(1, N+1):
print((ans[i]))
if __name__ == "__main__":
solve()
| from collections import defaultdict
import sys
input=sys.stdin.readline
class Reroot:
def __init__(self, N, e, merge, f, g):
self.G = defaultdict(list)
self.parents = [-1]*(N+1)
self.dp = defaultdict(lambda: defaultdict(int))
self.ans = [0]*(N+1)
self.merge = merge
self.f = f
self.g = g
self.e = e
def add_edge(self, s, t):
self.G[s].append(t)
def build(self):
self.dfs1(1)
self.dfs2(1)
return self.ans
def dfs1(self, s):
l = []
q = [1]
while q:
s = q.pop()
l.append(s)
for t in self.G[s]:
if t == self.parents[s]:
continue
self.parents[t] = s
q.append(t)
for s in l[::-1]:
v = self.e
for t in self.G[s]:
if t == self.parents[s]:
continue
v = self.merge(v, self.f(self.dp[s][t], 1))
self.dp[self.parents[s]][s] = self.g(v, 0)
def dfs2(self, s):
q = [(s, self.e)]
while q:
s, dp_p = q.pop()
par = self.parents[s]
for t in self.G[s]:
if t == par:
self.dp[s][t] = dp_p
size = len(self.G[s])
ac_l = [self.e] * (size+1)
ac_r = [self.e] * (size+1)
for i, t in enumerate(self.G[s]):
ac_l[i+1] = self.merge(ac_l[i], self.f(self.dp[s][t], 1))
for i, t in enumerate(self.G[s][::-1]):
ac_r[size-i-1] = self.merge(ac_r[size-i], self.f(self.dp[s][t], 1))
self.ans[s] = self.g(ac_l[size], 0)
for i, t in enumerate(self.G[s]):
if t == par:
continue
q.append((t, self.g(self.merge(ac_l[i], ac_r[i+1]), 0)))
def solve():
N, M = list(map(int, input().split()))
merge = lambda x,y:(x*y)%M
f = lambda x,y:x+y
g = lambda x,y:x+y
e = 1
tree = Reroot(N, e, merge, f, g)
for _ in range(N-1):
a, b = list(map(int, input().split()))
tree.add_edge(a, b)
tree.add_edge(b, a)
ans = tree.build()
for i in range(1, N+1):
print((ans[i]))
if __name__ == "__main__":
solve()
| 82 | 87 | 2,346 | 2,400 | from collections import defaultdict
from operator import add, mul
import sys
input = sys.stdin.readline
class Reroot:
def __init__(self, N, M):
self.G = defaultdict(list)
self.parents = [-1] * (N + 1)
self.dp = defaultdict(lambda: defaultdict(int))
self.ans = [0] * (N + 1)
self.merge = lambda x, y: mul(x, y)
self.add_root = lambda x: x # +1
self.e = 1
self.M = M
def add_edge(self, s, t):
self.G[s].append(t)
def build(self):
self.dfs1(1)
self.dfs2(1)
return self.ans
def dfs1(self, s):
l = []
q = [1]
while q:
s = q.pop()
l.append(s)
for t in self.G[s]:
if t == self.parents[s]:
continue
self.parents[t] = s
q.append(t)
for s in l[::-1]:
v = self.e
for t in self.G[s]:
if t == self.parents[s]:
continue
v = self.merge(v, self.dp[s][t] + 1)
self.dp[self.parents[s]][s] = self.add_root(v)
def dfs2(self, s):
q = [(s, self.e)]
while q:
s, dp_p = q.pop()
par = self.parents[s]
for t in self.G[s]:
if t == par:
self.dp[s][t] = dp_p
size = len(self.G[s])
ac_l = [self.e] * (size + 1)
ac_r = [self.e] * (size + 1)
for i, t in enumerate(self.G[s]):
ac_l[i + 1] = self.merge(ac_l[i], self.dp[s][t] + 1) % self.M
for i, t in enumerate(self.G[s][::-1]):
ac_r[size - i - 1] = (
self.merge(ac_r[size - i], self.dp[s][t] + 1) % self.M
)
self.ans[s] = self.add_root(ac_l[size])
for i, t in enumerate(self.G[s]):
if t == par:
continue
q.append((t, self.add_root(self.merge(ac_l[i], ac_r[i + 1]) % self.M)))
def solve():
N, M = list(map(int, input().split()))
tree = Reroot(N, M)
for _ in range(N - 1):
a, b = list(map(int, input().split()))
tree.add_edge(a, b)
tree.add_edge(b, a)
ans = tree.build()
for i in range(1, N + 1):
print((ans[i]))
if __name__ == "__main__":
solve()
| from collections import defaultdict
import sys
input = sys.stdin.readline
class Reroot:
def __init__(self, N, e, merge, f, g):
self.G = defaultdict(list)
self.parents = [-1] * (N + 1)
self.dp = defaultdict(lambda: defaultdict(int))
self.ans = [0] * (N + 1)
self.merge = merge
self.f = f
self.g = g
self.e = e
def add_edge(self, s, t):
self.G[s].append(t)
def build(self):
self.dfs1(1)
self.dfs2(1)
return self.ans
def dfs1(self, s):
l = []
q = [1]
while q:
s = q.pop()
l.append(s)
for t in self.G[s]:
if t == self.parents[s]:
continue
self.parents[t] = s
q.append(t)
for s in l[::-1]:
v = self.e
for t in self.G[s]:
if t == self.parents[s]:
continue
v = self.merge(v, self.f(self.dp[s][t], 1))
self.dp[self.parents[s]][s] = self.g(v, 0)
def dfs2(self, s):
q = [(s, self.e)]
while q:
s, dp_p = q.pop()
par = self.parents[s]
for t in self.G[s]:
if t == par:
self.dp[s][t] = dp_p
size = len(self.G[s])
ac_l = [self.e] * (size + 1)
ac_r = [self.e] * (size + 1)
for i, t in enumerate(self.G[s]):
ac_l[i + 1] = self.merge(ac_l[i], self.f(self.dp[s][t], 1))
for i, t in enumerate(self.G[s][::-1]):
ac_r[size - i - 1] = self.merge(
ac_r[size - i], self.f(self.dp[s][t], 1)
)
self.ans[s] = self.g(ac_l[size], 0)
for i, t in enumerate(self.G[s]):
if t == par:
continue
q.append((t, self.g(self.merge(ac_l[i], ac_r[i + 1]), 0)))
def solve():
N, M = list(map(int, input().split()))
merge = lambda x, y: (x * y) % M
f = lambda x, y: x + y
g = lambda x, y: x + y
e = 1
tree = Reroot(N, e, merge, f, g)
for _ in range(N - 1):
a, b = list(map(int, input().split()))
tree.add_edge(a, b)
tree.add_edge(b, a)
ans = tree.build()
for i in range(1, N + 1):
print((ans[i]))
if __name__ == "__main__":
solve()
| false | 5.747126 | [
"-from operator import add, mul",
"- def __init__(self, N, M):",
"+ def __init__(self, N, e, merge, f, g):",
"- self.merge = lambda x, y: mul(x, y)",
"- self.add_root = lambda x: x # +1",
"- self.e = 1",
"- self.M = M",
"+ self.merge = merge",
"+ self... | false | 0.039127 | 0.008123 | 4.817017 | [
"s755483150",
"s476435939"
] |
u476604182 | p03128 | python | s343769667 | s490052165 | 168 | 116 | 14,692 | 14,708 | Accepted | Accepted | 30.95 | n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
L=[0,2,5,5,4,5,6,3,7,6]
dp=[0]+[-1]*n
for i in range(n+1):
for a in A:
if i+L[a]<=n:
dp[i+L[a]]=max(dp[i+L[a]],dp[i]*10+a)
print((dp[n]))
| N, M = list(map(int, input().split()))
a = [int(i) for i in input().split()]
dic = {}
dic[1] = 2
dic[2] = 5
dic[3] = 5
dic[4] = 4
dic[5] = 5
dic[6] = 6
dic[7] = 3
dic[8] = 7
dic[9] = 6
ls = [-1]*8
dp = [-1]*(N+1)
dp[0] = 0
for i in a:
j = dic[i]
if ls[j]<i:
ls[j] = i
tag = []
for i in range(len(ls)):
if ls[i]!=-1:
tag += [i]
for i in range(N+1):
for j in tag:
if i+j<=N:
dp[i+j] = max(dp[i]*10+ls[j], dp[i+j])
print((dp[N]))
| 9 | 32 | 218 | 480 | n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [0] + [-1] * n
for i in range(n + 1):
for a in A:
if i + L[a] <= n:
dp[i + L[a]] = max(dp[i + L[a]], dp[i] * 10 + a)
print((dp[n]))
| N, M = list(map(int, input().split()))
a = [int(i) for i in input().split()]
dic = {}
dic[1] = 2
dic[2] = 5
dic[3] = 5
dic[4] = 4
dic[5] = 5
dic[6] = 6
dic[7] = 3
dic[8] = 7
dic[9] = 6
ls = [-1] * 8
dp = [-1] * (N + 1)
dp[0] = 0
for i in a:
j = dic[i]
if ls[j] < i:
ls[j] = i
tag = []
for i in range(len(ls)):
if ls[i] != -1:
tag += [i]
for i in range(N + 1):
for j in tag:
if i + j <= N:
dp[i + j] = max(dp[i] * 10 + ls[j], dp[i + j])
print((dp[N]))
| false | 71.875 | [
"-n, m = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"-L = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]",
"-dp = [0] + [-1] * n",
"-for i in range(n + 1):",
"- for a in A:",
"- if i + L[a] <= n:",
"- dp[i + L[a]] = max(dp[i + L[a]], dp[i] * 10 + a)",
"-print((dp[... | false | 0.047618 | 0.047059 | 1.011869 | [
"s343769667",
"s490052165"
] |
u623349537 | p02724 | python | s943259772 | s438013827 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | X = int(eval(input()))
a = X // 500
b = (X % 500) // 5
print((a * 1000 + b * 5)) | X = int(eval(input()))
print((X // 500 * 1000 + (X % 500)//5*5)) | 4 | 2 | 75 | 57 | X = int(eval(input()))
a = X // 500
b = (X % 500) // 5
print((a * 1000 + b * 5))
| X = int(eval(input()))
print((X // 500 * 1000 + (X % 500) // 5 * 5))
| false | 50 | [
"-a = X // 500",
"-b = (X % 500) // 5",
"-print((a * 1000 + b * 5))",
"+print((X // 500 * 1000 + (X % 500) // 5 * 5))"
] | false | 0.047024 | 0.049765 | 0.94494 | [
"s943259772",
"s438013827"
] |
u411353821 | p02731 | python | s717588104 | s758519546 | 18 | 16 | 2,940 | 2,940 | Accepted | Accepted | 11.11 | n = [list(map(int, s.split())) for s in open(0)][0][0]
c = n / 3
print((c ** 3)) | def main():
n = int(eval(input()))
print(((n/3)**3))
if __name__ == "__main__":
main()
| 3 | 7 | 81 | 99 | n = [list(map(int, s.split())) for s in open(0)][0][0]
c = n / 3
print((c**3))
| def main():
n = int(eval(input()))
print(((n / 3) ** 3))
if __name__ == "__main__":
main()
| false | 57.142857 | [
"-n = [list(map(int, s.split())) for s in open(0)][0][0]",
"-c = n / 3",
"-print((c**3))",
"+def main():",
"+ n = int(eval(input()))",
"+ print(((n / 3) ** 3))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.033167 | 0.038023 | 0.872299 | [
"s717588104",
"s758519546"
] |
u865741247 | p03253 | python | s413317853 | s932696733 | 1,944 | 165 | 114,396 | 39,828 | Accepted | Accepted | 91.51 | import math
N,M = list(map(int,input().split(" ")))
MOD = 10 ** 9 + 7
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
ans = 1
fac = factorize(M)
for temp in fac:
num = temp[1]
ans *= combinations_count(num + N - 1,N-1)
ans %= MOD
print(ans)
| import math
N,M = list(map(int,input().split(" ")))
MOD = 10 ** 9 + 7
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n;
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2, r + 1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p - 1, r, p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k]) % MOD
return result % MOD
ans = 1
fac = factorize(M)
for temp in fac:
num = temp[1]
ans *= cmb(num + N - 1,num)
ans %= MOD
print(ans)
| 27 | 48 | 642 | 1,118 | import math
N, M = list(map(int, input().split(" ")))
MOD = 10**9 + 7
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
ans = 1
fac = factorize(M)
for temp in fac:
num = temp[1]
ans *= combinations_count(num + N - 1, N - 1)
ans %= MOD
print(ans)
| import math
N, M = list(map(int, input().split(" ")))
MOD = 10**9 + 7
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def cmb(n, r):
if n - r < r:
r = n - r
if r == 0:
return 1
if r == 1:
return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2, r + 1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p - 1, r, p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k]) % MOD
return result % MOD
ans = 1
fac = factorize(M)
for temp in fac:
num = temp[1]
ans *= cmb(num + N - 1, num)
ans %= MOD
print(ans)
| false | 43.75 | [
"-def combinations_count(n, r):",
"- return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))",
"+def cmb(n, r):",
"+ if n - r < r:",
"+ r = n - r",
"+ if r == 0:",
"+ return 1",
"+ if r == 1:",
"+ return n",
"+ numerator = [n - r + k + 1 for k in... | false | 0.377346 | 0.041843 | 9.018158 | [
"s413317853",
"s932696733"
] |
u525065967 | p02682 | python | s625640230 | s276631315 | 22 | 20 | 9,144 | 9,160 | Accepted | Accepted | 9.09 | a,b,c,k = list(map(int, input().split()))
print((min(k,a) - (k-a-b if k-b>a else 0)))
| a,b,c,k = list(map(int, input().split()))
print((min(k, a) - max(0, k-a-b)))
| 2 | 2 | 79 | 70 | a, b, c, k = list(map(int, input().split()))
print((min(k, a) - (k - a - b if k - b > a else 0)))
| a, b, c, k = list(map(int, input().split()))
print((min(k, a) - max(0, k - a - b)))
| false | 0 | [
"-print((min(k, a) - (k - a - b if k - b > a else 0)))",
"+print((min(k, a) - max(0, k - a - b)))"
] | false | 0.107522 | 0.044227 | 2.431166 | [
"s625640230",
"s276631315"
] |
u119148115 | p02603 | python | s794605232 | s212818731 | 141 | 68 | 72,004 | 61,812 | Accepted | Accepted | 51.77 | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
B = [0] + LI()
A = [0]
for i in range(N): # 要らないものを消す
if B[i] != B[i+1]:
A.append(B[i+1])
N = len(A)-1
MAX = [0,1000] + [0]*N # MAX[i] = i日目開始時点の所持金の最大値
from functools import lru_cache
@lru_cache(maxsize=None)
def dfs(n,money):
if n == N+1:
return money
else:
res = money
for i in range(n,N): # 購入
for j in range(i+1,N+1): # 売却
if A[i] == min(A[i:j+1]) and A[j] == max(A[i:j+1]) and A[i] < A[j]:
a = money+(A[j]-A[i])*(money//A[i])
if a > MAX[j+1]:
res = max(res,dfs(j+1,a))
MAX[j+1] = a
return res
print((dfs(1,1000)))
| import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
# 買った株は翌日全て売ってよい
# 貪欲に
money = 1000
for i in range(N-1):
if A[i] < A[i+1]:
money += (A[i+1]-A[i])*(money//A[i])
print(money)
| 33 | 15 | 875 | 310 | import sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
N = I()
B = [0] + LI()
A = [0]
for i in range(N): # 要らないものを消す
if B[i] != B[i + 1]:
A.append(B[i + 1])
N = len(A) - 1
MAX = [0, 1000] + [0] * N # MAX[i] = i日目開始時点の所持金の最大値
from functools import lru_cache
@lru_cache(maxsize=None)
def dfs(n, money):
if n == N + 1:
return money
else:
res = money
for i in range(n, N): # 購入
for j in range(i + 1, N + 1): # 売却
if (
A[i] == min(A[i : j + 1])
and A[j] == max(A[i : j + 1])
and A[i] < A[j]
):
a = money + (A[j] - A[i]) * (money // A[i])
if a > MAX[j + 1]:
res = max(res, dfs(j + 1, a))
MAX[j + 1] = a
return res
print((dfs(1, 1000)))
| import sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
N = I()
A = LI()
# 買った株は翌日全て売ってよい
# 貪欲に
money = 1000
for i in range(N - 1):
if A[i] < A[i + 1]:
money += (A[i + 1] - A[i]) * (money // A[i])
print(money)
| false | 54.545455 | [
"-B = [0] + LI()",
"-A = [0]",
"-for i in range(N): # 要らないものを消す",
"- if B[i] != B[i + 1]:",
"- A.append(B[i + 1])",
"-N = len(A) - 1",
"-MAX = [0, 1000] + [0] * N # MAX[i] = i日目開始時点の所持金の最大値",
"-from functools import lru_cache",
"-",
"-",
"-@lru_cache(maxsize=None)",
"-def dfs(n, mo... | false | 0.041529 | 0.041088 | 1.010731 | [
"s794605232",
"s212818731"
] |
u818476133 | p02732 | python | s453742419 | s785624050 | 491 | 361 | 24,748 | 26,140 | Accepted | Accepted | 26.48 | def combi(x):
return x * (x-1) //2
n = int(eval(input()))
a = list(map(int,input().split()))
#print(a) #思い出すときに使おう 動きが分かるよ
for i in range(len(a)):
a[i] -= 1
#print(a)
cnt = [0] * n
for i in range(len(a)):
cnt[a[i]] += 1
#print(cnt)
total = 0
for i in cnt:
total += combi(i)
for i in range(n):
ans = total
ans -= combi(cnt[a[i]])
ans += combi(cnt[a[i]]-1)
print(ans) | def combi(x):
return x * (x-1) //2
n = int(eval(input()))
a = list(map(int,input().split()))
#print(a) #思い出すときに使おう 動きが分かるよ
for i in range(len(a)):
a[i] -= 1
#print(a)
cnt = [0] * n
for i in range(len(a)):
cnt[a[i]] += 1
#print(cnt)
total = 0
for i in cnt:
total += combi(i)
for i in range(n):
#ans = total
#ans -= combi(cnt[a[i]])
#ans += combi(cnt[a[i]]-1)
ans = total - cnt[a[i]] + 1
print(ans) | 30 | 31 | 433 | 469 | def combi(x):
return x * (x - 1) // 2
n = int(eval(input()))
a = list(map(int, input().split()))
# print(a) #思い出すときに使おう 動きが分かるよ
for i in range(len(a)):
a[i] -= 1
# print(a)
cnt = [0] * n
for i in range(len(a)):
cnt[a[i]] += 1
# print(cnt)
total = 0
for i in cnt:
total += combi(i)
for i in range(n):
ans = total
ans -= combi(cnt[a[i]])
ans += combi(cnt[a[i]] - 1)
print(ans)
| def combi(x):
return x * (x - 1) // 2
n = int(eval(input()))
a = list(map(int, input().split()))
# print(a) #思い出すときに使おう 動きが分かるよ
for i in range(len(a)):
a[i] -= 1
# print(a)
cnt = [0] * n
for i in range(len(a)):
cnt[a[i]] += 1
# print(cnt)
total = 0
for i in cnt:
total += combi(i)
for i in range(n):
# ans = total
# ans -= combi(cnt[a[i]])
# ans += combi(cnt[a[i]]-1)
ans = total - cnt[a[i]] + 1
print(ans)
| false | 3.225806 | [
"- ans = total",
"- ans -= combi(cnt[a[i]])",
"- ans += combi(cnt[a[i]] - 1)",
"+ # ans = total",
"+ # ans -= combi(cnt[a[i]])",
"+ # ans += combi(cnt[a[i]]-1)",
"+ ans = total - cnt[a[i]] + 1"
] | false | 0.038194 | 0.058431 | 0.653654 | [
"s453742419",
"s785624050"
] |
u116038906 | p02555 | python | s294590941 | s521453274 | 485 | 30 | 9,020 | 9,188 | Accepted | Accepted | 93.81 | # 【abc-178】個人的ふりかえり（A〜E）
# https://qiita.com/nyororingo/items/d372d1ff3f690b0d1fe2
S = int(eval(input()))
MOD = 10 ** 9 + 7
dp = [0] * (S + 1)
dp[0] = 1
for i in range(3, S + 1):
#print(dp)
for j in range((i - 3) + 1):
dp[i] += dp[j]
dp[i] %= MOD
print((dp[S] % MOD)) | # 【abc-178】個人的ふりかえり（A〜E）
# https://qiita.com/nyororingo/items/d372d1ff3f690b0d1fe2
S = int(eval(input()))
MOD = 10 ** 9 + 7
dp = [0] * (S + 1)
dp[0] = 1
for i in range(3, S + 1):
#print(dp)
#for j in range((i - 3) + 1):
#dp[i] += dp[j]
dp[i] = dp[i-1] +dp[i-3]
dp[i] %= MOD
print((dp[S] % MOD)) | 15 | 16 | 304 | 340 | # 【abc-178】個人的ふりかえり（A〜E）
# https://qiita.com/nyororingo/items/d372d1ff3f690b0d1fe2
S = int(eval(input()))
MOD = 10**9 + 7
dp = [0] * (S + 1)
dp[0] = 1
for i in range(3, S + 1):
# print(dp)
for j in range((i - 3) + 1):
dp[i] += dp[j]
dp[i] %= MOD
print((dp[S] % MOD))
| # 【abc-178】個人的ふりかえり（A〜E）
# https://qiita.com/nyororingo/items/d372d1ff3f690b0d1fe2
S = int(eval(input()))
MOD = 10**9 + 7
dp = [0] * (S + 1)
dp[0] = 1
for i in range(3, S + 1):
# print(dp)
# for j in range((i - 3) + 1):
# dp[i] += dp[j]
dp[i] = dp[i - 1] + dp[i - 3]
dp[i] %= MOD
print((dp[S] % MOD))
| false | 6.25 | [
"- for j in range((i - 3) + 1):",
"- dp[i] += dp[j]",
"- dp[i] %= MOD",
"+ # for j in range((i - 3) + 1):",
"+ # dp[i] += dp[j]",
"+ dp[i] = dp[i - 1] + dp[i - 3]",
"+ dp[i] %= MOD"
] | false | 0.146145 | 0.037067 | 3.942749 | [
"s294590941",
"s521453274"
] |
u796044734 | p02711 | python | s138616920 | s682831332 | 23 | 21 | 9,096 | 9,028 | Accepted | Accepted | 8.7 | num = eval(input());
if num[0] == "7" or num[1] == "7" or num[2] == "7" :
print("Yes");
else:
print("No");
| N = eval(input());
if N[0] == "7" or N[1] == "7" or N[2] == "7":
print("Yes");
else:
print("No");
| 7 | 6 | 114 | 108 | num = eval(input())
if num[0] == "7" or num[1] == "7" or num[2] == "7":
print("Yes")
else:
print("No")
| N = eval(input())
if N[0] == "7" or N[1] == "7" or N[2] == "7":
print("Yes")
else:
print("No")
| false | 14.285714 | [
"-num = eval(input())",
"-if num[0] == \"7\" or num[1] == \"7\" or num[2] == \"7\":",
"+N = eval(input())",
"+if N[0] == \"7\" or N[1] == \"7\" or N[2] == \"7\":"
] | false | 0.046544 | 0.046407 | 1.002957 | [
"s138616920",
"s682831332"
] |
u729133443 | p03156 | python | s919916911 | s933654201 | 288 | 18 | 21,412 | 2,940 | Accepted | Accepted | 93.75 | import numpy;n,a,b,*p=list(map(int,open(0).read().split()));c=numpy.array(p);d,f=sum(c<=a),sum(b<c);print((min(d,n-d-f,f))) | n,a,b,*p=list(map(int,open(0).read().split()));c=[0]*3
for t in p:c[(t<=a)-(t>b)]+=1
print((min(c))) | 1 | 3 | 115 | 94 | import numpy
n, a, b, *p = list(map(int, open(0).read().split()))
c = numpy.array(p)
d, f = sum(c <= a), sum(b < c)
print((min(d, n - d - f, f)))
| n, a, b, *p = list(map(int, open(0).read().split()))
c = [0] * 3
for t in p:
c[(t <= a) - (t > b)] += 1
print((min(c)))
| false | 66.666667 | [
"-import numpy",
"-",
"-c = numpy.array(p)",
"-d, f = sum(c <= a), sum(b < c)",
"-print((min(d, n - d - f, f)))",
"+c = [0] * 3",
"+for t in p:",
"+ c[(t <= a) - (t > b)] += 1",
"+print((min(c)))"
] | false | 0.452907 | 0.036821 | 12.300181 | [
"s919916911",
"s933654201"
] |
u575431498 | p02793 | python | s849029977 | s302551321 | 1,148 | 981 | 6,100 | 6,100 | Accepted | Accepted | 14.55 | from fractions import gcd
def lcm(x, y):
return x // gcd(x, y) * y
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a % b)
return [y, x - a//b * y, g]
def mod_inverse(a, m):
x, y, _ = extgcd(a, m)
return (m + x % m) % m
N = int(eval(input()))
A = list(map(int, input().split()))
_lcm = 1
for a in A:
_lcm = lcm(_lcm, a)
ans = 0
for a in A:
ans += _lcm * mod_inverse(a, 1000000007)
print((ans % 1000000007)) | from fractions import gcd
def lcm(x, y):
return x // gcd(x, y) * y
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a % b)
return [y, x - a//b * y, g]
def mod_inverse(a, m):
x, y, _ = extgcd(a, m)
return (m + x % m) % m
N = int(eval(input()))
A = list(map(int, input().split()))
_lcm = 1
for a in A:
_lcm = lcm(_lcm, a)
ans = 0
big = 1000000007
_lcm %= big
for a in A:
ans += _lcm * mod_inverse(a, big)
print((ans % big)) | 28 | 30 | 490 | 507 | from fractions import gcd
def lcm(x, y):
return x // gcd(x, y) * y
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a % b)
return [y, x - a // b * y, g]
def mod_inverse(a, m):
x, y, _ = extgcd(a, m)
return (m + x % m) % m
N = int(eval(input()))
A = list(map(int, input().split()))
_lcm = 1
for a in A:
_lcm = lcm(_lcm, a)
ans = 0
for a in A:
ans += _lcm * mod_inverse(a, 1000000007)
print((ans % 1000000007))
| from fractions import gcd
def lcm(x, y):
return x // gcd(x, y) * y
def extgcd(a, b):
if b == 0:
return [1, 0, a]
x, y, g = extgcd(b, a % b)
return [y, x - a // b * y, g]
def mod_inverse(a, m):
x, y, _ = extgcd(a, m)
return (m + x % m) % m
N = int(eval(input()))
A = list(map(int, input().split()))
_lcm = 1
for a in A:
_lcm = lcm(_lcm, a)
ans = 0
big = 1000000007
_lcm %= big
for a in A:
ans += _lcm * mod_inverse(a, big)
print((ans % big))
| false | 6.666667 | [
"+big = 1000000007",
"+_lcm %= big",
"- ans += _lcm * mod_inverse(a, 1000000007)",
"-print((ans % 1000000007))",
"+ ans += _lcm * mod_inverse(a, big)",
"+print((ans % big))"
] | false | 0.053067 | 0.053885 | 0.984817 | [
"s849029977",
"s302551321"
] |
u251515715 | p03408 | python | s048151326 | s762659586 | 21 | 17 | 3,316 | 3,064 | Accepted | Accepted | 19.05 | from collections import Counter
n = int(eval(input()))
s = [eval(input()) for i in range(n)]
m = int(eval(input()))
t = [eval(input()) for i in range(m)]
ss = set(s)
sl = Counter(s)
tl = Counter(t)
goukei=[]
for i in ss:
goukei.append(sl[i]-tl[i])
if max(goukei) > 0:
print((max(goukei)))
else:
print((0)) | n = int(eval(input()))
s = [eval(input()) for i in range(n)]
m = int(eval(input()))
t = [eval(input()) for i in range(m)]
ans = 0
for i in set(s):
tmp = s.count(i)-t.count(i)
if ans < tmp:
ans = tmp
print(ans) | 16 | 10 | 301 | 203 | from collections import Counter
n = int(eval(input()))
s = [eval(input()) for i in range(n)]
m = int(eval(input()))
t = [eval(input()) for i in range(m)]
ss = set(s)
sl = Counter(s)
tl = Counter(t)
goukei = []
for i in ss:
goukei.append(sl[i] - tl[i])
if max(goukei) > 0:
print((max(goukei)))
else:
print((0))
| n = int(eval(input()))
s = [eval(input()) for i in range(n)]
m = int(eval(input()))
t = [eval(input()) for i in range(m)]
ans = 0
for i in set(s):
tmp = s.count(i) - t.count(i)
if ans < tmp:
ans = tmp
print(ans)
| false | 37.5 | [
"-from collections import Counter",
"-",
"-ss = set(s)",
"-sl = Counter(s)",
"-tl = Counter(t)",
"-goukei = []",
"-for i in ss:",
"- goukei.append(sl[i] - tl[i])",
"-if max(goukei) > 0:",
"- print((max(goukei)))",
"-else:",
"- print((0))",
"+ans = 0",
"+for i in set(s):",
"+ ... | false | 0.168558 | 0.042208 | 3.993479 | [
"s048151326",
"s762659586"
] |
u571281863 | p02623 | python | s998808328 | s891732493 | 290 | 223 | 40,660 | 45,836 | Accepted | Accepted | 23.1 | n,m,k=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
AS=[0]
BS=[0]
for i in A:
if i+AS[-1]<=k:
AS.append(i+AS[-1])
else:break
for i in B:
if i+BS[-1]<=k:
BS.append(i+BS[-1])
else:break
r,j=0,len(BS)-1
for i in range(len(AS)):
while AS[i]+BS[j]>k:
j-=1
r=max(r,i+j)
print(r) | from itertools import accumulate
n,m,k=list(map(int,input().split()))
A=list(accumulate(list(map(int,input().split())),initial=0))
B=list(accumulate(list(map(int,input().split())),initial=0))
r,j=0,m
for i in range(n+1):
if A[i]>k:
break
while A[i]+B[j]>k:
j-=1
r=max(r,i+j)
print(r) | 19 | 12 | 359 | 290 | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
AS = [0]
BS = [0]
for i in A:
if i + AS[-1] <= k:
AS.append(i + AS[-1])
else:
break
for i in B:
if i + BS[-1] <= k:
BS.append(i + BS[-1])
else:
break
r, j = 0, len(BS) - 1
for i in range(len(AS)):
while AS[i] + BS[j] > k:
j -= 1
r = max(r, i + j)
print(r)
| from itertools import accumulate
n, m, k = list(map(int, input().split()))
A = list(accumulate(list(map(int, input().split())), initial=0))
B = list(accumulate(list(map(int, input().split())), initial=0))
r, j = 0, m
for i in range(n + 1):
if A[i] > k:
break
while A[i] + B[j] > k:
j -= 1
r = max(r, i + j)
print(r)
| false | 36.842105 | [
"+from itertools import accumulate",
"+",
"-A = list(map(int, input().split()))",
"-B = list(map(int, input().split()))",
"-AS = [0]",
"-BS = [0]",
"-for i in A:",
"- if i + AS[-1] <= k:",
"- AS.append(i + AS[-1])",
"- else:",
"+A = list(accumulate(list(map(int, input().split())), i... | false | 0.044951 | 0.046588 | 0.96485 | [
"s998808328",
"s891732493"
] |
u150984829 | p02264 | python | s940764548 | s602119577 | 240 | 180 | 16,940 | 17,732 | Accepted | Accepted | 25 | import sys
from collections import deque
s=sys.stdin.readlines()
q=int(s[0].split()[1])
f=lambda x,y:(x,int(y))
d=deque(f(*e.split())for e in s[1:])
t,a=0,[]
while d:
k,v=d.popleft()
if v>q:v-=q;t+=q;d.append([k,v])
else:t+=v;a+=[f'{k} {t}']
print(*a,sep='\n')
| import sys
from collections import deque
s=sys.stdin.readlines()
q=int(s[0].split()[1])
f=lambda x,y:(x,int(y))
d=deque(f(*e.split())for e in s[1:])
t,a=0,[]
while d:
k,v=d.popleft()
if v>q:v-=q;t+=q;d.append([k,v])
else:t+=v;a+=[f'{k} {t}']
print(('\n'.join(a)))
| 12 | 12 | 275 | 276 | import sys
from collections import deque
s = sys.stdin.readlines()
q = int(s[0].split()[1])
f = lambda x, y: (x, int(y))
d = deque(f(*e.split()) for e in s[1:])
t, a = 0, []
while d:
k, v = d.popleft()
if v > q:
v -= q
t += q
d.append([k, v])
else:
t += v
a += [f"{k} {t}"]
print(*a, sep="\n")
| import sys
from collections import deque
s = sys.stdin.readlines()
q = int(s[0].split()[1])
f = lambda x, y: (x, int(y))
d = deque(f(*e.split()) for e in s[1:])
t, a = 0, []
while d:
k, v = d.popleft()
if v > q:
v -= q
t += q
d.append([k, v])
else:
t += v
a += [f"{k} {t}"]
print(("\n".join(a)))
| false | 0 | [
"-print(*a, sep=\"\\n\")",
"+print((\"\\n\".join(a)))"
] | false | 0.048193 | 0.05059 | 0.952622 | [
"s940764548",
"s602119577"
] |
u644907318 | p02924 | python | s574262070 | s217597090 | 169 | 61 | 38,256 | 61,760 | Accepted | Accepted | 63.91 | N = int(eval(input()))
print((((N-1)*N)//2)) | N = int(eval(input()))
print(((N*(N-1))//2)) | 2 | 2 | 37 | 37 | N = int(eval(input()))
print((((N - 1) * N) // 2))
| N = int(eval(input()))
print(((N * (N - 1)) // 2))
| false | 0 | [
"-print((((N - 1) * N) // 2))",
"+print(((N * (N - 1)) // 2))"
] | false | 0.133963 | 0.044137 | 3.035139 | [
"s574262070",
"s217597090"
] |
u127499732 | p02873 | python | s229722937 | s266494543 | 216 | 121 | 4,108 | 4,108 | Accepted | Accepted | 43.98 | s = str(eval(input()))
f = "" # 前回のステップの文字 "<" or ">"
ans = 0 # Answer
count = 0 # Ai
continuous = 0 # ">" が何回連続するか
for m in s:
if m=="<":
if f==">" and count>0:
# 清算
ans-=count*continuous
count=0
count+=1
else:
if f=="<":
# セット
continuous=0
count-=1
continuous+=1
if count==-1:
ans+=continuous
count=0
continue
ans+=count
f=m
print(ans) | def main():
import sys
f = "" # 前回のステップの文字 "<" or ">"
ans = 0 # Answer
count = 0 # Ai
continuous = 0 # ">" が何回連続するか
for m in sys.stdin.readline().strip("\n"):
if m=="<":
if f==">" and count>0:
# 清算
ans-=count*continuous
count=0
count+=1
else:
if f=="<":
# セット
continuous=0
count-=1
continuous+=1
if count==-1:
ans+=continuous
count=0
continue
ans+=count
f=m
print(ans)
if __name__ == '__main__':
main() | 30 | 34 | 446 | 590 | s = str(eval(input()))
f = "" # 前回のステップの文字 "<" or ">"
ans = 0 # Answer
count = 0 # Ai
continuous = 0 # ">" が何回連続するか
for m in s:
if m == "<":
if f == ">" and count > 0:
# 清算
ans -= count * continuous
count = 0
count += 1
else:
if f == "<":
# セット
continuous = 0
count -= 1
continuous += 1
if count == -1:
ans += continuous
count = 0
continue
ans += count
f = m
print(ans)
| def main():
import sys
f = "" # 前回のステップの文字 "<" or ">"
ans = 0 # Answer
count = 0 # Ai
continuous = 0 # ">" が何回連続するか
for m in sys.stdin.readline().strip("\n"):
if m == "<":
if f == ">" and count > 0:
# 清算
ans -= count * continuous
count = 0
count += 1
else:
if f == "<":
# セット
continuous = 0
count -= 1
continuous += 1
if count == -1:
ans += continuous
count = 0
continue
ans += count
f = m
print(ans)
if __name__ == "__main__":
main()
| false | 11.764706 | [
"-s = str(eval(input()))",
"-f = \"\" # 前回のステップの文字 \"<\" or \">\"",
"-ans = 0 # Answer",
"-count = 0 # Ai",
"-continuous = 0 # \">\" が何回連続するか",
"-for m in s:",
"- if m == \"<\":",
"- if f == \">\" and count > 0:",
"- # 清算",
"- ans -= count * continuous",
"- ... | false | 0.11026 | 0.046156 | 2.388839 | [
"s229722937",
"s266494543"
] |
u399298563 | p04001 | python | s634325882 | s853160920 | 172 | 27 | 38,256 | 3,060 | Accepted | Accepted | 84.3 | S = eval(input())
if len(S) == 1:
print((int(S)))
exit()
else:
def count(n):
a = 0
if len(n) == 1:
return 0
else:
for i in range(1, len(n)):
a += int(n[:i]) * 2 ** (len(n[i:]) - 1) + int(n[i:]) + count(n[i:])
return a
print((int(S) + count(S))) | S = eval(input())
cnt=0
result = 0
for i in range(2**(len(S)-1)):
mark_list = S[0]
for j in range(len(S)-1):
if (i>>j)&1 == 1:
mark_list+="+"+S[j+1]
else:
mark_list+=S[j+1]
result+=eval(mark_list)
print(result) | 14 | 12 | 293 | 242 | S = eval(input())
if len(S) == 1:
print((int(S)))
exit()
else:
def count(n):
a = 0
if len(n) == 1:
return 0
else:
for i in range(1, len(n)):
a += int(n[:i]) * 2 ** (len(n[i:]) - 1) + int(n[i:]) + count(n[i:])
return a
print((int(S) + count(S)))
| S = eval(input())
cnt = 0
result = 0
for i in range(2 ** (len(S) - 1)):
mark_list = S[0]
for j in range(len(S) - 1):
if (i >> j) & 1 == 1:
mark_list += "+" + S[j + 1]
else:
mark_list += S[j + 1]
result += eval(mark_list)
print(result)
| false | 14.285714 | [
"-if len(S) == 1:",
"- print((int(S)))",
"- exit()",
"-else:",
"-",
"- def count(n):",
"- a = 0",
"- if len(n) == 1:",
"- return 0",
"+cnt = 0",
"+result = 0",
"+for i in range(2 ** (len(S) - 1)):",
"+ mark_list = S[0]",
"+ for j in range(len(S) - 1)... | false | 0.037465 | 0.037476 | 0.999723 | [
"s634325882",
"s853160920"
] |
u938812966 | p03433 | python | s681238208 | s383816253 | 19 | 17 | 2,940 | 3,064 | Accepted | Accepted | 10.53 | N = int(eval(input()))
A = int(eval(input()))
print(("Yes" if N % 500 <= A else "No"))
| print(("Yes" if int(eval(input())) % 500 <= int(eval(input())) else "No"))
| 3 | 1 | 75 | 61 | N = int(eval(input()))
A = int(eval(input()))
print(("Yes" if N % 500 <= A else "No"))
| print(("Yes" if int(eval(input())) % 500 <= int(eval(input())) else "No"))
| false | 66.666667 | [
"-N = int(eval(input()))",
"-A = int(eval(input()))",
"-print((\"Yes\" if N % 500 <= A else \"No\"))",
"+print((\"Yes\" if int(eval(input())) % 500 <= int(eval(input())) else \"No\"))"
] | false | 0.062422 | 0.059455 | 1.049905 | [
"s681238208",
"s383816253"
] |
u216015528 | p03013 | python | s909382916 | s849884739 | 485 | 157 | 467,496 | 23,932 | Accepted | Accepted | 67.63 | def resolve():
import sys
read = sys.stdin.read
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
a = set(int(x) for x in read().split())
dp = [0] * (N + 2)
dp[0] = 1
for i in range(N):
now = dp[i]
if i + 1 not in a:
dp[i + 1] += now
if i + 2 not in a:
dp[i + 2] += now
print((dp[N] % 1_000_000_007))
resolve()
| #!/usr/bin/env python3
def main():
N, M = list(map(int, input().split()))
A = set([int(eval(input())) for x in range(M)])
mod = 10 ** 9 + 7
dp = [0] * 10 ** 6
dp[0] = 1
for i in range(N + 1):
if i in A:
continue
dp[i + 1] += dp[i] % mod
dp[i + 2] += dp[i] % mod
print((dp[N] % mod))
if __name__ == '__main__':
main()
| 23 | 18 | 446 | 391 | def resolve():
import sys
read = sys.stdin.read
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
a = set(int(x) for x in read().split())
dp = [0] * (N + 2)
dp[0] = 1
for i in range(N):
now = dp[i]
if i + 1 not in a:
dp[i + 1] += now
if i + 2 not in a:
dp[i + 2] += now
print((dp[N] % 1_000_000_007))
resolve()
| #!/usr/bin/env python3
def main():
N, M = list(map(int, input().split()))
A = set([int(eval(input())) for x in range(M)])
mod = 10**9 + 7
dp = [0] * 10**6
dp[0] = 1
for i in range(N + 1):
if i in A:
continue
dp[i + 1] += dp[i] % mod
dp[i + 2] += dp[i] % mod
print((dp[N] % mod))
if __name__ == "__main__":
main()
| false | 21.73913 | [
"-def resolve():",
"- import sys",
"-",
"- read = sys.stdin.read",
"- readline = sys.stdin.readline",
"- N, M = list(map(int, readline().split()))",
"- a = set(int(x) for x in read().split())",
"- dp = [0] * (N + 2)",
"+#!/usr/bin/env python3",
"+def main():",
"+ N, M = list... | false | 0.078324 | 0.042725 | 1.833201 | [
"s909382916",
"s849884739"
] |
u291766461 | p03137 | python | s728497972 | s745736385 | 205 | 119 | 30,232 | 13,968 | Accepted | Accepted | 41.95 | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)
diff_dict = {}
for i in range(M-1):
diff = X[i+1] - X[i]
diff_dict[i] = diff
sorted_diff = sorted(list(diff_dict.items()), key=lambda x: x[1])[::-1][:N-1]
keys = {x[0] for x in sorted_diff}
tmp = []
count = 0
for i, x in enumerate(X):
tmp.append(x)
if i in keys:
if len(tmp) > 1:
count += (max(tmp) - min(tmp))
tmp.clear()
if len(tmp) > 1:
count += (max(tmp) - min(tmp))
print(count)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)
diff = []
for i in range(M-1):
diff.append(X[i+1] - X[i])
diff = sorted(diff)[::-1]
print((X[-1] - X[0] - sum(diff[:N-1]))) | 21 | 9 | 530 | 217 | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)
diff_dict = {}
for i in range(M - 1):
diff = X[i + 1] - X[i]
diff_dict[i] = diff
sorted_diff = sorted(list(diff_dict.items()), key=lambda x: x[1])[::-1][: N - 1]
keys = {x[0] for x in sorted_diff}
tmp = []
count = 0
for i, x in enumerate(X):
tmp.append(x)
if i in keys:
if len(tmp) > 1:
count += max(tmp) - min(tmp)
tmp.clear()
if len(tmp) > 1:
count += max(tmp) - min(tmp)
print(count)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)
diff = []
for i in range(M - 1):
diff.append(X[i + 1] - X[i])
diff = sorted(diff)[::-1]
print((X[-1] - X[0] - sum(diff[: N - 1])))
| false | 57.142857 | [
"-diff_dict = {}",
"+diff = []",
"- diff = X[i + 1] - X[i]",
"- diff_dict[i] = diff",
"-sorted_diff = sorted(list(diff_dict.items()), key=lambda x: x[1])[::-1][: N - 1]",
"-keys = {x[0] for x in sorted_diff}",
"-tmp = []",
"-count = 0",
"-for i, x in enumerate(X):",
"- tmp.append(x)",
"... | false | 0.081536 | 0.044301 | 1.840513 | [
"s728497972",
"s745736385"
] |
u319245933 | p02725 | python | s311243672 | s136736458 | 160 | 129 | 25,836 | 31,656 | Accepted | Accepted | 19.38 | import sys
K,N = list(map(int, sys.stdin.readline().strip().split()))
A = list(map(int, sys.stdin.readline().strip().split()))
# K = 20
# N = 3
# A =[0, 5, 15]
# A =[5, 10, 15]
distance = []
# 家間距離
for i,a in enumerate(A):
if i == len(A) - 1:
distance.append(K - A[i] + A[0])
else:
distance.append(A[i+1] - A[i])
# print(distance)
print((sum(distance) - max(distance)))
| K,N,*A = list(map(int, open(0).read().split()))
ans = []
for i in range(N-1):
ans.append(abs(A[i+1] - A[i]))
ans.append(A[0] + K - A[-1])
ans.sort()
ans.pop()
print((sum(ans))) | 19 | 11 | 407 | 185 | import sys
K, N = list(map(int, sys.stdin.readline().strip().split()))
A = list(map(int, sys.stdin.readline().strip().split()))
# K = 20
# N = 3
# A =[0, 5, 15]
# A =[5, 10, 15]
distance = []
# 家間距離
for i, a in enumerate(A):
if i == len(A) - 1:
distance.append(K - A[i] + A[0])
else:
distance.append(A[i + 1] - A[i])
# print(distance)
print((sum(distance) - max(distance)))
| K, N, *A = list(map(int, open(0).read().split()))
ans = []
for i in range(N - 1):
ans.append(abs(A[i + 1] - A[i]))
ans.append(A[0] + K - A[-1])
ans.sort()
ans.pop()
print((sum(ans)))
| false | 42.105263 | [
"-import sys",
"-",
"-K, N = list(map(int, sys.stdin.readline().strip().split()))",
"-A = list(map(int, sys.stdin.readline().strip().split()))",
"-# K = 20",
"-# N = 3",
"-# A =[0, 5, 15]",
"-# A =[5, 10, 15]",
"-distance = []",
"-# 家間距離",
"-for i, a in enumerate(A):",
"- if i == len(A) - 1... | false | 0.040265 | 0.039805 | 1.011565 | [
"s311243672",
"s136736458"
] |
u268554510 | p02775 | python | s056849286 | s830647070 | 756 | 698 | 140,208 | 138,824 | Accepted | Accepted | 7.67 | S = input()[::-1]
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
for i in range(l):
dp[i+1][0]=min(dp[i][0]+int(S[i]),dp[i][1]+int(S[i])+1)
if i!=0:
dp[i+1][1]=min(dp[i][0]+10-int(S[i]),dp[i][1]+10-(int(S[i])+1))
else:
dp[i+1][1]=dp[i][0]+10-int(S[i])
print((min(dp[-1][0],dp[-1][1]+1))) | S = eval(input())
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
dp[1][0]=min(dp[0][1]+10-int(S[0])+1,dp[0][0]+int(S[0]))
dp[1][1]=min(dp[0][1]+10-int(S[0])-1+1,dp[0][0]+int(S[0])+1)
for i in range(1,l):
dp[i+1][0]=min(dp[i][1]+10-int(S[i]),dp[i][0]+int(S[i]))
dp[i+1][1]=min(dp[i][1]+10-int(S[i])-1,dp[i][0]+int(S[i])+1)
print((dp[-1][0])) | 10 | 9 | 305 | 341 | S = input()[::-1]
l = len(S)
dp = [[0] * 2 for _ in range(l + 1)]
for i in range(l):
dp[i + 1][0] = min(dp[i][0] + int(S[i]), dp[i][1] + int(S[i]) + 1)
if i != 0:
dp[i + 1][1] = min(dp[i][0] + 10 - int(S[i]), dp[i][1] + 10 - (int(S[i]) + 1))
else:
dp[i + 1][1] = dp[i][0] + 10 - int(S[i])
print((min(dp[-1][0], dp[-1][1] + 1)))
| S = eval(input())
l = len(S)
dp = [[0] * 2 for _ in range(l + 1)]
dp[1][0] = min(dp[0][1] + 10 - int(S[0]) + 1, dp[0][0] + int(S[0]))
dp[1][1] = min(dp[0][1] + 10 - int(S[0]) - 1 + 1, dp[0][0] + int(S[0]) + 1)
for i in range(1, l):
dp[i + 1][0] = min(dp[i][1] + 10 - int(S[i]), dp[i][0] + int(S[i]))
dp[i + 1][1] = min(dp[i][1] + 10 - int(S[i]) - 1, dp[i][0] + int(S[i]) + 1)
print((dp[-1][0]))
| false | 10 | [
"-S = input()[::-1]",
"+S = eval(input())",
"-for i in range(l):",
"- dp[i + 1][0] = min(dp[i][0] + int(S[i]), dp[i][1] + int(S[i]) + 1)",
"- if i != 0:",
"- dp[i + 1][1] = min(dp[i][0] + 10 - int(S[i]), dp[i][1] + 10 - (int(S[i]) + 1))",
"- else:",
"- dp[i + 1][1] = dp[i][0] + ... | false | 0.089176 | 0.048404 | 1.842341 | [
"s056849286",
"s830647070"
] |
u136090046 | p04029 | python | s567582208 | s135922274 | 20 | 17 | 3,060 | 2,940 | Accepted | Accepted | 15 | res = 0
for i in range(int(eval(input()))+1):
res += i
print(res) | n = int(eval(input()))
res = 0
for i in range(1, n+1):
res += i
print(res) | 4 | 5 | 66 | 76 | res = 0
for i in range(int(eval(input())) + 1):
res += i
print(res)
| n = int(eval(input()))
res = 0
for i in range(1, n + 1):
res += i
print(res)
| false | 20 | [
"+n = int(eval(input()))",
"-for i in range(int(eval(input())) + 1):",
"+for i in range(1, n + 1):"
] | false | 0.048272 | 0.048664 | 0.991956 | [
"s567582208",
"s135922274"
] |
u260980560 | p01223 | python | s189661226 | s318795629 | 20 | 10 | 4,220 | 4,224 | Accepted | Accepted | 50 | for t in range(eval(input())):
up = 0; down = 0;
n = eval(input())
h = list(map(int, input().split()))
print(max([0]+[h[i+1]-h[i] for i in range(n-1)]), max([0]+[h[i]-h[i+1] for i in range(n-1)])) | for t in range(eval(input())):
n = eval(input())
h = list(map(int, input().split()))
print(max(0, max(h[i+1]-h[i] for i in range(n-1))), max(0, max(h[i]-h[i+1] for i in range(n-1)))) | 5 | 4 | 204 | 185 | for t in range(eval(input())):
up = 0
down = 0
n = eval(input())
h = list(map(int, input().split()))
print(
max([0] + [h[i + 1] - h[i] for i in range(n - 1)]),
max([0] + [h[i] - h[i + 1] for i in range(n - 1)]),
)
| for t in range(eval(input())):
n = eval(input())
h = list(map(int, input().split()))
print(
max(0, max(h[i + 1] - h[i] for i in range(n - 1))),
max(0, max(h[i] - h[i + 1] for i in range(n - 1))),
)
| false | 20 | [
"- up = 0",
"- down = 0",
"- max([0] + [h[i + 1] - h[i] for i in range(n - 1)]),",
"- max([0] + [h[i] - h[i + 1] for i in range(n - 1)]),",
"+ max(0, max(h[i + 1] - h[i] for i in range(n - 1))),",
"+ max(0, max(h[i] - h[i + 1] for i in range(n - 1))),"
] | false | 0.045275 | 0.047995 | 0.943341 | [
"s189661226",
"s318795629"
] |
u581187895 | p02900 | python | s143332643 | s394077566 | 196 | 151 | 5,048 | 9,196 | Accepted | Accepted | 22.96 | from fractions import gcd
def prime_decomposition(n): #素因数分解
i = 2
table = []
while i*i <= n:
while n%i == 0:
n /= i
table.append(i)
i += 1
if n > 1:
table.append(int(n))
# 重複なし
return set(table)
A, B = list(map(int, input().split()))
n_gcd = gcd(A, B)
n_div = prime_decomposition(n_gcd)
print((len(n_div)+1)) |
from math import gcd
def resolve():
def prime_factorize(n):
if 2 <= n < 4:
return [n]
res = []
i = 2
while i * i <= n:
while n % i == 0:
res.append(i)
n //= i
i += 1
if n != 1:
res.append(n)
return set(res)
a, b = list(map(int, input().split()))
g = gcd(a, b)
ans = prime_factorize(g)
print((len(ans) + 1))
if __name__ == "__main__":
resolve()
| 19 | 27 | 357 | 520 | from fractions import gcd
def prime_decomposition(n): # 素因数分解
i = 2
table = []
while i * i <= n:
while n % i == 0:
n /= i
table.append(i)
i += 1
if n > 1:
table.append(int(n))
# 重複なし
return set(table)
A, B = list(map(int, input().split()))
n_gcd = gcd(A, B)
n_div = prime_decomposition(n_gcd)
print((len(n_div) + 1))
| from math import gcd
def resolve():
def prime_factorize(n):
if 2 <= n < 4:
return [n]
res = []
i = 2
while i * i <= n:
while n % i == 0:
res.append(i)
n //= i
i += 1
if n != 1:
res.append(n)
return set(res)
a, b = list(map(int, input().split()))
g = gcd(a, b)
ans = prime_factorize(g)
print((len(ans) + 1))
if __name__ == "__main__":
resolve()
| false | 29.62963 | [
"-from fractions import gcd",
"+from math import gcd",
"-def prime_decomposition(n): # 素因数分解",
"- i = 2",
"- table = []",
"- while i * i <= n:",
"- while n % i == 0:",
"- n /= i",
"- table.append(i)",
"- i += 1",
"- if n > 1:",
"- table.a... | false | 0.144997 | 0.036272 | 3.997535 | [
"s143332643",
"s394077566"
] |
u223646582 | p02792 | python | s814214320 | s955160374 | 642 | 237 | 44,376 | 40,428 | Accepted | Accepted | 63.08 | N = int(eval(input()))
digit = len(str(N))
ans = 0
for a in range(1, 10):
for b in range(1, 10):
x, y = 0, 0
if a == b:
if a <= N:
x += 1
y += 1
if a*10+b <= N:
x += 1
if b*10+a <= N:
y += 1
if digit <= 2:
ans += x*y
continue
d = 3
while d < digit:
x += 10**(d-2)
y += 10**(d-2)
d += 1
for i in range(10**(digit-2)):
if int(str(a)+str(i).zfill(digit-2)+str(b)) <= N:
x += 1
if int(str(b)+str(i).zfill(digit-2)+str(a)) <= N:
y += 1
ans += x*y
print(ans)
| N = int(eval(input()))
C = [[0] * 10 for i in range(10)]
for n in range(1, N+1):
i = int(str(n)[0])
j = int(str(n)[-1])
C[i][j] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += C[i][j]*C[j][i]
print(ans)
| 36 | 14 | 749 | 255 | N = int(eval(input()))
digit = len(str(N))
ans = 0
for a in range(1, 10):
for b in range(1, 10):
x, y = 0, 0
if a == b:
if a <= N:
x += 1
y += 1
if a * 10 + b <= N:
x += 1
if b * 10 + a <= N:
y += 1
if digit <= 2:
ans += x * y
continue
d = 3
while d < digit:
x += 10 ** (d - 2)
y += 10 ** (d - 2)
d += 1
for i in range(10 ** (digit - 2)):
if int(str(a) + str(i).zfill(digit - 2) + str(b)) <= N:
x += 1
if int(str(b) + str(i).zfill(digit - 2) + str(a)) <= N:
y += 1
ans += x * y
print(ans)
| N = int(eval(input()))
C = [[0] * 10 for i in range(10)]
for n in range(1, N + 1):
i = int(str(n)[0])
j = int(str(n)[-1])
C[i][j] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += C[i][j] * C[j][i]
print(ans)
| false | 61.111111 | [
"-digit = len(str(N))",
"+C = [[0] * 10 for i in range(10)]",
"+for n in range(1, N + 1):",
"+ i = int(str(n)[0])",
"+ j = int(str(n)[-1])",
"+ C[i][j] += 1",
"-for a in range(1, 10):",
"- for b in range(1, 10):",
"- x, y = 0, 0",
"- if a == b:",
"- if a <= N... | false | 0.309339 | 0.075065 | 4.120937 | [
"s814214320",
"s955160374"
] |
u938486382 | p03087 | python | s607229947 | s915301109 | 968 | 407 | 17,992 | 35,424 | Accepted | Accepted | 57.95 | n, k = list(map(int, input().split(' ')))
orig_a = eval(input())
acs = {}
for i in range(n):
if i < 1:
acs[i] = 0
else:
acs[i] = acs[i-1] + (orig_a[i-1: i+1] == 'AC')
for _ in range(k):
s, e = list(map(int, input().split(' ')))
print((acs[e-1] - acs[s-1]))
| n, k = list(map(int, input().split(' ')))
a = eval(input())
acs = [0] * n
for i in range(1, n):
acs[i] = acs[i-1] + (a[i-1: i+1] == 'AC')
print(('\n'.join(map(str, [acs[e-1] - acs[s-1] for s, e in [list(map(int, input().split(' '))) for _ in range(k)]])))) | 11 | 6 | 275 | 255 | n, k = list(map(int, input().split(" ")))
orig_a = eval(input())
acs = {}
for i in range(n):
if i < 1:
acs[i] = 0
else:
acs[i] = acs[i - 1] + (orig_a[i - 1 : i + 1] == "AC")
for _ in range(k):
s, e = list(map(int, input().split(" ")))
print((acs[e - 1] - acs[s - 1]))
| n, k = list(map(int, input().split(" ")))
a = eval(input())
acs = [0] * n
for i in range(1, n):
acs[i] = acs[i - 1] + (a[i - 1 : i + 1] == "AC")
print(
(
"\n".join(
map(
str,
[
acs[e - 1] - acs[s - 1]
for s, e in [list(map(int, input().split(" "))) for _ in range(k)]
],
)
)
)
)
| false | 45.454545 | [
"-orig_a = eval(input())",
"-acs = {}",
"-for i in range(n):",
"- if i < 1:",
"- acs[i] = 0",
"- else:",
"- acs[i] = acs[i - 1] + (orig_a[i - 1 : i + 1] == \"AC\")",
"-for _ in range(k):",
"- s, e = list(map(int, input().split(\" \")))",
"- print((acs[e - 1] - acs[s - 1])... | false | 0.03954 | 0.036214 | 1.091848 | [
"s607229947",
"s915301109"
] |
u644907318 | p03112 | python | s443494194 | s306993042 | 1,727 | 966 | 38,608 | 99,492 | Accepted | Accepted | 44.06 | from bisect import bisect_right
A,B,Q = list(map(int,input().split()))
S = [int(eval(input())) for _ in range(A)]
S.append(10**11)
S.insert(0,-10**11)
T = [int(eval(input())) for _ in range(B)]
T.append(10**11)
T.insert(0,-10**11)
Ds = {i:0 for i in range(1,A+1)}
Ds[A+1] = 10**11
Ds[0] = 10**11
for i in range(1,A+1):
ind = bisect_right(T,S[i])
Ds[i] = min(T[ind]-S[i],S[i]-T[ind-1])
Dt = {j:0 for j in range(1,B+1)}
Dt[B+1] = 10**11
Dt[0] = 10**11
for j in range(1,B+1):
ind = bisect_right(S,T[j])
Dt[j] = min(S[ind]-T[j],T[j]-S[ind-1])
for _ in range(Q):
x = int(eval(input()))
inds = bisect_right(S,x)
cnts = min(S[inds]-x+Ds[inds],x-S[inds-1]+Ds[inds-1])
indt = bisect_right(T,x)
cntt = min(T[indt]-x+Dt[indt],x-T[indt-1]+Dt[indt-1])
print((min(cnts,cntt)))
| from bisect import bisect_right
INFTY = 10**11
A,B,Q = list(map(int,input().split()))
S = [int(eval(input())) for _ in range(A)]
S.insert(0,-INFTY)
S.append(INFTY)
T = [int(eval(input())) for _ in range(B)]
T.insert(0,-INFTY)
T.append(INFTY)
for _ in range(Q):
x = int(eval(input()))
indS = bisect_right(S,x)
indT = bisect_right(T,x)
d1 = x-S[indS-1]+abs(S[indS-1]-T[indT-1])
d2 = x-S[indS-1]+abs(S[indS-1]-T[indT])
d3 = S[indS]-x+abs(S[indS]-T[indT-1])
d4 = S[indS]-x+abs(S[indS]-T[indT])
d5 = x-T[indT-1]+abs(T[indT-1]-S[indS-1])
d6 = x-T[indT-1]+abs(T[indT-1]-S[indS])
d7 = T[indT]-x+abs(T[indT]-S[indS-1])
d8 = T[indT]-x+abs(T[indT]-S[indS])
print((min(d1,d2,d3,d4,d5,d6,d7,d8))) | 28 | 22 | 808 | 726 | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
S.append(10**11)
S.insert(0, -(10**11))
T = [int(eval(input())) for _ in range(B)]
T.append(10**11)
T.insert(0, -(10**11))
Ds = {i: 0 for i in range(1, A + 1)}
Ds[A + 1] = 10**11
Ds[0] = 10**11
for i in range(1, A + 1):
ind = bisect_right(T, S[i])
Ds[i] = min(T[ind] - S[i], S[i] - T[ind - 1])
Dt = {j: 0 for j in range(1, B + 1)}
Dt[B + 1] = 10**11
Dt[0] = 10**11
for j in range(1, B + 1):
ind = bisect_right(S, T[j])
Dt[j] = min(S[ind] - T[j], T[j] - S[ind - 1])
for _ in range(Q):
x = int(eval(input()))
inds = bisect_right(S, x)
cnts = min(S[inds] - x + Ds[inds], x - S[inds - 1] + Ds[inds - 1])
indt = bisect_right(T, x)
cntt = min(T[indt] - x + Dt[indt], x - T[indt - 1] + Dt[indt - 1])
print((min(cnts, cntt)))
| from bisect import bisect_right
INFTY = 10**11
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
S.insert(0, -INFTY)
S.append(INFTY)
T = [int(eval(input())) for _ in range(B)]
T.insert(0, -INFTY)
T.append(INFTY)
for _ in range(Q):
x = int(eval(input()))
indS = bisect_right(S, x)
indT = bisect_right(T, x)
d1 = x - S[indS - 1] + abs(S[indS - 1] - T[indT - 1])
d2 = x - S[indS - 1] + abs(S[indS - 1] - T[indT])
d3 = S[indS] - x + abs(S[indS] - T[indT - 1])
d4 = S[indS] - x + abs(S[indS] - T[indT])
d5 = x - T[indT - 1] + abs(T[indT - 1] - S[indS - 1])
d6 = x - T[indT - 1] + abs(T[indT - 1] - S[indS])
d7 = T[indT] - x + abs(T[indT] - S[indS - 1])
d8 = T[indT] - x + abs(T[indT] - S[indS])
print((min(d1, d2, d3, d4, d5, d6, d7, d8)))
| false | 21.428571 | [
"+INFTY = 10**11",
"-S.append(10**11)",
"-S.insert(0, -(10**11))",
"+S.insert(0, -INFTY)",
"+S.append(INFTY)",
"-T.append(10**11)",
"-T.insert(0, -(10**11))",
"-Ds = {i: 0 for i in range(1, A + 1)}",
"-Ds[A + 1] = 10**11",
"-Ds[0] = 10**11",
"-for i in range(1, A + 1):",
"- ind = bisect_rig... | false | 0.048366 | 0.069102 | 0.699913 | [
"s443494194",
"s306993042"
] |
u029000441 | p02661 | python | s399835001 | s942252689 | 332 | 273 | 25,760 | 25,688 | Accepted | Accepted | 17.77 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
n=I()
lis1=[];lis2=[]
for i in range(n):
a,b=MI()
lis1.append(a)
lis2.append(b)
lis1.sort()
lis2.sort()
if n%2==1:
ans=max(0,lis2[(n-1)//2]-lis1[(n-1)//2]+1)
else:
sup1=lis2[n//2-1]
sup2=lis2[n//2]
low1=lis1[n//2-1]
low2=lis1[n//2]
ans=(sup1+sup2-low1-low2+1)
ans=max(ans,0)
print(ans) | #float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
n=I()
lis1=[]
lis2=[]
for i in range(n):
a,b=MI()
lis1.append(a)
lis2.append(b)
lis1.sort()
lis2.sort()
if n%2==1:
med1=lis1[n//2]
med2=lis2[n//2]
print((med2-med1+1))
if n%2==0:
med1=lis1[n//2-1]+lis1[n//2]
med2=lis2[n//2-1]+lis2[n//2]
print((med2-med1+1)) | 39 | 40 | 1,114 | 1,106 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left, bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil, pi, factorial
from operator import itemgetter
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def LI2():
return [int(eval(input())) for i in range(n)]
def MXI():
return [[LI()] for i in range(n)]
def SI():
return input().rstrip()
def printns(x):
print(("\n".join(x)))
def printni(x):
print(("\n".join(list(map(str, x)))))
inf = 10**17
mod = 10**9 + 7
n = I()
lis1 = []
lis2 = []
for i in range(n):
a, b = MI()
lis1.append(a)
lis2.append(b)
lis1.sort()
lis2.sort()
if n % 2 == 1:
ans = max(0, lis2[(n - 1) // 2] - lis1[(n - 1) // 2] + 1)
else:
sup1 = lis2[n // 2 - 1]
sup2 = lis2[n // 2]
low1 = lis1[n // 2 - 1]
low2 = lis1[n // 2]
ans = sup1 + sup2 - low1 - low2 + 1
ans = max(ans, 0)
print(ans)
| # float型を許すな
# numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left, bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil, pi, factorial
from operator import itemgetter
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def LI2():
return [int(eval(input())) for i in range(n)]
def MXI():
return [[LI()] for i in range(n)]
def SI():
return input().rstrip()
def printns(x):
print(("\n".join(x)))
def printni(x):
print(("\n".join(list(map(str, x)))))
inf = 10**17
mod = 10**9 + 7
n = I()
lis1 = []
lis2 = []
for i in range(n):
a, b = MI()
lis1.append(a)
lis2.append(b)
lis1.sort()
lis2.sort()
if n % 2 == 1:
med1 = lis1[n // 2]
med2 = lis2[n // 2]
print((med2 - med1 + 1))
if n % 2 == 0:
med1 = lis1[n // 2 - 1] + lis1[n // 2]
med2 = lis2[n // 2 - 1] + lis2[n // 2]
print((med2 - med1 + 1))
| false | 2.5 | [
"+# float型を許すな",
"+# numpyはpythonで",
"- ans = max(0, lis2[(n - 1) // 2] - lis1[(n - 1) // 2] + 1)",
"-else:",
"- sup1 = lis2[n // 2 - 1]",
"- sup2 = lis2[n // 2]",
"- low1 = lis1[n // 2 - 1]",
"- low2 = lis1[n // 2]",
"- ans = sup1 + sup2 - low1 - low2 + 1",
"- ans = max(ans, ... | false | 0.047757 | 0.09523 | 0.501491 | [
"s399835001",
"s942252689"
] |
u021019433 | p02554 | python | s616337953 | s312217530 | 39 | 26 | 10,072 | 9,152 | Accepted | Accepted | 33.33 | M = 10**9 + 7
n = int(eval(input()))
print(((pow(10, n, M) - 2 * pow(9, n, M) + 8**n) % M))
| M = 10**9 + 7
n = int(eval(input()))
print(((pow(10, n, M) - 2 * pow(9, n, M) + pow(8, n, M)) % M))
| 3 | 3 | 86 | 94 | M = 10**9 + 7
n = int(eval(input()))
print(((pow(10, n, M) - 2 * pow(9, n, M) + 8**n) % M))
| M = 10**9 + 7
n = int(eval(input()))
print(((pow(10, n, M) - 2 * pow(9, n, M) + pow(8, n, M)) % M))
| false | 0 | [
"-print(((pow(10, n, M) - 2 * pow(9, n, M) + 8**n) % M))",
"+print(((pow(10, n, M) - 2 * pow(9, n, M) + pow(8, n, M)) % M))"
] | false | 0.049577 | 0.042586 | 1.164165 | [
"s616337953",
"s312217530"
] |
u671060652 | p02712 | python | s333980643 | s235531577 | 164 | 104 | 9,032 | 72,728 | Accepted | Accepted | 36.59 | N = int(eval(input()))
sum = 0
for i in range(1,N+1):
if not(i % 3 == 0 or i % 5 == 0):
sum += i
print(sum) | import itertools
import math
import fractions
import functools
n = int(eval(input()))
sum = 0
for i in range(1,n+1):
if not (i % 3 == 0 or i % 5 == 0):
sum += i
print(sum) | 7 | 10 | 115 | 186 | N = int(eval(input()))
sum = 0
for i in range(1, N + 1):
if not (i % 3 == 0 or i % 5 == 0):
sum += i
print(sum)
| import itertools
import math
import fractions
import functools
n = int(eval(input()))
sum = 0
for i in range(1, n + 1):
if not (i % 3 == 0 or i % 5 == 0):
sum += i
print(sum)
| false | 30 | [
"-N = int(eval(input()))",
"+import itertools",
"+import math",
"+import fractions",
"+import functools",
"+",
"+n = int(eval(input()))",
"-for i in range(1, N + 1):",
"+for i in range(1, n + 1):"
] | false | 0.113105 | 0.164797 | 0.686332 | [
"s333980643",
"s235531577"
] |
u103902792 | p02836 | python | s393229697 | s976579250 | 164 | 18 | 38,256 | 2,940 | Accepted | Accepted | 89.02 | s = eval(input())
ans = 0
for i in range(len(s)//2):
if s[i] != s[-(i+1)]:
ans += 1
print(ans) | s = eval(input())
t = s[::-1]
ans = 0
for i in range(len(s)):
if s[i]!=t[i]:
ans += 1
print((ans//2)) | 6 | 7 | 99 | 105 | s = eval(input())
ans = 0
for i in range(len(s) // 2):
if s[i] != s[-(i + 1)]:
ans += 1
print(ans)
| s = eval(input())
t = s[::-1]
ans = 0
for i in range(len(s)):
if s[i] != t[i]:
ans += 1
print((ans // 2))
| false | 14.285714 | [
"+t = s[::-1]",
"-for i in range(len(s) // 2):",
"- if s[i] != s[-(i + 1)]:",
"+for i in range(len(s)):",
"+ if s[i] != t[i]:",
"-print(ans)",
"+print((ans // 2))"
] | false | 0.036275 | 0.034932 | 1.03843 | [
"s393229697",
"s976579250"
] |
u193598069 | p03012 | python | s962029892 | s178005248 | 20 | 17 | 3,060 | 3,060 | Accepted | Accepted | 15 | N = int(eval(input()))
S = list(map(int, input().split()))
ans = 10000
for T in range(1, N):
s1 = 0
s2 = 0
for i in range(len(S)):
if i+1 <= T:
s1 += S[i]
if i+1 > T:
s2 += S[i]
if abs(s1 - s2) < ans:
ans = abs(s1 - s2)
print (ans)
| N = int(eval(input()))
S = list(map(int, input().split()))
ans = 10000
for T in range(1, N):
s1 = sum(S[:T+1])
s2 = sum(S[T+1:])
diff = abs(s1 - s2)
if diff < ans:
ans = diff
print (ans)
| 18 | 15 | 319 | 232 | N = int(eval(input()))
S = list(map(int, input().split()))
ans = 10000
for T in range(1, N):
s1 = 0
s2 = 0
for i in range(len(S)):
if i + 1 <= T:
s1 += S[i]
if i + 1 > T:
s2 += S[i]
if abs(s1 - s2) < ans:
ans = abs(s1 - s2)
print(ans)
| N = int(eval(input()))
S = list(map(int, input().split()))
ans = 10000
for T in range(1, N):
s1 = sum(S[: T + 1])
s2 = sum(S[T + 1 :])
diff = abs(s1 - s2)
if diff < ans:
ans = diff
print(ans)
| false | 16.666667 | [
"- s1 = 0",
"- s2 = 0",
"- for i in range(len(S)):",
"- if i + 1 <= T:",
"- s1 += S[i]",
"- if i + 1 > T:",
"- s2 += S[i]",
"- if abs(s1 - s2) < ans:",
"- ans = abs(s1 - s2)",
"+ s1 = sum(S[: T + 1])",
"+ s2 = sum(S[T + 1 :])",
"+ ... | false | 0.039525 | 0.039754 | 0.994236 | [
"s962029892",
"s178005248"
] |
u977697682 | p02624 | python | s507947855 | s511543417 | 29 | 26 | 9,096 | 9,148 | Accepted | Accepted | 10.34 | N = int(eval(input()))
s=k=kn=0;n=N
while k<n:
k += 1
n = N//k
kn = k*n*(n+1)
s += 4*kn
s -= (k+1)*kn
if n<k:
s -= 2*kn
print((s//4))
| N = int(eval(input()))
s=k=0;n=N
while k<n:
k += 1
n = N//k
s += k*n*(n+1)
knn = k*n*(n+1)//2
s -= (k+1)*knn//2
if n<k:
s -= knn
print(s)
| 12 | 13 | 144 | 150 | N = int(eval(input()))
s = k = kn = 0
n = N
while k < n:
k += 1
n = N // k
kn = k * n * (n + 1)
s += 4 * kn
s -= (k + 1) * kn
if n < k:
s -= 2 * kn
print((s // 4))
| N = int(eval(input()))
s = k = 0
n = N
while k < n:
k += 1
n = N // k
s += k * n * (n + 1)
knn = k * n * (n + 1) // 2
s -= (k + 1) * knn // 2
if n < k:
s -= knn
print(s)
| false | 7.692308 | [
"-s = k = kn = 0",
"+s = k = 0",
"- kn = k * n * (n + 1)",
"- s += 4 * kn",
"-s -= (k + 1) * kn",
"+ s += k * n * (n + 1)",
"+knn = k * n * (n + 1) // 2",
"+s -= (k + 1) * knn // 2",
"- s -= 2 * kn",
"-print((s // 4))",
"+ s -= knn",
"+print(s)"
] | false | 0.0418 | 0.034912 | 1.19727 | [
"s507947855",
"s511543417"
] |
u144913062 | p02758 | python | s708524476 | s161336012 | 1,066 | 807 | 123,688 | 112,808 | Accepted | Accepted | 24.3 | from heapq import heappush, heappop
import sys
input = sys.stdin.readline
mod = 998244353
N = int(eval(input()))
XD = [tuple(map(int, input().split())) for _ in range(N)]
XD.sort(key=lambda x : x[0])
children = [[] for _ in range(N)]
pq = []
for i, (x, d) in list(enumerate(XD))[::-1]:
while pq and pq[0][0] < x + d:
y, j = heappop(pq)
children[i].append(j)
heappush(pq, (x, i))
val = [0] * N
for i in range(N)[::-1]:
res = 1
for j in children[i]:
res = res * val[j] % mod
val[i] = res + 1
ans = 1
while pq:
x, i = heappop(pq)
ans = ans * val[i] % mod
print(ans) | import sys
input = sys.stdin.readline
mod = 998244353
N = int(eval(input()))
XD = [tuple(map(int, input().split())) for _ in range(N)]
XD.sort(key=lambda x : x[0])
children = [[] for _ in range(N)]
stack = []
for i, (x, d) in list(enumerate(XD))[::-1]:
while stack and stack[-1][0] < x + d:
y, j = stack.pop()
children[i].append(j)
stack.append((x, i))
val = [0] * N
for i in range(N)[::-1]:
res = 1
for j in children[i]:
res = res * val[j] % mod
val[i] = res + 1
ans = 1
for x, i in stack:
ans = ans * val[i] % mod
print(ans) | 26 | 24 | 634 | 592 | from heapq import heappush, heappop
import sys
input = sys.stdin.readline
mod = 998244353
N = int(eval(input()))
XD = [tuple(map(int, input().split())) for _ in range(N)]
XD.sort(key=lambda x: x[0])
children = [[] for _ in range(N)]
pq = []
for i, (x, d) in list(enumerate(XD))[::-1]:
while pq and pq[0][0] < x + d:
y, j = heappop(pq)
children[i].append(j)
heappush(pq, (x, i))
val = [0] * N
for i in range(N)[::-1]:
res = 1
for j in children[i]:
res = res * val[j] % mod
val[i] = res + 1
ans = 1
while pq:
x, i = heappop(pq)
ans = ans * val[i] % mod
print(ans)
| import sys
input = sys.stdin.readline
mod = 998244353
N = int(eval(input()))
XD = [tuple(map(int, input().split())) for _ in range(N)]
XD.sort(key=lambda x: x[0])
children = [[] for _ in range(N)]
stack = []
for i, (x, d) in list(enumerate(XD))[::-1]:
while stack and stack[-1][0] < x + d:
y, j = stack.pop()
children[i].append(j)
stack.append((x, i))
val = [0] * N
for i in range(N)[::-1]:
res = 1
for j in children[i]:
res = res * val[j] % mod
val[i] = res + 1
ans = 1
for x, i in stack:
ans = ans * val[i] % mod
print(ans)
| false | 7.692308 | [
"-from heapq import heappush, heappop",
"-pq = []",
"+stack = []",
"- while pq and pq[0][0] < x + d:",
"- y, j = heappop(pq)",
"+ while stack and stack[-1][0] < x + d:",
"+ y, j = stack.pop()",
"- heappush(pq, (x, i))",
"+ stack.append((x, i))",
"-while pq:",
"- x, i... | false | 0.048754 | 0.039804 | 1.224833 | [
"s708524476",
"s161336012"
] |
u539362921 | p02982 | python | s749204499 | s292810387 | 151 | 19 | 12,488 | 3,188 | Accepted | Accepted | 87.42 | import numpy as np
N,D = list(map(int,input().split()))
X = []
for n in range(N):
X.append(list(map(int,input().split())))
#N個のリスト入力を受け取る
cnt = 0
for i in range(N):
for j in range(i+1,N):
d = 0
for k in range(D):
d += (X[i][k]-X[j][k])**2
d = d**0.5
if d.is_integer() :
cnt += 1
print(cnt) | N,D = list(map(int,input().split()))
X = []
for n in range(N):
X.append(list(map(int,input().split())))
#N個のリスト入力を受け取る
cnt = 0
for i in range(N):
for j in range(i+1,N):
d = 0
for k in range(D):
d += (X[i][k]-X[j][k])**2
d = d**0.5
if d.is_integer() :
cnt += 1
print(cnt) | 20 | 18 | 376 | 354 | import numpy as np
N, D = list(map(int, input().split()))
X = []
for n in range(N):
X.append(list(map(int, input().split())))
# N個のリスト入力を受け取る
cnt = 0
for i in range(N):
for j in range(i + 1, N):
d = 0
for k in range(D):
d += (X[i][k] - X[j][k]) ** 2
d = d**0.5
if d.is_integer():
cnt += 1
print(cnt)
| N, D = list(map(int, input().split()))
X = []
for n in range(N):
X.append(list(map(int, input().split())))
# N個のリスト入力を受け取る
cnt = 0
for i in range(N):
for j in range(i + 1, N):
d = 0
for k in range(D):
d += (X[i][k] - X[j][k]) ** 2
d = d**0.5
if d.is_integer():
cnt += 1
print(cnt)
| false | 10 | [
"-import numpy as np",
"-"
] | false | 0.036259 | 0.042143 | 0.860386 | [
"s749204499",
"s292810387"
] |
u350093546 | p02713 | python | s409854027 | s506964505 | 1,178 | 64 | 9,068 | 62,136 | Accepted | Accepted | 94.57 | from math import gcd
k=int(eval(input()))
cnt=0
for i in range(1,k+1):
for j in range(1,k+1):
a=gcd(i,j)
for k in range(1,k+1):
cnt+=gcd(a,k)
print(cnt)
| k=int(eval(input()))
n=3
mod=10**9+7
lst=[0]*(k+1)
ans=0
for i in range(k,0,-1):
lst[i]+=pow(k//i,n,mod)
if k//i==1:
continue
else:
for j in range(2,k//i+1):
lst[i]-=lst[i*j]
for i in range(1,k+1):
ans+=(i*lst[i])%mod
ans%=mod
print(ans) | 9 | 19 | 171 | 284 | from math import gcd
k = int(eval(input()))
cnt = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
a = gcd(i, j)
for k in range(1, k + 1):
cnt += gcd(a, k)
print(cnt)
| k = int(eval(input()))
n = 3
mod = 10**9 + 7
lst = [0] * (k + 1)
ans = 0
for i in range(k, 0, -1):
lst[i] += pow(k // i, n, mod)
if k // i == 1:
continue
else:
for j in range(2, k // i + 1):
lst[i] -= lst[i * j]
for i in range(1, k + 1):
ans += (i * lst[i]) % mod
ans %= mod
print(ans)
| false | 52.631579 | [
"-from math import gcd",
"-",
"-cnt = 0",
"+n = 3",
"+mod = 10**9 + 7",
"+lst = [0] * (k + 1)",
"+ans = 0",
"+for i in range(k, 0, -1):",
"+ lst[i] += pow(k // i, n, mod)",
"+ if k // i == 1:",
"+ continue",
"+ else:",
"+ for j in range(2, k // i + 1):",
"+ ... | false | 0.150296 | 0.036283 | 4.142284 | [
"s409854027",
"s506964505"
] |
u864197622 | p02756 | python | s681812562 | s213127951 | 484 | 263 | 6,268 | 6,252 | Accepted | Accepted | 45.66 | S = eval(input())
L = []
R = []
rev = 0
for _ in range(int(eval(input()))):
A = input().split()
if A[0] == "1":
rev ^= 1
else:
if (int(A[1]) ^ rev) & 1:
L.append(A[2])
else:
R.append(A[2])
if rev:
print(("".join(R[::-1]) + S[::-1] + "".join(L)))
else:
print(("".join(L[::-1]) + S + "".join(R))) | import sys
input = lambda: sys.stdin.readline().rstrip()
S = eval(input())
L = []
R = []
rev = 0
for _ in range(int(eval(input()))):
A = input().split()
if A[0] == "1":
rev ^= 1
else:
if (int(A[1]) ^ rev) & 1:
L.append(A[2])
else:
R.append(A[2])
if rev:
print(("".join(R[::-1]) + S[::-1] + "".join(L)))
else:
print(("".join(L[::-1]) + S + "".join(R)))
| 18 | 21 | 364 | 426 | S = eval(input())
L = []
R = []
rev = 0
for _ in range(int(eval(input()))):
A = input().split()
if A[0] == "1":
rev ^= 1
else:
if (int(A[1]) ^ rev) & 1:
L.append(A[2])
else:
R.append(A[2])
if rev:
print(("".join(R[::-1]) + S[::-1] + "".join(L)))
else:
print(("".join(L[::-1]) + S + "".join(R)))
| import sys
input = lambda: sys.stdin.readline().rstrip()
S = eval(input())
L = []
R = []
rev = 0
for _ in range(int(eval(input()))):
A = input().split()
if A[0] == "1":
rev ^= 1
else:
if (int(A[1]) ^ rev) & 1:
L.append(A[2])
else:
R.append(A[2])
if rev:
print(("".join(R[::-1]) + S[::-1] + "".join(L)))
else:
print(("".join(L[::-1]) + S + "".join(R)))
| false | 14.285714 | [
"+import sys",
"+",
"+input = lambda: sys.stdin.readline().rstrip()"
] | false | 0.034381 | 0.077198 | 0.44536 | [
"s681812562",
"s213127951"
] |
u074220993 | p03449 | python | s853663451 | s235780105 | 115 | 31 | 27,216 | 9,076 | Accepted | Accepted | 73.04 | N = int(eval(input()))
import numpy as np
A = np.array([[int(x) for x in input().split()],[int(x) for x in input().split()]], dtype='int64')
A = A.cumsum(axis=1)
Ans = [A[0,i]+A[1,N-1]-A[1,i-1] if i > 0 else A[0,i]+A[1,N-1] for i in range(N)]
print((max(Ans))) |
def main():
with open(0) as f:
N = int(f.readline())
A = list(map(int, f.readline().split()))
B = list(map(int, f.readline().split()))
ans = max([sum(A[:i+1]+B[i:]) for i in range(N)])
print(ans)
main() | 6 | 11 | 257 | 251 | N = int(eval(input()))
import numpy as np
A = np.array(
[[int(x) for x in input().split()], [int(x) for x in input().split()]],
dtype="int64",
)
A = A.cumsum(axis=1)
Ans = [
A[0, i] + A[1, N - 1] - A[1, i - 1] if i > 0 else A[0, i] + A[1, N - 1]
for i in range(N)
]
print((max(Ans)))
| def main():
with open(0) as f:
N = int(f.readline())
A = list(map(int, f.readline().split()))
B = list(map(int, f.readline().split()))
ans = max([sum(A[: i + 1] + B[i:]) for i in range(N)])
print(ans)
main()
| false | 45.454545 | [
"-N = int(eval(input()))",
"-import numpy as np",
"+def main():",
"+ with open(0) as f:",
"+ N = int(f.readline())",
"+ A = list(map(int, f.readline().split()))",
"+ B = list(map(int, f.readline().split()))",
"+ ans = max([sum(A[: i + 1] + B[i:]) for i in range(N)])",
"+ ... | false | 0.186462 | 0.035958 | 5.185562 | [
"s853663451",
"s235780105"
] |
u606045429 | p02556 | python | s205424453 | s286320776 | 679 | 619 | 55,056 | 54,960 | Accepted | Accepted | 8.84 | N, *XY = list(map(int, open(0).read().split()))
XY = [(x, y) for x, y in zip(*[iter(XY)] * 2)]
XY = list(set(XY))
Ax, Ay = max(XY, key=lambda t: t[0] + t[1])
Bx, By = max(XY, key=lambda t: -t[0] + t[1])
Cx, Cy = max(XY, key=lambda t: t[0] - t[1])
Dx, Dy = max(XY, key=lambda t: -t[0] - t[1])
ans = 0
for x, y in XY:
ans = max(
ans,
abs(x - Ax) + abs(y - Ay),
abs(x - Bx) + abs(y - By),
abs(x - Cx) + abs(y - Cy),
abs(x - Dx) + abs(y - Dy),
)
print(ans) | N, *XY = list(map(int, open(0).read().split()))
XY = [(x, y) for x, y in zip(*[iter(XY)] * 2)]
XY = list(set(XY))
Ax, Ay = max(XY, key=lambda t: t[0] + t[1])
Bx, By = max(XY, key=lambda t: -t[0] + t[1])
Cx, Cy = max(XY, key=lambda t: t[0] - t[1])
Dx, Dy = max(XY, key=lambda t: -t[0] - t[1])
print((max(
max(abs(x - Ax) + abs(y - Ay),
abs(x - Bx) + abs(y - By),
abs(x - Cx) + abs(y - Cy),
abs(x - Dx) + abs(y - Dy),
) for x, y in XY
))) | 21 | 17 | 518 | 479 | N, *XY = list(map(int, open(0).read().split()))
XY = [(x, y) for x, y in zip(*[iter(XY)] * 2)]
XY = list(set(XY))
Ax, Ay = max(XY, key=lambda t: t[0] + t[1])
Bx, By = max(XY, key=lambda t: -t[0] + t[1])
Cx, Cy = max(XY, key=lambda t: t[0] - t[1])
Dx, Dy = max(XY, key=lambda t: -t[0] - t[1])
ans = 0
for x, y in XY:
ans = max(
ans,
abs(x - Ax) + abs(y - Ay),
abs(x - Bx) + abs(y - By),
abs(x - Cx) + abs(y - Cy),
abs(x - Dx) + abs(y - Dy),
)
print(ans)
| N, *XY = list(map(int, open(0).read().split()))
XY = [(x, y) for x, y in zip(*[iter(XY)] * 2)]
XY = list(set(XY))
Ax, Ay = max(XY, key=lambda t: t[0] + t[1])
Bx, By = max(XY, key=lambda t: -t[0] + t[1])
Cx, Cy = max(XY, key=lambda t: t[0] - t[1])
Dx, Dy = max(XY, key=lambda t: -t[0] - t[1])
print(
(
max(
max(
abs(x - Ax) + abs(y - Ay),
abs(x - Bx) + abs(y - By),
abs(x - Cx) + abs(y - Cy),
abs(x - Dx) + abs(y - Dy),
)
for x, y in XY
)
)
)
| false | 19.047619 | [
"-ans = 0",
"-for x, y in XY:",
"- ans = max(",
"- ans,",
"- abs(x - Ax) + abs(y - Ay),",
"- abs(x - Bx) + abs(y - By),",
"- abs(x - Cx) + abs(y - Cy),",
"- abs(x - Dx) + abs(y - Dy),",
"+print(",
"+ (",
"+ max(",
"+ max(",
"+ ... | false | 0.037595 | 0.086822 | 0.433011 | [
"s205424453",
"s286320776"
] |
u638057737 | p03480 | python | s851663738 | s588666530 | 74 | 63 | 3,188 | 3,188 | Accepted | Accepted | 14.86 | S = eval(input())
ans = len(S)
for i in range(len(S) - 1):
if S[i] != S[i+1]:
ans = min(max(len(S) - i - 1, i + 1),ans)
print(ans)
| S = eval(input())
L = len(S)
ans = L
for i in range(L - 1):
if S[i] != S[i+1]:
ans = min(max(L - i - 1, i + 1),ans)
print(ans)
| 7 | 8 | 144 | 141 | S = eval(input())
ans = len(S)
for i in range(len(S) - 1):
if S[i] != S[i + 1]:
ans = min(max(len(S) - i - 1, i + 1), ans)
print(ans)
| S = eval(input())
L = len(S)
ans = L
for i in range(L - 1):
if S[i] != S[i + 1]:
ans = min(max(L - i - 1, i + 1), ans)
print(ans)
| false | 12.5 | [
"-ans = len(S)",
"-for i in range(len(S) - 1):",
"+L = len(S)",
"+ans = L",
"+for i in range(L - 1):",
"- ans = min(max(len(S) - i - 1, i + 1), ans)",
"+ ans = min(max(L - i - 1, i + 1), ans)"
] | false | 0.038035 | 0.037215 | 1.02205 | [
"s851663738",
"s588666530"
] |
u645250356 | p03163 | python | s765104166 | s490540782 | 567 | 371 | 128,260 | 67,304 | Accepted | Accepted | 34.57 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n,w = inpl()
wei = [0] * n
val = [0] * n
for i in range(n):
wei[i],val[i] = inpl()
dp = [[0]*(w+5) for i in range(n+5)]
for i in range(n):
for j in range(w+1):
if wei[i] > j:
dp[i+1][j] = dp[i][j]
continue
dp[i+1][j] = max(dp[i+1][j], dp[i][j-wei[i]]+val[i], dp[i][j])
print((dp[n][w])) | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n,W = inpl()
wv = [inpl() for _ in range(n)]
dp = [0] * (W+1)
for i in range(n):
w,v = wv[i]
for j in range(w,W+1)[::-1]:
dp[j] = max(dp[j], dp[j-w] + v)
print((dp[W])) | 25 | 17 | 759 | 512 | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
mod2 = 998244353
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpln(n):
return list(int(sys.stdin.readline()) for i in range(n))
n, w = inpl()
wei = [0] * n
val = [0] * n
for i in range(n):
wei[i], val[i] = inpl()
dp = [[0] * (w + 5) for i in range(n + 5)]
for i in range(n):
for j in range(w + 1):
if wei[i] > j:
dp[i + 1][j] = dp[i][j]
continue
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - wei[i]] + val[i], dp[i][j])
print((dp[n][w]))
| from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
n, W = inpl()
wv = [inpl() for _ in range(n)]
dp = [0] * (W + 1)
for i in range(n):
w, v = wv[i]
for j in range(w, W + 1)[::-1]:
dp[j] = max(dp[j], dp[j - w] + v)
print((dp[W]))
| false | 32 | [
"-mod2 = 998244353",
"-def inpln(n):",
"- return list(int(sys.stdin.readline()) for i in range(n))",
"-",
"-",
"-n, w = inpl()",
"-wei = [0] * n",
"-val = [0] * n",
"+n, W = inpl()",
"+wv = [inpl() for _ in range(n)]",
"+dp = [0] * (W + 1)",
"- wei[i], val[i] = inpl()",
"-dp = [[0] * (... | false | 0.033375 | 0.111393 | 0.299618 | [
"s765104166",
"s490540782"
] |
u270681687 | p03324 | python | s839510251 | s568731192 | 20 | 17 | 3,060 | 3,064 | Accepted | Accepted | 15 | d, n = list(map(int, input().split()))
if d == 0:
if n <= 99:
print(n)
else:
print((101))
elif d == 1:
if n <= 99:
print((100 * n))
else:
print((10100))
else:
if n <= 99:
print((10000 * n))
else:
print((1010000)) | d, n = list(map(int, input().split()))
if d == 0:
if n < 100:
print(n)
else:
print((101))
elif d == 1:
if n < 100:
print((100 * n))
else:
print((10100))
else:
if n < 100:
print((10000 * n))
else:
print((1010000)) | 17 | 17 | 285 | 285 | d, n = list(map(int, input().split()))
if d == 0:
if n <= 99:
print(n)
else:
print((101))
elif d == 1:
if n <= 99:
print((100 * n))
else:
print((10100))
else:
if n <= 99:
print((10000 * n))
else:
print((1010000))
| d, n = list(map(int, input().split()))
if d == 0:
if n < 100:
print(n)
else:
print((101))
elif d == 1:
if n < 100:
print((100 * n))
else:
print((10100))
else:
if n < 100:
print((10000 * n))
else:
print((1010000))
| false | 0 | [
"- if n <= 99:",
"+ if n < 100:",
"- if n <= 99:",
"+ if n < 100:",
"- if n <= 99:",
"+ if n < 100:"
] | false | 0.062027 | 0.078229 | 0.792896 | [
"s839510251",
"s568731192"
] |
u830462928 | p03073 | python | s305456898 | s408788259 | 85 | 51 | 5,544 | 4,652 | Accepted | Accepted | 40 | s = list(eval(input()))
count1 = 0
s_copy = s.copy()
for i in range(len(s)-1):
if s[i] == s[i+1]:
count1 += 1
if s[i+1] == '0':
s[i+1] = '1'
else:
s[i+1] = '0'
s = s_copy.copy()
s.reverse()
count2 = 0
for i in range(len(s)-1):
if s[i] == s[i+1]:
count2 += 1
if s[i+1] == '0':
s[i+1] = '1'
else:
s[i+1] = '0'
print((min(count1,count2))) | s = list(eval(input()))
count1 = 0
s_copy = s.copy()
for i in range(len(s)-1):
if s[i] == s[i+1]:
count1 += 1
if s[i+1] == '0':
s[i+1] = '1'
else:
s[i+1] = '0'
print(count1) | 21 | 11 | 451 | 229 | s = list(eval(input()))
count1 = 0
s_copy = s.copy()
for i in range(len(s) - 1):
if s[i] == s[i + 1]:
count1 += 1
if s[i + 1] == "0":
s[i + 1] = "1"
else:
s[i + 1] = "0"
s = s_copy.copy()
s.reverse()
count2 = 0
for i in range(len(s) - 1):
if s[i] == s[i + 1]:
count2 += 1
if s[i + 1] == "0":
s[i + 1] = "1"
else:
s[i + 1] = "0"
print((min(count1, count2)))
| s = list(eval(input()))
count1 = 0
s_copy = s.copy()
for i in range(len(s) - 1):
if s[i] == s[i + 1]:
count1 += 1
if s[i + 1] == "0":
s[i + 1] = "1"
else:
s[i + 1] = "0"
print(count1)
| false | 47.619048 | [
"-s = s_copy.copy()",
"-s.reverse()",
"-count2 = 0",
"-for i in range(len(s) - 1):",
"- if s[i] == s[i + 1]:",
"- count2 += 1",
"- if s[i + 1] == \"0\":",
"- s[i + 1] = \"1\"",
"- else:",
"- s[i + 1] = \"0\"",
"-print((min(count1, count2)))",
"+pri... | false | 0.03935 | 0.038601 | 1.019402 | [
"s305456898",
"s408788259"
] |
u466161487 | p02708 | python | s132850524 | s159710390 | 106 | 88 | 9,160 | 9,148 | Accepted | Accepted | 16.98 | a,b=(int(x) for x in input().split())
z=0
while b<=a+1:z=(z+(a-b+1)*b+1)%int(1e9+7);b+=1
print(z) | a,b=(int(x)for x in input().split())
z=0
while b<=a+1:z=(z+(a-b+1)*b+1)%(10**9+7);b+=1
print(z) | 4 | 4 | 100 | 98 | a, b = (int(x) for x in input().split())
z = 0
while b <= a + 1:
z = (z + (a - b + 1) * b + 1) % int(1e9 + 7)
b += 1
print(z)
| a, b = (int(x) for x in input().split())
z = 0
while b <= a + 1:
z = (z + (a - b + 1) * b + 1) % (10**9 + 7)
b += 1
print(z)
| false | 0 | [
"- z = (z + (a - b + 1) * b + 1) % int(1e9 + 7)",
"+ z = (z + (a - b + 1) * b + 1) % (10**9 + 7)"
] | false | 0.217724 | 0.169172 | 1.286996 | [
"s132850524",
"s159710390"
] |
u564589929 | p02838 | python | s024894135 | s007243682 | 1,991 | 338 | 42,156 | 48,860 | Accepted | Accepted | 83.02 | # import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solve():
n = II()
A = LI()
# print([bin(a) for a in A])
mod = 1000000007
ans = 0
for i in range(0, 61):
# i桁目が1の個数を数える
x = 0
for a in A:
if (a >> i) & 1:
x += 1
y = n - x # i桁目が0の個数
# print(i, x, y)
# XORなので x*y 通りの組み合わせ
ans = ans + pow(2, i) * x * y % mod
print((ans % mod))
if __name__ == '__main__':
solve()
| # import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
import numpy as np
def solve():
n = II()
A = np.array(LI())
# print([bin(a) for a in A])
mod = 1000000007
ans = 0
for i in range(0, 61):
# i桁目が1の個数を数える
x = np.count_nonzero((A >> i) & 1)
y = n - x # i桁目が0の個数
# print(i, x, y)
# XORなので x*y 通りの組み合わせ
ans = ans + pow(2, i) * x * y % mod
# A = A >> 1
print((ans % mod))
if __name__ == '__main__':
solve()
| 34 | 33 | 780 | 786 | # import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MI1():
return list(map(int1, input().split()))
def LI():
return list(map(int, input().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
def solve():
n = II()
A = LI()
# print([bin(a) for a in A])
mod = 1000000007
ans = 0
for i in range(0, 61):
# i桁目が1の個数を数える
x = 0
for a in A:
if (a >> i) & 1:
x += 1
y = n - x # i桁目が0の個数
# print(i, x, y)
# XORなので x*y 通りの組み合わせ
ans = ans + pow(2, i) * x * y % mod
print((ans % mod))
if __name__ == "__main__":
solve()
| # import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MI1():
return list(map(int1, input().split()))
def LI():
return list(map(int, input().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
import numpy as np
def solve():
n = II()
A = np.array(LI())
# print([bin(a) for a in A])
mod = 1000000007
ans = 0
for i in range(0, 61):
# i桁目が1の個数を数える
x = np.count_nonzero((A >> i) & 1)
y = n - x # i桁目が0の個数
# print(i, x, y)
# XORなので x*y 通りの組み合わせ
ans = ans + pow(2, i) * x * y % mod
# A = A >> 1
print((ans % mod))
if __name__ == "__main__":
solve()
| false | 2.941176 | [
"+import numpy as np",
"+",
"+",
"- A = LI()",
"+ A = np.array(LI())",
"- x = 0",
"- for a in A:",
"- if (a >> i) & 1:",
"- x += 1",
"+ x = np.count_nonzero((A >> i) & 1)",
"+ # A = A >> 1"
] | false | 0.040477 | 0.328793 | 0.123107 | [
"s024894135",
"s007243682"
] |
u864197622 | p02757 | python | s303220286 | s935527840 | 464 | 305 | 3,556 | 42,060 | Accepted | Accepted | 34.27 | def calc(S, P):
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
return ans
else:
C = [0] * P
C[0] = 1
a = 0
for i, s in enumerate(S[::-1]):
a = (a + int(s) * pow(10, i, P)) % P
ans += C[a]
C[a] += 1
return ans
N, P = list(map(int, input().split()))
S = eval(input())
print((calc(S, P))) | N, P = list(map(int, input().split()))
S = eval(input())
ans = 0
C = [0] * P
C[0] = 1
a = 0
if P in (2, 5):
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
print(ans)
else:
for i, s in enumerate(S[::-1]):
a = (a + int(s) * pow(10, i, P)) % P
ans += C[a]
C[a] += 1
print(ans) | 20 | 17 | 464 | 349 | def calc(S, P):
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
return ans
else:
C = [0] * P
C[0] = 1
a = 0
for i, s in enumerate(S[::-1]):
a = (a + int(s) * pow(10, i, P)) % P
ans += C[a]
C[a] += 1
return ans
N, P = list(map(int, input().split()))
S = eval(input())
print((calc(S, P)))
| N, P = list(map(int, input().split()))
S = eval(input())
ans = 0
C = [0] * P
C[0] = 1
a = 0
if P in (2, 5):
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
print(ans)
else:
for i, s in enumerate(S[::-1]):
a = (a + int(s) * pow(10, i, P)) % P
ans += C[a]
C[a] += 1
print(ans)
| false | 15 | [
"-def calc(S, P):",
"- ans = 0",
"- if P == 2 or P == 5:",
"- for i, s in enumerate(S):",
"- if int(s) % P == 0:",
"- ans += i + 1",
"- return ans",
"- else:",
"- C = [0] * P",
"- C[0] = 1",
"- a = 0",
"- for i, s in ... | false | 0.044485 | 0.039518 | 1.125697 | [
"s303220286",
"s935527840"
] |
u979591106 | p02658 | python | s892647966 | s403487667 | 59 | 53 | 21,648 | 21,796 | Accepted | Accepted | 10.17 | from sys import stdin
N = int(stdin.readline().rstrip())
data = list(map(int,input().split()))
count =data[0]
data.remove(data[0])
if 0 in data:
print((0))
else:
for _ in data:
if count ==0:
break
elif count <= 10**18:
count *= _
if count ==0:
print((0))
elif count <= 10**18:
print(count)
else:
print((-1)) | from sys import stdin
N = int(stdin.readline().rstrip())
data = list(map(int,input().split()))
count =data[0]
data.remove(data[0])
if 0 in data:
print((0))
else:
for _ in data:
if count ==0:
break
elif count <= 10**18:
count *= _
if count <= 10**18:
print(count)
else:
print((-1)) | 25 | 21 | 415 | 372 | from sys import stdin
N = int(stdin.readline().rstrip())
data = list(map(int, input().split()))
count = data[0]
data.remove(data[0])
if 0 in data:
print((0))
else:
for _ in data:
if count == 0:
break
elif count <= 10**18:
count *= _
if count == 0:
print((0))
elif count <= 10**18:
print(count)
else:
print((-1))
| from sys import stdin
N = int(stdin.readline().rstrip())
data = list(map(int, input().split()))
count = data[0]
data.remove(data[0])
if 0 in data:
print((0))
else:
for _ in data:
if count == 0:
break
elif count <= 10**18:
count *= _
if count <= 10**18:
print(count)
else:
print((-1))
| false | 16 | [
"- if count == 0:",
"- print((0))",
"- elif count <= 10**18:",
"+ if count <= 10**18:"
] | false | 0.038402 | 0.047569 | 0.807298 | [
"s892647966",
"s403487667"
] |
u761320129 | p03481 | python | s184003643 | s212182959 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | X,Y = list(map(int,input().split()))
ans = 0
while X <= Y:
X *= 2
ans += 1
print(ans) | X,Y = list(map(int,input().split()))
ans = 0
while X <= Y:
ans += 1
X *= 2
print(ans) | 6 | 6 | 92 | 92 | X, Y = list(map(int, input().split()))
ans = 0
while X <= Y:
X *= 2
ans += 1
print(ans)
| X, Y = list(map(int, input().split()))
ans = 0
while X <= Y:
ans += 1
X *= 2
print(ans)
| false | 0 | [
"+ ans += 1",
"- ans += 1"
] | false | 0.042191 | 0.041824 | 1.008765 | [
"s184003643",
"s212182959"
] |
u367701763 | p03164 | python | s477159195 | s837118348 | 208 | 119 | 148,920 | 74,368 | Accepted | Accepted | 42.79 | #####################################################################################################
##### ナップサック問題 （価値が小さい場合）
#####################################################################################################
"""
経路を状態の添え字に取るような事は無い
経路の末端の情報のみを横軸の添え字に取ることが多い
例：一年生 ⇒ k項目までの総和
パスタ ⇒ k日目に食べたパスタ
暑い日々⇒ k日目に着た服
DPテーブルにおいて、ある値以降の全てで 1 となる場合、
その値でDPテーブルを切ってしまって、
indexがその値を超えるごとに、DPテーブルの上限に +1 をしていくというアイデアで計算量を減らせる
例: https://atcoder.jp/contests/tdpc/submissions/14958104
初期条件を常に意識するように！
ベンチマーク
（重複なし）
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4641577#1
(重複あり)
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4641577#1
"""
import sys
input = sys.stdin.readline
M, W = list(map(int, input().split())) # M: 品物の種類 W: 重量制限
single = True # True = 重複なし
price_list = [0]
weight_list = [0]
for _ in range(M):
weight, price = list(map(int, input().split()))
price_list.append(price)
weight_list.append(weight)
################################################################################################################################################
V = sum(price_list)
dp_max = W + 1 # 総和重量の最大値
dp = [[dp_max] * (V + 1) for _ in range(M + 1)] # 左端と上端の境界条件で W, M を一個ずつ多めに取る
""" dp[item <= M ][weight <= V] = 価値を固定した時の"最小"重量 """
for item in range(M+1): # 左端の境界条件
dp[item][0] = 0 # 価値 0 を実現するのに必要な品物の個数は 0 個
# for weight in range(W+1): # 上端の境界条件
# dp[0][weight] = dp_min # 0 種類の品物で実現できる価値総額は存在しない （dpの初期化で自動的に課せる場合が多い）
for item in range(1,M+1): # 境界条件を除いた M 回のループ（※ f[item] = g.f[item-i] の漸化式なので、list index out of range となる）
for price in range(1, V+1):
if price < price_list[item]: # price (総価値) < price_list[item] (品物の価値) の時は無視してよい
dp[item][price] = dp[item - 1][price]
else:
temp = dp[item - single][price - price_list[item]] + weight_list[item] # single = True: 重複なし
if temp < dp[item-1][price]: # min(dp[item-1][price], temp)
dp[item][price] = temp
else:
dp[item][price] = dp[item-1][price]
print((max(price for price in range(V+1) if dp[M][price] <= W))) | def knapsack_price(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[price <= V] = 価値を固定した時の最小重量 """
V = sum(price_list)
dp_max = W+1
dp = [dp_max] * (V + 1)
dp[0] = 0 # 境界条件： 価値0 の時は重さは0
for item in range(N):
if single:
S = reversed(list(range(price_list[item], V + 1)))
else:
S = list(range(price_list[item], V + 1))
for price in S:
dp[price] = min2(dp[price], dp[price - price_list[item]] + weight_list[item])
return max(price for price in range(V+1) if dp[price] <= W)
#######################################################################################################
import sys
input = sys.stdin.readline
def max2(x, y):
""" pythonの組み込み関数 max は2変数に対しては遅い！！ """
if x > y:
return x
else:
return y
def min2(x, y):
""" pythonの組み込み関数 min は2変数に対しては遅い！！ """
if x < y:
return x
else:
return y
N, W = list(map(int, input().split())) # N: 品物の種類 W: 重量制限
price_list = []
weight_list = []
for _ in range(N):
""" price と weight が逆転して入力されている場合有り """
weight, price = list(map(int, input().split()))
price_list.append(price)
weight_list.append(weight)
print((knapsack_price(single=True))) | 71 | 52 | 2,578 | 1,348 | #####################################################################################################
##### ナップサック問題 （価値が小さい場合）
#####################################################################################################
"""
経路を状態の添え字に取るような事は無い
経路の末端の情報のみを横軸の添え字に取ることが多い
例：一年生 ⇒ k項目までの総和
パスタ ⇒ k日目に食べたパスタ
暑い日々⇒ k日目に着た服
DPテーブルにおいて、ある値以降の全てで 1 となる場合、
その値でDPテーブルを切ってしまって、
indexがその値を超えるごとに、DPテーブルの上限に +1 をしていくというアイデアで計算量を減らせる
例: https://atcoder.jp/contests/tdpc/submissions/14958104
初期条件を常に意識するように！
ベンチマーク
（重複なし）
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4641577#1
(重複あり)
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4641577#1
"""
import sys
input = sys.stdin.readline
M, W = list(map(int, input().split())) # M: 品物の種類 W: 重量制限
single = True # True = 重複なし
price_list = [0]
weight_list = [0]
for _ in range(M):
weight, price = list(map(int, input().split()))
price_list.append(price)
weight_list.append(weight)
################################################################################################################################################
V = sum(price_list)
dp_max = W + 1 # 総和重量の最大値
dp = [[dp_max] * (V + 1) for _ in range(M + 1)] # 左端と上端の境界条件で W, M を一個ずつ多めに取る
""" dp[item <= M ][weight <= V] = 価値を固定した時の"最小"重量 """
for item in range(M + 1): # 左端の境界条件
dp[item][0] = 0 # 価値 0 を実現するのに必要な品物の個数は 0 個
# for weight in range(W+1): # 上端の境界条件
# dp[0][weight] = dp_min # 0 種類の品物で実現できる価値総額は存在しない （dpの初期化で自動的に課せる場合が多い）
for item in range(
1, M + 1
): # 境界条件を除いた M 回のループ（※ f[item] = g.f[item-i] の漸化式なので、list index out of range となる）
for price in range(1, V + 1):
if price < price_list[item]: # price (総価値) < price_list[item] (品物の価値) の時は無視してよい
dp[item][price] = dp[item - 1][price]
else:
temp = (
dp[item - single][price - price_list[item]] + weight_list[item]
) # single = True: 重複なし
if temp < dp[item - 1][price]: # min(dp[item-1][price], temp)
dp[item][price] = temp
else:
dp[item][price] = dp[item - 1][price]
print((max(price for price in range(V + 1) if dp[M][price] <= W)))
| def knapsack_price(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[price <= V] = 価値を固定した時の最小重量 """
V = sum(price_list)
dp_max = W + 1
dp = [dp_max] * (V + 1)
dp[0] = 0 # 境界条件： 価値0 の時は重さは0
for item in range(N):
if single:
S = reversed(list(range(price_list[item], V + 1)))
else:
S = list(range(price_list[item], V + 1))
for price in S:
dp[price] = min2(
dp[price], dp[price - price_list[item]] + weight_list[item]
)
return max(price for price in range(V + 1) if dp[price] <= W)
#######################################################################################################
import sys
input = sys.stdin.readline
def max2(x, y):
"""pythonの組み込み関数 max は2変数に対しては遅い！！"""
if x > y:
return x
else:
return y
def min2(x, y):
"""pythonの組み込み関数 min は2変数に対しては遅い！！"""
if x < y:
return x
else:
return y
N, W = list(map(int, input().split())) # N: 品物の種類 W: 重量制限
price_list = []
weight_list = []
for _ in range(N):
"""price と weight が逆転して入力されている場合有り"""
weight, price = list(map(int, input().split()))
price_list.append(price)
weight_list.append(weight)
print((knapsack_price(single=True)))
| false | 26.760563 | [
"-#####################################################################################################",
"-##### ナップサック問題 （価値が小さい場合）",
"-#####################################################################################################",
"-\"\"\"",
"-経路を状態の添え字に取るような事は無い",
"-経路の末端の情報のみを横軸の添え字に取ることが多い",... | false | 0.043157 | 0.04142 | 1.041924 | [
"s477159195",
"s837118348"
] |
u350412774 | p02984 | python | s596293307 | s549942687 | 158 | 130 | 14,092 | 14,092 | Accepted | Accepted | 17.72 | N = int(eval(input()))
a = list(map(int, input().split()))
c = 0
for idx, i in enumerate(a):
if idx %2 ==0:
c += i
else:
c -= i
x1 = c
print(x1)
for i in range(1,N):
x1 = 2*a[i-1] - x1
print(x1) | N = int(eval(input()))
a = list(map(int, input().split()))
# mountain 1
c = sum(a[::2]) - sum(a[1::2])
print(c)
for i in range(1,N):
# next mountains
c = 2*a[i-1] - c
print(c) | 13 | 9 | 217 | 184 | N = int(eval(input()))
a = list(map(int, input().split()))
c = 0
for idx, i in enumerate(a):
if idx % 2 == 0:
c += i
else:
c -= i
x1 = c
print(x1)
for i in range(1, N):
x1 = 2 * a[i - 1] - x1
print(x1)
| N = int(eval(input()))
a = list(map(int, input().split()))
# mountain 1
c = sum(a[::2]) - sum(a[1::2])
print(c)
for i in range(1, N):
# next mountains
c = 2 * a[i - 1] - c
print(c)
| false | 30.769231 | [
"-c = 0",
"-for idx, i in enumerate(a):",
"- if idx % 2 == 0:",
"- c += i",
"- else:",
"- c -= i",
"-x1 = c",
"-print(x1)",
"+# mountain 1",
"+c = sum(a[::2]) - sum(a[1::2])",
"+print(c)",
"- x1 = 2 * a[i - 1] - x1",
"- print(x1)",
"+ # next mountains",
"+ ... | false | 0.043092 | 0.041427 | 1.040203 | [
"s596293307",
"s549942687"
] |
u729133443 | p02889 | python | s712326426 | s609363194 | 558 | 384 | 42,800 | 41,796 | Accepted | Accepted | 31.18 | from scipy.sparse import*
f=csgraph.floyd_warshall
def main():
n,m,l,*t=list(map(int,open(0).read().split()))
d=[[0]*(n+1)for _ in range(n+1)]
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=c
d=f(f(d,0)<=l)-1
d[d>n]=-1
d=d.astype('i')
print(('\n'.join(map(str,[d[i]for i in zip(*[iter(t[m*3+1:])]*2)]))))
main() | from scipy.sparse import*
f=csgraph.floyd_warshall
def main():
n,m,l,*t=list(map(int,open(0).read().split()))
d=[[0]*(n+1)for _ in range(n+1)]
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=c
d=f(f(d,0)<=l)-1
d[d>n]=-1
d=d.astype('U')
print(('\n'.join(d[i]for i in zip(*[iter(t[m*3+1:])]*2))))
main() | 11 | 11 | 325 | 314 | from scipy.sparse import *
f = csgraph.floyd_warshall
def main():
n, m, l, *t = list(map(int, open(0).read().split()))
d = [[0] * (n + 1) for _ in range(n + 1)]
for a, b, c in zip(*[iter(t[: m * 3])] * 3):
d[a][b] = c
d = f(f(d, 0) <= l) - 1
d[d > n] = -1
d = d.astype("i")
print(("\n".join(map(str, [d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2)]))))
main()
| from scipy.sparse import *
f = csgraph.floyd_warshall
def main():
n, m, l, *t = list(map(int, open(0).read().split()))
d = [[0] * (n + 1) for _ in range(n + 1)]
for a, b, c in zip(*[iter(t[: m * 3])] * 3):
d[a][b] = c
d = f(f(d, 0) <= l) - 1
d[d > n] = -1
d = d.astype("U")
print(("\n".join(d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2))))
main()
| false | 0 | [
"- d = d.astype(\"i\")",
"- print((\"\\n\".join(map(str, [d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2)]))))",
"+ d = d.astype(\"U\")",
"+ print((\"\\n\".join(d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2))))"
] | false | 0.302565 | 0.470216 | 0.643459 | [
"s712326426",
"s609363194"
] |
u581187895 | p03828 | python | s308258670 | s273535970 | 106 | 26 | 3,316 | 3,444 | Accepted | Accepted | 75.47 | from collections import defaultdict
N = int(eval(input()))
MOD = 10**9+7
mp = defaultdict(int)
# N! -> N-1, N-2,...で対応 (1は影響ないから2からスタート)
for i in range(2, N+1) :
x = i
for j in range(2, x+1): # 素数jの個数を求める
while x%j == 0:
x /= j
mp[j] += 1
ans = 1
for v in list(mp.values()):
ans = ((ans%MOD) * (v+1)%MOD) % MOD
print(ans)
| """
ある整数 x が、素因数分解によって x = p^n × q^m × ... (p, q, ...は素数) と表せる時、
x の約数の個数は(n + 1) × (m + 1) × ... となります。
"""
"""nを素因数分解"""
"""2以上の整数n => return [[素因数, 指数], ...]の2次元リスト"""
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
from collections import defaultdict
N = int(eval(input()))
MOD = 10**9+7
primes = defaultdict(int)
# N!をループしそれぞれの素因数を取得
for i in range(2, N+1):
for k, v in factorization(i):
primes[k] += v
ans = 1
for k, v in list(primes.items()):
ans = ans * (v+1)%MOD
print(ans) | 18 | 38 | 361 | 827 | from collections import defaultdict
N = int(eval(input()))
MOD = 10**9 + 7
mp = defaultdict(int)
# N! -> N-1, N-2,...で対応 (1は影響ないから2からスタート)
for i in range(2, N + 1):
x = i
for j in range(2, x + 1): # 素数jの個数を求める
while x % j == 0:
x /= j
mp[j] += 1
ans = 1
for v in list(mp.values()):
ans = ((ans % MOD) * (v + 1) % MOD) % MOD
print(ans)
| """
ある整数 x が、素因数分解によって x = p^n × q^m × ... (p, q, ...は素数) と表せる時、
x の約数の個数は(n + 1) × (m + 1) × ... となります。
"""
"""nを素因数分解"""
"""2以上の整数n => return [[素因数, 指数], ...]の2次元リスト"""
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if arr == []:
arr.append([n, 1])
return arr
from collections import defaultdict
N = int(eval(input()))
MOD = 10**9 + 7
primes = defaultdict(int)
# N!をループしそれぞれの素因数を取得
for i in range(2, N + 1):
for k, v in factorization(i):
primes[k] += v
ans = 1
for k, v in list(primes.items()):
ans = ans * (v + 1) % MOD
print(ans)
| false | 52.631579 | [
"+\"\"\"",
"+ある整数 x が、素因数分解によって x = p^n × q^m × ... (p, q, ...は素数) と表せる時、",
"+x の約数の個数は(n + 1) × (m + 1) × ... となります。",
"+\"\"\"",
"+\"\"\"nを素因数分解\"\"\"",
"+\"\"\"2以上の整数n => return [[素因数, 指数], ...]の2次元リスト\"\"\"",
"+",
"+",
"+def factorization(n):",
"+ arr = []",
"+ temp = n",
"+ for i... | false | 0.048321 | 0.037256 | 1.296991 | [
"s308258670",
"s273535970"
] |
u583507988 | p03827 | python | s692926453 | s337707003 | 28 | 23 | 9,088 | 9,112 | Accepted | Accepted | 17.86 | n = int(eval(input()))
s = eval(input())
ans = [0]
x = 0
for i in range(n):
if s[i] == 'I':
x += 1
ans.append(x)
else:
x -= 1
ans.append(x)
#print(ans)
print((max(ans))) | n=int(eval(input()))
s=eval(input())
ans=0
x=0
for i in range(n):
if s[i]=='I':
x+=1
else:
x-=1
ans=max(ans,x)
print(ans) | 13 | 11 | 187 | 133 | n = int(eval(input()))
s = eval(input())
ans = [0]
x = 0
for i in range(n):
if s[i] == "I":
x += 1
ans.append(x)
else:
x -= 1
ans.append(x)
# print(ans)
print((max(ans)))
| n = int(eval(input()))
s = eval(input())
ans = 0
x = 0
for i in range(n):
if s[i] == "I":
x += 1
else:
x -= 1
ans = max(ans, x)
print(ans)
| false | 15.384615 | [
"-ans = [0]",
"+ans = 0",
"- ans.append(x)",
"- ans.append(x)",
"-# print(ans)",
"-print((max(ans)))",
"+ ans = max(ans, x)",
"+print(ans)"
] | false | 0.049579 | 0.035581 | 1.393384 | [
"s692926453",
"s337707003"
] |
u648212584 | p02796 | python | s716459367 | s708097643 | 289 | 210 | 24,548 | 18,248 | Accepted | Accepted | 27.34 | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(eval(input()))
lr = []
for _ in range(N):
p,l = list(map(int,input().split()))
lr.append((p-l,p+l))
lr.sort(key = itemgetter(1,0))
now = -10**10
count = 0
for i in range(N):
if now <= lr[i][0]:
count += 1
now = lr[i][1]
print(count)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(eval(input()))
arm = []
for _ in range(N):
x,l = list(map(int,input().split()))
arm.append((x-l,x+l))
count = 0
arm.sort(key=itemgetter(1))
right = -10**10
for l,r in arm:
if right <= l:
right = r
count += 1
print(count)
if __name__ == "__main__":
main()
| 23 | 24 | 482 | 468 | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(eval(input()))
lr = []
for _ in range(N):
p, l = list(map(int, input().split()))
lr.append((p - l, p + l))
lr.sort(key=itemgetter(1, 0))
now = -(10**10)
count = 0
for i in range(N):
if now <= lr[i][0]:
count += 1
now = lr[i][1]
print(count)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(eval(input()))
arm = []
for _ in range(N):
x, l = list(map(int, input().split()))
arm.append((x - l, x + l))
count = 0
arm.sort(key=itemgetter(1))
right = -(10**10)
for l, r in arm:
if right <= l:
right = r
count += 1
print(count)
if __name__ == "__main__":
main()
| false | 4.166667 | [
"- lr = []",
"+ arm = []",
"- p, l = list(map(int, input().split()))",
"- lr.append((p - l, p + l))",
"- lr.sort(key=itemgetter(1, 0))",
"- now = -(10**10)",
"+ x, l = list(map(int, input().split()))",
"+ arm.append((x - l, x + l))",
"- for i in range(N):",... | false | 0.04256 | 0.07219 | 0.58955 | [
"s716459367",
"s708097643"
] |
u976225138 | p03624 | python | s509031828 | s119445565 | 40 | 30 | 8,996 | 9,100 | Accepted | Accepted | 25 | s = eval(input())
a = "abcdefghijklmnopqrstuvwxyz"
for i in s:
a = a.replace(i, "")
else:
if len(a):
print((a[0]))
else:
print("None") | s = set(eval(input()))
a = set("abcdefghijklmnopqrstuvwxyz")
d = a - s
if d:
print((sorted(d)[0]))
else:
print("None") | 10 | 7 | 164 | 124 | s = eval(input())
a = "abcdefghijklmnopqrstuvwxyz"
for i in s:
a = a.replace(i, "")
else:
if len(a):
print((a[0]))
else:
print("None")
| s = set(eval(input()))
a = set("abcdefghijklmnopqrstuvwxyz")
d = a - s
if d:
print((sorted(d)[0]))
else:
print("None")
| false | 30 | [
"-s = eval(input())",
"-a = \"abcdefghijklmnopqrstuvwxyz\"",
"-for i in s:",
"- a = a.replace(i, \"\")",
"+s = set(eval(input()))",
"+a = set(\"abcdefghijklmnopqrstuvwxyz\")",
"+d = a - s",
"+if d:",
"+ print((sorted(d)[0]))",
"- if len(a):",
"- print((a[0]))",
"- else:",
... | false | 0.042329 | 0.041055 | 1.031031 | [
"s509031828",
"s119445565"
] |
u540761833 | p02691 | python | s741808587 | s568007047 | 451 | 183 | 100,316 | 40,476 | Accepted | Accepted | 59.42 | from collections import defaultdict
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
plus = [A[i]+(i+1) for i in range(N)]
diff = [-A[i]+(i+1) for i in range(N)]
plusc = defaultdict(list)
for i in range(N):
plusc[plus[i]].append(i)
ans = 0
for i in range(1,N):
ans += bisect.bisect_left(plusc[diff[i]],i)
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
count = 0
dicta = {}
for i in range(N):
if i - A[i] in dicta:
count += dicta[i-A[i]]
if i + A[i] in dicta:
dicta[i+A[i]] += 1
else:
dicta[i+A[i]] = 1
print(count) | 14 | 12 | 354 | 261 | from collections import defaultdict
import bisect
N = int(eval(input()))
A = list(map(int, input().split()))
plus = [A[i] + (i + 1) for i in range(N)]
diff = [-A[i] + (i + 1) for i in range(N)]
plusc = defaultdict(list)
for i in range(N):
plusc[plus[i]].append(i)
ans = 0
for i in range(1, N):
ans += bisect.bisect_left(plusc[diff[i]], i)
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
dicta = {}
for i in range(N):
if i - A[i] in dicta:
count += dicta[i - A[i]]
if i + A[i] in dicta:
dicta[i + A[i]] += 1
else:
dicta[i + A[i]] = 1
print(count)
| false | 14.285714 | [
"-from collections import defaultdict",
"-import bisect",
"-",
"-plus = [A[i] + (i + 1) for i in range(N)]",
"-diff = [-A[i] + (i + 1) for i in range(N)]",
"-plusc = defaultdict(list)",
"+count = 0",
"+dicta = {}",
"- plusc[plus[i]].append(i)",
"-ans = 0",
"-for i in range(1, N):",
"- an... | false | 0.048578 | 0.048049 | 1.011005 | [
"s741808587",
"s568007047"
] |
u750990077 | p02678 | python | s687915467 | s315987506 | 520 | 443 | 41,652 | 98,708 | Accepted | Accepted | 14.81 | from collections import deque
def main():
n, m = list(map(int, input().split()))
to = [[] for _ in range(n+1)]
ans = [None]*(n+1)
for _ in range(m):
a, b = list(map(int, input().split()))
to[a].append(b)
to[b].append(a)
q = deque([1])
while q:
p = q.pop()
children = to[p]
for child in children:
if ans[child] is None:
ans[child] = p
q.appendleft(child)
print("Yes")
print(("\n".join(list(map(str, ans[2:])))))
if __name__ == "__main__":
main() | from collections import deque
def main():
n, m = list(map(int, input().split()))
to = [[] for _ in range(n+1)]
for _ in range(m):
a, b = list(map(int, input().split()))
to[a].append(b)
to[b].append(a)
q = deque([1])
ans = [None]*(n+1)
while q:
p = q.pop()
for child in to[p]:
if ans[child] is None:
ans[child] = p
q.appendleft(child)
print("Yes")
print(("\n".join(list(map(str, ans[2:])))))
if __name__ == "__main__":
main() | 24 | 24 | 588 | 565 | from collections import deque
def main():
n, m = list(map(int, input().split()))
to = [[] for _ in range(n + 1)]
ans = [None] * (n + 1)
for _ in range(m):
a, b = list(map(int, input().split()))
to[a].append(b)
to[b].append(a)
q = deque([1])
while q:
p = q.pop()
children = to[p]
for child in children:
if ans[child] is None:
ans[child] = p
q.appendleft(child)
print("Yes")
print(("\n".join(list(map(str, ans[2:])))))
if __name__ == "__main__":
main()
| from collections import deque
def main():
n, m = list(map(int, input().split()))
to = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = list(map(int, input().split()))
to[a].append(b)
to[b].append(a)
q = deque([1])
ans = [None] * (n + 1)
while q:
p = q.pop()
for child in to[p]:
if ans[child] is None:
ans[child] = p
q.appendleft(child)
print("Yes")
print(("\n".join(list(map(str, ans[2:])))))
if __name__ == "__main__":
main()
| false | 0 | [
"- ans = [None] * (n + 1)",
"+ ans = [None] * (n + 1)",
"- children = to[p]",
"- for child in children:",
"+ for child in to[p]:"
] | false | 0.097084 | 0.098081 | 0.989835 | [
"s687915467",
"s315987506"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.