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.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a green ball, and a blue ball and then change th... | instruction | 0 | 81,893 | 7 | 163,786 |
Tags: brute force, math
Correct Solution:
```
for i in range(int(input())):
a=list(map(int,input().split()))
b=[a[j]%2 for j in range(len(a))]
if b.count(0)==4:
print("Yes")
elif b.count(0)==3:
print("Yes")
elif min(a[:3])>=1:
a[0]-=1
a[1]-=1
a[2]-=1
a... | output | 1 | 81,893 | 7 | 163,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,894 | 7 | 163,788 |
Yes | output | 1 | 81,894 | 7 | 163,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,895 | 7 | 163,790 |
Yes | output | 1 | 81,895 | 7 | 163,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,896 | 7 | 163,792 |
Yes | output | 1 | 81,896 | 7 | 163,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,897 | 7 | 163,794 |
Yes | output | 1 | 81,897 | 7 | 163,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,898 | 7 | 163,796 |
No | output | 1 | 81,898 | 7 | 163,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,899 | 7 | 163,798 |
No | output | 1 | 81,899 | 7 | 163,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,900 | 7 | 163,800 |
No | output | 1 | 81,900 | 7 | 163,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Boboniu gives you
* r red balls,
* g green balls,
* b blue balls,
* w white balls.
He allows you to do the following operation as many times as you want:
* Pick a red ball, a... | instruction | 0 | 81,901 | 7 | 163,802 |
No | output | 1 | 81,901 | 7 | 163,803 |
Provide tags and a correct Python 3 solution for this coding contest problem.
John Doe has an n × m table. John Doe can paint points in some table cells, not more than one point in one table cell. John Doe wants to use such operations to make each square subtable of size n × n have exactly k points.
John Doe wondered... | instruction | 0 | 82,014 | 7 | 164,028 |
Tags: bitmasks, combinatorics, dp, math
Correct Solution:
```
n,m,k=map(int,input().split())
M=int(1e9+7)
N=n*n
iv=[0]*(N+1)
iv[1]=1
for i in range(2, N+1):
iv[i]=M-M//i*iv[M%i]%M
f1=[1]*(N+1)
for i in range(1, N+1):
f1[i]=f1[i-1]*i%M
f2=[1]*(N+1)
for i in range(1, N+1):
f2[i]=f2[i-1]*iv[i]%M
left=m%n
#m/n... | output | 1 | 82,014 | 7 | 164,029 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,347 | 7 | 164,694 |
"Correct Solution:
```
N=int(input())
c=str(input())
R=c.count('R')
W=c[:R].count('W')
print(W)
``` | output | 1 | 82,347 | 7 | 164,695 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,348 | 7 | 164,696 |
"Correct Solution:
```
N = int(input())
C = input()
r = C.count('R')
ans = C[:r].count('W')
print(ans)
``` | output | 1 | 82,348 | 7 | 164,697 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,349 | 7 | 164,698 |
"Correct Solution:
```
n=int(input())
s=input()
nr=s.count("R")
print(s[:nr].count("W"))
``` | output | 1 | 82,349 | 7 | 164,699 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,350 | 7 | 164,700 |
"Correct Solution:
```
_ = input()
c = input()
r_num = c.count("R")
print(c[:r_num].count("W"))
``` | output | 1 | 82,350 | 7 | 164,701 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,351 | 7 | 164,702 |
"Correct Solution:
```
N = int(input())
C = input()
Nw = C.count('W')
Nr = N - Nw
print(Nw - C[(-1*Nw):].count('W'))
``` | output | 1 | 82,351 | 7 | 164,703 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,352 | 7 | 164,704 |
"Correct Solution:
```
N,c=input(),input()
print(c[:c.count('R')].count('W'))
``` | output | 1 | 82,352 | 7 | 164,705 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,353 | 7 | 164,706 |
"Correct Solution:
```
n=int(input())
c=list(input())
x=c.count("R")
m=c[:x]
y=m.count("W")
print(y)
``` | output | 1 | 82,353 | 7 | 164,707 |
Provide a correct Python 3 solution for this coding contest problem.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stands for white.
You can do the following two kinds of oper... | instruction | 0 | 82,354 | 7 | 164,708 |
"Correct Solution:
```
N=int(input())
S=input()
le=S.count('R')
P=S[le:]
print(P.count('R'))
``` | output | 1 | 82,354 | 7 | 164,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,355 | 7 | 164,710 |
Yes | output | 1 | 82,355 | 7 | 164,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,356 | 7 | 164,712 |
Yes | output | 1 | 82,356 | 7 | 164,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,357 | 7 | 164,714 |
Yes | output | 1 | 82,357 | 7 | 164,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,358 | 7 | 164,716 |
Yes | output | 1 | 82,358 | 7 | 164,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,359 | 7 | 164,718 |
No | output | 1 | 82,359 | 7 | 164,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,360 | 7 | 164,720 |
No | output | 1 | 82,360 | 7 | 164,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,361 | 7 | 164,722 |
No | output | 1 | 82,361 | 7 | 164,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \leq i \leq N) is given to you as a character c_i; `R` stands for red and `W` stand... | instruction | 0 | 82,362 | 7 | 164,724 |
No | output | 1 | 82,362 | 7 | 164,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ringo got interested in modern art. He decided to draw a big picture on the board with N+2 rows and M+2 columns of squares constructed in the venue of CODE FESTIVAL 2017, using some people.
The... | instruction | 0 | 82,459 | 7 | 164,918 |
No | output | 1 | 82,459 | 7 | 164,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ringo got interested in modern art. He decided to draw a big picture on the board with N+2 rows and M+2 columns of squares constructed in the venue of CODE FESTIVAL 2017, using some people.
The... | instruction | 0 | 82,460 | 7 | 164,920 |
No | output | 1 | 82,460 | 7 | 164,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ringo got interested in modern art. He decided to draw a big picture on the board with N+2 rows and M+2 columns of squares constructed in the venue of CODE FESTIVAL 2017, using some people.
The... | instruction | 0 | 82,461 | 7 | 164,922 |
No | output | 1 | 82,461 | 7 | 164,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ringo got interested in modern art. He decided to draw a big picture on the board with N+2 rows and M+2 columns of squares constructed in the venue of CODE FESTIVAL 2017, using some people.
The... | instruction | 0 | 82,462 | 7 | 164,924 |
No | output | 1 | 82,462 | 7 | 164,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,692 | 7 | 165,384 |
Tags: math, number theory
Correct Solution:
```
import math
for i in range(int(input())):
a,b= map(int,input().split())
if math.gcd(a,b) ==1 :
print('Finite')
else:
print('Infinite')
``` | output | 1 | 82,692 | 7 | 165,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,693 | 7 | 165,386 |
Tags: math, number theory
Correct Solution:
```
from math import gcd
import sys
Input = sys.stdin.readline
n = int(Input())
for i in range(n):
a, b = list(map(int, Input().split()))
print("Finite" if gcd(a, b) == 1 else "Infinite")
# Codeforcesian
``` | output | 1 | 82,693 | 7 | 165,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,694 | 7 | 165,388 |
Tags: math, number theory
Correct Solution:
```
def gcd(a, b):
while b > 0:
a, b = b, a % b
# print('a', a)
return a
for z in range(int(input())):
a, b = map(int, input().split())
if gcd(a,b) > 1:
print('infinite')
else:
print('finite')
``` | output | 1 | 82,694 | 7 | 165,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,695 | 7 | 165,390 |
Tags: math, number theory
Correct Solution:
```
from collections import Counter,defaultdict,deque
from heapq import heapify,heappop,heappush
import sys,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.rea... | output | 1 | 82,695 | 7 | 165,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,696 | 7 | 165,392 |
Tags: math, number theory
Correct Solution:
```
def gcd(a,b):
while b:
a,b=b,a%b
return a
t=int(input())
for i in range(t):
a,b=map(int,input().split())
if gcd(a,b)==1:
print("Finite")
else:
print("Infinite")
``` | output | 1 | 82,696 | 7 | 165,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,697 | 7 | 165,394 |
Tags: math, number theory
Correct Solution:
```
import math
for _ in range(int(input())):
a,b = map(int,input().split())
re = math.gcd(a,b)
if(re == 1):
print("Finite")
else:
print("Infinite")
``` | output | 1 | 82,697 | 7 | 165,395 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,698 | 7 | 165,396 |
Tags: math, number theory
Correct Solution:
```
from math import gcd
t = int(input())
for _ in range(t):
a, b = [int(_) for _ in input().split()]
if gcd(a, b) == 1:
print('Finite')
else:
print('Infinite')
``` | output | 1 | 82,698 | 7 | 165,397 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then 2 and so on.
Each number is painted white or b... | instruction | 0 | 82,699 | 7 | 165,398 |
Tags: math, number theory
Correct Solution:
```
def nod(a, b):
if a == 0 or b == 0:
return max(a, b)
if a == 1 or b == 1:
return 1
return nod(b % a, a)
n = int(input())
for i in range(n):
a, b = map(int, input().split())
if nod(min(a, b), max(a, b)) == 1:
print('Finite')
... | output | 1 | 82,699 | 7 | 165,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,700 | 7 | 165,400 |
Yes | output | 1 | 82,700 | 7 | 165,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,701 | 7 | 165,402 |
Yes | output | 1 | 82,701 | 7 | 165,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,702 | 7 | 165,404 |
Yes | output | 1 | 82,702 | 7 | 165,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,703 | 7 | 165,406 |
Yes | output | 1 | 82,703 | 7 | 165,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,704 | 7 | 165,408 |
No | output | 1 | 82,704 | 7 | 165,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,705 | 7 | 165,410 |
No | output | 1 | 82,705 | 7 | 165,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,706 | 7 | 165,412 |
No | output | 1 | 82,706 | 7 | 165,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the set of all nonnegative integers: {0, 1, 2, ...}. Given two integers a and b (1 ≤ a, b ≤ 10^4). We paint all the numbers in increasing number first we paint 0, then we paint 1, then ... | instruction | 0 | 82,707 | 7 | 165,414 |
No | output | 1 | 82,707 | 7 | 165,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You finally woke up after this crazy dream and decided to walk around to clear your head. Outside you saw your house's fence — so plain and boring, that you'd like to repaint it.
<image>
You have a fence consisting of n planks, where the i... | instruction | 0 | 82,800 | 7 | 165,600 |
Tags: brute force, constructive algorithms, greedy
Correct Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from collections import defaultdict
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future... | output | 1 | 82,800 | 7 | 165,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You finally woke up after this crazy dream and decided to walk around to clear your head. Outside you saw your house's fence — so plain and boring, that you'd like to repaint it.
<image>
You have a fence consisting of n planks, where the i... | instruction | 0 | 82,801 | 7 | 165,602 |
Tags: brute force, constructive algorithms, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
for _ in range(int(input())):
N, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
t = [[] for _ in range(N + 1... | output | 1 | 82,801 | 7 | 165,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You finally woke up after this crazy dream and decided to walk around to clear your head. Outside you saw your house's fence — so plain and boring, that you'd like to repaint it.
<image>
You have a fence consisting of n planks, where the i... | instruction | 0 | 82,802 | 7 | 165,604 |
Tags: brute force, constructive algorithms, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
now = list(map(int, input().split()))
goal = list(map(int, input().split()))
color = list(map(int, input().split()))
... | output | 1 | 82,802 | 7 | 165,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You finally woke up after this crazy dream and decided to walk around to clear your head. Outside you saw your house's fence — so plain and boring, that you'd like to repaint it.
<image>
You have a fence consisting of n planks, where the i... | instruction | 0 | 82,803 | 7 | 165,606 |
Tags: brute force, constructive algorithms, greedy
Correct Solution:
```
#fi = open("task3.txt")
#def input():
# return fi.readline()
T = int(input())
for _ in range(T):
n,m = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
c = [int(x) for x in input(... | output | 1 | 82,803 | 7 | 165,607 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.