lang stringclasses 1
value | prompt stringlengths 1.38k 11.3k | eval_prompt stringlengths 37 8.09k | ground_truth stringlengths 1 328 | unit_tests stringclasses 145
values | task_id stringlengths 23 25 | split stringclasses 2
values |
|---|---|---|---|---|---|---|
python | Complete the code in python to solve this programming problem:
Description: We say an infinite sequence $$$a_{0}, a_{1}, a_2, \ldots$$$ is non-increasing if and only if for all $$$i\ge 0$$$, $$$a_i \ge a_{i+1}$$$.There is an infinite right and down grid. The upper-left cell has coordinates $$$(0,0)$$$. Rows are number... | n,x,d,m,f=int(input()),0,0,10**9+7,[1]
for {{completion}}: f.append(f[-1]*i%m)
for z in list(map(int,input().split())):
d+=f[z+x]*pow(f[x+1]*f[z-1],m-2,m)*(z!=0)
x+=1
print(d%m) | i in range(1,9**6) | [{"input": "2\n2 2 0", "output": ["5"]}, {"input": "10\n12 11 8 8 6 6 6 5 3 2 1", "output": ["2596"]}] | control_completion_007312 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: We say an infinite sequence $$$a_{0}, a_{1}, a_2, \ldots$$$ is non-increasing if and only if for all $$$i\ge 0$$$, $$$a_i \ge a_{i+1}$$$.There is an infinite right and down grid. The upper-left cell has coordinates $$$(0,0)$$$. Rows are number... | n,x,d,m,f=int(input()),0,0,10**9+7,[1]
for i in range(1,9**6): f.append(f[-1]*i%m)
for {{completion}}:
d+=f[z+x]*pow(f[x+1]*f[z-1],m-2,m)*(z!=0)
x+=1
print(d%m) | z in list(map(int,input().split())) | [{"input": "2\n2 2 0", "output": ["5"]}, {"input": "10\n12 11 8 8 6 6 6 5 3 2 1", "output": ["2596"]}] | control_completion_007313 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Mainak has a convex polygon $$$\mathcal P$$$ with $$$n$$$ vertices labelled as $$$A_1, A_2, \ldots, A_n$$$ in a counter-clockwise fashion. The coordinates of the $$$i$$$-th point $$$A_i$$$ are given by $$$(x_i, y_i)$$$, where $$$x_i$$$ and $$$... | import math
pi = 3.14159265358979323846264338327950288419716939937510
eps, sq2 = 1e-13, math.sqrt(2)
x, y = [], []
n = 0
def binary_find(la, lb, ra, rb, cy, fy, alpha_1, alpha_2, ab):
while math.fabs(cy - fy) > eps:
mid_y = cy / 2.0 + fy / 2.0
la = lb = 0.0
ra, rb = pi - alpha... | yy < mid_y | [{"input": "4\n4 5\n4 1\n7 1\n7 5", "output": ["1.17809724510"]}, {"input": "5\n-3 3\n3 1\n4 2\n-1 9\n-2 9", "output": ["1.07823651333"]}] | control_completion_007390 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Mainak has a convex polygon $$$\mathcal P$$$ with $$$n$$$ vertices labelled as $$$A_1, A_2, \ldots, A_n$$$ in a counter-clockwise fashion. The coordinates of the $$$i$$$-th point $$$A_i$$$ are given by $$$(x_i, y_i)$$$, where $$$x_i$$$ and $$$... | import math
pi = 3.14159265358979323846264338327950288419716939937510
eps, sq2 = 1e-13, math.sqrt(2)
x, y = [], []
n = 0
def binary_find(la, lb, ra, rb, cy, fy, alpha_1, alpha_2, ab):
while math.fabs(cy - fy) > eps:
mid_y = cy / 2.0 + fy / 2.0
la = lb = 0.0
ra, rb = pi - alpha... | yy > mid_y | [{"input": "4\n4 5\n4 1\n7 1\n7 5", "output": ["1.17809724510"]}, {"input": "5\n-3 3\n3 1\n4 2\n-1 9\n-2 9", "output": ["1.07823651333"]}] | control_completion_007391 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | for {{completion}}:
p = list(map(int, input()))
print('YES' if sum(p[:3]) == sum(p[3:]) else 'NO')
| _ in range(int(input())) | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007486 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | for {{completion}}:print('yes' if int(_[0]) + int(_[1]) + int(_[2]) == int(_[3]) + int(_[4]) + int(_[5]) else 'NO') | _ in [*open(0)][1:] | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007487 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | t = int(input())
for i in range(1, t + 1):
summa = 0
a = int(input())
a6 = a % 10
a5 = (a // 10) % 10
a4 = (a // 100) % 10
a3 = (a // 1000) % 10
a2 = (a // 10000) % 10
a1 = (a // 100000) % 10
if {{completion}}:
print('YES')
else:
print("NO") | a1 + a2 + a3 == a4 + a5 + a6 | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007488 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | for {{completion}}: print(('NO', 'YES')[sum(int(p) for p in (c[:3])) == sum(int(p) for p in (c[3:]))]) | c in [input() for i in range(int(input()))] | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007489 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | import sys
def main():
s = sys.stdin.read().strip().split('\n')[1:]
r = []
for {{completion}}:
nums = list(map(int, i))
r.append(('NO', 'YES')[sum(nums[:3]) == sum(nums[3:])])
return r
print(*main(), sep='\n')
| i in s | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007490 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | for {{completion}}:
a = [int(j) for j in input()]
print("YES" if sum(a[0:3])==sum(a[3:6]) else "NO") | i in range(int(input())) | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007491 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | t = int(input(""))
for i in range(t):
ticket = input("")
if {{completion}}:
print("YES")
else:
print("NO") | int(ticket[0])+int(ticket[1])+int(ticket[2]) == int(ticket[3])+int(ticket[4])+int(ticket[5]) | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007492 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | s = int(input())
r = []
for i in range(s):
a = int(input())
if {{completion}}:
print("YES", end=" ")
else:
print("NO", end=" ")
| a // 100000 + a // 10000 % 10 + a // 1000 % 10 == a // 100 % 10 + a % 10 + a // 10 % 10 | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007493 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | n=input()
for i in range(int(n)):
sumf=0
suml=0
s = input()
for {{completion}}:
sumf += int(s[x])
for x in range(3,6):
suml += int(s[x])
if sumf== suml:
print('YES')
else:
print('NO')
| x in range(0,3) | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007494 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | n=input()
for i in range(int(n)):
sumf=0
suml=0
s = input()
for x in range(0,3):
sumf += int(s[x])
for {{completion}}:
suml += int(s[x])
if sumf== suml:
print('YES')
else:
print('NO')
| x in range(3,6) | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007495 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading ze... | for {{completion}}:
n = list(map(int, list(input())))
print("YES" if n[0]+n[1]+n[2]==n[3]+n[4]+n[5] else "NO") | t in range(int(input())) | [{"input": "5\n213132\n973894\n045207\n000000\n055776", "output": ["YES\nNO\nYES\nYES\nNO"]}] | control_completion_007496 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | t = int(input())
def solve():
n, m = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
for j in range(m):
temp = -A[i][j]
for x in range(n):
# i - j == x - y => y = x - i + j
y = x - i + j
if {{comple... | 0 <= y < m | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007554 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | t = int(input())
def solve():
n, m = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
for j in range(m):
temp = -A[i][j]
for x in range(n):
# i - j == x - y => y = x - i + j
y = x - i + j
if 0 <= y <... | 0 <= y < m | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007555 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | k,o=lambda:map(int,input().split()),range
for f in o(*k()):
n,m=k();a=[[*k()]for t in o(n)];l=[0]*(m+n);r=l[:]
for i in o(n):
for {{completion}}:b=a[i][j];l[i-j+m-1]+=b;r[i+j]+=b
print(max(l[i-j+m-1]+r[i+j]-a[i][j]for i in o(n)for j in o(m))) | j in o(m) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007556 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | T = int(input())
for tc in range(T):
(A, B) = map(int, input().split(' '))
nums = []
for i in range(A):
nums.append([int(x) for x in input().split()])
C = A + B - 1
left = [0 for _ in range(C)]
right = [0 for _ in range(C)]
for a in range(A):
for {{completion}... | b in range(B) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007557 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | T = int(input())
for tc in range(T):
(A, B) = map(int, input().split(' '))
nums = []
for i in range(A):
nums.append([int(x) for x in input().split()])
C = A + B - 1
left = [0 for _ in range(C)]
right = [0 for _ in range(C)]
for a in range(A):
for b in range(B)... | b in range(B) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007558 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | import sys
sm_row = [-1, +1, -1, +1]
sm_column = [-1, +1, +1, -1]
for _ in range(int(sys.stdin.readline())):
n, m = map(int, sys.stdin.readline().split())
t = []
maximum = 0
for i in range(n):
t.append(list(map(int, sys.stdin.readline().split())))
for row in range(n):
for c... | 0 <= new_row < n and 0 <= new_column < m | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007559 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | # auther: codeCell
for _ in range(int(input())):
n,m=map(int,input().split())
a = [ [*map(int, input().split())] for _ in range(n)]
u = [0]*(n+m-1)
v = [0]*(n+m-1)
for i in range(n):
for {{completion}}:
u[i+j] += a[i][j]
v[i-j] += a[i][j]
for i in ran... | j in range(m) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007560 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | # auther: codeCell
for _ in range(int(input())):
n,m=map(int,input().split())
a = [ [*map(int, input().split())] for _ in range(n)]
u = [0]*(n+m-1)
v = [0]*(n+m-1)
for i in range(n):
for j in range(m):
u[i+j] += a[i][j]
v[i-j] += a[i][j]
for i in rang... | j in range(m) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007561 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353
for _ in range(I()):
n,m=M();l=[L() for i in range(n)];ans=0
for i in range(n):
for j in range(m):
s=l[i][j]
... | p>=0 and q>=0 | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007562 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353
for _ in range(I()):
n,m=M();l=[L() for i in range(n)];ans=0
for i in range(n):
for j in range(m):
s=l[i][j]
... | p>=0 and q<m | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007563 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | t=eval(input())
for i in range(t):
ans=-1
temp=[int(x) for x in input().split()]
n,m=temp[0],temp[1] # n*m
check=[]
for j in range(n):
temp=[int(x) for x in input().split()]
check.append(temp)
dic_l={}
dic_r={}
for x in range(n):
for y in range(m... | x+y not in dic_l | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007564 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | t=eval(input())
for i in range(t):
ans=-1
temp=[int(x) for x in input().split()]
n,m=temp[0],temp[1] # n*m
check=[]
for j in range(n):
temp=[int(x) for x in input().split()]
check.append(temp)
dic_l={}
dic_r={}
for x in range(n):
for y in range(m... | y-x not in dic_r | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007565 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | def calc(x, y):
ans = 0
x1, y1 = x, y
while x1 > 0 and y1 > 0:
ans += field[y1 - 1][x1 - 1]
x1 -= 1
y1 -= 1
# print("OK", x1, y1)
x1, y1 = x, y
x1 += 1
y1 += 1
while x1 <= m and y1 <= n:
ans += field[y1 - 1][x1 - 1]
x1 += 1
y1... | x in range(m) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007566 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | I,R=lambda:map(int,input().split()),range
for _ in R(*I()):
n,m=I();a=[[*I()] for _ in R(n)];l=[0]*(m+n);r=l[:]
for i in R(n):
for {{completion}}:
b=a[i][j];l[i-j+m-1]+=b;r[i+j]+=b
print(max(l[i-j+m-1]+r[i+j]-a[i][j] for i in R(n) for j in R(m))) | j in R(m) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007567 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | t=int(input())
for p in range(t):
n,m=map(int,input().split())
c=[]
b=[]
s=0
for i in range(n):
a=list(map(int,input().split()))
b+=[a]
for k in range(n):
for l in range(m):
for {{completion}}:
s+=b[k-v][l-v]
for w in r... | v in range(min(l,k)+1) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007568 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Timur's grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns with each cell having a non-negative integer written on it. Timur's challenge is to place a bisho... | t=int(input())
for p in range(t):
n,m=map(int,input().split())
c=[]
b=[]
s=0
for i in range(n):
a=list(map(int,input().split()))
b+=[a]
for k in range(n):
for l in range(m):
for v in range(min(l,k)+1):
s+=b[k-v][l-v]
fo... | w in range(1,min(n-k-1,m-l-1)+1) | [{"input": "4\n4 4\n1 2 2 1\n2 4 2 4\n2 2 3 1\n2 4 2 4\n2 1\n1\n0\n3 3\n1 1 1\n1 1 1\n1 1 1\n3 3\n0 1 1\n1 0 1\n1 1 0", "output": ["20\n1\n5\n3"]}] | control_completion_007569 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | h, w, q = map(int, input().split())
p = [False] * (h * w)
c = cc = 0
def query(y, x):
global c, cc
i = x*h+y
p[i] = not p[i]
if p[i]:
if i < c:
cc += 1
c += 1
if p[c-1]:
cc += 1
else:
if {{completion}}:
cc -= 1
... | i < c | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007735 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | h, w, q = map(int, input().split())
p = [False] * (h * w)
c = cc = 0
def query(y, x):
global c, cc
i = x*h+y
p[i] = not p[i]
if p[i]:
if i < c:
cc += 1
c += 1
if p[c-1]:
cc += 1
else:
if i < c:
cc -= 1
... | p[c] | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007736 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | from sys import stdin
rln=stdin.buffer.readline
rl=lambda:rln().rstrip(b'\r\n').rstrip(b'\n')
ri=lambda:int(rln())
rif=lambda:[*map(int,rln().split())]
rt=lambda:rl().decode()
rtf=lambda:rln().decode().split()
inf=float('inf')
dir4=[(-1,0),(0,1),(1,0),(0,-1)]
dir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,... | x in range(n) | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007737 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | from sys import stdin
rln=stdin.buffer.readline
rl=lambda:rln().rstrip(b'\r\n').rstrip(b'\n')
ri=lambda:int(rln())
rif=lambda:[*map(int,rln().split())]
rt=lambda:rl().decode()
rtf=lambda:rln().decode().split()
inf=float('inf')
dir4=[(-1,0),(0,1),(1,0),(0,-1)]
dir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,... | a[i] | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007738 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | import sys
n, m, k = map(int, sys.stdin.readline().split())
board = [list(sys.stdin.readline().strip()) for _ in range(n)]
cnt = 0
for i in range(n):
for j in range(m):
cnt += board[i][j] == '*'
clean = 0
q, r = divmod(cnt, n)
for j in range(q):
for i in range(n):
clean += board[i... | board[r][q] == '*' | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007739 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | import sys
n, m, k = map(int, sys.stdin.readline().split())
board = [list(sys.stdin.readline().strip()) for _ in range(n)]
cnt = 0
for i in range(n):
for j in range(m):
cnt += board[i][j] == '*'
clean = 0
q, r = divmod(cnt, n)
for j in range(q):
for i in range(n):
clean += board[i... | n * y + x <= cnt - 1 | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007740 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... |
n,m,q = map(int, input().split())
s = [input() for _ in range(n)]
s = [s[j][i] for i in range(m) for j in range(n)]
qrr = [list(map(int, input().split())) for _ in range(q)]
qrr = [n * (q[1] - 1) + q[0] - 1 for q in qrr]
count = s.count('*')
correct = s[:count].count('*')
for q in qrr:
count += 1 if s[q] == ... | s[q] == '.' | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007741 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | from itertools import chain
I=lambda:map(int,input().split())
n,m,q=I()
g0=[list(input()) for _ in range(n)]
g=list(chain.from_iterable(zip(*g0)))
tot=g.count('*')
inner=g[:tot].count('*')
for _ in range(q):
i,j=I()
p=(j-1)*n+i-1
if g[p]=='*':
tot-=1
#"tide fall"
if g[tot]=='*':inner-=1... | g[tot]=='*' | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007742 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | from itertools import chain
I=lambda:map(int,input().split())
n,m,q=I()
g0=[list(input()) for _ in range(n)]
g=list(chain.from_iterable(zip(*g0)))
tot=g.count('*')
inner=g[:tot].count('*')
for _ in range(q):
i,j=I()
p=(j-1)*n+i-1
if g[p]=='*':
tot-=1
#"tide fall"
if g[tot]=='*':inner-=1... | p<tot | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007743 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | n,m,q=map(int,input().split())
z=[] # 2d
a=[] # 1d
c=0 # count icons
ans=0
for i in range(n):
z.append(list(input()))
for i in range(m):
for j in range(n):
if z[j][i]=="*":
a.append(1)
c+=1
else:
a.append(0)
ans=c
for i in range(c):
if a[i]... | a[c-1]==1 | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007744 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | n,m,q=map(int,input().split())
z=[] # 2d
a=[] # 1d
c=0 # count icons
ans=0
for i in range(n):
z.append(list(input()))
for i in range(m):
for j in range(n):
if z[j][i]=="*":
a.append(1)
c+=1
else:
a.append(0)
ans=c
for i in range(c):
if a[i]... | n*(y-1)+x-1 >= c-1 | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007745 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | import sys
def solve():
# n = int(sys.stdin.readline().strip())
n, m, q = [int(x) for x in sys.stdin.readline().strip().split()]
a = []
m = [0] * (m * n)
for y in range(n):
s = sys.stdin.readline().strip()
for x, c in enumerate(s):
if c == '*':
a.append... | m[cnt] == 1 | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007746 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Your friend Ivan asked you to help him rearrange his desktop. The desktop can be represented as a rectangle matrix of size $$$n \times m$$$ consisting of characters '.' (empty cell of the desktop) and '*' (an icon).The desktop is called good i... | import sys
def solve():
# n = int(sys.stdin.readline().strip())
n, m, q = [int(x) for x in sys.stdin.readline().strip().split()]
a = []
m = [0] * (m * n)
for y in range(n):
s = sys.stdin.readline().strip()
for x, c in enumerate(s):
if c == '*':
a.append... | z < cnt | [{"input": "4 4 8\n..**\n.*..\n*...\n...*\n1 3\n2 3\n3 1\n2 3\n3 4\n4 3\n2 3\n2 2", "output": ["3\n4\n4\n3\n4\n5\n5\n5"]}, {"input": "2 5 5\n*...*\n*****\n1 3\n2 2\n1 3\n1 5\n2 3", "output": ["2\n3\n3\n3\n2"]}] | control_completion_007747 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... |
from collections import deque
n,m=[int(x) for x in input().split()]
g=[[] for _ in range(n)]
indeg=[0]*n
outdeg=[0]*n
tpdeg=[0]*n
for _ in range(m):
v,u=[int(x) for x in input().split()]
v-=1
u-=1
g[v].append(u)
outdeg[v]+=1
indeg[u]+=1
tpdeg[u]+=1
q=deque(i for i in ... | indeg[v]>1 and outdeg[u]>1 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007762 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... |
from collections import deque
n,m=[int(x) for x in input().split()]
g=[[] for _ in range(n)]
indeg=[0]*n
outdeg=[0]*n
tpdeg=[0]*n
for _ in range(m):
v,u=[int(x) for x in input().split()]
v-=1
u-=1
g[v].append(u)
outdeg[v]+=1
indeg[u]+=1
tpdeg[u]+=1
q=deque(i for i in ... | tpdeg[v]==0 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007763 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... |
def iint():
return int(input().strip())
def iints():
return map(int, input().strip().split(" "))
def arr():
return list(input().strip().split(" "))
def arri():
return list(iints())
n,m = iints()
class Graph:
def __init__(self, n):
self.adj = [[] for _ in range(n)]
self.ins = [0... | not ins2[x] | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007764 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... |
def iint():
return int(input().strip())
def iints():
return map(int, input().strip().split(" "))
def arr():
return list(input().strip().split(" "))
def arri():
return list(iints())
n,m = iints()
class Graph:
def __init__(self, n):
self.adj = [[] for _ in range(n)]
self.ins = [0... | g.ins[x] > 1 and g.outs[cur] > 1 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007765 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... | import sys
from collections import deque
n, m = map(int, sys.stdin.readline().split())
inv = [0] * (n + 1)
outv = [0] * (n + 1)
graph = [[] for _ in range(n + 1)]
reverse = [[] for _ in range(n + 1)]
for _ in range(m):
v, u = map(int, sys.stdin.readline().split())
graph[v].append(u)
reverse[u].a... | inv[nxt] > 1 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007766 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... | import sys
input = sys.stdin.readline
import math
for _ in range(1):
n, m = map(int, input().split())
g = [[] for i in range(n)]
deg = [0] * n
in_deg = [0] * n
out_deg = [0] * n
for i in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
g[x].... | deg[to] == 0 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007767 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... | import sys
input = sys.stdin.readline
import math
for _ in range(1):
n, m = map(int, input().split())
g = [[] for i in range(n)]
deg = [0] * n
in_deg = [0] * n
out_deg = [0] * n
for i in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
g[x].... | in_deg[j] > 1 and out_deg[i] > 1 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007768 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... | from collections import deque
I=lambda:map(int,input().split())
n,m=I()
g=[[]for _ in range(n)]
din,dout,dcur=[0]*n,[0]*n,[0]*n
for _ in range(m):
u,v=I()
u,v=u-1,v-1
g[u].append(v)
dout[u]+=1;din[v]+=1;dcur[v]+=1
q=deque([i for i,d in enumerate(din) if d==0])
f=[1]*n
while q:
u=q.popleft()
... | dout[u]>1 and din[v]>1 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007769 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given a directed acyclic graph, consisting of $$$n$$$ vertices and $$$m$$$ edges. The vertices are numbered from $$$1$$$ to $$$n$$$. There are no multiple edges and self-loops.Let $$$\mathit{in}_v$$$ be the number of incoming edges (in... | from collections import deque
I=lambda:map(int,input().split())
n,m=I()
g=[[]for _ in range(n)]
din,dout,dcur=[0]*n,[0]*n,[0]*n
for _ in range(m):
u,v=I()
u,v=u-1,v-1
g[u].append(v)
dout[u]+=1;din[v]+=1;dcur[v]+=1
q=deque([i for i,d in enumerate(din) if d==0])
f=[1]*n
while q:
u=q.popleft()
... | dcur[v]==0 | [{"input": "3 3\n1 2\n2 3\n1 3", "output": ["2"]}, {"input": "5 0", "output": ["1"]}, {"input": "7 8\n7 1\n1 3\n6 2\n2 3\n7 2\n2 4\n7 3\n6 3", "output": ["3"]}] | control_completion_007770 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Monocarp plays "Rage of Empires II: Definitive Edition" — a strategic computer game. Right now he's planning to attack his opponent in the game, but Monocarp's forces cannot enter the opponent's territory since the opponent has built a wall.Th... | N=int(input())
A=[int(x) for x in input().split()]
B=sorted(A)
ans=-(-B[0]//2)-(-B[1]//2)
for {{completion}}:
ans=min(ans,-(-(A[i]+A[i+2])//2))
for i in range(N-1):
score=max(-(-(A[i]+A[i+1])//3),-(-A[i]//2),-(-A[i+1]//2))
ans=min(score,ans)
print(ans) | i in range(N-2) | [{"input": "5\n20 10 30 10 20", "output": ["10"]}, {"input": "3\n1 8 1", "output": ["1"]}, {"input": "6\n7 6 6 8 5 8", "output": ["4"]}, {"input": "6\n14 3 8 10 15 4", "output": ["4"]}, {"input": "4\n1 100 100 1", "output": ["2"]}, {"input": "3\n40 10 10", "output": ["7"]}] | control_completion_007774 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Monocarp plays "Rage of Empires II: Definitive Edition" — a strategic computer game. Right now he's planning to attack his opponent in the game, but Monocarp's forces cannot enter the opponent's territory since the opponent has built a wall.Th... | N=int(input())
A=[int(x) for x in input().split()]
B=sorted(A)
ans=-(-B[0]//2)-(-B[1]//2)
for i in range(N-2):
ans=min(ans,-(-(A[i]+A[i+2])//2))
for {{completion}}:
score=max(-(-(A[i]+A[i+1])//3),-(-A[i]//2),-(-A[i+1]//2))
ans=min(score,ans)
print(ans) | i in range(N-1) | [{"input": "5\n20 10 30 10 20", "output": ["10"]}, {"input": "3\n1 8 1", "output": ["1"]}, {"input": "6\n7 6 6 8 5 8", "output": ["4"]}, {"input": "6\n14 3 8 10 15 4", "output": ["4"]}, {"input": "4\n1 100 100 1", "output": ["2"]}, {"input": "3\n40 10 10", "output": ["7"]}] | control_completion_007775 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Monocarp plays "Rage of Empires II: Definitive Edition" — a strategic computer game. Right now he's planning to attack his opponent in the game, but Monocarp's forces cannot enter the opponent's territory since the opponent has built a wall.Th... | def onagr(x, y):
x, y = max(x, y), min(x, y)
if x >= 2 * y:
res = (x + 1) // 2
else:
res = x - y + (2 * y - x) // 3 * 2 + (2 * y - x) % 3
return res
def onagr1(x, y):
return min(x, y) + (abs(x - y) + 1) // 2
n = int(input())
m1, m2, *a = list(map(int, input().split(... | k < m2 | [{"input": "5\n20 10 30 10 20", "output": ["10"]}, {"input": "3\n1 8 1", "output": ["1"]}, {"input": "6\n7 6 6 8 5 8", "output": ["4"]}, {"input": "6\n14 3 8 10 15 4", "output": ["4"]}, {"input": "4\n1 100 100 1", "output": ["2"]}, {"input": "3\n40 10 10", "output": ["7"]}] | control_completion_007776 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Monocarp plays "Rage of Empires II: Definitive Edition" — a strategic computer game. Right now he's planning to attack his opponent in the game, but Monocarp's forces cannot enter the opponent's territory since the opponent has built a wall.Th... | import sys
n = int(sys.stdin.readline())
arr = list(map(int, sys.stdin.readline().split()))
x, y = sorted(arr)[:2]
ans = (x + 1) // 2 + (y + 1) // 2
for i in range(n - 2):
x, y = arr[i], arr[i + 2]
if {{completion}}:
x -= 1
y -= 1
ans = min(ans, (x + 1) // 2 + (y + 1) // 2 ... | (x % 2 == 1) and (y % 2 == 1) | [{"input": "5\n20 10 30 10 20", "output": ["10"]}, {"input": "3\n1 8 1", "output": ["1"]}, {"input": "6\n7 6 6 8 5 8", "output": ["4"]}, {"input": "6\n14 3 8 10 15 4", "output": ["4"]}, {"input": "4\n1 100 100 1", "output": ["2"]}, {"input": "3\n40 10 10", "output": ["7"]}] | control_completion_007777 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Monocarp plays "Rage of Empires II: Definitive Edition" — a strategic computer game. Right now he's planning to attack his opponent in the game, but Monocarp's forces cannot enter the opponent's territory since the opponent has built a wall.Th... | from math import ceil
def cal(a,b):
if a>b:
a,b=b,a
if {{completion}}:
return ceil((a+b)/3)
else:
return ceil(b/2)
def cal2(a,b,c):
if a%2==1 or c%2==1:
return a//2+c//2+1
return a//2+b//2
n=int(input())
l=list(map(int,input().split()))
t=sorte... | a>b//2 | [{"input": "5\n20 10 30 10 20", "output": ["10"]}, {"input": "3\n1 8 1", "output": ["1"]}, {"input": "6\n7 6 6 8 5 8", "output": ["4"]}, {"input": "6\n14 3 8 10 15 4", "output": ["4"]}, {"input": "4\n1 100 100 1", "output": ["2"]}, {"input": "3\n40 10 10", "output": ["7"]}] | control_completion_007778 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Monocarp plays "Rage of Empires II: Definitive Edition" — a strategic computer game. Right now he's planning to attack his opponent in the game, but Monocarp's forces cannot enter the opponent's territory since the opponent has built a wall.Th... | from math import ceil
def cal(a,b):
if a>b:
a,b=b,a
if a>b//2:
return ceil((a+b)/3)
else:
return ceil(b/2)
def cal2(a,b,c):
if {{completion}}:
return a//2+c//2+1
return a//2+b//2
n=int(input())
l=list(map(int,input().split()))
t=sorted(l)
ans=... | a%2==1 or c%2==1 | [{"input": "5\n20 10 30 10 20", "output": ["10"]}, {"input": "3\n1 8 1", "output": ["1"]}, {"input": "6\n7 6 6 8 5 8", "output": ["4"]}, {"input": "6\n14 3 8 10 15 4", "output": ["4"]}, {"input": "4\n1 100 100 1", "output": ["2"]}, {"input": "3\n40 10 10", "output": ["7"]}] | control_completion_007779 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is an array $$$a$$$ of length $$$n$$$. You may perform the following operation any number of times: Choose two indices $$$l$$$ and $$$r$$$ where $$$1 \le l < r \le n$$$ and $$$a_l = a_r$$$. Then, set $$$a[l \ldots r] = [a_{l+1}, a_{l... | import sys
sys.setrecursionlimit(10000)
def read_line(f):
while True:
s=f.readline().strip()
if s:
return s
def read_list(f):
return [int(x) for x in read_line(f).split()]
def read_tuple(f):
return tuple(read_list(f))
def load_single_case(f):
read_line(f)
... | used.get(an[pa],0)<=0 | [{"input": "5\n\n5\n\n1 2 3 3 2\n\n1 3 3 2 2\n\n5\n\n1 2 4 2 1\n\n4 2 2 1 1\n\n5\n\n2 4 5 5 2\n\n2 2 4 5 5\n\n3\n\n1 2 3\n\n1 2 3\n\n3\n\n1 1 2\n\n2 1 1", "output": ["YES\nYES\nNO\nYES\nNO"]}] | control_completion_007873 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is an array $$$a$$$ of length $$$n$$$. You may perform the following operation any number of times: Choose two indices $$$l$$$ and $$$r$$$ where $$$1 \le l < r \le n$$$ and $$$a_l = a_r$$$. Then, set $$$a[l \ldots r] = [a_{l+1}, a_{l... | import sys
sys.setrecursionlimit(10000)
def read_line(f):
while True:
s=f.readline().strip()
if s:
return s
def read_list(f):
return [int(x) for x in read_line(f).split()]
def read_tuple(f):
return tuple(read_list(f))
def load_single_case(f):
read_line(f)
... | used.get(an[pa],0)<=0 | [{"input": "5\n\n5\n\n1 2 3 3 2\n\n1 3 3 2 2\n\n5\n\n1 2 4 2 1\n\n4 2 2 1 1\n\n5\n\n2 4 5 5 2\n\n2 2 4 5 5\n\n3\n\n1 2 3\n\n1 2 3\n\n3\n\n1 1 2\n\n2 1 1", "output": ["YES\nYES\nNO\nYES\nNO"]}] | control_completion_007874 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You have a binary string $$$a$$$ of length $$$n$$$ consisting only of digits $$$0$$$ and $$$1$$$. You are given $$$q$$$ queries. In the $$$i$$$-th query, you are given two indices $$$l$$$ and $$$r$$$ such that $$$1 \le l \le r \le n$$$. Let $$... | import sys;input=sys.stdin.readline
I=lambda:map(int,input().split())
n, q = I()
s = input()
pre0,pre1 = [0]*n,[0]*n
for i in range(1,n):
c1,c2=s[i-1],s[i]
pre0[i],pre1[i] = pre0[i-1],pre1[i-1]
if c1 == c2 == '0':pre0[i]+=1
elif {{completion}}:pre1[i]+=1
for _ in range(q):
l,r=I()
print(max(pr... | c1 == c2 == '1' | [{"input": "5 3\n11011\n2 4\n1 5\n3 5", "output": ["1\n3\n2"]}, {"input": "10 3\n1001110110\n1 10\n2 5\n5 10", "output": ["4\n2\n3"]}] | control_completion_007889 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You have a binary string $$$a$$$ of length $$$n$$$ consisting only of digits $$$0$$$ and $$$1$$$. You are given $$$q$$$ queries. In the $$$i$$$-th query, you are given two indices $$$l$$$ and $$$r$$$ such that $$$1 \le l \le r \le n$$$. Let $$... | # import io,os
# read = io.BytesIO(os.read(0, os.fstat(0).st_size))
# I = lambda: [*map(int, read.readline().split())]
import sys
I=lambda:[*map(int,sys.stdin.readline().split())]
n, q = I()
s = input()
ones = [0, 0]
zeroes = [0, 0]
for i in range(1, n):
if s[i] == s[i - 1] == '0':
zeroes.append(zeroe... | s[i] == s[i - 1] == '1' | [{"input": "5 3\n11011\n2 4\n1 5\n3 5", "output": ["1\n3\n2"]}, {"input": "10 3\n1001110110\n1 10\n2 5\n5 10", "output": ["4\n2\n3"]}] | control_completion_007890 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a grid with $$$r$$$ rows and $$$c$$$ columns, where the square on the $$$i$$$-th row and $$$j$$$-th column has an integer $$$a_{i, j}$$$ written on it. Initially, all elements are set to $$$0$$$. We are allowed to do the following ope... | # import io,os
# read = io.BytesIO(os.read(0, os.fstat(0).st_size))
# I = lambda: [*map(int, read.readline().split())]
import sys
I=lambda:[*map(int,sys.stdin.readline().split())]
M = 998244353
r, c = I()
rows = []
for i in range(r):
rows.append([*input()])
if r % 2 == 0 and c % 2 == 0:
blanks = 0
fo... | not seen[v] | [{"input": "3 3\n?10\n1??\n010", "output": ["1"]}, {"input": "2 3\n000\n001", "output": ["0"]}, {"input": "1 1\n?", "output": ["2"]}, {"input": "6 9\n1101011?0\n001101?00\n101000110\n001011010\n0101?01??\n00?1000?0", "output": ["8"]}] | control_completion_007924 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a grid with $$$r$$$ rows and $$$c$$$ columns, where the square on the $$$i$$$-th row and $$$j$$$-th column has an integer $$$a_{i, j}$$$ written on it. Initially, all elements are set to $$$0$$$. We are allowed to do the following ope... | # import io,os
# read = io.BytesIO(os.read(0, os.fstat(0).st_size))
# I = lambda: [*map(int, read.readline().split())]
import sys
I=lambda:[*map(int,sys.stdin.readline().split())]
M = 998244353
r, c = I()
rows = []
for i in range(r):
rows.append([*input()])
if r % 2 == 0 and c % 2 == 0:
blanks = 0
fo... | v in edges[component[j]] | [{"input": "3 3\n?10\n1??\n010", "output": ["1"]}, {"input": "2 3\n000\n001", "output": ["0"]}, {"input": "1 1\n?", "output": ["2"]}, {"input": "6 9\n1101011?0\n001101?00\n101000110\n001011010\n0101?01??\n00?1000?0", "output": ["8"]}] | control_completion_007925 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | for _ in range(int(input())):
n = int(input())
a = b = 0
c = '-'
for x, y in zip(*[iter(input())]*2):
if {{completion}}:
a += 1
else:
b += x != c
c = x
print(a, max(1, b)) | x != y | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007948 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... |
inp = [*open(0)]
for s in inp[2::2]:
s = s.strip()
res = 0
mseg = 1
prebit = None
for i in range(len(s) // 2):
if s[2*i] != s[2*i+1]:
res += 1
else:
if {{completion}}:
prebit = s[2*i]
else:
mseg += 1... | prebit is None | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007949 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... |
for _ in range(int(input().strip())):
n = int(input().strip())
arr = input()
ans = 0
t = []
for i in range(0, len(arr), 2):
if {{completion}}:
ans += 1
else:
t.append(arr[i])
seg = 1
for i in range(0, len(t) - 1):
if t[i] != t[i +... | arr[i] != arr[i + 1] | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007950 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... |
for _ in range(int(input().strip())):
n = int(input().strip())
arr = input()
ans = 0
t = []
for i in range(0, len(arr), 2):
if arr[i] != arr[i + 1]:
ans += 1
else:
t.append(arr[i])
seg = 1
for i in range(0, len(t) - 1):
if {{compl... | t[i] != t[i + 1] | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007951 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | import sys
input=sys.stdin.readline
for _ in range(int(input())):
n=int(input())
s=input()
x,y,Lf=0,0,-1
for i in range(0,n,2):
if(s[i]!=s[i+1]):
x+=1
else:
if{{completion}}:
y+=1
Lf=s[i]
print(x,max(y,1)) | (Lf!=s[i]) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007952 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | for _ in range(int(input())):
n = int(input())
l = [[], []]
for {{completion}}:
l[x==y].append(int(x))
print(len(l[0]), sum(map(lambda x : x[0] ^ x[1], zip(l[1], l[1][1:]))) + 1) | x, y in zip(*[iter(input())]*2) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007953 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | def solve(s):
res = 0
seg = 0
prev = -1
allDiff = True
for i in range(1,len(s),2):
if s[i] == s[i-1]:
allDiff = False
if {{completion}}: seg += 1
prev = s[i]
else:
res += 1
if allDiff: seg += 1
print(res,seg)
if __name__ == "__main__":
t = int(input())
while t:
n= int(inp... | prev != s[i] | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3 2\n0 3\n0 1\n0 1\n3 1"]}] | control_completion_007954 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | for {{completion}}:
n,s=int(input()),input()
print(sum([1 for i in range(1,n,2) if s[i]!=s[i-1]])) | _ in range(int(input())) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007975 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | import re
for s in[*open(0)][2::2]:
i=p=r=0
for t in re.findall('0+|1+',s):
i+=1
if len(t)&1:
if {{completion}}:r+=i-p;p=0
else:p=i
print(r) | p | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007976 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | t=int(input(""))
for z in range(t):
n=int(input(""))
a=input("")
s=[]
for {{completion}}:
ab=a[i]+a[i+1]
s.append(ab)
b=s.count('10')
c=s.count('01')
print(b+c) | i in range(0,len(a)-1,2) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007977 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | def func(s):
curr=s[0]
c=0
count=0
for i in s:
if i==curr:
c+=1
elif {{completion}}:
c=1
curr=i
continue
else:
curr=i
c=2
count+=1
return count
for i in range(int(input())):
... | c%2==0 | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007978 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | for _ in range(int(input())):
input()
inp, count = input(), 0
for i in range(0, len(inp), 2):
if {{completion}}:
count += 1
print(count) | (inp[i] != inp[i+1]) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007979 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | t = int(input())
for _ in range(t):
_, s = input(), input()
res, i, c = 0, 0, 0
while i < len(s):
d = s[i]
while {{completion}}:
c += 1
i += 1
c = c & 1
res += 1 if c else 0
print(res)
| i < len(s) and s[i] == d | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007980 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | t=int(input())
for i in range (t):
n=int(input())
a=input()
count=0
for k in range(n//2):
if{{completion}}:
count+=1
print(count)
| (a[2*k]!=a[2*k+1]) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007981 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | from itertools import groupby
t = int(input())
while t:
t-=1
n = int(input())
s = input()
o = [len("".join(g))&1 for _,g in groupby(s)]
l = -1
res = 0
for i, o_ in enumerate(o):
if o_:
if {{completion}}:
l = i
else:
res += i... | l == -1 | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007982 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | n=int(input(""))
t=0
while(t<n):
t+=1
length=int(input(""))
s=input("")
count=0
for i in range(1, length, 2):
if {{completion}}:
count+=1
print(count)
| s[i]!=s[i-1] | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007983 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: This is the easy version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string $$$s$$$ of length $$$n$$$, consisting only o... | for {{completion}}:
n,s,w=int(input()),input(),0
print(sum([1 for i in range(1,n,2) if s[i]!=s[i-1]])) | _ in range(int(input())) | [{"input": "5\n10\n1110011000\n8\n11001111\n2\n00\n2\n11\n6\n100110", "output": ["3\n0\n0\n0\n3"]}] | control_completion_007984 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | for {{completion}}:
n = int(input()); a = [*map(int,input().split())]
print(n+(-a.count(0) or len(set(a))==n)) | t in range(int(input())) | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008020 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | for n in [*open(0)][2::2]:
*a,=map(int,n.split());b=len(a);c=a.count(0)
while a:
q=a.pop()
if {{completion}}:
break
print(b+(a==[])*(c==0)-c)
| a.count(q)>0 | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008021 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | def solve():
N=int(input())
A=sorted(list(map(int,input().split())))
return sum([i>0 for i in A])+all([i>0 for i in A])*all([A[i]<A[i+1] for i in range(N-1)])
T=int(input())
for {{completion}}:
print(solve()) | i in range(T) | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008022 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | t=int(input())
for _ in range(t):
n=int(input())
ar=list(map(int,input().split()))
z=[0]*110
for x in range(n):
z[ar[x]]+=1
eq=False
for x in range(110):
if {{completion}}:
eq=True
if z[0]>0:
print(n-z[0])
elif eq:
print(n)
... | z[x]>1 | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008023 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | for j in range(int(input())):
h = int(input())
a = list(map(int,input().split()))
if 0 in a:
print(h - a.count(0))
else:
if {{completion}}:
print(len(a))
else:
print(len(a)+1) | len(set(a)) < len(a) | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008024 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | for i in range(int(input())):
n = int(input())
s = input().split()
if s.count("0"):
print(n-s.count("0"))
else:
for i in s:
if {{completion}}:
print(n)
break
else:
print(n+1) | s.count(i)>1 | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008025 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | import sys
input = sys.stdin.readline
def getInts(): return map(int, input().split())
def solve():
input()
a = [*getInts()]
if {{completion}}:
print(len(a) - a.count(0))
else:
s = set(a)
print(len(a) + (len(a) == len(s)))
for _ in range(int(input())):
solve()
| 0 in a | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008026 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | test=int(input())
while test:
test-=1
n=int(input())
arr=[int(x) for x in input().split()]
zero=0
s=set(arr)
for i in arr:
if {{completion}}:
zero+=1
if zero:
print(n-zero)
elif len(s)==n:
print(n+1)
else:
print(n)
| i==0 | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008027 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$; $$$1 \leq i,j \leq n$$$). If $$$a_i = a_j$$$, change one of them to $$$0$$$. Otherwise change both of ... | for {{completion}}:
n=int(input())
a=[*map(int,input().split())]
print(n-a.count(0)+(0 not in a and len(a)==len(set(a)))) | _ in[0]*int(input()) | [{"input": "3\n3\n1 2 3\n3\n1 2 2\n3\n1 2 0", "output": ["4\n3\n2"]}] | control_completion_008028 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given an array $$$a$$$ consisting of $$$n$$$ positive integers.You are allowed to perform this operation any number of times (possibly, zero): choose an index $$$i$$$ ($$$2 \le i \le n$$$), and change $$$a_i$$$ to $$$a_i - a_{i-1}$$$... | import sys
def diff_ops(arr):
result = True
for {{completion}}:
result = result and arr[i] % arr[0] == 0
return result
if __name__ == "__main__":
input_arr = list(map(int, sys.stdin.read().split()))
len_input = len(input_arr)
n = input_arr[0]
test_cases = []
pos = ... | i in range(1, len(arr)) | [{"input": "4\n\n2\n\n5 10\n\n3\n\n1 2 3\n\n4\n\n1 1 1 1\n\n9\n\n9 9 8 2 4 4 3 5 3", "output": ["YES\nYES\nYES\nNO"]}] | control_completion_008029 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: You are given an array $$$a$$$ consisting of $$$n$$$ positive integers.You are allowed to perform this operation any number of times (possibly, zero): choose an index $$$i$$$ ($$$2 \le i \le n$$$), and change $$$a_i$$$ to $$$a_i - a_{i-1}$$$... | import sys
def diff_ops(arr):
result = True
for i in range(1, len(arr)):
result = result and arr[i] % arr[0] == 0
return result
if __name__ == "__main__":
input_arr = list(map(int, sys.stdin.read().split()))
len_input = len(input_arr)
n = input_arr[0]
test_cases = []
... | pos <= len_input - 1 | [{"input": "4\n\n2\n\n5 10\n\n3\n\n1 2 3\n\n4\n\n1 1 1 1\n\n9\n\n9 9 8 2 4 4 3 5 3", "output": ["YES\nYES\nYES\nNO"]}] | control_completion_008030 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | n, k = map(int, input().split())
answer = [0] * (n + 1)
dp = [1] + [0] * n
MIN = 0
while MIN + k <= n:
mod = [0 for _ in range(k)]
for {{completion}}:
dp[i], mod[i % k] = mod[i % k], dp[i] + mod[i % k]
mod[i % k] %= 998244353
answer[i] += dp[i]
answer[i] %= 998244353
... | i in range(MIN, n + 1) | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008069 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | import copy
n, k = list(map(int, input().split(' ')))
dp = [0]*(n+1)
for i in range(k, n+1, k):
dp[i] = 1
# print(list(range(n+1)))
# print(dp, k)
ans = copy.copy(dp)
dp2 = [0]*(n+1)
for s in range(2,n): # will be sqrt(n) really
ks = k + s - 1
first = (ks * (ks+1) // 2) - ((k-1) * k // 2)
if first ... | i in range(first, n+1) | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008070 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | import copy
n, k = list(map(int, input().split(' ')))
dp = [0]*(n+1)
for i in range(k, n+1, k):
dp[i] = 1
# print(list(range(n+1)))
# print(dp, k)
ans = copy.copy(dp)
dp2 = [0]*(n+1)
for s in range(2,n): # will be sqrt(n) really
ks = k + s - 1
first = (ks * (ks+1) // 2) - ((k-1) * k // 2)
if first ... | i in range(0, n+1) | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008071 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | import sys
inf=float('inf')
mod=998244353
#input = lambda: sys.stdin.readline().rstrip()
inpnm = lambda: map(int,input().split())
inparr = lambda: [int(i) for i in input().split()]
inpint = lambda: int(input())
def main():
n,k=inpnm()
N=n+1
f1=[0]*N
res=[0]*N
f1[0]=1
i=1
... | j in range(step,N) | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008072 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | import sys
inf=float('inf')
mod=998244353
#input = lambda: sys.stdin.readline().rstrip()
inpnm = lambda: map(int,input().split())
inparr = lambda: [int(i) for i in input().split()]
inpint = lambda: int(input())
def main():
n,k=inpnm()
N=n+1
f1=[0]*N
res=[0]*N
f1[0]=1
i=1
... | j in range(N) | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008073 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | t=1
mod=998244353
while t:
t-=1
n,k=[int(x) for x in input().split()]
dp=[0 for x in range(n+1)]
ans=[0 for x in range(n+1)]
for i in range(k,n+1,k):
dp[i]+=1
ans[i]=dp[i]
while True:
k+=1
shift=False
for i in reversed(range(n+1)):
... | dp[i] | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008074 | control_fixed |
python | Complete the code in python to solve this programming problem:
Description: There is a chip on the coordinate line. Initially, the chip is located at the point $$$0$$$. You can perform any number of moves; each move increases the coordinate of the chip by some positive integer (which is called the length of the move).... | MOD, MAXN = 998244353, 10**5 * 2
N, K = map(int, input().split())
ans, dp = [0] * (MAXN + 10), [0] * (MAXN + 10)
dp[0] = 1
s = 0
for i in range(701):
if s > N:
break
new_dp = [0] * (MAXN + 10)
for {{completion}}:
new_dp[j] = (new_dp[j - i - K] + dp[j - i - K]) % MOD
ans[j]... | j in range(s + i + K, N + 1) | [{"input": "8 1", "output": ["1 1 2 2 3 4 5 6"]}, {"input": "10 2", "output": ["0 1 0 1 1 1 1 2 2 2"]}] | control_completion_008075 | control_fixed |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.