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.
There are n segments [l_i, r_i] for 1 ≤ i ≤ n. You should divide all segments into two non-empty groups in such way that there is no pair of segments from different groups which have at least one common point, or say that it's impossible to do it. Each segment should belong to exactly one group.
To optimize testing process you will be given multitest.
Input
The first line contains one integer T (1 ≤ T ≤ 50000) — the number of queries. Each query contains description of the set of segments. Queries are independent.
First line of each query contains single integer n (2 ≤ n ≤ 10^5) — number of segments. It is guaranteed that ∑{n} over all queries does not exceed 10^5.
The next n lines contains two integers l_i, r_i per line (1 ≤ l_i ≤ r_i ≤ 2 ⋅ 10^5) — the i-th segment.
Output
For each query print n integers t_1, t_2, ..., t_n (t_i ∈ \{1, 2\}) — for each segment (in the same order as in the input) t_i equals 1 if the i-th segment will belongs to the first group and 2 otherwise.
If there are multiple answers, you can print any of them. If there is no answer, print -1.
Example
Input
3
2
5 5
2 3
3
3 5
2 3
2 3
3
3 3
4 4
5 5
Output
2 1
-1
1 1 2
Note
In the first query the first and the second segments should be in different groups, but exact numbers don't matter.
In the second query the third segment intersects with the first and the second segments, so they should be in the same group, but then the other group becomes empty, so answer is -1.
In the third query we can distribute segments in any way that makes groups non-empty, so any answer of 6 possible is correct.
Submitted Solution:
```
def go(a):
return a[1][1]
for _ in range(int(input())):
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
b=[]
for i in range(n):
b.append([i,a[i]])
b.sort(key=go)
ans=[0]*n
group=1
maxx=b[0][1][0]
for i in range(n):
if group==1 and b[i][1][0]>maxx:
group=2
if maxx<b[i][1][1]:
maxx=b[i][1][1]
ans[b[i][0]]=group
if group==2:
print(*ans)
#print(x,y)
else:print(-1)
``` | instruction | 0 | 29,164 | 11 | 58,328 |
No | output | 1 | 29,164 | 11 | 58,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments [l_i, r_i] for 1 ≤ i ≤ n. You should divide all segments into two non-empty groups in such way that there is no pair of segments from different groups which have at least one common point, or say that it's impossible to do it. Each segment should belong to exactly one group.
To optimize testing process you will be given multitest.
Input
The first line contains one integer T (1 ≤ T ≤ 50000) — the number of queries. Each query contains description of the set of segments. Queries are independent.
First line of each query contains single integer n (2 ≤ n ≤ 10^5) — number of segments. It is guaranteed that ∑{n} over all queries does not exceed 10^5.
The next n lines contains two integers l_i, r_i per line (1 ≤ l_i ≤ r_i ≤ 2 ⋅ 10^5) — the i-th segment.
Output
For each query print n integers t_1, t_2, ..., t_n (t_i ∈ \{1, 2\}) — for each segment (in the same order as in the input) t_i equals 1 if the i-th segment will belongs to the first group and 2 otherwise.
If there are multiple answers, you can print any of them. If there is no answer, print -1.
Example
Input
3
2
5 5
2 3
3
3 5
2 3
2 3
3
3 3
4 4
5 5
Output
2 1
-1
1 1 2
Note
In the first query the first and the second segments should be in different groups, but exact numbers don't matter.
In the second query the third segment intersects with the first and the second segments, so they should be in the same group, but then the other group becomes empty, so answer is -1.
In the third query we can distribute segments in any way that makes groups non-empty, so any answer of 6 possible is correct.
Submitted Solution:
```
def isd(a,b):
if a[0] in b or a[1] in b:
return 0
return 1
n=int(input())
for i in range(n):
x=int(input())
a=x*[0]
for i in range(x):
a[i]=list(map(int,input().split()))
h=x*[0]
h[0]='2 '
b=[[],[a[0]]]
l=1
for i in range(1,len(a)):
f=1
for j in b[1]:
if not isd(a[i],j):
f=0
break
if f:
b[0]+=[a[i]]
h[i]='1 '
else:
f=1
for j in b[0]:
if not isd(a[i],j):
f=0
break
if f:
b[1]+=[a[i]]
h[i]='2 '
else:
l=0
print(-1)
break
if l:
if b[0]:
g=''
for i in h:
g+=i
print(g)
else:
print(-1)
``` | instruction | 0 | 29,165 | 11 | 58,330 |
No | output | 1 | 29,165 | 11 | 58,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments [l_i, r_i] for 1 ≤ i ≤ n. You should divide all segments into two non-empty groups in such way that there is no pair of segments from different groups which have at least one common point, or say that it's impossible to do it. Each segment should belong to exactly one group.
To optimize testing process you will be given multitest.
Input
The first line contains one integer T (1 ≤ T ≤ 50000) — the number of queries. Each query contains description of the set of segments. Queries are independent.
First line of each query contains single integer n (2 ≤ n ≤ 10^5) — number of segments. It is guaranteed that ∑{n} over all queries does not exceed 10^5.
The next n lines contains two integers l_i, r_i per line (1 ≤ l_i ≤ r_i ≤ 2 ⋅ 10^5) — the i-th segment.
Output
For each query print n integers t_1, t_2, ..., t_n (t_i ∈ \{1, 2\}) — for each segment (in the same order as in the input) t_i equals 1 if the i-th segment will belongs to the first group and 2 otherwise.
If there are multiple answers, you can print any of them. If there is no answer, print -1.
Example
Input
3
2
5 5
2 3
3
3 5
2 3
2 3
3
3 3
4 4
5 5
Output
2 1
-1
1 1 2
Note
In the first query the first and the second segments should be in different groups, but exact numbers don't matter.
In the second query the third segment intersects with the first and the second segments, so they should be in the same group, but then the other group becomes empty, so answer is -1.
In the third query we can distribute segments in any way that makes groups non-empty, so any answer of 6 possible is correct.
Submitted Solution:
```
import sys
input = sys.stdin.readline
from itertools import accumulate
t = int(input())
for _ in range(t):
n = int(input())
lr = [list(map(int,input().split())) for i in range(n)]
dc = {lr[i][0]*10**9+lr[i][1]:i for i in range(n)}
lr.sort()
mx = [lr[0][1]]
for i in range(1,n):
mx.append(max(mx[-1],lr[i][1]))
s = -1
for i in range(n):
l,r = lr[i]
if i > 0:
if l > mx[i-1]:
s = dc[lr[i][0]*10**9+lr[i][1]]
break
if s == -1:
print(-1)
continue
else:
print(*[2 if s <= i else 1 for i in range(n)])
``` | instruction | 0 | 29,166 | 11 | 58,332 |
No | output | 1 | 29,166 | 11 | 58,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
import sys
n = int(sys.stdin.readline())
l = [int(x) for x in sys.stdin.readline().split(' ')]
ind = sorted(range(len(l)), key=lambda x: l[x])
h = l[ind[0]] - 1
for i in ind:
if l[i] <= h:
l[i] = h+1
h += 1
else:
h = l[i]
print(" ".join([str(x) for x in l]))
``` | instruction | 0 | 29,466 | 11 | 58,932 |
Yes | output | 1 | 29,466 | 11 | 58,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
n=int(input())
x=list(map(int,input().split()))
a=[i for i in range(n)]
a.sort(key=lambda y:x[y])
c=0
for i in range(n):
if x[a[i]] <= c:
x[a[i]] = c
c += 1
elif x[a[i]] > c:
c = x[a[i]] + 1
x=list(map(str,x))
print(" ".join(x))
``` | instruction | 0 | 29,467 | 11 | 58,934 |
Yes | output | 1 | 29,467 | 11 | 58,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
n = int(input());
values = list( map(int, input().split(' ')) );
keys = sorted(range(n), key = lambda a : values[a]);
last = 0;
for a in keys :
last = max(values[a], last);
values[a] = last;
last += 1;
print(*values);
``` | instruction | 0 | 29,468 | 11 | 58,936 |
Yes | output | 1 | 29,468 | 11 | 58,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
n=int(input())
lst=[*map(int,input().split())]
elem=0
for i,x in enumerate(sorted(range(n),key=lst.__getitem__)):
lst[x]=elem=max(elem+1,lst[x])
print(' '.join(map(str,lst)))
``` | instruction | 0 | 29,469 | 11 | 58,938 |
Yes | output | 1 | 29,469 | 11 | 58,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
from collections import Counter
import string
import bisect
#import random
import math
import sys
# sys.setrecursionlimit(10**6)
from fractions import Fraction
def array_int():
return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
if arrber_of_variables==1:
return int(sys.stdin.readline())
if arrber_of_variables>=2:
return map(int,sys.stdin.readline().split())
def makedict(var):
return dict(Counter(var))
testcases=1
for _ in range(testcases):
n=vary(1)
num=[]
j=0
for i in input().split():
num.append([int(i),j])
j+=1
num.sort()
numt=[num[0][0]]*n
for i in range(1,n):
if num[i][0]!=num[i-1][0]:
continue
else:
num[i][0]=num[i][0]+1
num.sort(key=lambda x:x[1])
for i in range(n):
print(num[i][0],end=" ")
print()
``` | instruction | 0 | 29,470 | 11 | 58,940 |
No | output | 1 | 29,470 | 11 | 58,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
input()
d1 = {}
d2 = {}
for x in map(int, input().split()):
if x not in d2:
d2[x] = x
if x not in d1:
d1[x] = x
else:
d2[x] += 1
if d2[x] not in d2:
d1[d2[x]] = d2[x]
else:
k = max(d2[x], d2[d2[x]] + 1)
d1[k] = k
for val in d1.values():
print(val, end=' ')
``` | instruction | 0 | 29,471 | 11 | 58,942 |
No | output | 1 | 29,471 | 11 | 58,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
n=int(input())
a=list(map(int, input().split()))
a.sort()
b = ""
temp=0
for i in range (n):
if a[i] <= temp:
a[i] = temp
temp+=1
elif a[i] > temp:
temp = a[i] + 1
b= b + " " + str(a[i])
print (b)
``` | instruction | 0 | 29,472 | 11 | 58,944 |
No | output | 1 | 29,472 | 11 | 58,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.
There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least ai rating units as a present.
The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.
Help site X cope with the challenging task of rating distribution. Find the optimal distribution.
Input
The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print a sequence of integers b1, b2, ..., bn. Number bi means that user i gets bi of rating as a present. The printed sequence must meet the problem conditions.
If there are multiple optimal solutions, print any of them.
Examples
Input
3
5 1 1
Output
5 1 2
Input
1
1000000000
Output
1000000000
Submitted Solution:
```
i = int(input())
rat = list(map(int, input().split(' ')))
ratp = [[rat[x], x, -1] for x in range(len(rat))]
ratp.sort()
start = 1
for i in range(len(ratp)):
if ratp[i][0] == start:
ratp[i][2] = start
start += 1
elif ratp[i][0] < start:
ratp[i][2] = start
start += 1
else:
start = ratp[i][0]
ratp[i][2] = start
start += 1
print(start, ratp)
ratp.sort(key = lambda x:x[1])
print(' '.join([str(x[2]) for x in ratp]))
``` | instruction | 0 | 29,473 | 11 | 58,946 |
No | output | 1 | 29,473 | 11 | 58,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
#def proverka(b, k, m, p):
# for i in range()
n = int(input())
a = []
for i in range(n):
a.append([int(j) for j in input().split()])
flag = "Yes"
for i in range(n):
for j in range(n):
if(a[i][j] != 1):
f = False
for k in range(n):
if(f):
break
for z in range(n):
if(a[k][j] + a[i][z] == a[i][j]):
f = True
if(f):
break
if(not(f)):
flag = "No"
print(flag)
``` | instruction | 0 | 29,655 | 11 | 59,310 |
Yes | output | 1 | 29,655 | 11 | 59,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
n = int(input())
arr = [list(map(int,input().split())) for _ in range(n)]
for i in range(n):
for j in range(n):
if(arr[i][j] != 1):
valid = 0
for k in range(n):
for l in range(n):
if(arr[i][j] == arr[i][k] + arr[l][j]):
valid += 1;
if(valid == 0):
print("No")
exit(0);
print("Yes");
``` | instruction | 0 | 29,656 | 11 | 59,312 |
Yes | output | 1 | 29,656 | 11 | 59,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
n=int(input())
k=[]
for i in range(n):
k.append(list(map(int,input().split())))
k1=tuple(zip(*k))
m=[]
for i in range(n):
for j in range(n):
if k[i][j]!=1:
g=False
for l in k[i]:
for z in k1[j]:
if l+z==k[i][j]:
m.append(1)
g=True
break
if g:
break
else:
m.append(1)
if len(m)==n*n:
print("Yes")
else:
print("No")
``` | instruction | 0 | 29,657 | 11 | 59,314 |
Yes | output | 1 | 29,657 | 11 | 59,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
n=I()
l=[LI() for _ in range(n)]
for i in range(n):
for j in range(n):
x=l[i][j]
if x==1:
continue
d={}
for k in range(n):
if k!=j:
d[l[i][k]]=l[i][k]
f=False
# print(d)
for k in range(n):
if k!=i:
if x-l[k][j] in d:
f=True
if not f:
return 'No'
return 'Yes'
# main()
print(main())
``` | instruction | 0 | 29,658 | 11 | 59,316 |
Yes | output | 1 | 29,658 | 11 | 59,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
""" Created by Shahen Kosyan on 6/25/17 """
if __name__ == "__main__":
n = int(input())
i = 0
matrix = []
while i < n:
matrix.append([int(x) for x in input().split(' ')])
i += 1
i = 0
good = True
while i < n:
j = 0
while j < n:
if matrix[i][j] != 1:
total = 0
k = 0
while k < n:
if k == j:
k += 1
else:
total += matrix[i][k]
l = 0
while l < n:
if l == i:
l += 1
else:
total += matrix[l][j]
# print('total2', total)
if total == matrix[i][j]:
good = True
total = 0
break
else:
total -= matrix[l][j]
l += 1
good = False
if good:
total = 0
break
else:
total -= matrix[i][k]
k += 1
else:
good = True
if good:
j += 1
else:
break
if good:
i += 1
else:
break
if good:
print("YES")
else:
print("NO")
``` | instruction | 0 | 29,659 | 11 | 59,318 |
No | output | 1 | 29,659 | 11 | 59,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
n = int(input())
a = [[int(x) for x in input().split()] for y in range(n)]
ans = True
for i in range(n):
ans = False
for j in range(n):
if a[i][j] == 1:
continue
for k in range(i):
for l in range(j):
if a[k][j] + a[i][l] == a[i][j]:
ans = True
for k in range(i + 1, n):
for l in range(j):
if a[k][j] + a[i][l] == a[i][j]:
ans = True
for k in range(i):
for l in range(j + 1, n):
if a[k][j] + a[i][l] == a[i][j]:
ans = True
for k in range(i + 1, n):
for l in range(j + 1, n):
if a[k][j] + a[i][l] == a[i][j]:
ans = True
if not ans:
break
if not ans:
break
if ans:
print("Yes")
else:
print("No")
``` | instruction | 0 | 29,660 | 11 | 59,320 |
No | output | 1 | 29,660 | 11 | 59,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
def good(lab):
for i, line in enumerate(lab):
for j, item in enumerate(line):
if item == 1:
continue
for k, x in enumerate(line):
if j==k:
continue
col = [l[j] for l in lab]
for m, y in enumerate(col):
if m==i:
continue
if x+y==item:
continue
else:
return "No"
return "Yes"
def main():
N = int(input())
lab = [[int(item) for item in input().split()] for _ in range(N)]
print(good(lab))
if __name__ == "__main__":
main()
``` | instruction | 0 | 29,661 | 11 | 59,322 |
No | output | 1 | 29,661 | 11 | 59,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x, y such that 1 ≤ x, y ≤ n and ax, y ≠ 1, there should exist two indices s and t so that ax, y = ax, s + at, y, where ai, j denotes the integer in i-th row and j-th column.
Help Okabe determine whether a given lab is good!
Input
The first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab.
The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai, j (1 ≤ ai, j ≤ 105).
Output
Print "Yes" if the given lab is good and "No" otherwise.
You can output each letter in upper or lower case.
Examples
Input
3
1 1 2
2 3 1
6 4 1
Output
Yes
Input
3
1 5 2
1 1 1
1 2 3
Output
No
Note
In the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is "Yes".
In the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is "No".
Submitted Solution:
```
def main_function():
is_inner_most_loop_broken = False
intermediate_list = [[int(i) for i in input().split(" ")] for j in range(int(input()))]
for i in range(len(intermediate_list)):
for j in range(len(intermediate_list[i])):
if not intermediate_list[i][j] == 1:
for h in range(len(intermediate_list)):
if h != i:
for y in range(len(intermediate_list[i])):
if y != j:
if intermediate_list[i][j] == intermediate_list[h][j] + intermediate_list[i][y]:
is_inner_most_loop_broken = True
break
if is_inner_most_loop_broken:
break
else:
return "No"
return "Yes"
print(main_function())
``` | instruction | 0 | 29,662 | 11 | 59,324 |
No | output | 1 | 29,662 | 11 | 59,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,679 | 11 | 59,358 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
n, k = map(int, input().split())
cnt = [0] * (1<<k)
for _ in range(n):
arr = list(map(int, input().split()))
acc = 0
for i in range(k):
acc |= arr[i] * (1<<i)
cnt[acc] += 1
gud = cnt[0] > 0
for i in range(1<<k):
for j in range(i+1, 1<<k):
if i & j > 0:
continue
if cnt[i] > 0 and cnt[j] > 0:
gud = True
if gud:
print("YES")
else:
print("NO")
``` | output | 1 | 29,679 | 11 | 59,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,680 | 11 | 59,360 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
inp = input().split(" ")
n = int(inp[0])
k = int(inp[1])
s = set()
for i in range(n):
a = input().split(' ')
x = 0
for j in range(k):
x = 2 * x + int(a[j])
s.add(x)
for i in range(16):
if i in s:
for j in range(16):
if j in s:
if i & j == 0:
print("YES")
exit(0)
print("NO")
``` | output | 1 | 29,680 | 11 | 59,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,681 | 11 | 59,362 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
n, k = map(int, input().split())
a = set()
yes = False
for i in range(n):
a.add(input())
for w in a:
for w2 in a:
x = list(map(int, w.split()))
y = list(map(int, w2.split()))
count = 0
for i in range(k):
if x[i] + y[i] != 2:
count += 1
if count == k:
yes = True
if yes:
print("YES")
else:
print("NO")
``` | output | 1 | 29,681 | 11 | 59,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,682 | 11 | 59,364 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
n,k=map(int,input().split())
l=set()
for i in range(n):
l.add(int("".join(map(str,input().split())),2))
for x in l:
for y in l:
if x&y==0:
print("YES")
exit()
print("NO")
``` | output | 1 | 29,682 | 11 | 59,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,683 | 11 | 59,366 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
problems,teams=[int(x) for x in input().split()]
teams1=[0 for x in range(teams)]
known=set()
for i in range(problems):
questions="".join(input().split())
known.add(int(questions,2))
known=sorted(known)
z=len(known)
for i in range(z):
for j in range(i,z):
if known[i]&known[j]==0:
print("YES")
exit()
print("NO")
#print(known)
``` | output | 1 | 29,683 | 11 | 59,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,684 | 11 | 59,368 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
### Problem:
"""
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
#Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
#Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
"""
### SOLUTION:
"""
every row has (2^k) possibilities from 0 - (2^k - 1)
to have at least 2 problems in the problemset:
- if an input row is all zeros, i.e. there is a problem that nobody knows
- an input row containing 1's and there is a previous input row in which for every 1 in the input row, there is a zero in the adjacent position. i.e. for every known problem there is a problem that this group doesn't know
-- Fast solution: if we have a row x and the complement of x, for ex: 101 and 010
SOLUTION STEPS:
1- get n, k
2- create twoPkList: a list of 2^k - 2 rows, (the tow missing rows are the ones containing all 0's and all 1's and there is no need to check against them),
a (k+1) columns and initialize the values = 0 i.e. FALSE, the (k+1) column is to check if a specific row is already inputted (1:TRUE) or not yes (0:FALSE)
-- for every row in n input rows:
3- convert the input elements to binary
-- if it is a 1:
-- add its position in the input string to the onesList
-- convert it to its decimal value and add it to the summation
4- #FAST CASE# if the input is all 0's, make result = YES and break
5- #FAST CASE# if the input is all 1's, no need to do more check, continue
6- #FAST CASE# if the complement of summation already exists in the list by i.e. if twoPkList[2**k -2 - summation][k] is set
7- for each row in twoPkList:
8- create adjacentZeros to count the number of 0's in the row that are adjacent to the 1's in the input
9- #FAST CASE# check if the row is already set and it is not the same row as the input:
10- for every position containing 1 in the input: check if the same position in the row has a 1:
11- if it has, increase adjacentZeros by 1,
12- if the total number of adjacentZeros == length of the 1's positions list (onesList) i.e. for every 1 in the iput there is an adjacent zero in the row, set the result = "YES"
then a problemset can be created
13- if the result is set to "YES", break
14- if the twoPkList[summation - 1][k] is not set
15- add the binary list of the input to twoPkList[summation - 1]
16- set the twoPkList[summation - 1][k]
"""
n, k = input().split()
n = int(n) # no. of problems
k = int(k) # no. of teams
inputList = [] # input
twoPkList = [] # array to save status for each 2 pow k values
kList = [] # array to save status for each k values in every (2 pow k) row
result = 'NO'
list1 = []
list0 = []
for j in range(k):
list1.append('1')
list0.append('0')
kList.append(0)
onesStr = ' '.join(list1)
zerosStr = ' '.join(list0)
kList.append(0)# initialize elements = FALSE + another column to check the whole number
# case k = 3 :
# 0 0 1 (1)
# 0 1 0 (2)
# 0 1 1 (3)
# 1 0 0 (4)
# ........
#for every value btn. parentheses we put a boolean value indicating whether it's already found (TRUE) or not (FALSE)
for i in range(2**k - 2): # all cases except when all 0's and all 1's
twoPkList.append(list(kList))#initialize elements = FALSE
for i in range(n):
inputString = input()
if (inputString == zerosStr): # input is all 0's
result = "YES"
break
if (inputString == onesStr): # all ones, no need to check
continue
inputList = inputString.split()# split the input string
onesList = [] # to save the positions of 1's in the input string
summation = 0 #initialize summation
for j in range(k):
#convert to binary
inputList[j] = int(inputList[j])# a list of ones and zeros
if (inputList[j]):# if it is a 1
onesList.append(j)# keep the position of that 1
summation += inputList[j] * (2**(k-1-j))
if (twoPkList[2**k - 2 - summation][k]): # if the complement exists
result = "YES"
break
for index, row in enumerate(twoPkList):# for every row in twoPkList
adjacentZeros = 0
if ( row[k] and (not( index == (summation - 1) )) ):# if the row is already set and it isn't the same element #### to not pointlessly check a row
for position in onesList:# for every position of 1
if (row[position] == 0):# if the position of a 1 in the input has an adjacent 0
adjacentZeros += 1 # increase number of adjacent zeros by 1
if (adjacentZeros == len(onesList)):# if number of zeros in the row == number of ones in the input in the same positions
# we can form an interesting problemset
result = "YES"
break
if (result == "YES"):
break
if (not twoPkList[summation - 1][k]):#if it is not set
twoPkList[summation - 1] = list(inputList)
twoPkList[summation - 1].append(1)
print(result)
``` | output | 1 | 29,684 | 11 | 59,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,685 | 11 | 59,370 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
n,k = map(int,input().split())
kij = [list(map(int,input().split())) for i in range(n)]
kji = [[max(sum(kij[j]) / k,kij[j][i]) for j in range(n)] for i in range(k)]
km = [min(kji[i]) for i in range(k)]
if max(km) == 1 or sum(km) > k / 2:
print("NO")
elif k == 2 or k == 3 or min(km) <= 0.25:
print("YES")
else:
ans = "NO"
num = -1
num2 = -1
num3 = -1
num4 = -1
num5 = -1
num6 = -1
for i in range(n):
if kji[0][i] == 0.5:
if kji[1][i] == 0.5:
num = 2
num2 = 3
elif kji[2][i] == 0.5:
num3 = 1
num4 = 3
else:
num5 = 2
num6 = 1
if num != -1:
for i in range(n):
if kji[num][i] == 0.5 and kji[num2][i] == 0.5:
ans = "YES"
break
if num3 != -1:
for i in range(n):
if kji[num3][i] == 0.5 and kji[num4][i] == 0.5:
ans = "YES"
break
if num5 != -1:
for i in range(n):
if kji[num5][i] == 0.5 and kji[num6][i] == 0.5:
ans = "YES"
break
print(ans)
``` | output | 1 | 29,685 | 11 | 59,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems. | instruction | 0 | 29,686 | 11 | 59,372 |
Tags: bitmasks, brute force, constructive algorithms, dp
Correct Solution:
```
n, k = [int(x) for x in input().split()]
bit_array = set()
for i in range(n):
temp = input()
temp2 = ""
for c in temp:
if c != " ":
temp2 += c
bit_array.add(temp2)
# print(bit_array)
ls = list(bit_array)
ans = "no"
for x in ls:
for y in ls:
temp = ""
for i in range(k):
temp += str(int(x[i]) & int(y[i]))
if temp == "0" * k:
ans = "yes"
break
print(ans)
``` | output | 1 | 29,686 | 11 | 59,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
n, k = map(int, input().split())
arr = [list(map(int, input().split())) for _ in range(n)]
vis = [0] * (1 << k)
for i in arr:
x = 0
for j in i:
x = 2*x + j
if x == 0:
print('YES')
exit()
for j in range(len(vis)):
if j & x == 0 and vis[j]:
print('YES')
exit()
vis[x] = 1
print('NO')
``` | instruction | 0 | 29,687 | 11 | 59,374 |
Yes | output | 1 | 29,687 | 11 | 59,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
n, k = [int(i) for i in input().split()]
K = 1 << k
p = [0] * K
for i in range(n):
pi = [int(j) for j in input().split()]
pc = sum(pi[j] << j for j in range(k))
p[pc] += 1
s = [0] * k
def go(i0, used):
if i0 >= K: return False
if p[i0]:
s0 = s[:]
ok = True
used += 1
for j in range(k):
f = (i0 >> j) & 1
assert f == 0 or f == 1
s[j] += (i0 >> j) & 1
if s[j] * 2 > used: ok = False
if ok: return True
if go(i0+1, used): return True
s[:] = s0
used -= 1
return go(i0+1, used)
ans = "YES" if go(0, 0) else "NO"
print(ans)
``` | instruction | 0 | 29,688 | 11 | 59,376 |
Yes | output | 1 | 29,688 | 11 | 59,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
vis = [0] * ((1 << 4) + 5)
line = input().split()
n = int(line[0])
k = int(line[1])
for i in range(n):
line = input().split()
st = 0
for j in range(k):
x = int(line[j])
st += (1 << j) * x
vis[st] = 1
flag = False
for i in range(16):
for j in range(16):
if vis[i] == 0 or vis[j] == 0:
continue
if (i & j) == 0:
flag = True
break
if flag:
break
if flag:
print('YES')
else:
print('NO')
``` | instruction | 0 | 29,689 | 11 | 59,378 |
Yes | output | 1 | 29,689 | 11 | 59,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
n, k = map(int, input().split())
temp = set()
for i in range(n):
temp.add(input())
f = 0
for r in temp:
for r2 in temp:
a, b = list(map(int, r.split())), list(map(int, r2.split()))
c = 0
for i in range(k):
c += int(a[i] + b[i] != 2)
if c == k:
f = 1
if f:
print("YES")
else:
print("NO")
``` | instruction | 0 | 29,690 | 11 | 59,380 |
Yes | output | 1 | 29,690 | 11 | 59,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
x = input().split()
n = int(x[0])
j = int(x[1])
a = [0]*j
for i in range(n):
y = [int(i) for i in input().split()]
for i in range(j):
a[i] = a[i] + y[i]
hasFound = 0
for i in range(j):
if a[i]/n == 1:
hasFound = 1
if hasFound :
print('NO')
else:
print('YES')
``` | instruction | 0 | 29,691 | 11 | 59,382 |
No | output | 1 | 29,691 | 11 | 59,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
import sys
from sys import stdin, stdout
def R():
return map(int, stdin.readline().strip().split())
def I():
return stdin.readline().strip().split()
n, m = map(int, stdin.readline().strip().split())
arr = []
for i in range(n):
arr.append(int(''.join(I()), 2))
arr = list(set(arr))
for i in range(len(arr)):
for j in range(i+1, len(arr)):
if arr[i]+arr[j] == arr[i]^arr[j]:
print("YES")
exit()
print("NO")
``` | instruction | 0 | 29,692 | 11 | 59,384 |
No | output | 1 | 29,692 | 11 | 59,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
import math
n, k = input().split()
inputList = []
teamList = []
n = int(n)# no of problems
k = int(k)# no of teams
result = 'YES'
for i in range(k):
teamList.append(0)
for i in range(n):
inputList = input().split()
for j in range(k):
teamList[j] += int(inputList[j])
if (max(teamList) == n):
result = 'NO'
print(result)
``` | instruction | 0 | 29,693 | 11 | 59,386 |
No | output | 1 | 29,693 | 11 | 59,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.
k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
Determine if Snark and Philip can make an interesting problemset!
Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.
Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.
Output
Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
Examples
Input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
Output
NO
Input
3 2
1 0
1 1
0 1
Output
YES
Note
In the first example you can't make any interesting problemset, because the first team knows all problems.
In the second example you can choose the first and the third problems.
Submitted Solution:
```
n, k = [int(i) for i in input().split()]
K = 1 << k
p = [0] * K
dbg = (n == 10000) and (k == 3)
dbgl=[[1,1,1],[0,1,1],[0,1,0],[1,1,0],[0,1,0]]
for i in range(n):
pi = [int(j) for j in input().split()]
pc = sum(pi[j] << j for j in range(k))
p[pc] += 1
if dbg and i < len(dbgl) and pi!=dbgl[i]: dbg=False
if dbg: print(p)
s = [0] * k
def go(i0, used):
if i0 >= K: return False
if p[i0]:
s0 = s
ok = True
used += 1
for j in range(k):
s[j] += (i0 >> j) & 1
if s[j] * 2 > used: ok = False
if ok: return True
if go(i0+1, used): return True
s[:] = s0
used -= 1
return go(i0+1, used)
ans = "YES" if go(0, 0) else "NO"
if not dbg: print(ans)
``` | instruction | 0 | 29,694 | 11 | 59,388 |
No | output | 1 | 29,694 | 11 | 59,389 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,807 | 11 | 59,614 |
"Correct Solution:
```
n = int(input())
a, b = map(int,input().split())
p = [int(x) for x in input().split()]
x,y,z = 0,0,0
for i in p:
if i <= a:
x += 1
elif i <= b:
y += 1
else:
z += 1
print(min(x,y,z))
``` | output | 1 | 29,807 | 11 | 59,615 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,808 | 11 | 59,616 |
"Correct Solution:
```
import bisect
n = int(input())
a,b = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
a_ = bisect.bisect_right(p,a)
b_ = bisect.bisect_right(p,b)
print(min(a_,b_-a_,n-b_))
``` | output | 1 | 29,808 | 11 | 59,617 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,809 | 11 | 59,618 |
"Correct Solution:
```
n, a, b, *P = map(int, open(0).read().split())
cnt = [0]*3
for p in P:
if p <= a:
cnt[0] += 1
elif a < p <= b:
cnt[1] += 1
else:
cnt[2] += 1
print(min(cnt))
``` | output | 1 | 29,809 | 11 | 59,619 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,810 | 11 | 59,620 |
"Correct Solution:
```
N,A,B,*P=map(int,open(0).read().split())
C=[0]*3
for p in P:
C[(A<p)+(B<p)]+=1
print(min(C))
``` | output | 1 | 29,810 | 11 | 59,621 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,811 | 11 | 59,622 |
"Correct Solution:
```
n=int(input())
a,b=map(int,input().split())
p=list(map(int,input().split()))
ta=0
tb=0
tc=0
for i in range(n):
if p[i]<=a:
ta=ta+1
elif p[i]>=b+1:
tc=tc+1
else:
tb=tb+1
print(min(ta,tb,tc))
``` | output | 1 | 29,811 | 11 | 59,623 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,812 | 11 | 59,624 |
"Correct Solution:
```
N = int(input())
A, B = map(int, input().split())
P = list(map(int, input().split()))
a = len([*filter(lambda x: x<=A,P)])
b = len([*filter(lambda x: A<x<=B,P)])
c = len([*filter(lambda x: B<x,P)])
print(min(a,b,c))
``` | output | 1 | 29,812 | 11 | 59,625 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,813 | 11 | 59,626 |
"Correct Solution:
```
from bisect import *
N = int(input())
A, B = map(int, input().split())
P = list(map(int, input().split()))
P.sort()
a = bisect_right(P, A)
b = bisect_right(P, B)-a
c = N-b-a
print(min(a, b, c))
``` | output | 1 | 29,813 | 11 | 59,627 |
Provide a correct Python 3 solution for this coding contest problem.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1 | instruction | 0 | 29,814 | 11 | 59,628 |
"Correct Solution:
```
n=int(input())
a,b=map(int,input().split())
p1,p2,p3=0,0,0
for t in map(int,input().split()):
if t<=a:
p1+=1
elif t<=b:
p2+=1
else:
p3+=1
print(min(p1,p2,p3))
``` | output | 1 | 29,814 | 11 | 59,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
n = int(input())
a, b = map(int, input().split())
p = list(map(int, input().split()))
x = len([i for i in p if i <= a])
y = len([i for i in p if a < i <= b])
z = len([i for i in p if b < i])
print(min(x,y,z))
``` | instruction | 0 | 29,815 | 11 | 59,630 |
Yes | output | 1 | 29,815 | 11 | 59,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
N = int(input())
A,B = map(int,input().split())
P=list(map(int,input().split()))
a = sum(x<=A for x in P)
b = sum(x<=B and x>A for x in P)
c = sum(x>B for x in P)
print(min(a,b,c))
``` | instruction | 0 | 29,816 | 11 | 59,632 |
Yes | output | 1 | 29,816 | 11 | 59,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
N,A,B,*P=map(int, open(0).read().split())
S=[0]*3
f=lambda p:(A+1<=p)+(B+1<=p)
for p in P:
S[f(p)]+=1
print(min(S))
``` | instruction | 0 | 29,817 | 11 | 59,634 |
Yes | output | 1 | 29,817 | 11 | 59,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
n = int(input())
a, b = map(int, input().split())
p = [int(i) for i in input().split()]
p_a = len([i for i in p if i <= a])
p_a_b = len([i for i in p if a < i <= b])
p_b = n - p_a - p_a_b
print(min(min(p_a, p_b), p_a_b))
``` | instruction | 0 | 29,818 | 11 | 59,636 |
Yes | output | 1 | 29,818 | 11 | 59,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
N=int(input())
A,B=list(map(int,input().split()))
P=list(map(int,input().split()))
P.sort()
na=0
while P[na] < A+1:
na=na+1
nb=na
while P[nb] < B+1:
nb=nb+1
nb=nb-na
nc=N-nb
n=[na,nb,nc]
n.sort()
print(n[0])
``` | instruction | 0 | 29,819 | 11 | 59,638 |
No | output | 1 | 29,819 | 11 | 59,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
import numpy as np
N = int(input())
A, B = map(int, input().split())
P = list(map(int, input().split()))
P = np.array(P)
X = P[P <= A]
Y = P[(P <= (A + 1)) & (P <= B)]
Z = P[P >= (B + 1)]
print(min(len(X), len(Y), len(Z)))
``` | instruction | 0 | 29,820 | 11 | 59,640 |
No | output | 1 | 29,820 | 11 | 59,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.
With these problems, you would like to hold as many contests as possible under the following condition:
* A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.
The same problem should not be used in multiple contests. At most how many contests can be held?
Constraints
* 3 \leq N \leq 100
* 1 \leq P_i \leq 20 (1 \leq i \leq N)
* 1 \leq A < B < 20
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A B
P_1 P_2 ... P_N
Output
Print the answer.
Examples
Input
7
5 15
1 10 16 2 7 20 12
Output
2
Input
8
3 8
5 5 5 10 10 10 15 20
Output
0
Input
3
5 6
5 6 10
Output
1
Submitted Solution:
```
n = int(input())
ab = input().rstrip().split()
p = input().rstrip().split()
c=0
i = 1
for i in range(n):
j=i-1
for j in range(n):
if(p[j] > p[i]):
temp = p[j]
p[j] = p[i]
p[i] = temp
i = 0
for i in range(n):
p[i] = int(p[i])
a=int(ab[0])
b=int(ab[1])
i = 0
j = 0
k = 0
for i in range(n):
if(p[i] <= a and p[i]!=0):
j = i + 1
for j in range(n):
if(p[j]<=b and p[j] >= a+1):
k = j + 1
for k in range(n):
if(p[k] >= b+1):
c = c + 1
p[i]=0
p[j]=0
p[k]=0
print(c)
``` | instruction | 0 | 29,821 | 11 | 59,642 |
No | output | 1 | 29,821 | 11 | 59,643 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.