message stringlengths 2 28.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 21 109k | cluster float64 7 7 | __index_level_0__ int64 42 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't contain three or more contiguous balls with the ... | instruction | 0 | 18,062 | 7 | 36,124 |
Tags: brute force, two pointers
Correct Solution:
```
n, k, x = map(int, input().split())
balls = list(map(int, input().split()))
count = 0
ans = 0
for i in range(0, n): # 1 1 2 2 1 1 => l = 2, r = 3, count = 3
if x == balls[i]:
count_out = 0
l = i
r = i
while balls[l] ... | output | 1 | 18,062 | 7 | 36,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't contain three or more contiguous balls with the ... | instruction | 0 | 18,063 | 7 | 36,126 |
Tags: brute force, two pointers
Correct Solution:
```
n, k, x = input().split()
t = input().split() + ['a', 'b']
u, q = -2, 1
for v in range(int(n) + 1):
if x == t[v]:
if u == -2: u = v - 1
elif u != -2:
s, i, j, y = 0, u, v, t[v]
while j - i - s > 2:
s = j - i
wh... | output | 1 | 18,063 | 7 | 36,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't contain three or more contiguous balls with the ... | instruction | 0 | 18,064 | 7 | 36,128 |
Tags: brute force, two pointers
Correct Solution:
```
n_balls, n_colors, new_ball = map(int, input().split())
balls = list(map(int, input().split()))
answer = 0
for i in range(n_balls):
copy = balls[:]
copy.insert(i, new_ball)
while (len(copy) > 2):
size = len(copy)
for j in range(2, len(... | output | 1 | 18,064 | 7 | 36,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't contain three or more contiguous balls with the ... | instruction | 0 | 18,065 | 7 | 36,130 |
Tags: brute force, two pointers
Correct Solution:
```
import copy
def main():
n, x, k = list(map(int, input().strip().split(' ')))
balls = list(map(int, input().strip().split(' ')))
original_balls = copy.deepcopy(balls)
flag = 1
maxi = 0
# print(balls)
for i in range(len(balls)):
b... | output | 1 | 18,065 | 7 | 36,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,066 | 7 | 36,132 |
Yes | output | 1 | 18,066 | 7 | 36,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,067 | 7 | 36,134 |
Yes | output | 1 | 18,067 | 7 | 36,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,068 | 7 | 36,136 |
Yes | output | 1 | 18,068 | 7 | 36,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,069 | 7 | 36,138 |
Yes | output | 1 | 18,069 | 7 | 36,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,070 | 7 | 36,140 |
No | output | 1 | 18,070 | 7 | 36,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,071 | 7 | 36,142 |
No | output | 1 | 18,071 | 7 | 36,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,072 | 7 | 36,144 |
No | output | 1 | 18,072 | 7 | 36,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game?
There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't c... | instruction | 0 | 18,073 | 7 | 36,146 |
No | output | 1 | 18,073 | 7 | 36,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,968 | 7 | 37,936 |
Tags: dp, graphs
Correct Solution:
```
n, m = map(int, input().split())
a = []
for _ in range(n):
a.append([])
max_b = [0] * n
maximum = 0
for i in range(m):
x, y = map(int, input().split())
a[x - 1].append(y - 1)
a[y - 1].append(x - 1)
for i in range(n):
max_b[i] = 1
for v in a[i]:
if v... | output | 1 | 18,968 | 7 | 37,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,969 | 7 | 37,938 |
Tags: dp, graphs
Correct Solution:
```
n, m = map(int, input().split())
graph = [list() for _ in range(n+1)]
count = [0 for _ in range(n+1)]
dp = [0 for _ in range(n+1)]
for _ in range(m):
u, v = map(int, input().split())
if v < u:
u, v = v, u
graph[v].append(u)
count[v] += 1
count[u] += 1
f... | output | 1 | 18,969 | 7 | 37,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,970 | 7 | 37,940 |
Tags: dp, graphs
Correct Solution:
```
n, m = map(int, input().split())
graph = [[i] for i in range(n+2)]
dn = [0 for _ in range(n+2)]
res = 0
for _ in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
for node in range(1, n+1):
dn[node] = dn[max(graph[node] if graph[node]... | output | 1 | 18,970 | 7 | 37,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,971 | 7 | 37,942 |
Tags: dp, graphs
Correct Solution:
```
n,m =map(int, input().split())
#b=[]
d=[0]*n
f=[[] for i in range(n)]
#for i in range(n):
# f+=[]
#print(f)
#print(d)
for i in range(m):
#s=input().split()
a=list(map(int, input().split()))
d[a[0]-1]+=1
d[a[1]-1]+=1
a.sort()
#a.reverse
f[a[1]-1]+=[a[0]-1]
#print(f[4])
k=[1... | output | 1 | 18,971 | 7 | 37,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,972 | 7 | 37,944 |
Tags: dp, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5+10)
def dfs(v):
if memo[v]!=-1:
return memo[v]
res = 1
for nv in G[v]:
res = max(res, dfs(nv)+1)
memo[v] = res
return res
n, m = map(int, input().split()... | output | 1 | 18,972 | 7 | 37,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,973 | 7 | 37,946 |
Tags: dp, graphs
Correct Solution:
```
from collections import defaultdict
graph = defaultdict(list)
n, m = list(map(int, input().split()))
for i in range(m):
v, u = list(map(int, input().split()))
graph[v].append(u)
graph[u].append(v)
dp = [1] * (n + 1)
ans = len(graph[1])
for i in range(2, n + 1):
fo... | output | 1 | 18,973 | 7 | 37,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,974 | 7 | 37,948 |
Tags: dp, graphs
Correct Solution:
```
from sys import stdin, setrecursionlimit
setrecursionlimit(100000)
class Graph:
def __init__(self, No_of_nodes):
self.n = No_of_nodes
self.adj = [[] for i in range(self.n)]
def addEdge(self, a, b):
self.adj[a].append(b)
self.adj[b].append(a)
count[a][0] += 1
coun... | output | 1 | 18,974 | 7 | 37,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connec... | instruction | 0 | 18,975 | 7 | 37,950 |
Tags: dp, graphs
Correct Solution:
```
max_n = 100005;
V = [[] for i in range(max_n)]
deg = [0] * max_n
dist = [0] * max_n
data = input().split(" ")
n = int(data[0])
m = int(data[1])
for i in range(m):
data = input().split(" ")
u = int(data[0])
v = int(data[1])
V[u].append(v)
V[v].append(u)
... | output | 1 | 18,975 | 7 | 37,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,976 | 7 | 37,952 |
Yes | output | 1 | 18,976 | 7 | 37,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,977 | 7 | 37,954 |
Yes | output | 1 | 18,977 | 7 | 37,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,978 | 7 | 37,956 |
Yes | output | 1 | 18,978 | 7 | 37,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,979 | 7 | 37,958 |
Yes | output | 1 | 18,979 | 7 | 37,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,980 | 7 | 37,960 |
No | output | 1 | 18,980 | 7 | 37,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,981 | 7 | 37,962 |
No | output | 1 | 18,981 | 7 | 37,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,982 | 7 | 37,964 |
No | output | 1 | 18,982 | 7 | 37,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect... | instruction | 0 | 18,983 | 7 | 37,966 |
No | output | 1 | 18,983 | 7 | 37,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,011 | 7 | 38,022 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n = int(input())
res = []
for i in range(n) :
u = i + 2
if u == 2 :
res.append(1)
else:
e = int(u**(0.5))
lock = 0
for j in range(2,e+1) :
if u%j == 0 :
lock = 1
br... | output | 1 | 19,011 | 7 | 38,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,012 | 7 | 38,024 |
Tags: constructive algorithms, number theory
Correct Solution:
```
from math import sqrt
n=int(input())
l=[1]*(n+2)
for i in range(2,int(sqrt(n+2)+1)):
if l[i]==1:
for j in range(i*i,n+2,i):
l[j]=2
if n>=3:
print(2)
print(*l[2:n+2])
else:
print(1)
print(*[1]*n)
``` | output | 1 | 19,012 | 7 | 38,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,013 | 7 | 38,026 |
Tags: constructive algorithms, number theory
Correct Solution:
```
import math
n = int(input())
is_Prime = [True for i in range(n+2)]
limit = int(math.sqrt(len(is_Prime)))
def displaySieve():
for i in range(len(is_Prime)):
print(i, is_Prime[i])
for i in range(2, limit+1, 1):
if is_Prime[i]:
fo... | output | 1 | 19,013 | 7 | 38,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,014 | 7 | 38,028 |
Tags: constructive algorithms, number theory
Correct Solution:
```
import math as ma
n = int(input())
#primes = array.array('b', )
maxN = 100001
primes = [0]*(n+2)
color = [0]*(n+2)
c = 1
for p in range(2, n+2):
if (primes[p] == 0):
for l in range(p, n+2-p, p):
primes[p+l]=1
ncolors =... | output | 1 | 19,014 | 7 | 38,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,015 | 7 | 38,030 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n=int(input())
seive=[1]*(n+2)
seive[0]=-1
seive[1]=-1
for i in range(n+2):
if seive[i]==1:
for j in range(i*2,n+2,i):
seive[j]=2
if(n==1 or n==2):
print(1)
for i in range(2,n+2):
print(seive[i],end=' ')
elif(n==... | output | 1 | 19,015 | 7 | 38,031 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,016 | 7 | 38,032 |
Tags: constructive algorithms, number theory
Correct Solution:
```
import math
def prime(n):
j = 0
if n ==2 or n==3:
return 1
for i in range(2, int(math.sqrt(n))+1):
if n%i == 0:
j = 1
break
if j == 1:
return 0
else:
return 1
n = int(input(... | output | 1 | 19,016 | 7 | 38,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,017 | 7 | 38,034 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n = int(input())
t = [1] * (n+2)
for i in range(2, n+2):
for j in range(i * i, n+2, i):t[j] = 2
if n>2:
print(2)
else:
print(1)
print(*t[2:])
``` | output | 1 | 19,017 | 7 | 38,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is, the prices of the jewelry are 2, 3, 4, ... n +... | instruction | 0 | 19,018 | 7 | 38,036 |
Tags: constructive algorithms, number theory
Correct Solution:
```
n = int(input())
arr = [1] * n
for i in range(2, n + 2):
if arr[i - 2]:
for j in range(i * i, n + 2, i):
arr[j - 2] = 0
print(len(set(arr)))
print(' '.join(('1' if arr[i - 2] == 1 else '2') for i in range(2, n + 2)))
``` | output | 1 | 19,018 | 7 | 38,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,019 | 7 | 38,038 |
Yes | output | 1 | 19,019 | 7 | 38,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,020 | 7 | 38,040 |
Yes | output | 1 | 19,020 | 7 | 38,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,021 | 7 | 38,042 |
Yes | output | 1 | 19,021 | 7 | 38,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,022 | 7 | 38,044 |
Yes | output | 1 | 19,022 | 7 | 38,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,023 | 7 | 38,046 |
No | output | 1 | 19,023 | 7 | 38,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,024 | 7 | 38,048 |
No | output | 1 | 19,024 | 7 | 38,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,025 | 7 | 38,050 |
No | output | 1 | 19,025 | 7 | 38,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.
He bought n pieces of jewelry. The i-th piece has price equal to i + 1, that is,... | instruction | 0 | 19,026 | 7 | 38,052 |
No | output | 1 | 19,026 | 7 | 38,053 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`... | instruction | 0 | 19,122 | 7 | 38,244 |
"Correct Solution:
```
h,w,k=map(int,input().split())
c=[list(input()) for _ in range(h)]
ans=0
for i in range(2**h):
for j in range(2**w):
cnt=0
for x in range(h):
for y in range(w):
if i>>x&1:continue
if j>>y&1:continue
if c[x][y]=="#":cnt+=1
if cnt==k:
ans+=1
print(a... | output | 1 | 19,122 | 7 | 38,245 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`... | instruction | 0 | 19,123 | 7 | 38,246 |
"Correct Solution:
```
h,w,x=map(int,input().split())
a=[list(input()) for i in range(h)]
ans=0
for i in range(2**(h+w)):
b=0
for j in range(h):
for k in range(w):
if (i>>j)&1==1 and (i>>k+h)&1==1 and a[j][k]=="#":
b+=1
if b==x:
ans+=1
print(ans)
``` | output | 1 | 19,123 | 7 | 38,247 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`... | instruction | 0 | 19,124 | 7 | 38,248 |
"Correct Solution:
```
H, W, K = map(int, input().split())
C = [[i for i in input()] for j in range(H)]
ans = 0
for h_bit in range(1 << H):
for w_bit in range(1 << W):
black = 0
for i in range(H):
for j in range(W):
if h_bit & (1 << i) and w_bit & (1 << j):
if C[i][j] == '#':
black += 1
if bla... | output | 1 | 19,124 | 7 | 38,249 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`... | instruction | 0 | 19,125 | 7 | 38,250 |
"Correct Solution:
```
import sys
h, w, k = map(int, input().split())
s = sys.stdin.readlines()
ans = 0
for ib in range(1<<h):
for jb in range(1<<w):
cnt = 0
for i in range(h):
if ib >> i & 1:
continue
for j in range(w):
if jb >> j & 1:
continue
if s[i][j] == "#"... | output | 1 | 19,125 | 7 | 38,251 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`... | instruction | 0 | 19,126 | 7 | 38,252 |
"Correct Solution:
```
n,m,k = map(int,input().split())
arr = []
for _ in range(n):
arr.append(list(input()))
ans = 0
for i in range(1<<n):
for j in range(1<<m):
black = 0
for q in range(n):
for r in range(m):
if i & (1<<q) and j & (1<<r) and arr[q][r] == "#":
black += 1
if bl... | output | 1 | 19,126 | 7 | 38,253 |
Provide a correct Python 3 solution for this coding contest problem.
We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`... | instruction | 0 | 19,127 | 7 | 38,254 |
"Correct Solution:
```
H,W,K = map(int,input().split())
s = [list(input()) for i in range(H)]
ans = 0
for i in range(1<<H):
for j in range(1<<W):
cnt = 0
for h in range(H):
for w in range(W):
if (i>>h)&1 == 1 and (j>>w)&1==1:
if s[h][w]=='#':
cnt += 1
if cnt==K:
... | output | 1 | 19,127 | 7 | 38,255 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.