message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 219 108k | cluster float64 11 11 | __index_level_0__ int64 438 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A: Information Search
problem
The posting list is a list in which there is a correspondence between the search term and the appearing document ID. For example
* Hokkaido: 1, 2, 4, 9
* Sightse... | instruction | 0 | 93,511 | 11 | 187,022 |
Yes | output | 1 | 93,511 | 11 | 187,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,660 | 11 | 187,320 |
Tags: math
Correct Solution:
```
from math import *
from sys import stdin,stdout
# input = stdin.readline
for __ in range(int(input())):
n,m=map(int,input().split())
if(min(n,m)<=1 or (n==2 and m==2)):
print("YES")
else:
print("NO")
``` | output | 1 | 93,660 | 11 | 187,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,661 | 11 | 187,322 |
Tags: math
Correct Solution:
```
for t in range(int(input())):
a,b = map(int,input().split())
if a==b==2:
print('Yes')
elif a == 1 or b == 1: print('Yes')
else: print('No')
``` | output | 1 | 93,661 | 11 | 187,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,662 | 11 | 187,324 |
Tags: math
Correct Solution:
```
z=input
from math import *
for _ in range(int(z())):
a,b=map(int,z().split())
if a==b<=2 or a==1 or b==1:
print('YES')
else:
print('NO')
``` | output | 1 | 93,662 | 11 | 187,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,663 | 11 | 187,326 |
Tags: math
Correct Solution:
```
t = int(input())
for x in range(t):
wejscie = str(input())
a, b = wejscie.split()
a = int(a)
b = int(b)
if a == 1 or b == 1:
print("YES")
else:
if a <= 2 and b <= 2:
print("YES")
else:
print("NO")
``` | output | 1 | 93,663 | 11 | 187,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,664 | 11 | 187,328 |
Tags: math
Correct Solution:
```
for _ in range(int(input())):
# n = int(input())
n, m = list(map(int, input().split()))
# arr = list(map(str, input().split()))
# arr = list(input())
# temp1 = temp2 = stars = stars1 = flag = 0
if n == 1 or m == 1 :
print('YES')
elif n + m <= 4:
... | output | 1 | 93,664 | 11 | 187,329 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,665 | 11 | 187,330 |
Tags: math
Correct Solution:
```
import sys
input = sys.stdin.readline
t = int(input())
nm = [list(map(int, input().split())) for _ in range(t)]
for n, m in nm:
if n == 1 or m == 1:
print('YES')
elif n == 2 and m == 2:
print('YES')
else:
print('NO')
``` | output | 1 | 93,665 | 11 | 187,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,666 | 11 | 187,332 |
Tags: math
Correct Solution:
```
test=int(input())
for i in range(test):
n,m=input().split()
if n=="1" or m=="1" or (n=="2" and m=="2"):
print("YES")
else:
print("NO")
``` | output | 1 | 93,666 | 11 | 187,333 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,667 | 11 | 187,334 |
Tags: math
Correct Solution:
```
Times=int(input())
j=0
while j<Times:
s=input().split()
m=int(s[0])
n=int(s[1])
if m>n:
m,n=n,m
if m*n<=m+n:
print("YES")
else:
print("NO")
j+=1
``` | output | 1 | 93,667 | 11 | 187,335 |
Provide tags and a correct Python 2 solution for this coding contest problem.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the following conditions hold:
1. The pieces are a... | instruction | 0 | 93,668 | 11 | 187,336 |
Tags: math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
return map(int,raw_input().split())
def pr_num(n):
... | output | 1 | 93,668 | 11 | 187,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,669 | 11 | 187,338 |
Yes | output | 1 | 93,669 | 11 | 187,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,670 | 11 | 187,340 |
Yes | output | 1 | 93,670 | 11 | 187,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,671 | 11 | 187,342 |
Yes | output | 1 | 93,671 | 11 | 187,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,672 | 11 | 187,344 |
Yes | output | 1 | 93,672 | 11 | 187,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,673 | 11 | 187,346 |
No | output | 1 | 93,673 | 11 | 187,347 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,674 | 11 | 187,348 |
No | output | 1 | 93,674 | 11 | 187,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,675 | 11 | 187,350 |
No | output | 1 | 93,675 | 11 | 187,351 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,676 | 11 | 187,352 |
No | output | 1 | 93,676 | 11 | 187,353 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a special jigsaw puzzle consisting of n⋅ m identical pieces. Every piece has three tabs and one blank, as pictured below.
<image>
The jigsaw puzzle is considered solved if the fo... | instruction | 0 | 93,677 | 11 | 187,354 |
No | output | 1 | 93,677 | 11 | 187,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,699 | 11 | 187,398 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
# Enter your code here. Read input from STDIN. Print output to STDOUT# ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_fun... | output | 1 | 93,699 | 11 | 187,399 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,700 | 11 | 187,400 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
# Enter your code here. Read input from STDIN. Print output to STDOUT# ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_fun... | output | 1 | 93,700 | 11 | 187,401 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,701 | 11 | 187,402 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
"""
#If FastIO not needed, use this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
import time
fr... | output | 1 | 93,701 | 11 | 187,403 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,702 | 11 | 187,404 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
def solve(lst, n, k):
sum_current = sum(lst[0:k])
ans = sum_current
for i in range(n - k):
sum_current = sum_current - lst[i] + lst[i + k]
ans = max(ans, sum_current)
return ans
def two_editorials():
n, m, ... | output | 1 | 93,702 | 11 | 187,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,703 | 11 | 187,406 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
n, m, k = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
def solv(lst):
res = sum(lst[:k])
s = res
for i in range(n-k):
s += lst[i+k] - lst[i]
res = max(res, s)
return res
a.s... | output | 1 | 93,703 | 11 | 187,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,704 | 11 | 187,408 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
import sys
BUFSIZE = 8192
from sys import stderr
from io import BytesIO, IOBase
import os
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writ... | output | 1 | 93,704 | 11 | 187,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,705 | 11 | 187,410 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
# Enter your code here. Read input from STDIN. Print output to STDOUT# ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_fun... | output | 1 | 93,705 | 11 | 187,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take place. There are two problem authors, each of ... | instruction | 0 | 93,706 | 11 | 187,412 |
Tags: brute force, dp, greedy, sortings, two pointers
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
def prog():
n,m,k = map(int,input().split())
intervals = [list(map(int,input().split())) for i in range(m)]
for i in range(m):
intervals[i][0] -= 1
intervals[i][1] -=... | output | 1 | 93,706 | 11 | 187,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,707 | 11 | 187,414 |
Yes | output | 1 | 93,707 | 11 | 187,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,708 | 11 | 187,416 |
Yes | output | 1 | 93,708 | 11 | 187,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,709 | 11 | 187,418 |
Yes | output | 1 | 93,709 | 11 | 187,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,710 | 11 | 187,420 |
Yes | output | 1 | 93,710 | 11 | 187,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,711 | 11 | 187,422 |
No | output | 1 | 93,711 | 11 | 187,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,712 | 11 | 187,424 |
No | output | 1 | 93,712 | 11 | 187,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,713 | 11 | 187,426 |
No | output | 1 | 93,713 | 11 | 187,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland regional ICPC contest has just ended. There were m participants numbered from 1 to m, who competed on a problemset of n problems numbered from 1 to n.
Now the editorial is about to take... | instruction | 0 | 93,714 | 11 | 187,428 |
No | output | 1 | 93,714 | 11 | 187,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem statement
Here are $ N $ sheets of paper. You want to scan all paper by using $ 3 $ scanners in parallel. Each piece of paper has a fixed scanning time, and the time it takes to scan th... | instruction | 0 | 95,237 | 11 | 190,474 |
No | output | 1 | 95,237 | 11 | 190,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem statement
Here are $ N $ sheets of paper. You want to scan all paper by using $ 3 $ scanners in parallel. Each piece of paper has a fixed scanning time, and the time it takes to scan th... | instruction | 0 | 95,238 | 11 | 190,476 |
No | output | 1 | 95,238 | 11 | 190,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem statement
Here are $ N $ sheets of paper. You want to scan all paper by using $ 3 $ scanners in parallel. Each piece of paper has a fixed scanning time, and the time it takes to scan th... | instruction | 0 | 95,239 | 11 | 190,478 |
No | output | 1 | 95,239 | 11 | 190,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem statement
Here are $ N $ sheets of paper. You want to scan all paper by using $ 3 $ scanners in parallel. Each piece of paper has a fixed scanning time, and the time it takes to scan th... | instruction | 0 | 95,240 | 11 | 190,480 |
No | output | 1 | 95,240 | 11 | 190,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a consisting of n positive integers. Find a non-empty subset of its elements such that their sum is even (i.e. divisible by 2) or determine that there is no such subset.
... | instruction | 0 | 95,401 | 11 | 190,802 |
Yes | output | 1 | 95,401 | 11 | 190,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,494 | 11 | 190,988 |
Yes | output | 1 | 95,494 | 11 | 190,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,495 | 11 | 190,990 |
Yes | output | 1 | 95,495 | 11 | 190,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,496 | 11 | 190,992 |
Yes | output | 1 | 95,496 | 11 | 190,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,497 | 11 | 190,994 |
Yes | output | 1 | 95,497 | 11 | 190,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,498 | 11 | 190,996 |
No | output | 1 | 95,498 | 11 | 190,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,499 | 11 | 190,998 |
No | output | 1 | 95,499 | 11 | 190,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,500 | 11 | 191,000 |
No | output | 1 | 95,500 | 11 | 191,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a program that consists of n instructions. Initially a single variable x is assigned to 0. Afterwards, the instructions are of two types:
* increase x by 1;
* decrease x by ... | instruction | 0 | 95,501 | 11 | 191,002 |
No | output | 1 | 95,501 | 11 | 191,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya tries to break in a safe. He knows that a code consists of n numbers, and every number is a 0 or a 1. Vasya has made m attempts to enter the code. After each attempt the system told him in how many position stand the right numbers. It ... | instruction | 0 | 95,653 | 11 | 191,306 |
Tags: brute force
Correct Solution:
```
import itertools
n,m=map(int,input().split())
def gen(s,d):
ans=[]
a=int(str(s),2)
A=int(a)
for i in itertools.combinations(list(range(n)), d):
c=A
for e in i:c=c ^ 1<<e
ans.append(c)
return ans
a,b=map(int,input().split())
cur=gen(a,b)... | output | 1 | 95,653 | 11 | 191,307 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya tries to break in a safe. He knows that a code consists of n numbers, and every number is a 0 or a 1. Vasya has made m attempts to enter the code. After each attempt the system told him in how many position stand the right numbers. It ... | instruction | 0 | 95,654 | 11 | 191,308 |
Tags: brute force
Correct Solution:
```
import sys
from array import array # noqa: F401
from itertools import combinations
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n, m = map(int, input().split())
s = set()
x = set()
for i in range(m):
a, k = input().split()
k = int(k)
a = i... | output | 1 | 95,654 | 11 | 191,309 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.