node_ids listlengths 4 1.4k | edge_index listlengths 1 2.22k | text listlengths 4 1.4k | source stringlengths 14 427k |
|---|---|---|---|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
2,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
17,
13,
0,
13,
13,
14,
40,
18,
13,
2,
13... | [
[
69,
2
],
[
10,
9
],
[
70,
12
],
[
78,
19
],
[
84,
25
],
[
29,
28
],
[
70,
31
],
[
79,
35
],
[
28,
36
],
[
81,
39
],
[
79,
43
],
[
28,
44
],
[
81,
46
],
[
... | [
"N = int(input())\na = [int(input()) for _ in range(N)] + [0]\nans = 0\n\nfor i in range(N):\n if a[i] != 0:\n add, mod = divmod(a[i], 2)\n ans += add\n if a[i + 1] != 0:\n a[i + 1] += mod\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"inpu... | N = int(input())
a = [int(input()) for _ in range(N)] + [0]
ans = 0
for i in range(N):
if a[i] != 0:
add, mod = divmod(a[i], 2)
ans += add
if a[i + 1] != 0:
a[i + 1] += mod
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
14,
2,
13,
17,
4,
13,
2,
18,
13,
17,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
... | [
[
123,
2
],
[
10,
9
],
[
124,
12
],
[
129,
19
],
[
114,
22
],
[
120,
25
],
[
124,
29
],
[
130,
35
],
[
40,
39
],
[
124,
43
],
[
111,
46
],
[
99,
48
],
[
94,
48
],... | [
"N=int(input())\nA=[int(input()) for _ in range(N)]\ncnt=0\nbuf=0\n#print(A)\nif N==1:\n print(A[0]//2)\nelse:\n for i in range(N-1):\n su=A[i]+A[i+1]\n cnt=cnt+su//2\n buf=(su//2)*2\n if buf>A[i]:\n A[i+1]=A[i+1]-(buf-A[i])\n A[i]=0\n else:\n ... | N=int(input())
A=[int(input()) for _ in range(N)]
cnt=0
buf=0
#print(A)
if N==1:
print(A[0]//2)
else:
for i in range(N-1):
su=A[i]+A[i+1]
cnt=cnt+su//2
buf=(su//2)*2
if buf>A[i]:
A[i+1]=A[i+1]-(buf-A[i])
A[i]=0
else:
A[i]=A[i]-buf
#... |
[
7,
15,
13,
0,
13,
2,
17,
17,
0,
13,
2,
2,
17,
17,
17,
15,
4,
18,
13,
13,
17,
12,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
18,
13,
... | [
[
103,
4
],
[
106,
9
],
[
25,
24
],
[
32,
31
],
[
24,
34
],
[
42,
41
],
[
45,
44
],
[
48,
47
],
[
24,
50
],
[
53,
52
],
[
41,
55
],
[
47,
56
],
[
47,
60
],
[
... | [
"import sys\nINF = 10 ** 10\nMOD = 10 ** 9 + 7\nfrom functools import lru_cache\nsys.setrecursionlimit(100000000)\n\ndef main():\n n = int(input())\n a = [int(input()) for _ in range(n)]\n ans = 0\n for i in range(n):\n ans += a[i]//2\n if i != n - 1:\n if a[i]%2 == 1 and a[i + ... | import sys
INF = 10 ** 10
MOD = 10 ** 9 + 7
from functools import lru_cache
sys.setrecursionlimit(100000000)
def main():
n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
for i in range(n):
ans += a[i]//2
if i != n - 1:
if a[i]%2 == 1 and a[i + 1] > 0:
... |
[
7,
0,
13,
12,
4,
13,
13,
0,
13,
17,
23,
0,
13,
12,
4,
13,
4,
13,
0,
13,
12,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
12,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
12,
4,
18,
4,
13,
13,
0,
13,
2,
17,
17,
0,
13... | [
[
180,
2
],
[
9,
8
],
[
183,
12
],
[
165,
19
],
[
186,
32
],
[
177,
43
],
[
153,
51
],
[
156,
56
],
[
162,
61
],
[
75,
73
],
[
75,
75
],
[
189,
77
],
[
184,
79
],... | [
"printn = lambda x: print(x,end='')\ninn = lambda : int(input())\ninl = lambda: list(map(int, input().split()))\ninm = lambda: map(int, input().split())\nins = lambda : input().strip()\nDBG = True and False\nBIG = 10**18\nR = 10**9 + 7\n\ndef ddprint(x):\n if DBG:\n print(x)\n\nn = inn()\na = [0]\nfor... | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n = inn()
a = [0]
for i in range(1,n+1):
... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
13,
17,
13,
13,
31,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
18,
13,
13,
17,
14,
2,
2,
2,
18,
13,
13,
17,
2,
2,
13,
17,
13,
18,
13,
2,
13,
17,
0,
13,
17,
0,
18,
13,
... | [
[
73,
2
],
[
73,
15
],
[
70,
18
],
[
22,
21
],
[
74,
24
],
[
64,
26
],
[
21,
30
],
[
21,
38
],
[
21,
42
],
[
74,
44
],
[
21,
48
],
[
67,
51
],
[
59,
54
],
[
... | [
"n,*aa = map(int, open(0).read().split())\n\nans = 0\nfor i in range(n):\n ans += aa[i]//2\n if aa[i]%2 and i+1<n and aa[i+1]:\n ans += 1\n aa[i+1] -= 1\n\nprint(ans)",
"n,*aa = map(int, open(0).read().split())",
"n",
"map(int, open(0).read().split())",
"map",
"int",
"open(0).read().... | n,*aa = map(int, open(0).read().split())
ans = 0
for i in range(n):
ans += aa[i]//2
if aa[i]%2 and i+1<n and aa[i+1]:
ans += 1
aa[i+1] -= 1
print(ans) |
[
7,
15,
13,
0,
13,
18,
13,
13,
0,
13,
2,
17,
17,
0,
13,
17,
0,
13,
12,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
0,
13,
12,
13,
23,
0,
13,
12,
4,
13,
4,
13,
13,
4,
18,
4,
18,
13,
13,
13,
41,
28,
13,
4,
... | [
[
265,
4
],
[
259,
9
],
[
253,
14
],
[
214,
17
],
[
26,
25
],
[
215,
31
],
[
241,
33
],
[
277,
38
],
[
266,
49
],
[
55,
54
],
[
278,
60
],
[
226,
62
],
[
256,
67
... | [
"import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\n\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nnf = lambda: float(ns())\nnfn = lambda y: [nf() for _ in ... | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa ... |
[
7,
15,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
39,
17,
13,
28,
13,
4,
13,
13,
0,
18,
13,
13,
4,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
18,
13,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
18,
13,
13,
17,... | [
[
104,
4
],
[
98,
10
],
[
105,
14
],
[
17,
16
],
[
105,
19
],
[
24,
21
],
[
99,
22
],
[
16,
23
],
[
107,
29
],
[
33,
32
],
[
105,
35
],
[
101,
37
],
[
21,
43
],
... | [
"import math\nn = int(input())\n\ncards = [0] * n\n\nfor i in range(n):\n cards[i] = int(input())\n\nans = 0\n\n\nfor i in range(n):\n ans += math.floor(cards[i] / 2)\n cards[i] = cards[i] % 2\n if cards[i] == 1 and not(i == (n - 1)) and not(cards[i + 1] == 0):\n ans += 1\n cards[i + 1] = cards[i + 1] - 1... | import math
n = int(input())
cards = [0] * n
for i in range(n):
cards[i] = int(input())
ans = 0
for i in range(n):
ans += math.floor(cards[i] / 2)
cards[i] = cards[i] % 2
if cards[i] == 1 and not(i == (n - 1)) and not(cards[i + 1] == 0):
ans += 1
cards[i + 1] = cards[i + 1] - 1
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
18,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
13,
0,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
17,
17,
0,
13,
2,
1... | [
[
88,
2
],
[
10,
9
],
[
89,
12
],
[
91,
19
],
[
82,
22
],
[
85,
25
],
[
92,
27
],
[
31,
30
],
[
89,
34
],
[
97,
37
],
[
86,
38
],
[
101,
38
],
[
104,
38
],
[
... | [
"n = int(input())\na = [int(input()) for i in range(n)]\n\nans = 0\nc = a[0]\nfor i in range(n - 1):\n b = c\n c = a[i + 1]\n use = b // 2 * 2\n ans += use // 2\n b -= use\n if b and c >= 1:\n ans += 1\n c -= 1\nans += c // 2\n\nprint(ans)",
"n = int(input())",
"n",
"int(input(... | n = int(input())
a = [int(input()) for i in range(n)]
ans = 0
c = a[0]
for i in range(n - 1):
b = c
c = a[i + 1]
use = b // 2 * 2
ans += use // 2
b -= use
if b and c >= 1:
ans += 1
c -= 1
ans += c // 2
print(ans)
|
[
7,
15,
13,
12,
13,
12,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
12,
13,
12,
13,
0,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
0,
13,
13,
0,
13,
17,
12,
13,
14,
2,
40,
18,
13,
13,
17,
40,
18,
13,
2,
... | [
[
10,
9
],
[
153,
13
],
[
9,
18
],
[
25,
24
],
[
147,
26
],
[
30,
29
],
[
24,
32
],
[
147,
35
],
[
38,
37
],
[
41,
40
],
[
37,
48
],
[
76,
49
],
[
37,
53
],
[
... | [
"import sys\ndef input(): return sys.stdin.readline().strip()\ndef Z(): return int(input())\ndef ZZ(): return [int(_) for _ in input().split()]\n\ndef main():\n N = Z()\n A = [Z() for _ in range(N)]\n output = 0\n\n def makeRun(i, s):\n #A[i]とA[i+1]でシュンツ作る\n if A[i] <= 0 or A[i+1] <= 0: re... | import sys
def input(): return sys.stdin.readline().strip()
def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]
def main():
N = Z()
A = [Z() for _ in range(N)]
output = 0
def makeRun(i, s):
#A[i]とA[i+1]でシュンツ作る
if A[i] <= 0 or A[i+1] <= 0: return s
A[... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
2,
39,
17,
13,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
4,
13,
2,
13,
17,
4,
13,
17,
13,
0,
13,
18,
13,
13,
13,
18,
13,
13,
0,
... | [
[
126,
2
],
[
129,
8
],
[
127,
12
],
[
15,
14
],
[
127,
17
],
[
108,
19
],
[
28,
25
],
[
130,
26
],
[
14,
27
],
[
109,
28
],
[
114,
30
],
[
127,
40
],
[
127,
45
]... | [
"n = int(input())\ncnt = [0]*n\nfor i in range(n):\n a = int(input())\n cnt[i] += a\n\nans = 0\nfor i, j in zip(range(n-1), range(1, n)):\n x, y = cnt[i], cnt[j]\n z = x//2\n cnt[i] -= 2*z\n ans += z\n if cnt[i] == 0:\n continue\n if 0 < y:\n ans += 1\n cnt[i] -= 1\n ... | n = int(input())
cnt = [0]*n
for i in range(n):
a = int(input())
cnt[i] += a
ans = 0
for i, j in zip(range(n-1), range(1, n)):
x, y = cnt[i], cnt[j]
z = x//2
cnt[i] -= 2*z
ans += z
if cnt[i] == 0:
continue
if 0 < y:
ans += 1
cnt[i] -= 1
cnt[j] -= 1
else:
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
13,
17,
14,
2,
13,
17,
0,
13,
17,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13... | [
[
52,
2
],
[
67,
8
],
[
61,
11
],
[
15,
14
],
[
53,
17
],
[
58,
19
],
[
55,
25
],
[
62,
28
],
[
65,
28
],
[
50,
28
],
[
59,
29
],
[
49,
32
],
[
62,
35
],
[
... | [
"n=int(input())\nans=0\ntmp=0\nfor i in range(n):\n t=int(input())\n ans+=(tmp+t)//2\n tmp=(tmp+t)%2\n if t==0:\n tmp=0\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans=0",
"ans",
"0",
"tmp=0",
"tmp",
"0",
"for i in range(n):\n t=in... | n=int(input())
ans=0
tmp=0
for i in range(n):
t=int(input())
ans+=(tmp+t)//2
tmp=(tmp+t)%2
if t==0:
tmp=0
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
0,
13,
17,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
14,
2,
2,
2,
13,
17,
2,
18,
13,
17,
17,
2,
18,
13,
17,
17,
0,
13,
17,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
... | [
[
104,
2
],
[
116,
8
],
[
110,
11
],
[
15,
14
],
[
105,
17
],
[
117,
20
],
[
14,
30
],
[
117,
34
],
[
117,
39
],
[
113,
43
],
[
49,
46
],
[
117,
47
],
[
54,
51
],... | [
"n=int(input())\na=[]\nans=0\nfor i in range(n):\n a.append(int(input()))\n if(i>0 and a[-2]==1 and a[-1]>0):\n ans+=1\n a[-2]-=1\n a[-1]-=1\n ans+=a[-1]//2\n a[-1]=a[-1]%2\n if(i>0 and a[-2]==1 and a[-1]==1):\n ans+=1\n a[-2]-=1\n a[-1]-=1\n\nprint(ans)",
... | n=int(input())
a=[]
ans=0
for i in range(n):
a.append(int(input()))
if(i>0 and a[-2]==1 and a[-1]>0):
ans+=1
a[-2]-=1
a[-1]-=1
ans+=a[-1]//2
a[-1]=a[-1]%2
if(i>0 and a[-2]==1 and a[-1]==1):
ans+=1
a[-2]-=1
a[-1]-=1
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
39,
0,
13,
39,
28,
13,
13,
14,
40,
13,
17,
4,
18,
13,
13,
13,
4,
18,
13,
13,
2,
4,
13,
13,
17,
0,
13,
39,
4,
18,
... | [
[
81,
2
],
[
10,
9
],
[
82,
12
],
[
69,
19
],
[
78,
22
],
[
84,
25
],
[
72,
28
],
[
32,
31
],
[
70,
31
],
[
31,
35
],
[
85,
39
],
[
76,
39
],
[
31,
41
],
[
... | [
"n=int(input())\na=[int(input())for i in range(n)]\nc=0\nl=[]\nl2=[]\nfor i in a:\n if i!=0:\n l.append(i)\n else:\n l2.append(sum(l)//2)\n l=[]\nl2.append(sum(l)//2)\nprint(sum(l2))",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(input())for i in ra... | n=int(input())
a=[int(input())for i in range(n)]
c=0
l=[]
l2=[]
for i in a:
if i!=0:
l.append(i)
else:
l2.append(sum(l)//2)
l=[]
l2.append(sum(l)//2)
print(sum(l2)) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
4,
13,
4,
13,
14,
2,
2,
2,
13,
17,
17,
2,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
13,
4,
13,
... | [
[
77,
2
],
[
59,
8
],
[
68,
14
],
[
60,
16
],
[
20,
19
],
[
78,
23
],
[
71,
26
],
[
60,
35
],
[
75,
35
],
[
72,
39
],
[
81,
39
],
[
80,
42
],
[
62,
45
],
[
... | [
"N = int(input())\npre = int(input())\nans = pre // 2\nfor _ in range(N - 1):\n i = int(input())\n if pre % 2 == 1 and i > 0:\n i -= 1\n ans += 1\n ans += i // 2\n pre = i\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"pre = int(input())",
... | N = int(input())
pre = int(input())
ans = pre // 2
for _ in range(N - 1):
i = int(input())
if pre % 2 == 1 and i > 0:
i -= 1
ans += 1
ans += i // 2
pre = i
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
4,
13,
4,
13,
14,
13,
0,
13,
8,
2,
17,
13,
17,
17,
0,
13,
8,
40,
13,
17,
2,
2,
13,
17,
17,... | [
[
106,
2
],
[
88,
8
],
[
103,
14
],
[
89,
16
],
[
94,
19
],
[
89,
21
],
[
25,
24
],
[
107,
28
],
[
100,
31
],
[
109,
39
],
[
101,
43
],
[
112,
47
],
[
101,
50
],
... | [
"n = int(input())\na1 = int(input())\nflag = a1%2\nans = a1//2\nfor i in range(n-1):\n a = int(input())\n if flag:\n ans+=1 if 0<a else 0\n ans+=(a-1)//2 if a!=0 else 0\n flag=1 if a!=0 and (a-1)%2==1 else 0\n else:\n ans +=a//2\n flag=a%2\nprint(ans)",
"n = int(input()... | n = int(input())
a1 = int(input())
flag = a1%2
ans = a1//2
for i in range(n-1):
a = int(input())
if flag:
ans+=1 if 0<a else 0
ans+=(a-1)//2 if a!=0 else 0
flag=1 if a!=0 and (a-1)%2==1 else 0
else:
ans +=a//2
flag=a%2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
0,
13,
4,
13,
2,
13,
13,
17,
13,
0,
13,
13,
14,
2,
2,
13,
17,
2,
13,
17,
4,
13,
13,
10,
13,
13,
... | [
[
57,
2
],
[
10,
9
],
[
58,
12
],
[
54,
19
],
[
72,
22
],
[
66,
25
],
[
29,
28
],
[
55,
28
],
[
63,
31
],
[
67,
35
],
[
28,
36
],
[
63,
38
],
[
69,
40
],
[
... | [
"n = int(input())\nA = [int(input()) for _ in range(n)]\nans = 0\npre = 0\nfor a in A:\n d, m = divmod(pre + a, 2)\n ans += d\n if m == 1 and a > 0: pre = 1\n else: pre = 0\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(input()) for _ in range(n)",
"for _ ... | n = int(input())
A = [int(input()) for _ in range(n)]
ans = 0
pre = 0
for a in A:
d, m = divmod(pre + a, 2)
ans += d
if m == 1 and a > 0: pre = 1
else: pre = 0
print(ans) |
[
7,
15,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
13,
2,
2,
2,
13,
13,
13,
17,
0,
13,
13,
0,
13,
13,
0,
13,
17,
4,... | [
[
81,
3
],
[
84,
9
],
[
60,
12
],
[
16,
15
],
[
82,
18
],
[
63,
20
],
[
61,
27
],
[
76,
27
],
[
70,
27
],
[
64,
28
],
[
78,
30
],
[
64,
33
],
[
61,
34
],
[
... | [
"from collections import Counter\nn = int(input())\ncount=0\nres = 0\nfor _ in range(n):\n a = int(input())\n if res < a:\n tmp = (a-res)%2\n count += res+(a-tmp-res)//2\n res = tmp\n else:\n count += a\n res = 0\n \nprint(count)",
"from collections import Counter",
"n = int(input())",
"n... | from collections import Counter
n = int(input())
count=0
res = 0
for _ in range(n):
a = int(input())
if res < a:
tmp = (a-res)%2
count += res+(a-tmp-res)//2
res = tmp
else:
count += a
res = 0
print(count) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
2,
13,
17,
0,
13,
17,
0,
13,
17,
14,
2,
2,
13,
17,
17,
0,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
1... | [
[
78,
2
],
[
60,
8
],
[
69,
11
],
[
15,
14
],
[
79,
17
],
[
81,
19
],
[
61,
26
],
[
76,
26
],
[
67,
26
],
[
82,
28
],
[
64,
28
],
[
63,
31
],
[
57,
34
],
[
... | [
"N=int(input())\n\nnowodd = False\nans = 0\nfor i in range(N):\n a = int(input())\n if nowodd and a>0:\n a-=1\n ans+=1\n\n if a%2==1:\n nowodd=True\n else:\n nowodd=False\n ans+=a//2\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input"... | N=int(input())
nowodd = False
ans = 0
for i in range(N):
a = int(input())
if nowodd and a>0:
a-=1
ans+=1
if a%2==1:
nowodd=True
else:
nowodd=False
ans+=a//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13,
... | [
[
72,
2
],
[
10,
9
],
[
73,
12
],
[
66,
19
],
[
57,
22
],
[
54,
25
],
[
29,
28
],
[
67,
28
],
[
28,
32
],
[
63,
35
],
[
55,
37
],
[
76,
37
],
[
61,
37
],
[
... | [
"# 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これでdiff1185は数字が高すぎじゃない? \n# 貪欲で取っていくのを考えると、非ゼロの区間が連続する場合、その連続に対して下からペアを作って、最後に0か1だけ残ることがわかり、\n# 単純に書ける。こんなふうに。\n\nn = int(input())\nnums = [int(input()) for _ in range(n)]\n\nans = 0\ntemp = 0\nfor m in nums:\n if m == 0:\n ans += temp // 2\n temp = 0\n else:\n ... | # 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これでdiff1185は数字が高すぎじゃない?
# 貪欲で取っていくのを考えると、非ゼロの区間が連続する場合、その連続に対して下からペアを作って、最後に0か1だけ残ることがわかり、
# 単純に書ける。こんなふうに。
n = int(input())
nums = [int(input()) for _ in range(n)]
ans = 0
temp = 0
for m in nums:
if m == 0:
ans += temp // 2
temp = 0
else:
temp += m
ans +=... |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
4,
13,
18,
13,
13,
17,
13,
0,
18,
13,
13,
13,
0,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
... | [
[
90,
2
],
[
10,
9
],
[
91,
12
],
[
84,
19
],
[
96,
22
],
[
26,
25
],
[
91,
29
],
[
93,
32
],
[
41,
35
],
[
85,
36
],
[
25,
37
],
[
93,
39
],
[
44,
41
],
[
... | [
"n = int(input())\nA = [int(input()) for _ in range(n)]\nans = 0\nfor i in range(n-1):\n p,r = divmod(A[i], 2)\n A[i] = r\n ans += p\n if A[i]*A[i+1]:\n A[i+1] -= 1\n ans += 1\nprint(ans+A[-1]//2)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(inpu... | n = int(input())
A = [int(input()) for _ in range(n)]
ans = 0
for i in range(n-1):
p,r = divmod(A[i], 2)
A[i] = r
ans += p
if A[i]*A[i+1]:
A[i+1] -= 1
ans += 1
print(ans+A[-1]//2) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
17,
0,
13,
4,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
4,
13,
2,
13,
17,
0,
13,
4,
13,
17,
0,
13,
13,
0,
13,
4,
13,
2,
13,
17,
4,
13,
13,... | [
[
58,
2
],
[
61,
8
],
[
79,
13
],
[
19,
18
],
[
59,
21
],
[
70,
23
],
[
71,
30
],
[
64,
33
],
[
80,
37
],
[
68,
37
],
[
74,
37
],
[
73,
40
],
[
67,
45
],
[
... | [
"n=int(input())\nans=int(0)\ns=int(0)\nfor i in range(n):\n now=int(input())\n if now==0:\n ans+=int(s/2)\n s=int(0)\n else:\n s+=now\nans+=int(s/2)\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans=int(0)",
"ans",
"int(0)",
"int",... | n=int(input())
ans=int(0)
s=int(0)
for i in range(n):
now=int(input())
if now==0:
ans+=int(s/2)
s=int(0)
else:
s+=now
ans+=int(s/2)
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
4,
13,
13,
10,
2,
13,
... | [
[
72,
2
],
[
10,
9
],
[
73,
12
],
[
57,
19
],
[
69,
22
],
[
60,
25
],
[
29,
28
],
[
58,
28
],
[
28,
32
],
[
54,
35
],
[
61,
37
],
[
67,
37
],
[
64,
37
],
[
... | [
"N = int(input())\nA = [int(input()) for _ in range(N)]\n\nres = 0\nn = 0\nfor a in A:\n if a == 0:\n res += n // 2\n n = 0\n n += a\n\nres += n // 2\n\nprint(res)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(input()) for _ in range(N)",
"for _ in ra... | N = int(input())
A = [int(input()) for _ in range(N)]
res = 0
n = 0
for a in A:
if a == 0:
res += n // 2
n = 0
n += a
res += n // 2
print(res)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
18,
13,
13,
17,
14,
40,
13,
2,
13... | [
[
102,
2
],
[
10,
9
],
[
103,
12
],
[
105,
19
],
[
108,
22
],
[
26,
25
],
[
103,
28
],
[
87,
31
],
[
43,
31
],
[
106,
32
],
[
25,
33
],
[
111,
36
],
[
87,
38
],
... | [
"n = int(input())\na = [int(input()) for _ in range(n)]\nans = 0\nfor i in range(n):\n\tif a[i] >= 2:\n\t\tans += a[i] // 2\n\t\ta[i] = a[i] % 2\n\tif i != n-1:\n\t\tif a[i] >= 1 and a[i+1] >= 1:\n\t\t\tk = min(a[i], a[i+1])\n\t\t\tans += k\n\t\t\ta[i] -= k\n\t\t\ta[i+1] -= k\nprint(ans)",
"n = int(input())",
"... | n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
for i in range(n):
if a[i] >= 2:
ans += a[i] // 2
a[i] = a[i] % 2
if i != n-1:
if a[i] >= 1 and a[i+1] >= 1:
k = min(a[i], a[i+1])
ans += k
a[i] -= k
a[i+1] -= k
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
14,
2,
13,
17,
4,
13,
2,
2,
2,
18,
13,
17,
17,
17,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
2,
2,
18,
13,
13,
18... | [
[
122,
2
],
[
10,
9
],
[
123,
12
],
[
110,
19
],
[
123,
23
],
[
111,
31
],
[
107,
39
],
[
43,
42
],
[
123,
46
],
[
119,
49
],
[
111,
54
],
[
42,
55
],
[
111,
57
]... | [
"n = int(input())\n\nal = [int(input()) for _ in range(n)]\n\nif n == 1:\n print(al[0] // 2 * 2 // 2)\n exit()\nans = 0\nfor i in range(n-1):\n rest = ((al[i] + al[i+1]) // 2) * 2\n ans += rest\n for j in range(2):\n if al[i+j] >= rest:\n al[i+j] -= rest\n break\n ... | n = int(input())
al = [int(input()) for _ in range(n)]
if n == 1:
print(al[0] // 2 * 2 // 2)
exit()
ans = 0
for i in range(n-1):
rest = ((al[i] + al[i+1]) // 2) * 2
ans += rest
for j in range(2):
if al[i+j] >= rest:
al[i+j] -= rest
break
else:
re... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
15,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
13,
17,
0,
13,
2,
13,
17,
0,
... | [
[
90,
2
],
[
84,
8
],
[
13,
12
],
[
91,
15
],
[
85,
18
],
[
87,
25
],
[
85,
29
],
[
96,
31
],
[
78,
34
],
[
38,
37
],
[
91,
42
],
[
88,
47
],
[
85,
47
],
[
... | [
"n = int(input())\na = []\nfrom collections import Counter\nfor _ in range(n):\n a.append(int(input()))\na = [0] + a\n \ncursum = 0\nans = 0\nfor i in range(1,n+1):\n if a[i] == 0:\n ans += cursum // 2\n cursum = 0\n else:\n cursum += a[i]\n \nans += cursum // 2\nprint(ans)",... | n = int(input())
a = []
from collections import Counter
for _ in range(n):
a.append(int(input()))
a = [0] + a
cursum = 0
ans = 0
for i in range(1,n+1):
if a[i] == 0:
ans += cursum // 2
cursum = 0
else:
cursum += a[i]
ans += cursum // 2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
18,... | [
[
89,
2
],
[
10,
9
],
[
90,
12
],
[
86,
19
],
[
92,
22
],
[
26,
25
],
[
90,
29
],
[
83,
32
],
[
39,
34
],
[
87,
35
],
[
25,
36
],
[
42,
39
],
[
87,
40
],
[
... | [
"N = int(input())\nA = [int(input()) for _ in range(N)]\n\nans = 0\nfor i in range(N-1):\n ans += A[i]//2\n A[i] %= 2\n if A[i] <= A[i+1]:\n ans += A[i]\n A[i+1] -= A[i]\nans += A[N-1]//2\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(in... | N = int(input())
A = [int(input()) for _ in range(N)]
ans = 0
for i in range(N-1):
ans += A[i]//2
A[i] %= 2
if A[i] <= A[i+1]:
ans += A[i]
A[i+1] -= A[i]
ans += A[N-1]//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
42,
2,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
2,
13,
17,
... | [
[
83,
2
],
[
10,
9
],
[
84,
12
],
[
74,
19
],
[
77,
22
],
[
71,
25
],
[
72,
29
],
[
81,
29
],
[
84,
30
],
[
86,
32
],
[
36,
35
],
[
72,
38
],
[
81,
38
],
[
... | [
"n = int(input())\na = [int(input()) for _ in range(n)]\n\nans = 0\ni = 0\nwhile i < n:\n res = 0\n for j in range(i, n):\n if a[j] == 0: break\n res += a[j]\n ans += res // 2\n i = j + 1\n\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int... | n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
i = 0
while i < n:
res = 0
for j in range(i, n):
if a[j] == 0: break
res += a[j]
ans += res // 2
i = j + 1
print(ans)
|
[
7,
15,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
4,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
4,
13,
18,
13,
13,
17,
13,
0,
13,
13,
14,
2,
13,
17,
14,
2,
18,
... | [
[
94,
4
],
[
12,
11
],
[
95,
14
],
[
88,
21
],
[
82,
28
],
[
32,
31
],
[
95,
35
],
[
91,
38
],
[
89,
42
],
[
31,
43
],
[
91,
45
],
[
103,
47
],
[
86,
48
],
[
... | [
"import numpy as np\nN = int(input())\nA = np.array([int(input()) for _ in range(N)])\nans = 0\nfor i in range(N-1):\n d,m = divmod(A[i],2)\n ans += d\n if m == 1:\n if A[i+1] > 0:\n A[i+1] -= 1\n ans += 1\n\nans += A[-1]//2\nprint(ans)",
"import numpy as np",
"numpy",
"N... | import numpy as np
N = int(input())
A = np.array([int(input()) for _ in range(N)])
ans = 0
for i in range(N-1):
d,m = divmod(A[i],2)
ans += d
if m == 1:
if A[i+1] > 0:
A[i+1] -= 1
ans += 1
ans += A[-1]//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
2,
13,
17,
40,
13,
2,
13,
17,
40,
... | [
[
85,
2
],
[
10,
9
],
[
86,
12
],
[
97,
19
],
[
91,
22
],
[
98,
29
],
[
83,
32
],
[
89,
32
],
[
94,
35
],
[
83,
37
],
[
89,
37
],
[
88,
40
],
[
83,
42
],
[
... | [
"\n# 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これでdiff1185は数字が高すぎじゃない? \n\nn = int(input())\nnums = [int(input()) for _ in range(n)]\n\nans = 0\nfor idx, m in enumerate(nums):\n if m > 0:\n ans += m // 2\n # m -= (m // 2) * 2\n m = m & 1\n if m == 1 and idx != n-1 and nums[idx+1] >= 1:\n ans += 1... |
# 直感的に分かる貪欲（下から組を作る）だと思うんだけど、これでdiff1185は数字が高すぎじゃない?
n = int(input())
nums = [int(input()) for _ in range(n)]
ans = 0
for idx, m in enumerate(nums):
if m > 0:
ans += m // 2
# m -= (m // 2) * 2
m = m & 1
if m == 1 and idx != n-1 and nums[idx+1] >= 1:
ans += 1
m -= 1
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
13,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
17,
4,
13,
2,
13,
2,
13,
17,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
... | [
[
48,
2
],
[
57,
8
],
[
45,
11
],
[
15,
14
],
[
49,
17
],
[
60,
19
],
[
63,
27
],
[
61,
28
],
[
54,
30
],
[
58,
32
],
[
52,
32
],
[
64,
32
],
[
51,
35
],
[
... | [
"n=int(input())\nx=0\nz=0\nfor i in range(n):\n t=int(input())\n if t:\n x+=t\n else:\n z+=x//2\n x=0\nprint(z+x//2)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"x=0",
"x",
"0",
"z=0",
"z",
"0",
"for i in range(n):\n t=int(input())\n if t:\n x+=t\n ... | n=int(input())
x=0
z=0
for i in range(n):
t=int(input())
if t:
x+=t
else:
z+=x//2
x=0
print(z+x//2) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
14,
40,
13,
2,
13,
17,
14,
2,
2,
18,
13,
13,
17,
40,
18,... | [
[
83,
2
],
[
10,
9
],
[
84,
12
],
[
92,
19
],
[
89,
22
],
[
26,
25
],
[
84,
28
],
[
86,
30
],
[
62,
32
],
[
37,
32
],
[
93,
33
],
[
25,
34
],
[
40,
37
],
[
... | [
"n = int(input())\narr = [int(input()) for _ in range(n)]\n\nans = 0\nfor i in range(n):\n ans += arr[i] // 2\n arr[i] %= 2\n if i != n - 1:\n if arr[i] == 1 and arr[i + 1] >= 1:\n arr[i] -= 1\n arr[i + 1] -= 1\n ans += 1\n\nprint(ans)",
"n = int(input())",
"n",
... | n = int(input())
arr = [int(input()) for _ in range(n)]
ans = 0
for i in range(n):
ans += arr[i] // 2
arr[i] %= 2
if i != n - 1:
if arr[i] == 1 and arr[i + 1] >= 1:
arr[i] -= 1
arr[i + 1] -= 1
ans += 1
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
14,
40,
17,
13,
0,
13,
2,
4,
13,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
2,
18,
13,
13,
17,
2,
13,
2,
13,
17,
0,
... | [
[
89,
2
],
[
10,
9
],
[
90,
12
],
[
77,
19
],
[
83,
22
],
[
78,
27
],
[
92,
29
],
[
78,
33
],
[
80,
36
],
[
40,
39
],
[
90,
42
],
[
78,
47
],
[
39,
48
],
[
... | [
"N = int(input())\nA = [int(input()) for _ in range(N)]\nans = 0\nif 0 not in A:\n ans = sum(A)//2\nelse:\n now = 0\n for i in range(N):\n if A[i] == 0 or i == N-1:\n ans += sum(A[now:i+1])//2\n now = i+1\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
... | N = int(input())
A = [int(input()) for _ in range(N)]
ans = 0
if 0 not in A:
ans = sum(A)//2
else:
now = 0
for i in range(N):
if A[i] == 0 or i == N-1:
ans += sum(A[now:i+1])//2
now = i+1
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
17,
0,
18,
13,
2,
13,
17,
4,
13,
18,
13,
2,
13,
... | [
[
85,
2
],
[
10,
9
],
[
86,
12
],
[
94,
19
],
[
88,
22
],
[
26,
25
],
[
86,
29
],
[
91,
32
],
[
95,
36
],
[
25,
37
],
[
95,
39
],
[
25,
41
],
[
50,
45
],
[
... | [
"N = int(input())\nA = [int(input()) for i in range(N)]\nans = 0\nfor i in range(N-1):\n ans += (A[i] + A[i+1])//2\n A[i+1] = min(A[i+1], (A[i] + A[i+1]) % 2)\nif N == 1:\n print(A[0]//2)\n exit()\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(input(... | N = int(input())
A = [int(input()) for i in range(N)]
ans = 0
for i in range(N-1):
ans += (A[i] + A[i+1])//2
A[i+1] = min(A[i+1], (A[i] + A[i+1]) % 2)
if N == 1:
print(A[0]//2)
exit()
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
13,
17,
14,
2,
13,
17,
0,
13,
17,
... | [
[
73,
2
],
[
70,
8
],
[
64,
14
],
[
71,
16
],
[
67,
19
],
[
71,
21
],
[
25,
24
],
[
74,
28
],
[
79,
31
],
[
76,
37
],
[
80,
40
],
[
68,
41
],
[
83,
41
],
[
... | [
"N = int(input())\n\nfirst = int(input())\nanswer = first//2\nbefore = first%2\nfor _ in range(N-1):\n A = int(input())\n answer += (A+before)//2\n before = (A+before)%2\n if A == 0:\n before = 0\nprint(answer)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"first = int(i... | N = int(input())
first = int(input())
answer = first//2
before = first%2
for _ in range(N-1):
A = int(input())
answer += (A+before)//2
before = (A+before)%2
if A == 0:
before = 0
print(answer) |
[
7,
15,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
31,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
... | [
[
110,
4
],
[
98,
13
],
[
113,
22
],
[
101,
31
],
[
111,
38
],
[
101,
40
],
[
104,
43
],
[
119,
49
],
[
53,
52
],
[
102,
57
],
[
105,
62
],
[
52,
64
],
[
85,
66
]... | [
"import sys\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nN, *A = map(int, read().split())\n\nA = [0] + A\nanswer = 0\nfor i in range(1, N + 1):\n if A[i - 1] and A[i]:\n answer += 1\n A[i] -= 1\n n, A[i] = divmod(A[i], 2)\n a... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *A = map(int, read().split())
A = [0] + A
answer = 0
for i in range(1, N + 1):
if A[i - 1] and A[i]:
answer += 1
A[i] -= 1
n, A[i] = divmod(A[i], 2)
answer += n
print(ans... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
... | [
[
48,
2
],
[
60,
8
],
[
63,
11
],
[
15,
14
],
[
49,
17
],
[
69,
19
],
[
70,
26
],
[
54,
29
],
[
61,
31
],
[
67,
31
],
[
52,
31
],
[
51,
34
],
[
66,
37
],
[
... | [
"n = int(input())\ncur = 0\nres = 0\nfor _ in range(n):\n x = int(input())\n if x == 0:\n res += cur // 2\n cur = 0\n else:\n cur += x\nres += cur // 2\nprint(res)\n",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"cur = 0",
"cur",
"0",
"res = ... | n = int(input())
cur = 0
res = 0
for _ in range(n):
x = int(input())
if x == 0:
res += cur // 2
cur = 0
else:
cur += x
res += cur // 2
print(res)
|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
13,
17,
13,
13,
31,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
10,... | [
[
56,
2
],
[
56,
15
],
[
71,
18
],
[
68,
21
],
[
25,
24
],
[
57,
27
],
[
24,
32
],
[
62,
35
],
[
24,
38
],
[
74,
40
],
[
69,
42
],
[
66,
42
],
[
63,
42
],
[
... | [
"N, *A = map(int, open(0).read().split())\n\nans = 0\ncnt = 0\nfor i in range(N):\n if A[i] > 0:\n cnt += A[i]\n else:\n ans += cnt // 2\n cnt = 0\nelse:\n ans += cnt // 2\n\nprint(ans)",
"N, *A = map(int, open(0).read().split())",
"N",
"map(int, open(0).read().split())",
"map"... | N, *A = map(int, open(0).read().split())
ans = 0
cnt = 0
for i in range(N):
if A[i] > 0:
cnt += A[i]
else:
ans += cnt // 2
cnt = 0
else:
ans += cnt // 2
print(ans)
|
[
7,
15,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
18,
18,
13,
13,
13,
15,
15,
15,
15,
15,
15,
15,
15,
12,
13,
23,
13,
23,
13,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
28,
13,
13,
23,
12,
13,
23,
13,
12,
1... | [
[
230,
11
],
[
28,
28
],
[
30,
30
],
[
236,
32
],
[
266,
37
],
[
47,
46
],
[
52,
52
],
[
64,
63
],
[
231,
67
],
[
63,
73
],
[
82,
81
],
[
91,
91
],
[
95,
94
],
... | [
"#\n# ⋀_⋀ \n# (･ω･) \n# .／ Ｕ ∽ Ｕ＼\n# │＊ 合 ＊│\n# │＊ 格 ＊│ \n# │＊ 祈 ＊│ \n# │＊ 願 ＊│ \n# │＊ ＊│ \n# ￣\n#\nimport sys\nsys.setrecursionlimit(10**6)\ninput=sys.stdin.readline\nfrom math import floor,sqrt,factorial,hypot,log #log2ないｙｐ\nfrom heapq import heappop, heappush, heappushpop\nfrom collections i... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
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,default... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
13,
13,
14,
2,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
... | [
[
50,
2
],
[
56,
8
],
[
65,
11
],
[
15,
14
],
[
51,
17
],
[
62,
19
],
[
68,
25
],
[
63,
27
],
[
57,
28
],
[
60,
28
],
[
54,
28
],
[
63,
31
],
[
53,
34
],
[
... | [
"N=int(input())\nhave=0\nans=0\nfor i in range(N):\n a=int(input())\n now=a+have\n if a==0:\n have=0\n else:\n have=now%2\n ans+=now//2\n\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"have=0",
"have",
"0",
"ans=0",
"ans",
"0",
... | N=int(input())
have=0
ans=0
for i in range(N):
a=int(input())
now=a+have
if a==0:
have=0
else:
have=now%2
ans+=now//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
13,
13,
17,
14,
2,
2,
13,
17,
2,
13,
17,
0,
13,
17,
14,
2,
2,
2,
13,
13,
17,
17,
0,... | [
[
81,
2
],
[
96,
8
],
[
87,
11
],
[
84,
14
],
[
18,
17
],
[
82,
22
],
[
99,
25
],
[
72,
31
],
[
85,
34
],
[
76,
34
],
[
103,
34
],
[
79,
34
],
[
100,
35
],
[
... | [
"N = int(input())\nans = 0\nprev_A = -10\nprev_card_num = 0\nfor i in range(1,N+1):\n A = int(input())\n ans += (prev_card_num + A)//2\n if prev_card_num == 1 and A == 0:\n prev_card_num = 0\n elif (prev_card_num+A)%2 == 1:\n prev_card_num = 1\n prev_A = i\n else:\n prev_c... | N = int(input())
ans = 0
prev_A = -10
prev_card_num = 0
for i in range(1,N+1):
A = int(input())
ans += (prev_card_num + A)//2
if prev_card_num == 1 and A == 0:
prev_card_num = 0
elif (prev_card_num+A)%2 == 1:
prev_card_num = 1
prev_A = i
else:
prev_card_num = 0
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
14,
2,
2,
13,
17,
17,
14,
40,
13,
17,
0,
13,
17,
0,
13,
2,
13,
... | [
[
74,
2
],
[
86,
8
],
[
77,
11
],
[
15,
14
],
[
75,
18
],
[
98,
20
],
[
87,
27
],
[
84,
27
],
[
105,
27
],
[
81,
27
],
[
102,
27
],
[
101,
30
],
[
99,
32
],
[
... | [
"N=int(input())\nformer=0\nans=0\nfor i in range(0,N):\n a=int(input())\n if former==0:\n former=a%2\n ans+=a//2\n else:\n if a%2==0:\n if a!=0:\n former=1\n ans+=a//2\n else:\n former=0\n else:\n form... | N=int(input())
former=0
ans=0
for i in range(0,N):
a=int(input())
if former==0:
former=a%2
ans+=a//2
else:
if a%2==0:
if a!=0:
former=1
ans+=a//2
else:
former=0
else:
former=0
ans+... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
4,
13,
17,
2,
13,
13,
17,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
1... | [
[
57,
2
],
[
51,
8
],
[
60,
11
],
[
15,
14
],
[
58,
17
],
[
48,
19
],
[
54,
25
],
[
61,
28
],
[
46,
28
],
[
49,
29
],
[
45,
32
],
[
49,
38
],
[
61,
39
],
[
... | [
"n = int(input())\nans = 0\nm = 0\nfor i in range(n):\n a = int(input())\n ans += (m+a)//2\n m = max(0,a-m)%2\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"m = 0",
"m",
"0",
"for i in range(n):\n a = int(input())\n ... | n = int(input())
ans = 0
m = 0
for i in range(n):
a = int(input())
ans += (m+a)//2
m = max(0,a-m)%2
print(ans) |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
13,
17,
13,
13,
31,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
17,
9,
0,
13,
4,
13,
2,
13,
13,
17,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,... | [
[
56,
2
],
[
56,
15
],
[
62,
18
],
[
53,
21
],
[
25,
24
],
[
24,
28
],
[
59,
31
],
[
65,
35
],
[
24,
39
],
[
60,
40
],
[
63,
40
],
[
66,
40
],
[
65,
42
],
[
... | [
"N, *A = map(int, open(0).read().split())\n\nr = 0\nans = 0\nfor a in A:\n if a == 0:\n r = 0\n continue\n q, r = divmod(a + r, 2)\n ans += q\nprint(ans)",
"N, *A = map(int, open(0).read().split())",
"N",
"map(int, open(0).read().split())",
"map",
"int",
"open(0).read().split()",
... | N, *A = map(int, open(0).read().split())
r = 0
ans = 0
for a in A:
if a == 0:
r = 0
continue
q, r = divmod(a + r, 2)
ans += q
print(ans)
|
[
7,
15,
13,
12,
13,
12,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
18,
13,
2,
13,
17,
14,... | [
[
91,
15
],
[
107,
19
],
[
23,
22
],
[
92,
25
],
[
107,
30
],
[
121,
32
],
[
109,
35
],
[
97,
38
],
[
42,
41
],
[
92,
46
],
[
112,
49
],
[
122,
51
],
[
41,
53
],
... | [
"import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nN = int(input())\nXs = [int(input()) for _ in range(N)]\n\nlast = 0\nans = 0\nfor i in range(1, N+1):\n cnt = Xs[i-1]\n if cnt<=last:\n ans += cnt\n last... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
Xs = [int(input()) for _ in range(N)]
last = 0
ans = 0
for i in range(1, N+1):
cnt = Xs[i-1]
if cnt<=last:
ans += cnt
last = 0
else:
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
17,
9,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
13,
17,
4,
13,
13,
10,
17,
13,
10,
2,
13,
10,
4... | [
[
59,
2
],
[
62,
8
],
[
50,
11
],
[
15,
14
],
[
60,
17
],
[
56,
19
],
[
57,
26
],
[
65,
29
],
[
53,
33
],
[
57,
36
],
[
51,
37
],
[
69,
37
],
[
66,
37
],
[
... | [
"n = int(input())\nans = 0\nr = 0\nfor i in range(n):\n a = int(input())\n if a == 0:\n r = 0\n continue\n else:\n ans += (a + r) // 2\n r = (a + r) % 2\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"... | n = int(input())
ans = 0
r = 0
for i in range(n):
a = int(input())
if a == 0:
r = 0
continue
else:
ans += (a + r) // 2
r = (a + r) % 2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
... | [
[
57,
2
],
[
60,
8
],
[
60,
11
],
[
15,
14
],
[
58,
17
],
[
51,
19
],
[
52,
26
],
[
63,
29
],
[
49,
31
],
[
67,
31
],
[
70,
31
],
[
69,
34
],
[
66,
37
],
[
... | [
"n = int(input())\n\nans = x = 0\nfor _ in range(n):\n a = int(input())\n if a == 0:\n ans += x//2\n x = 0\n x += a\nelse:\n ans += x//2\n\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans = x = 0",
"ans",
"0",
"= x = 0",
"x",
"0... | n = int(input())
ans = x = 0
for _ in range(n):
a = int(input())
if a == 0:
ans += x//2
x = 0
x += a
else:
ans += x//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
2,
18,
13,
13,
17,
17,
14,
40,
13... | [
[
101,
2
],
[
10,
9
],
[
102,
12
],
[
104,
19
],
[
92,
22
],
[
26,
25
],
[
102,
28
],
[
74,
31
],
[
43,
31
],
[
105,
32
],
[
25,
33
],
[
95,
36
],
[
74,
38
],
[... | [
"N = int(input())\nA = [int(input()) for i in range(N)]\n\nans = 0\nfor i in range(N):\n if A[i] >= 2:\n ans += A[i]//2\n A[i] -= (A[i]//2)*2\n if i != N-1:\n if A[i] == 1 and A[i+1] >= 1:\n A[i] = 0\n A[i+1] -= 1\n ans += 1\nprint(ans)\n",
"N = int(inpu... | N = int(input())
A = [int(input()) for i in range(N)]
ans = 0
for i in range(N):
if A[i] >= 2:
ans += A[i]//2
A[i] -= (A[i]//2)*2
if i != N-1:
if A[i] == 1 and A[i+1] >= 1:
A[i] = 0
A[i+1] -= 1
ans += 1
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
40,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
... | [
[
60,
2
],
[
48,
8
],
[
57,
11
],
[
15,
14
],
[
61,
17
],
[
51,
19
],
[
52,
26
],
[
63,
29
],
[
52,
30
],
[
69,
32
],
[
58,
34
],
[
67,
34
],
[
64,
34
],
[
... | [
"N = int(input())\nans = 0\nnow = 0\nfor i in range(N):\n a = int(input())\n if a != 0:\n now += a\n else:\n ans += now // 2\n now = 0\nans += now // 2\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"now = 0"... | N = int(input())
ans = 0
now = 0
for i in range(N):
a = int(input())
if a != 0:
now += a
else:
ans += now // 2
now = 0
ans += now // 2
print(ans)
|
[
7,
15,
13,
15,
13,
15,
15,
13,
15,
0,
13,
18,
13,
13,
4,
13,
2,
17,
17,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
17,
0,
13,
2,
2,
13,
... | [
[
79,
10
],
[
23,
22
],
[
80,
26
],
[
29,
28
],
[
32,
31
],
[
35,
34
],
[
22,
37
],
[
40,
39
],
[
80,
43
],
[
39,
46
],
[
50,
49
],
[
53,
52
],
[
31,
55
],
[
... | [
"import math\n#import numpy as np\nimport queue\nfrom collections import deque,defaultdict\nimport heapq as hpq\nfrom sys import stdin,setrecursionlimit\n#from scipy.sparse.csgraph import dijkstra\n#from scipy.sparse import csr_matrix\nipt = stdin.readline\nsetrecursionlimit(10**7)\n\ndef main():\n n = int(ipt()... | import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
n = int(ipt())
ans = 0
... |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
14,
2,
2,
18,
13,
13,
17,
40,
18,
13,
2,
13,
17,
... | [
[
90,
2
],
[
10,
9
],
[
91,
12
],
[
78,
19
],
[
87,
22
],
[
26,
25
],
[
91,
29
],
[
81,
32
],
[
39,
34
],
[
79,
35
],
[
25,
36
],
[
42,
39
],
[
79,
40
],
[
... | [
"n=int(input())\na=[int(input()) for i in range(n)]\nans=0\nfor i in range(n-1):\n ans+=a[i]//2\n a[i]%=2\n if a[i]==1 and a[i+1]>=1:\n ans+=1\n a[i+1]-=1\nans+=a[-1]//2\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(input()) for i in range(n)",
"for i ... | n=int(input())
a=[int(input()) for i in range(n)]
ans=0
for i in range(n-1):
ans+=a[i]//2
a[i]%=2
if a[i]==1 and a[i+1]>=1:
ans+=1
a[i+1]-=1
ans+=a[-1]//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
4,
18,
13,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
14,
2,
2,
18,
13,
13,
17,
40,... | [
[
79,
2
],
[
82,
8
],
[
12,
11
],
[
80,
14
],
[
83,
17
],
[
83,
25
],
[
76,
29
],
[
33,
32
],
[
80,
35
],
[
88,
37
],
[
44,
39
],
[
83,
40
],
[
32,
41
],
[
... | [
"n = int(input())\na = []\nfor i in range(n):\n a.append(int(input()))\na.append(0)\nans = 0\nfor i in range(n):\n ans += a[i] // 2\n a[i] %= 2\n if a[i] == 1 and a[i + 1] >= 1:\n ans += 1\n a[i + 1] -= 1\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
... | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
a.append(0)
ans = 0
for i in range(n):
ans += a[i] // 2
a[i] %= 2
if a[i] == 1 and a[i + 1] >= 1:
ans += 1
a[i + 1] -= 1
print(ans) |
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
15,
15,
15,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
6,
13,
12,
13,
29,
4,
13,
4,
18,
4,
18,
18,
13,
13,
13,
13,
0,
13,
13,
13,
12,
13,
29,
4,
18,
... | [
[
48,
32
],
[
48,
46
],
[
48,
48
],
[
64,
50
],
[
64,
62
],
[
64,
64
],
[
86,
66
],
[
70,
69
],
[
64,
75
],
[
48,
79
],
[
69,
80
],
[
86,
84
],
[
86,
86
],
[
... | [
"# -*- coding: utf-8 -*-\nimport sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
import decimal
cla... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
17,
0,
13,
4,
13,
13,
17,
13,
0,
13,
13,
0,
13,
2,
13,
13,
0,
13,
2,
2,
2,
17,
13,
13,
2,
2,
17,... | [
[
69,
2
],
[
87,
8
],
[
63,
11
],
[
15,
14
],
[
70,
17
],
[
84,
19
],
[
85,
26
],
[
72,
29
],
[
78,
32
],
[
85,
35
],
[
78,
37
],
[
66,
39
],
[
76,
40
],
[
... | [
"#B\nn = int(input())\ncnt = 0\nmerge = 0\nfor _ in range(n):\n v = int(input())\n if v==0:\n merge = 0\n else:\n q,r = divmod(v,2)\n cnt += q\n cnt += (merge * r)\n merge = (1-merge)*r + (1-r)*merge\nprint(cnt)",
"n = int(input())",
"n",
"int(input())",
"int",
... | #B
n = int(input())
cnt = 0
merge = 0
for _ in range(n):
v = int(input())
if v==0:
merge = 0
else:
q,r = divmod(v,2)
cnt += q
cnt += (merge * r)
merge = (1-merge)*r + (1-r)*merge
print(cnt) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
39,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
4,
18,
13,
13,
13,
12,
13,
0,
13,
17,
28,
13,
4,
13,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
14,
2,
2,
18,
13,
13,
17,
... | [
[
114,
2
],
[
138,
8
],
[
126,
11
],
[
15,
14
],
[
115,
17
],
[
129,
19
],
[
127,
26
],
[
130,
28
],
[
33,
32
],
[
36,
35
],
[
72,
38
],
[
74,
40
],
[
44,
43
],
... | [
"N = int(input())\n\nans = 0\nList = []\nfor i in range(N):\n A = int(input())\n List.append(A)\n \ndef func(a, b):\n ret = 0\n for i in range(a, b + 1):\n ret += List[i] // 2\n if List[i] % 2 and i != b:\n List[i + 1] -= 1\n ret += 1\n return ret\n\nleft = 0\nf... | N = int(input())
ans = 0
List = []
for i in range(N):
A = int(input())
List.append(A)
def func(a, b):
ret = 0
for i in range(a, b + 1):
ret += List[i] // 2
if List[i] % 2 and i != b:
List[i + 1] -= 1
ret += 1
return ret
left = 0
for right in range(N):
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
18,
13,
13,
17,
14,
2,
2,
2,
13,
2,
13,
17,
2,
... | [
[
86,
2
],
[
89,
8
],
[
12,
11
],
[
87,
14
],
[
90,
17
],
[
95,
24
],
[
28,
27
],
[
87,
30
],
[
98,
32
],
[
71,
34
],
[
39,
34
],
[
90,
35
],
[
27,
36
],
[
... | [
"N = int(input())\nl = []\nfor i in range(N):\n l.append(int(input()))\n \nans = 0\nfor i in range(N):\n ans += l[i] // 2\n l[i] = l[i] % 2\n if (i<N-1) and (l[i]==1) and (l[i+1]>0):\n ans += 1\n l[i] = 0\n l[i+1] -= 1\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
... | N = int(input())
l = []
for i in range(N):
l.append(int(input()))
ans = 0
for i in range(N):
ans += l[i] // 2
l[i] = l[i] % 2
if (i<N-1) and (l[i]==1) and (l[i+1]>0):
ans += 1
l[i] = 0
l[i+1] -= 1
print(ans) |
[
7,
15,
13,
15,
13,
15,
15,
4,
18,
13,
13,
17,
15,
15,
15,
15,
15,
15,
15,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
17,
12,
13,
12,
13,
0,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
0,
13,
13,
0,
13,
17,
28,
... | [
[
105,
20
],
[
114,
27
],
[
108,
36
],
[
112,
38
],
[
42,
41
],
[
109,
44
],
[
112,
47
],
[
120,
49
],
[
123,
52
],
[
56,
55
],
[
109,
58
],
[
129,
60
],
[
67,
62
... | [
"#!/usr/bin/env python3\n\nimport sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop,heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... |
[
7,
15,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
39,
17,
4,
13,
4,
13,
4,
13,
39,
17,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
2,
13,
1... | [
[
86,
11
],
[
92,
16
],
[
26,
25
],
[
32,
31
],
[
46,
45
],
[
49,
48
],
[
52,
51
],
[
25,
55
],
[
31,
60
],
[
51,
61
],
[
65,
64
],
[
48,
66
],
[
72,
66
],
[
... | [
"import sys\n\nsys.setrecursionlimit(10 ** 7)\nf_inf = float('inf')\nmod = 10 ** 9 + 7\n\n\ndef resolve():\n n = int(input())\n A = [0] + list(int(input()) for _ in range(n)) + [0]\n\n res = 0\n cnt = 0\n for i in range(n + 2):\n if A[i] == 0:\n res += cnt // 2\n cnt = 0\... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
A = [0] + list(int(input()) for _ in range(n)) + [0]
res = 0
cnt = 0
for i in range(n + 2):
if A[i] == 0:
res += cnt // 2
cnt = 0
else:
... |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
2,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
18,
13,
13,
17,
14,
40,
18,
13,
2,
13,
17,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
... | [
[
75,
2
],
[
10,
9
],
[
76,
12
],
[
72,
19
],
[
69,
25
],
[
29,
28
],
[
76,
31
],
[
81,
33
],
[
73,
36
],
[
28,
37
],
[
73,
42
],
[
28,
44
],
[
78,
48
],
[
... | [
"n=int(input())\nA=[int(input()) for _ in range(n)]+[0]\n\ncnt=0\nfor i in range(n):\n cnt +=A[i]//2\n if A[i+1]!=0:\n cnt +=A[i]%2\n A[i+1] -=A[i]%2\nprint(cnt)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(input()) for _ in range(n)",
"for _ in range(... | n=int(input())
A=[int(input()) for _ in range(n)]+[0]
cnt=0
for i in range(n):
cnt +=A[i]//2
if A[i+1]!=0:
cnt +=A[i]%2
A[i+1] -=A[i]%2
print(cnt) |
[
7,
15,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
31,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
40,
13,
0,... | [
[
89,
4
],
[
104,
13
],
[
98,
22
],
[
107,
31
],
[
90,
38
],
[
107,
40
],
[
110,
43
],
[
92,
46
],
[
50,
49
],
[
49,
53
],
[
96,
53
],
[
80,
55
],
[
95,
61
],
[... | [
"import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nN,*A = map(int,read().split())\n\nrest = 0\nanswer = 0\nfor x in A:\n if not x:\n rest = 0\n continue\n if rest:\n x -= 1\n answer += 1\n q,rest = divmod(x,... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,*A = map(int,read().split())
rest = 0
answer = 0
for x in A:
if not x:
rest = 0
continue
if rest:
x -= 1
answer += 1
q,rest = divmod(x,2)
answer += q
p... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
2,
39,
17,
13,
28,
13,
4,
13,
13,
0,
18,
13,
13,
4,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
40,
18,
13,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
18,
13,... | [
[
103,
2
],
[
106,
8
],
[
104,
12
],
[
15,
14
],
[
104,
17
],
[
22,
19
],
[
107,
20
],
[
14,
21
],
[
97,
27
],
[
31,
30
],
[
104,
34
],
[
19,
38
],
[
76,
38
],
... | [
"n = int(input())\na = [0]*n\n\nfor i in range(n):\n a[i] = int(input())\nans = 0\nfor i in range(n-1):\n if a[i] >= 2:\n ans += a[i]//2\n a[i] = a[i]%2\n if a[i] == 1 and a[i+1] >= 1:\n ans += 1\n a[i] -= 1\n a[i+1] -= 1\nprint(ans+a[-1]//2)",
"n = int(input())",
"n"... | n = int(input())
a = [0]*n
for i in range(n):
a[i] = int(input())
ans = 0
for i in range(n-1):
if a[i] >= 2:
ans += a[i]//2
a[i] = a[i]%2
if a[i] == 1 and a[i+1] >= 1:
ans += 1
a[i] -= 1
a[i+1] -= 1
print(ans+a[-1]//2)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
13,
0,
13,
13,
0,
13,
17,
9,
0,
13,
13,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
2... | [
[
77,
2
],
[
10,
9
],
[
78,
12
],
[
65,
19
],
[
80,
22
],
[
89,
25
],
[
29,
28
],
[
66,
28
],
[
90,
32
],
[
75,
32
],
[
84,
32
],
[
28,
33
],
[
69,
33
],
[
... | [
"n = int(input())\nA = [int(input()) for _ in range(n)]\nans = 0\ntmp = 0\nfor a in A:\n if tmp > a:\n ans += a\n tmp = 0\n continue\n else:\n ans += tmp\n a -= tmp\n ans += a // 2\n tmp = a - (a // 2) * 2\nprint(ans)",
"n = int(input())",
"n",
"int(input... | n = int(input())
A = [int(input()) for _ in range(n)]
ans = 0
tmp = 0
for a in A:
if tmp > a:
ans += a
tmp = 0
continue
else:
ans += tmp
a -= tmp
ans += a // 2
tmp = a - (a // 2) * 2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13,
10,
13,
13,
10,
17,
13,
... | [
[
57,
2
],
[
48,
8
],
[
63,
11
],
[
15,
14
],
[
58,
17
],
[
66,
19
],
[
67,
26
],
[
60,
29
],
[
64,
31
],
[
52,
31
],
[
55,
31
],
[
54,
34
],
[
51,
37
],
[
... | [
"N=int(input())\nans=0\nt=0\nfor _ in range(N):\n A=int(input())\n if A==0:\n ans+=t//2\n t=0\n else:\n t+=A\nans+=t//2\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"ans=0",
"ans",
"0",
"t=0",
"t",
"0",
"for _ in range(N):\n ... | N=int(input())
ans=0
t=0
for _ in range(N):
A=int(input())
if A==0:
ans+=t//2
t=0
else:
t+=A
ans+=t//2
print(ans) |
[
7,
15,
13,
0,
13,
4,
13,
4,
18,
18,
13,
13,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
18,
18,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
17,
14,
18,
1... | [
[
88,
4
],
[
16,
15
],
[
89,
18
],
[
94,
29
],
[
85,
32
],
[
36,
35
],
[
89,
39
],
[
91,
41
],
[
95,
45
],
[
35,
47
],
[
58,
49
],
[
95,
50
],
[
35,
51
],
[
... | [
"import sys\nN = int(sys.stdin.readline())\nA = [int(sys.stdin.readline()) for _ in range(N)]\nans = 0\nfor i in range(1, N):\n ans += (A[i - 1] + A[i]) >> 1\n if A[i]:\n A[i] = (A[i - 1] + A[i]) & 1\nprint(A[0] >> 1 if N == 1 else ans)",
"import sys",
"sys",
"N = int(sys.stdin.readline())",
"N... | import sys
N = int(sys.stdin.readline())
A = [int(sys.stdin.readline()) for _ in range(N)]
ans = 0
for i in range(1, N):
ans += (A[i - 1] + A[i]) >> 1
if A[i]:
A[i] = (A[i - 1] + A[i]) & 1
print(A[0] >> 1 if N == 1 else ans) |
[
7,
15,
13,
0,
13,
4,
13,
4,
18,
4,
18,
18,
13,
13,
13,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
18,
4,
18,
18,
13,
13,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
17,
9... | [
[
96,
4
],
[
90,
17
],
[
21,
20
],
[
97,
23
],
[
91,
26
],
[
102,
40
],
[
87,
43
],
[
47,
46
],
[
91,
46
],
[
46,
50
],
[
85,
50
],
[
93,
53
],
[
84,
57
],
[
... | [
"import sys\n\nN = int(sys.stdin.readline().rstrip())\n\nA = []\nfor _ in range(N):\n A.append(int(sys.stdin.readline().rstrip()))\n\npairs = 0\nres = 0\nfor a_i in A:\n if a_i == 0:\n res = 0\n continue\n \n a_i += res\n r = a_i // 2\n pairs += r\n res = a_i - 2*r\n\nprint(pairs)... | import sys
N = int(sys.stdin.readline().rstrip())
A = []
for _ in range(N):
A.append(int(sys.stdin.readline().rstrip()))
pairs = 0
res = 0
for a_i in A:
if a_i == 0:
res = 0
continue
a_i += res
r = a_i // 2
pairs += r
res = a_i - 2*r
print(pairs) |
[
7,
15,
15,
15,
12,
13,
0,
13,
4,
13,
13,
4,
13,
17,
31,
13,
0,
13,
17,
0,
13,
17,
0,
13,
17,
42,
2,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
17,
0,
13,
2,
2,
18,
13,
13,
13,
17,
0,
13,
2,
2,
18,
13,
13,
13,
17... | [
[
8,
7
],
[
8,
14
],
[
18,
17
],
[
21,
20
],
[
24,
23
],
[
20,
27
],
[
57,
27
],
[
7,
28
],
[
20,
33
],
[
57,
33
],
[
37,
36
],
[
40,
39
],
[
20,
44
],
[
57... | [
"#!/usr/bin/env python3\nfrom collections import deque, Counter\nfrom heapq import heappop, heappush\nfrom bisect import bisect_right\n\ndef main():\n N, *A = map(int, open(0))\n ans = 0\n i = 0\n prev = 0\n while i < N:\n if A[i] == 0:\n prev = 0\n else:\n ans += ... | #!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
N, *A = map(int, open(0))
ans = 0
i = 0
prev = 0
while i < N:
if A[i] == 0:
prev = 0
else:
ans += (A[i]+prev)//2
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
4,
13,
4,
13,
14,
2,
13,
40,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
0,
13,
2,... | [
[
72,
2
],
[
84,
8
],
[
78,
14
],
[
85,
16
],
[
63,
19
],
[
85,
21
],
[
25,
24
],
[
73,
29
],
[
75,
32
],
[
64,
39
],
[
85,
39
],
[
82,
39
],
[
76,
41
],
[
... | [
"N=int(input())\npre=int(input())\nans=pre//2\npre=pre&1\nfor i in range(2,N+1):\n Ai=int(input())\n if pre and Ai>=1:\n ans+=1\n Ai-=1\n ans+=Ai//2\n pre=Ai&1\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"pre=int(input())",
"pre",
"int(... | N=int(input())
pre=int(input())
ans=pre//2
pre=pre&1
for i in range(2,N+1):
Ai=int(input())
if pre and Ai>=1:
ans+=1
Ai-=1
ans+=Ai//2
pre=Ai&1
print(ans) |
[
7,
15,
13,
13,
15,
15,
15,
4,
18,
13,
13,
2,
17,
17,
0,
13,
18,
18,
13,
13,
13,
0,
13,
8,
2,
17,
18,
13,
13,
12,
4,
13,
31,
13,
23,
12,
17,
23,
12,
13,
0,
13,
12,
4,
18,
4,
13,
13,
0,
13,
12,
4,
13,
4,
13,
... | [
[
169,
15
],
[
172,
22
],
[
42,
41
],
[
153,
46
],
[
50,
49
],
[
41,
59
],
[
63,
62
],
[
41,
67
],
[
71,
70
],
[
49,
76
],
[
79,
78
],
[
84,
83
],
[
96,
95
],
[... | [
"#coding:utf-8\nimport sys,os\nfrom collections import defaultdict, deque\nfrom fractions import gcd\nfrom math import ceil, floor\nsys.setrecursionlimit(10**6)\nwrite = sys.stdout.write\ndbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0\ndef main(given=sys.stdin.readlin... | #coding:utf-8
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
input... |
[
7,
15,
12,
13,
42,
17,
0,
13,
4,
13,
4,
18,
4,
13,
13,
17,
28,
13,
13,
14,
2,
4,
13,
13,
17,
27,
13,
0,
13,
4,
13,
12,
13,
41,
29,
4,
13,
13,
12,
13,
0,
13,
4,
13,
29,
4,
13,
13,
0,
13,
4,
13,
2,
17,
17,
15... | [
[
8,
7
],
[
18,
17
],
[
7,
17
],
[
17,
23
],
[
17,
26
],
[
170,
28
],
[
168,
30
],
[
42,
41
],
[
174,
43
],
[
41,
47
],
[
149,
49
],
[
155,
64
],
[
153,
66
],
[... | [
"from _collections import deque\n\n\ndef parser():\n while 1:\n data = list(input().split(' '))\n for number in data:\n if len(number) > 0:\n yield (number)\n\n\ninput_parser = parser()\n\n\ndef gw():\n global input_parser\n return next(input_parser)\n\n\ndef gi():\n... | from _collections import deque
def parser():
while 1:
data = list(input().split(' '))
for number in data:
if len(number) > 0:
yield (number)
input_parser = parser()
def gw():
global input_parser
return next(input_parser)
def gi():
data = gw()
retur... |
[
7,
15,
13,
15,
13,
0,
13,
12,
2,
4,
13,
13,
17,
23,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
4,
18,
13,
13,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
... | [
[
91,
6
],
[
100,
15
],
[
115,
24
],
[
94,
33
],
[
121,
47
],
[
101,
54
],
[
121,
56
],
[
103,
59
],
[
109,
62
],
[
66,
65
],
[
65,
69
],
[
118,
72
],
[
65,
73
],... | [
"#! /usr/bin/env python3\n\nimport sys\nimport numpy as np\nint1 = lambda x: int(x) - 1\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(500000)\n\nN, *A = map(int, read().split())\n\ncnt = 0\nacc = 0\nfor a in A:\n if a != 0:\n ... | #! /usr/bin/env python3
import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N, *A = map(int, read().split())
cnt = 0
acc = 0
for a in A:
if a != 0:
acc += a
els... |
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
13,
17,
13,
13,
31,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
2,
13,
17,
0,
13,
17,
4,
13,
2,
13,
2,
13,
17,
10,
4,
... | [
[
55,
2
],
[
55,
15
],
[
64,
18
],
[
58,
21
],
[
25,
24
],
[
56,
27
],
[
24,
32
],
[
61,
35
],
[
24,
38
],
[
67,
40
],
[
59,
42
],
[
71,
42
],
[
62,
42
],
[
... | [
"N,*A = map(int, open(0).read().split())\nans = 0\ncum = 0\nfor i in range(N):\n if A[i] > 0:\n cum += A[i]\n else:\n ans += cum // 2\n cum = 0\nprint(ans+cum//2)",
"N,*A = map(int, open(0).read().split())",
"N",
"map(int, open(0).read().split())",
"map",
"int",
"open(0).read(... | N,*A = map(int, open(0).read().split())
ans = 0
cum = 0
for i in range(N):
if A[i] > 0:
cum += A[i]
else:
ans += cum // 2
cum = 0
print(ans+cum//2) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
... | [
[
89,
2
],
[
10,
9
],
[
90,
12
],
[
98,
19
],
[
95,
22
],
[
26,
25
],
[
90,
29
],
[
92,
32
],
[
39,
34
],
[
99,
35
],
[
25,
36
],
[
42,
39
],
[
99,
40
],
[
... | [
"N = int(input())\nA = [int(input()) for _ in range(N)]\nans = 0\nfor i in range(N-1):\n dup1 = A[i] // 2\n A[i] -= dup1 * 2\n dup2 = min(A[i], A[i+1])\n A[i+1] -= dup2\n ans += dup1 + dup2\ndup1 = A[-1] // 2\nans += dup1\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"inp... | N = int(input())
A = [int(input()) for _ in range(N)]
ans = 0
for i in range(N-1):
dup1 = A[i] // 2
A[i] -= dup1 * 2
dup2 = min(A[i], A[i+1])
A[i+1] -= dup2
ans += dup1 + dup2
dup1 = A[-1] // 2
ans += dup1
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
0,
13,
4,
13,
18,
13,
17,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
17,
14,
2,
18,
13,
2,
13,
17,
17,
0,
13,
4,
13,
18,... | [
[
96,
2
],
[
105,
8
],
[
12,
11
],
[
97,
14
],
[
106,
17
],
[
102,
24
],
[
106,
28
],
[
102,
31
],
[
106,
32
],
[
36,
35
],
[
97,
39
],
[
114,
41
],
[
106,
46
],
... | [
"n = int(input())\na = []\nfor i in range(n):\n a.append(int(input()))\n#適当な整数iを考えたとき、i-1の数字が余っているのであれば、それとペアを組ませるのが最適。\n#余っていない時は、出来るだけ自分同士でペアを組む。もし一枚余るようであれば、残しておく\nans, a[0] = divmod(a[0], 2)\nfor i in range(1,n):\n pair = 0\n if a[i-1] > 0:\n pair = min(a[i-1], a[i])\n a[i-1] -= pair\n ... | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
#適当な整数iを考えたとき、i-1の数字が余っているのであれば、それとペアを組ませるのが最適。
#余っていない時は、出来るだけ自分同士でペアを組む。もし一枚余るようであれば、残しておく
ans, a[0] = divmod(a[0], 2)
for i in range(1,n):
pair = 0
if a[i-1] > 0:
pair = min(a[i-1], a[i])
a[i-1] -= pair
a[i] -= pair... |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
... | [
[
54,
2
],
[
10,
9
],
[
55,
12
],
[
57,
19
],
[
66,
22
],
[
60,
25
],
[
29,
28
],
[
58,
28
],
[
28,
32
],
[
76,
32
],
[
72,
35
],
[
75,
38
],
[
73,
39
],
[
... | [
"N = int(input())\nA = [int(input()) for i in range(N)]\n\nans = 0\ntmp = 0\nfor a in A:\n if a == 0:\n tmp = 0\n a += tmp\n ans += a // 2\n tmp = a % 2\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(input()) for i in range(N)",
"for i in ... | N = int(input())
A = [int(input()) for i in range(N)]
ans = 0
tmp = 0
for a in A:
if a == 0:
tmp = 0
a += tmp
ans += a // 2
tmp = a % 2
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
40,
13,
17,
0,
13,
13,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
... | [
[
51,
2
],
[
48,
8
],
[
63,
11
],
[
15,
14
],
[
52,
17
],
[
57,
19
],
[
58,
26
],
[
66,
29
],
[
58,
30
],
[
60,
32
],
[
49,
34
],
[
55,
34
],
[
67,
34
],
[
... | [
"N = int(input())\ntmp = 0\nans = 0\nfor _ in range(N):\n a = int(input())\n if a != 0:\n tmp += a\n else:\n ans += tmp // 2\n tmp = 0\nans += tmp // 2\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"tmp = 0",
"tmp",
"0",
"ans = 0"... | N = int(input())
tmp = 0
ans = 0
for _ in range(N):
a = int(input())
if a != 0:
tmp += a
else:
ans += tmp // 2
tmp = 0
ans += tmp // 2
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
2,
18,
13,
13,
17,
17,
0,
13,
2,
18,
13,
13,
17,
14,
2,
18,
13,
2,
13,
17,
17,
0,
13,
... | [
[
111,
2
],
[
10,
9
],
[
112,
12
],
[
105,
19
],
[
99,
22
],
[
26,
25
],
[
112,
29
],
[
58,
34
],
[
106,
35
],
[
25,
36
],
[
114,
40
],
[
58,
42
],
[
106,
43
],
... | [
"n = int(input())\na = [int(input()) for i in range(n)]\nans = 0\nfor i in range(n-1):\n if a[i]%2==0:\n ans+=a[i]//2\n elif a[i+1]>0:\n ans+=1\n a[i]-=1\n ans+=a[i]//2\n a[i+1]-=1\n else:\n ans+=a[i]//2 \n #print(ans)\n \nans+=a[n-1]//2\nprint(ans)",
"n = int(input())",
"n",
"int(in... | n = int(input())
a = [int(input()) for i in range(n)]
ans = 0
for i in range(n-1):
if a[i]%2==0:
ans+=a[i]//2
elif a[i+1]>0:
ans+=1
a[i]-=1
ans+=a[i]//2
a[i+1]-=1
else:
ans+=a[i]//2
#print(ans)
ans+=a[n-1]//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
2,
13,
17,
14,
2,
2,
2,
13,
17,
17,
40,
18,
13,
2,
13,
17,
... | [
[
89,
2
],
[
83,
8
],
[
12,
11
],
[
90,
14
],
[
84,
17
],
[
92,
24
],
[
28,
27
],
[
90,
31
],
[
98,
34
],
[
84,
36
],
[
27,
37
],
[
95,
39
],
[
99,
41
],
[
... | [
"N=int(input())\nA=[]\nfor i in range(N):\n A.append(int(input()))\n\nans=0\nfor i in range(N-1):\n x=A[i]\n ans+=x//2\n if x%2==1 and A[i+1]>=1:\n ans+=1\n A[i+1]-=1\n\nans+=A[N-1]//2\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"A=[]",
"... | N=int(input())
A=[]
for i in range(N):
A.append(int(input()))
ans=0
for i in range(N-1):
x=A[i]
ans+=x//2
if x%2==1 and A[i+1]>=1:
ans+=1
A[i+1]-=1
ans+=A[N-1]//2
print(ans)
|
[
7,
15,
13,
12,
13,
0,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
2,
13,
17,
0,
18,
13,
13,
2,
17,
2,
13,
17,
14,
2,
2,
2,
18,
13,
13,
17,
... | [
[
90,
6
],
[
100,
8
],
[
12,
11
],
[
91,
14
],
[
100,
17
],
[
87,
19
],
[
105,
22
],
[
26,
25
],
[
91,
28
],
[
96,
30
],
[
72,
31
],
[
40,
31
],
[
88,
32
],
[
... | [
"import sys\ndef I(): return int(sys.stdin.readline().rstrip())\n\n\nN = I()\nA = [I() for _ in range(N)]\n\nans = 0\nfor i in range(N):\n a = A[i]\n ans += a//2\n A[i] -= 2*(a//2)\n if A[i] == 1 and i < N-1 and A[i+1] >= 1:\n ans += 1\n A[i] = 0\n A[i+1] -= 1\n\nprint(ans)",
"imp... | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
A = [I() for _ in range(N)]
ans = 0
for i in range(N):
a = A[i]
ans += a//2
A[i] -= 2*(a//2)
if A[i] == 1 and i < N-1 and A[i+1] >= 1:
ans += 1
A[i] = 0
A[i+1] -= 1
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
17,
0,
13,
2,
13,
18,
13,
13,
0,
13,
2,
13,
2,
13,
17,
... | [
[
76,
2
],
[
10,
9
],
[
77,
12
],
[
79,
19
],
[
91,
22
],
[
73,
25
],
[
82,
29
],
[
33,
32
],
[
77,
35
],
[
80,
39
],
[
32,
40
],
[
85,
43
],
[
83,
45
],
[
... | [
"#A[i]の部分列P[i]に0が含まれない場合、P[i]にあるカードを最大限利用し、sum(P[i])//2組構成でき、あまりは一切持ち越されない。\n#これより、先頭から0が現れるまで要素を加算していき、0が出たら2で割って切り捨て\n#この解はコーナーケースなくできる\n\n#sum(P[i])//2組は何らかの順序でgreedyに取れば必ず構成でき、そうすることでP[i]のどこか1つがsum(P[i])%2となる以外は全て0となる\n#... 0 [ P[i] ] 0 [ P[i+1] ]...と構成するため、\n#... 0 [(1/0) 0 0 ... (0/1)] 0 [p[i+1][0] p[i+1][1] ... | #A[i]の部分列P[i]に0が含まれない場合、P[i]にあるカードを最大限利用し、sum(P[i])//2組構成でき、あまりは一切持ち越されない。
#これより、先頭から0が現れるまで要素を加算していき、0が出たら2で割って切り捨て
#この解はコーナーケースなくできる
#sum(P[i])//2組は何らかの順序でgreedyに取れば必ず構成でき、そうすることでP[i]のどこか1つがsum(P[i])%2となる以外は全て0となる
#... 0 [ P[i] ] 0 [ P[i+1] ]...と構成するため、
#... 0 [(1/0) 0 0 ... (0/1)] 0 [p[i+1][0] p[i+1][1] ...]があまりを活用... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
0,
13,
17,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
40,
2,
2,
13,
17,
13,
17,
2,
18,
13,
13,
17,
0,
13,
17,
0,
18,
13,
13,
17,
... | [
[
92,
2
],
[
89,
8
],
[
86,
11
],
[
15,
14
],
[
93,
17
],
[
90,
20
],
[
104,
27
],
[
31,
30
],
[
93,
33
],
[
30,
39
],
[
105,
41
],
[
102,
41
],
[
111,
41
],
[
... | [
"n = int(input())\na = []\ncnt = 0\nfor i in range(n):\n a.append(int(input()))\nstack = -1\nfor i in range(n):\n if i+1 - stack <= 1 and a[i] > 0:\n cnt += 1\n a[i] -= 1\n stack = -1\n cnt += a[i] // 2\n if a[i] % 2 == 1:\n stack = i+1\n else:\n stack = -1\nprint(cnt)",
"n = int(input())",
... | n = int(input())
a = []
cnt = 0
for i in range(n):
a.append(int(input()))
stack = -1
for i in range(n):
if i+1 - stack <= 1 and a[i] > 0:
cnt += 1
a[i] -= 1
stack = -1
cnt += a[i] // 2
if a[i] % 2 == 1:
stack = i+1
else:
stack = -1
print(cnt) |
[
7,
15,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
12,
4,
13,
4,
13,
0,
13,
12,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
12,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
12,
4,... | [
[
350,
4
],
[
335,
13
],
[
338,
22
],
[
336,
27
],
[
344,
29
],
[
336,
37
],
[
329,
40
],
[
336,
50
],
[
332,
53
],
[
351,
61
],
[
341,
64
],
[
336,
71
],
[
79,
78
... | [
"import sys\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\nin_n = lambda: int(readline())\nin_nn = lambda: map(int, readline().split())\nin_nl = lambda: list(map(int, readline().split()))\nin_na = lambda: map(int, read().split())\nin_s = lambda: readline().rstrip().decode('utf-8')\n\n\ndef... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N =... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
13,
39,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
4,
18,
13,
13,
13,
0,
13,
39,
4,
18,
13,
13,
13,
4,
18,
13,
13,
13,
0,
13,
17,
28,
13,
13,
0,
13,
2,
4,
13,
... | [
[
77,
2
],
[
62,
8
],
[
68,
10
],
[
14,
13
],
[
78,
16
],
[
71,
18
],
[
72,
25
],
[
63,
29
],
[
69,
31
],
[
81,
31
],
[
80,
33
],
[
69,
37
],
[
81,
37
],
[
... | [
"n = int(input())\nlar, l = [], []\nfor i in range(n):\n a = int(input())\n if a == 0:\n lar.append(l)\n l = []\n else:\n l.append(a)\nlar.append(l)\nans = 0\nfor l in lar:\n ans += sum(l) // 2\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"inp... | n = int(input())
lar, l = [], []
for i in range(n):
a = int(input())
if a == 0:
lar.append(l)
l = []
else:
l.append(a)
lar.append(l)
ans = 0
for l in lar:
ans += sum(l) // 2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
4,
18,
13,
13,
17,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
2,
... | [
[
98,
2
],
[
10,
9
],
[
99,
12
],
[
101,
19
],
[
102,
23
],
[
92,
27
],
[
104,
30
],
[
34,
33
],
[
99,
36
],
[
84,
39
],
[
51,
39
],
[
102,
40
],
[
33,
41
],
[
... | [
"N = int(input())\nA = [int(input()) for _ in range(N)]\nA.append(0)\n\ncon = False\nans = 0\n\nfor i in range(N):\n if A[i] >=2:\n ans += A[i]//2\n A[i] -= (A[i]//2)*2\n \n mm = min(A[i+1],A[i])\n ans += mm\n A[i+1] -= mm\n A[i] -= mm\n #print(A)\n\n\nprint(ans)",
"N = int(inpu... | N = int(input())
A = [int(input()) for _ in range(N)]
A.append(0)
con = False
ans = 0
for i in range(N):
if A[i] >=2:
ans += A[i]//2
A[i] -= (A[i]//2)*2
mm = min(A[i+1],A[i])
ans += mm
A[i+1] -= mm
A[i] -= mm
#print(A)
print(ans) |
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
... | [
[
5,
4
],
[
12,
11
],
[
4,
14
],
[
22,
21
],
[
25,
24
],
[
28,
27
],
[
4,
31
],
[
35,
34
],
[
41,
36
],
[
21,
37
],
[
27,
38
],
[
44,
41
],
[
21,
42
],
[
27... | [
"def main():\n n = int(input())\n a = [int(input()) for _ in range(n)]\n ans = 0\n for i in range(n-1):\n ans += a[i] // 2\n a[i] %= 2\n ans += min(a[i], a[i+1])\n a[i+1] -= min(a[i], a[i+1])\n ans += a[n-1] // 2\n print(ans)\n\nif __name__ == \"__main__\":\n main()"... | def main():
n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
for i in range(n-1):
ans += a[i] // 2
a[i] %= 2
ans += min(a[i], a[i+1])
a[i+1] -= min(a[i], a[i+1])
ans += a[n-1] // 2
print(ans)
if __name__ == "__main__":
main() |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
13,
17,
14,
2,
13,
17,
0,
13,
17,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
4,
1... | [
[
49,
2
],
[
67,
8
],
[
64,
11
],
[
15,
14
],
[
50,
17
],
[
55,
19
],
[
58,
25
],
[
65,
28
],
[
53,
28
],
[
62,
28
],
[
56,
29
],
[
61,
32
],
[
65,
35
],
[
... | [
"n=int(input())\nc=0\nam=0\nfor i in range(n):\n a=int(input())\n c+=(am+a)//2\n am=(am+a)%2\n if a==0:\n am=0\nprint(c)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"c=0",
"c",
"0",
"am=0",
"am",
"0",
"for i in range(n):\n a=int(input())\n c+=(am+a)//2\n a... | n=int(input())
c=0
am=0
for i in range(n):
a=int(input())
c+=(am+a)//2
am=(am+a)%2
if a==0:
am=0
print(c) |
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
4,
18,
13,
13,
17,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
2,
13,... | [
[
5,
4
],
[
11,
10
],
[
14,
13
],
[
4,
16
],
[
10,
19
],
[
10,
27
],
[
32,
31
],
[
35,
34
],
[
38,
37
],
[
4,
41
],
[
10,
45
],
[
37,
46
],
[
49,
48
],
[
10... | [
"def main():\n n = int(input())\n cards = []\n for _ in range(n):\n cards.append(int(input()))\n cards.append(0)\n answer = 0\n tmp = 0\n for i in range(n + 1):\n if cards[i]:\n tmp += cards[i]\n else:\n answer += tmp // 2\n tmp = 0\n pri... | def main():
n = int(input())
cards = []
for _ in range(n):
cards.append(int(input()))
cards.append(0)
answer = 0
tmp = 0
for i in range(n + 1):
if cards[i]:
tmp += cards[i]
else:
answer += tmp // 2
tmp = 0
print(answer)
if __n... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
0,
13,
17,
42,
2,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
0,
13,
13,
0,
13,
17,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13,
10,
... | [
[
65,
2
],
[
53,
8
],
[
77,
11
],
[
71,
14
],
[
72,
18
],
[
57,
18
],
[
66,
19
],
[
62,
21
],
[
63,
28
],
[
80,
31
],
[
78,
33
],
[
60,
33
],
[
69,
33
],
[
... | [
"N = int(input())\nans = 0\ntmp = 0\ni = 0\nwhile i < N:\n a = int(input())\n if a == 0:\n ans += tmp //2\n tmp = 0\n else:\n tmp += a\n i += 1\nans += tmp // 2\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"tmp = 0",
"tmp... | N = int(input())
ans = 0
tmp = 0
i = 0
while i < N:
a = int(input())
if a == 0:
ans += tmp //2
tmp = 0
else:
tmp += a
i += 1
ans += tmp // 2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
13,
13,
0,
13,
2,
13,
17,
14,
2,
2,
13,
17,
2,
13,
17,
0,
13,
17,
9,
0,
13,
2,
13,
17,
4,
13,
13,
10,
17,
13... | [
[
70,
2
],
[
67,
8
],
[
55,
11
],
[
15,
14
],
[
71,
17
],
[
76,
19
],
[
61,
25
],
[
77,
27
],
[
56,
28
],
[
59,
28
],
[
65,
28
],
[
73,
30
],
[
62,
32
],
[
... | [
"N = int(input())\nans = 0\nB = 0\nfor i in range(N):\n A = int(input())\n C = A+B\n ans += C//2\n if B == 1 and C == 1:\n B = 0\n continue\n B = C % 2\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"B = 0",
... | N = int(input())
ans = 0
B = 0
for i in range(N):
A = int(input())
C = A+B
ans += C//2
if B == 1 and C == 1:
B = 0
continue
B = C % 2
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
2,
... | [
[
83,
2
],
[
95,
8
],
[
12,
11
],
[
84,
14
],
[
96,
17
],
[
89,
24
],
[
28,
27
],
[
84,
31
],
[
86,
34
],
[
41,
36
],
[
96,
37
],
[
27,
38
],
[
44,
41
],
[
... | [
"n=int(input())\nA=[]\nfor i in range(n):\n A.append(int(input()))\n\nans=0\nfor i in range(n-1):\n ans+=A[i]//2\n A[i]%=2\n if A[i]==1 and A[i+1]>0:\n ans+=1\n A[i+1]-=1\n\nans+=A[-1]//2\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"A=[]",
... | n=int(input())
A=[]
for i in range(n):
A.append(int(input()))
ans=0
for i in range(n-1):
ans+=A[i]//2
A[i]%=2
if A[i]==1 and A[i+1]>0:
ans+=1
A[i+1]-=1
ans+=A[-1]//2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
18,
13,
13,
17,
13,
0,
13,
13,
14,
2,
2,
13,
2,
13,
17,
40,
18,
13,
2,
13,
17,
17,
0,
... | [
[
66,
2
],
[
10,
9
],
[
67,
12
],
[
75,
19
],
[
69,
22
],
[
26,
25
],
[
67,
28
],
[
78,
30
],
[
76,
34
],
[
25,
35
],
[
78,
37
],
[
81,
39
],
[
79,
40
],
[
... | [
"n = int(input())\nlis = [int(input()) for i in range(n)]\n\nans = 0\nfor i in range(n):\n temp, mod = divmod(lis[i], 2)\n ans += temp\n if i < n-1 and lis[i+1] != 0:\n lis[i+1] += mod\n\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(input()) for... | n = int(input())
lis = [int(input()) for i in range(n)]
ans = 0
for i in range(n):
temp, mod = divmod(lis[i], 2)
ans += temp
if i < n-1 and lis[i+1] != 0:
lis[i+1] += mod
print(ans) |
[
7,
15,
13,
15,
15,
15,
13,
15,
13,
12,
13,
12,
13,
12,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
2,
1... | [
[
86,
16
],
[
93,
20
],
[
24,
23
],
[
87,
26
],
[
93,
31
],
[
89,
33
],
[
77,
36
],
[
101,
39
],
[
43,
42
],
[
87,
45
],
[
90,
49
],
[
42,
50
],
[
74,
53
],
[
... | [
"import sys\nfrom collections import Counter\nfrom collections import deque\nimport math\nimport bisect\ndef input(): return sys.stdin.readline().strip()\ndef mp(): return map(int,input().split())\ndef lmp(): return list(map(int,input().split()))\n\n\nn=int(input())\nl=[int(input()) for i in range(n)]\nans=0\nc=0\n... | import sys
from collections import Counter
from collections import deque
import math
import bisect
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n=int(input())
l=[int(input()) for i in range(n)]
ans=0
c=0
for i in range(n):
... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
13,
13,
17,
14,
2,
2,
2,
13,
13,
17,
17,
14,
2,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
17,
4,
13,
13,
10,
4... | [
[
56,
2
],
[
68,
8
],
[
62,
11
],
[
15,
14
],
[
57,
17
],
[
71,
19
],
[
65,
25
],
[
72,
28
],
[
63,
29
],
[
78,
29
],
[
75,
29
],
[
60,
29
],
[
72,
35
],
[
... | [
"N = int(input())\nans = 0\nb = 0\nfor i in range(N):\n a = int(input())\n ans += (a + b) // 2\n if (a + b) % 2 == 1:\n if a > 0:\n b = 1\n else:\n b = 0\n else:\n b = 0\n \nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()"... | N = int(input())
ans = 0
b = 0
for i in range(N):
a = int(input())
ans += (a + b) // 2
if (a + b) % 2 == 1:
if a > 0:
b = 1
else:
b = 0
else:
b = 0
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
18,
13,
13,
13,
17,
14,
40,
18,
13,
13,
17,
0,
13,
2,
2,
18,
13,
13,
13,
17,
... | [
[
69,
2
],
[
10,
9
],
[
70,
12
],
[
66,
19
],
[
81,
22
],
[
63,
25
],
[
29,
28
],
[
70,
31
],
[
72,
33
],
[
67,
37
],
[
28,
38
],
[
64,
39
],
[
79,
39
],
[
... | [
"n = int(input())\nA = [int(input()) for _ in range(n)]\nans = 0\ntemp = 0\nfor i in range(n):\n ans += (A[i]+temp)//2\n if A[i] != 0:\n temp = (A[i]+temp)%2\n else:\n temp = 0\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(input()) for _ ... | n = int(input())
A = [int(input()) for _ in range(n)]
ans = 0
temp = 0
for i in range(n):
ans += (A[i]+temp)//2
if A[i] != 0:
temp = (A[i]+temp)%2
else:
temp = 0
print(ans) |
[
7,
12,
13,
0,
13,
4,
13,
14,
2,
2,
17,
13,
40,
2,
17,
13,
4,
13,
17,
14,
2,
2,
17,
13,
40,
2,
17,
13,
4,
13,
17,
14,
2,
2,
17,
13,
40,
2,
17,
13,
4,
13,
17,
14,
2,
2,
17,
13,
40,
2,
17,
13,
4,
13,
17,
4,
... | [
[
5,
4
],
[
4,
11
],
[
4,
15
],
[
4,
23
],
[
4,
27
],
[
4,
35
],
[
4,
39
],
[
4,
47
],
[
4,
51
],
[
63,
62
],
[
68,
67
],
[
62,
70
],
[
76,
75
],
[
79,
... | [
"def examA():\n S = SI()\n if \"W\" in S and not \"E\" in S:\n print(\"No\")\n elif \"E\" in S and not \"W\" in S:\n print(\"No\")\n elif \"N\" in S and not \"S\" in S:\n print(\"No\")\n elif \"S\" in S and not \"N\" in S:\n print(\"No\")\n else:\n print(\"Yes\")... | def examA():
S = SI()
if "W" in S and not "E" in S:
print("No")
elif "E" in S and not "W" in S:
print("No")
elif "N" in S and not "S" in S:
print("No")
elif "S" in S and not "N" in S:
print("No")
else:
print("Yes")
return
def examB():
N = I()
... |
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
2,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
2,
13,
... | [
[
89,
2
],
[
10,
9
],
[
90,
12
],
[
95,
19
],
[
92,
22
],
[
26,
25
],
[
90,
29
],
[
98,
32
],
[
39,
34
],
[
96,
35
],
[
25,
36
],
[
42,
39
],
[
96,
40
],
[
... | [
"n = int(input())\na = [int(input()) for _ in range(n)]\n\nans = 0\nfor i in range(n - 1):\n pair1 = a[i] // 2\n a[i] -= pair1 * 2\n pair2 = min(a[i], a[i+1])\n ans += pair1 + pair2\n a[i+1] -= pair2\n\nans += a[-1] // 2\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()... | n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
for i in range(n - 1):
pair1 = a[i] // 2
a[i] -= pair1 * 2
pair2 = min(a[i], a[i+1])
ans += pair1 + pair2
a[i+1] -= pair2
ans += a[-1] // 2
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
2,
13,
17,
0,
13,
17,
9,
0,
13,
13,
0,
13,
2,
13,
17,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
2,
1... | [
[
61,
2
],
[
52,
8
],
[
67,
11
],
[
15,
14
],
[
62,
17
],
[
49,
19
],
[
50,
26
],
[
64,
29
],
[
68,
31
],
[
59,
31
],
[
71,
31
],
[
70,
34
],
[
58,
38
],
[
... | [
"n = int(input())\nans = 0\nsum = 0\nfor _ in range(n):\n a = int(input())\n if a == 0:\n ans += sum//2\n sum = 0\n continue\n sum += a\nans += sum // 2\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"sum = 0",
"sum",
"0",... | n = int(input())
ans = 0
sum = 0
for _ in range(n):
a = int(input())
if a == 0:
ans += sum//2
sum = 0
continue
sum += a
ans += sum // 2
print(ans) |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
14,
2,
13,
17,
0,
13,
17,
0,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
13,
17,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
17,
... | [
[
52,
2
],
[
61,
8
],
[
49,
11
],
[
15,
14
],
[
53,
17
],
[
64,
19
],
[
65,
26
],
[
55,
29
],
[
58,
32
],
[
65,
35
],
[
50,
36
],
[
68,
36
],
[
56,
36
],
[
... | [
"n = int(input())\nans = 0\nflow = 0\nfor i in range(n):\n a = int(input())\n if a == 0:\n flow = 0\n else :\n ans += (a + flow) // 2\n flow = (a + flow) % 2\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"ans = 0",
"ans",
"0",
"flow = 0",
"flow",... | n = int(input())
ans = 0
flow = 0
for i in range(n):
a = int(input())
if a == 0:
flow = 0
else :
ans += (a + flow) // 2
flow = (a + flow) % 2
print(ans) |
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
4,
18,
13,
13,
2,
17,
17,
15,
15,
15,
15,
15,
15,
15,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
39,
4,
13,
12,
13,... | [
[
258,
4
],
[
33,
32
],
[
259,
40
],
[
46,
45
],
[
235,
52
],
[
60,
60
],
[
64,
64
],
[
264,
66
],
[
252,
71
],
[
288,
78
],
[
241,
80
],
[
291,
82
],
[
87,
86
],... | [
"#float型を許すな\n#numpyはpythonで\nimport sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nfrom collections import Counter, deque\nfrom collections import defaultdict\nfrom itertools import combinations, permutations, accumulate, groupby, product\nfrom bisect import bisect_left,bisect_right\nfrom heapq imp... | #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, h... |
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
4,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
0,
13,
2,
13,
17,
0,
13,
17,
28,
13,
13,
0,
13,
2,
13,
17,
14,
2,
13,
17,
14,
2,
13,
17,
0,
13,
17,
... | [
[
5,
4
],
[
12,
11
],
[
4,
14
],
[
22,
21
],
[
25,
24
],
[
28,
27
],
[
21,
27
],
[
31,
30
],
[
27,
32
],
[
36,
35
],
[
39,
38
],
[
21,
38
],
[
42,
41
],
[
3... | [
"def solve():\n N = int(input())\n A = [int(input()) for _ in range(N)]\n ans = 0\n for a in A:\n ans += a//2\n prev = 0\n for a in A:\n new = a%2\n if prev == 1:\n if new == 1:\n ans += 1\n elif a>0:\n prev = 1\n ... | def solve():
N = int(input())
A = [int(input()) for _ in range(N)]
ans = 0
for a in A:
ans += a//2
prev = 0
for a in A:
new = a%2
if prev == 1:
if new == 1:
ans += 1
elif a>0:
prev = 1
else:
... |
[
7,
15,
13,
13,
15,
15,
15,
15,
15,
15,
15,
15,
15,
12,
13,
12,
13,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,... | [
[
26,
25
],
[
140,
31
],
[
35,
35
],
[
130,
44
],
[
142,
49
],
[
124,
57
],
[
122,
59
],
[
63,
62
],
[
125,
65
],
[
122,
68
],
[
151,
70
],
[
148,
73
],
[
77,
76
... | [
"import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\nfrom operator import i... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... |
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
13,
0,
13,
2,
13,
17,
14,
2,
2,
13,
17,
2,
13,
17,
0,
13,
17,
14,
2,
13,
17,
0,
13,
17,
0,
13,
17,
4,
13,
13,
1... | [
[
72,
2
],
[
60,
8
],
[
78,
11
],
[
15,
14
],
[
73,
17
],
[
75,
19
],
[
81,
25
],
[
79,
26
],
[
67,
26
],
[
70,
26
],
[
58,
26
],
[
63,
28
],
[
82,
30
],
[
... | [
"N = int(input())\nr = 0\nb = 0\nfor _ in range(N):\n a = int(input())\n a += b\n# print(a-b,b,a//2)\n r += a//2\n if a == 1 and b == 1:\n b = 0\n elif a%2:\n b = 1\n else:\n b = 0\nprint(r)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
... | N = int(input())
r = 0
b = 0
for _ in range(N):
a = int(input())
a += b
# print(a-b,b,a//2)
r += a//2
if a == 1 and b == 1:
b = 0
elif a%2:
b = 1
else:
b = 0
print(r)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.