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.
You have a blackboard and initially only an odd number x is written on it. Your goal is to write the number 1 on the blackboard.
You may write new numbers on the blackboard with the following two operations.
* You may take two numbers (... | instruction | 0 | 31,189 | 7 | 62,378 |
Tags: bitmasks, constructive algorithms, math, matrices, number theory
Correct Solution:
```
def GSB(n):
ans = 0
for i in range(63):
if (1<<i)&n:
ans = i
return ans
def pop_count(n):
ans = 0
for i in range(63):
if (1<<i)&n:
ans += 1
return ans
exists = []
ops = []
def add(a,b):
assert(a in exists and... | output | 1 | 31,189 | 7 | 62,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open t... | instruction | 0 | 31,536 | 7 | 63,072 |
Tags: brute force, implementation
Correct Solution:
```
from functools import reduce
def factorial(n):
return reduce(lambda x, y: x*y, range(1,n+1))
colors = {
'R' : 0,
'O' : 0,
'Y' : 0,
'G' : 0,
'B' : 0,
'V' : 0
}
for c in list(input()):
colors[c] += 1
amount = list(reversed(sorted(... | output | 1 | 31,536 | 7 | 63,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the... | instruction | 0 | 31,537 | 7 | 63,074 |
No | output | 1 | 31,537 | 7 | 63,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the... | instruction | 0 | 31,538 | 7 | 63,076 |
No | output | 1 | 31,538 | 7 | 63,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the... | instruction | 0 | 31,539 | 7 | 63,078 |
No | output | 1 | 31,539 | 7 | 63,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the... | instruction | 0 | 31,540 | 7 | 63,080 |
No | output | 1 | 31,540 | 7 | 63,081 |
Provide a correct Python 3 solution for this coding contest problem.
We have an H \times W grid, where each square is painted white or black in the initial state. Given are strings A_1, A_2, ..., A_H representing the colors of the squares in the initial state. For each pair (i, j) (1 \leq i \leq H, 1 \leq j \leq W), i... | instruction | 0 | 31,569 | 7 | 63,138 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
H,W=map(int,input().split())
A=[input().strip() for i in range(H)]
mod=998244353
# factorial,facotiralの逆数を事前計算.
FACT=[1]
for i in range(1,21):
FACT.append(FACT[-1]*i%mod)
FACT_INV=[pow(FACT[-1],mod-2,mod)]
for i in range(20,0,-1):
FACT_INV.append(... | output | 1 | 31,569 | 7 | 63,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have an H \times W grid, where each square is painted white or black in the initial state. Given are strings A_1, A_2, ..., A_H representing the colors of the squares in the initial state. Fo... | instruction | 0 | 31,570 | 7 | 63,140 |
No | output | 1 | 31,570 | 7 | 63,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have an H \times W grid, where each square is painted white or black in the initial state. Given are strings A_1, A_2, ..., A_H representing the colors of the squares in the initial state. Fo... | instruction | 0 | 31,571 | 7 | 63,142 |
No | output | 1 | 31,571 | 7 | 63,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have an H \times W grid, where each square is painted white or black in the initial state. Given are strings A_1, A_2, ..., A_H representing the colors of the squares in the initial state. Fo... | instruction | 0 | 31,572 | 7 | 63,144 |
No | output | 1 | 31,572 | 7 | 63,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have an H \times W grid, where each square is painted white or black in the initial state. Given are strings A_1, A_2, ..., A_H representing the colors of the squares in the initial state. Fo... | instruction | 0 | 31,573 | 7 | 63,146 |
No | output | 1 | 31,573 | 7 | 63,147 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,590 | 7 | 63,180 |
"Correct Solution:
```
s = str(input())
n = len(s)
dif = 0
for i in range(n):
if s[i] != str(i % 2):
dif += 1
print(min(dif, n - dif))
``` | output | 1 | 31,590 | 7 | 63,181 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,591 | 7 | 63,182 |
"Correct Solution:
```
S=input()
d0=0
d1=0
for i in range(len(S)):
d0+=int(S[i])!=i%2
d1+=int(S[i])!=(i+1)%2
print(min(d0,d1))
``` | output | 1 | 31,591 | 7 | 63,183 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,592 | 7 | 63,184 |
"Correct Solution:
```
S=input()
a=0
b=0
for i in range(len(S)):
if int(S[i])==i%2:
a+=1
else:
b+=1
print(min(a,b))
``` | output | 1 | 31,592 | 7 | 63,185 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,593 | 7 | 63,186 |
"Correct Solution:
```
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == str(i%2):
ans += 1
print(min(ans, n-ans))
``` | output | 1 | 31,593 | 7 | 63,187 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,594 | 7 | 63,188 |
"Correct Solution:
```
s = input()
n = len(s)
a = s[0::2].count("0")
b = s[1::2].count("0")
print(min((((n+1)//2)-a+b),(a+n//2-b)))
``` | output | 1 | 31,594 | 7 | 63,189 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,595 | 7 | 63,190 |
"Correct Solution:
```
a=input()
n=len(a)
b="01"*(n//2)+"0"*(n%2)
k=s=0
for i in range(n):
if b[i]==a[i]:s+=1
else: k+=1
print(min(k,s))
``` | output | 1 | 31,595 | 7 | 63,191 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,596 | 7 | 63,192 |
"Correct Solution:
```
S=input()
c=S[::2].count("0")+S[1::2].count("1")
print(min(c,len(S)-c))
``` | output | 1 | 31,596 | 7 | 63,193 |
Provide a correct Python 3 solution for this coding contest problem.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of S is `0`, and painted white if that character is `1`.
Y... | instruction | 0 | 31,597 | 7 | 63,194 |
"Correct Solution:
```
S = input()
N = len(S)
c1 = S[1::2].count('0')
c2 = S[0::2].count('1')
sum1 = N-c1-c2
sum2 = c1+c2
print(min(sum1,sum2))
``` | output | 1 | 31,597 | 7 | 63,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,598 | 7 | 63,196 |
Yes | output | 1 | 31,598 | 7 | 63,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,599 | 7 | 63,198 |
Yes | output | 1 | 31,599 | 7 | 63,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,600 | 7 | 63,200 |
Yes | output | 1 | 31,600 | 7 | 63,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,601 | 7 | 63,202 |
Yes | output | 1 | 31,601 | 7 | 63,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,602 | 7 | 63,204 |
No | output | 1 | 31,602 | 7 | 63,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,603 | 7 | 63,206 |
No | output | 1 | 31,603 | 7 | 63,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,604 | 7 | 63,208 |
No | output | 1 | 31,604 | 7 | 63,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.
The i-th tile from the left is painted black if the i-th character of ... | instruction | 0 | 31,605 | 7 | 63,210 |
No | output | 1 | 31,605 | 7 | 63,211 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,670 | 7 | 63,340 |
"Correct Solution:
```
H, W = map( int, input().split())
V = [ input() for _ in range(H)]
B = [ '' for _ in range(H)]
R = [ '' for _ in range(H)]
N = '#'*(W-1)
for i in range(H):
if i%2 == 0:
B[i] = N+V[i][-1]
R[i] = V[i][:W-1] + '#'
else:
R[i] = V[i][-1] + N
B[i] = '#' + V[i][1:... | output | 1 | 31,670 | 7 | 63,341 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,671 | 7 | 63,342 |
"Correct Solution:
```
h,w=map(int,input().split());r=[list('#'+'#.'[i%2]*(w-2)+'.')for i in range(h)];b=[list('.'+'.#'[i%2]*(w-2)+'#')for i in range(h)]
for i in range(h):
t=input()
for j in range(w):
if t[j]=='#':r[i][j]=b[i][j]='#'
for t in r:print(''.join(t))
print()
for t in b:print(''.join(t))
``` | output | 1 | 31,671 | 7 | 63,343 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,672 | 7 | 63,344 |
"Correct Solution:
```
h, w= map(int, input().split())
a = [['.']*w for _ in range(h)]
b = [['.']*w for _ in range(h)]
for i in range(h):
s = input()
for j in range(w):
if i % 2 and j != w - 1 or j == 0 or s[j] == '#':
a[i][j] = '#'
if (i+1) % 2 and j != 0 or j == w - 1 or s[j] == '#':
b[i][j] =... | output | 1 | 31,672 | 7 | 63,345 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,673 | 7 | 63,346 |
"Correct Solution:
```
H, W = map(int, input().split())
A = []
for i in range(H):
A.append(input())
red = [["." for w in range(W)] for _ in range(H)]
blue = [["." for w in range(W)] for _ in range(H)]
for i in range(H):
if i % 2 == 0:
red[i] = ["#" for w in range(W)]
red[i][-1] = "."
else:... | output | 1 | 31,673 | 7 | 63,347 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,674 | 7 | 63,348 |
"Correct Solution:
```
#!/usr/bin/env python3
import copy
h, w = map(int, input().split())
f = [ list(input()) for _ in range(h) ]
a = copy.deepcopy(f)
b = copy.deepcopy(f)
a[0] = '#' * w
for y in range(1, h - 1):
for x in range(w):
[a, b][x % 2][y][x] = '#'
b[h - 1] = '#' * w
print(*map(''.join, a), sep='\... | output | 1 | 31,674 | 7 | 63,349 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,675 | 7 | 63,350 |
"Correct Solution:
```
h, w = map(int, input().split())
G = [input() for _ in range(h)]
R = [["."]*w for _ in range(h)]
B = [["."]*w for _ in range(h)]
for i in range(1, h-1):
if i%2:
R[i] = list("." + "#"*(w-2) + ".")
B[i] = list(G[i])
else:
B[i] = list("." + "#"*(w-2) + ".")
R[i] = list(G[i])
... | output | 1 | 31,675 | 7 | 63,351 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,676 | 7 | 63,352 |
"Correct Solution:
```
h,w = map(int,input().split())
grid = [list(input()) for i in range(h)]
black = [[1 for i in range(w)] for j in range(h)]
white = [[1 for i in range(w)] for j in range(h)]
for i in range(h):
for j in range(w):
if i%2 and j%2 == 0:
black[i][j] = 0
elif i%2 == 0 and j%2:
white... | output | 1 | 31,676 | 7 | 63,353 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to trav... | instruction | 0 | 31,677 | 7 | 63,354 |
"Correct Solution:
```
H, W = map(int, input().split())
lines = [input() for _ in range(H)]
rs = [list("#" + (W-2) * ("#" if i%2==0 else ".") + ".") for i in range(H)]
bs = [list("." + (W-2) * ("#" if i%2==1 else ".") + "#") for i in range(H)]
for i, line in enumerate(lines):
for j, c in enumerate(line):
... | output | 1 | 31,677 | 7 | 63,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,678 | 7 | 63,356 |
Yes | output | 1 | 31,678 | 7 | 63,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,679 | 7 | 63,358 |
Yes | output | 1 | 31,679 | 7 | 63,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,680 | 7 | 63,360 |
Yes | output | 1 | 31,680 | 7 | 63,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,681 | 7 | 63,362 |
Yes | output | 1 | 31,681 | 7 | 63,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,682 | 7 | 63,364 |
No | output | 1 | 31,682 | 7 | 63,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,683 | 7 | 63,366 |
No | output | 1 | 31,683 | 7 | 63,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,684 | 7 | 63,368 |
No | output | 1 | 31,684 | 7 | 63,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.
Snuke painted some of the cells red in his paper. Here, the cells painte... | instruction | 0 | 31,685 | 7 | 63,370 |
No | output | 1 | 31,685 | 7 | 63,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joseph really likes the culture of Japan. Last year he learned Japanese traditional clothes and visual arts and now he is trying to find out the secret of the Japanese game called Nonogram.
In ... | instruction | 0 | 31,984 | 7 | 63,968 |
No | output | 1 | 31,984 | 7 | 63,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joseph really likes the culture of Japan. Last year he learned Japanese traditional clothes and visual arts and now he is trying to find out the secret of the Japanese game called Nonogram.
In ... | instruction | 0 | 31,985 | 7 | 63,970 |
No | output | 1 | 31,985 | 7 | 63,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joseph really likes the culture of Japan. Last year he learned Japanese traditional clothes and visual arts and now he is trying to find out the secret of the Japanese game called Nonogram.
In ... | instruction | 0 | 31,986 | 7 | 63,972 |
No | output | 1 | 31,986 | 7 | 63,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joseph really likes the culture of Japan. Last year he learned Japanese traditional clothes and visual arts and now he is trying to find out the secret of the Japanese game called Nonogram.
In ... | instruction | 0 | 31,987 | 7 | 63,974 |
No | output | 1 | 31,987 | 7 | 63,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Small, but very brave, mouse Brain was not accepted to summer school of young villains. He was upset and decided to postpone his plans of taking over the world, but to become a photographer instead.
As you may know, the coolest photos are o... | instruction | 0 | 32,116 | 7 | 64,232 |
Tags: implementation
Correct Solution:
```
s=""
n,m=map(int,input().split())
for i in range(n):
s+=input()
if "C" in s or "M" in s or "Y" in s:
print("#Color")
else:
print("#Black&White")
``` | output | 1 | 32,116 | 7 | 64,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Small, but very brave, mouse Brain was not accepted to summer school of young villains. He was upset and decided to postpone his plans of taking over the world, but to become a photographer instead.
As you may know, the coolest photos are o... | instruction | 0 | 32,117 | 7 | 64,234 |
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split())
A=[]
for i in range(n):
A.append(list(input().split()))
color=False
for i in range(n):
if 'C' in A[i] or 'M' in A[i] or 'Y' in A[i]:
color=True
break
if color:
print('#Color')
else:
print('#Black&White')
``` | output | 1 | 32,117 | 7 | 64,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Small, but very brave, mouse Brain was not accepted to summer school of young villains. He was upset and decided to postpone his plans of taking over the world, but to become a photographer instead.
As you may know, the coolest photos are o... | instruction | 0 | 32,118 | 7 | 64,236 |
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split())
a=0
for i in range(n):
l=list(map(str,input().split()))
for j in range(len(l)):
if l[j]=='C' or l[j]=='M' or l[j]=='Y' :
a=a+1
if a==0:
print( "#Black&White")
else:
print("#Color")
``` | output | 1 | 32,118 | 7 | 64,237 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.