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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,869 | 7 | 93,738 |
Yes | output | 1 | 46,869 | 7 | 93,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,870 | 7 | 93,740 |
Yes | output | 1 | 46,870 | 7 | 93,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,871 | 7 | 93,742 |
Yes | output | 1 | 46,871 | 7 | 93,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,872 | 7 | 93,744 |
No | output | 1 | 46,872 | 7 | 93,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,873 | 7 | 93,746 |
No | output | 1 | 46,873 | 7 | 93,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,874 | 7 | 93,748 |
No | output | 1 | 46,874 | 7 | 93,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
N people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.
The person numbered i says:
* "In front of me, exactly A_i... | instruction | 0 | 46,875 | 7 | 93,750 |
No | output | 1 | 46,875 | 7 | 93,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Japan, people make offerings called hina arare, colorful crackers, on March 3.
We have a bag that contains N hina arare. (From here, we call them arare.)
It is known that the bag either con... | instruction | 0 | 46,921 | 7 | 93,842 |
No | output | 1 | 46,921 | 7 | 93,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Japan, people make offerings called hina arare, colorful crackers, on March 3.
We have a bag that contains N hina arare. (From here, we call them arare.)
It is known that the bag either con... | instruction | 0 | 46,922 | 7 | 93,844 |
No | output | 1 | 46,922 | 7 | 93,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Japan, people make offerings called hina arare, colorful crackers, on March 3.
We have a bag that contains N hina arare. (From here, we call them arare.)
It is known that the bag either con... | instruction | 0 | 46,923 | 7 | 93,846 |
No | output | 1 | 46,923 | 7 | 93,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,253 | 7 | 94,506 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
def solve():
n, l, r = map(int, input().split())
c = list(map(int, input().split()))
lc = [0] * (n+1)
rc = [0] * (n+1)
res = 0
for i in range(l):
lc[c[i]] += 1
for i in range(l, n):
rc[c[i]] += 1
for i in ra... | output | 1 | 47,253 | 7 | 94,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,254 | 7 | 94,508 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
def map_int():
return map(int, input().split())
def solve():
n, l, r=map_int()
c=list(map_int())
if r>l:
c=c[l:n]+c[:l]
l, r = r, l
color = [0]*(n+1)
for i in range(n):
... | output | 1 | 47,254 | 7 | 94,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,255 | 7 | 94,510 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
# https://codeforces.com/contest/1515/problem/D
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
# do magic here
t = int(input())
def makeDict(left):
leftMap = {}
for item in left:
if item not in leftMap:
... | output | 1 | 47,255 | 7 | 94,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,256 | 7 | 94,512 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
#!/usr/bin/env python3
import sys, getpass
import math, random
import functools, itertools, collections, heapq, bisect
from collections import Counter, defaultdict, deque
input = sys.stdin.readline # to read input quickly
# available on Google, AtCoder Python... | output | 1 | 47,256 | 7 | 94,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,257 | 7 | 94,514 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
# template begins
#####################################
from io import BytesIO, IOBase
import sys
import math
import os
from collections import defaultdict
from math import ceil
from bisect import bisect_left, bisect_left
from time import perf_counter
# regio... | output | 1 | 47,257 | 7 | 94,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,258 | 7 | 94,516 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
from collections import defaultdict as dd
for _ in range(int(input())):
n,l,r=map(int,input().split())
a=list(map(int,input().split()))
le=dd(int)
ri=dd(int)
k=abs(l-r)
k//=2
for i in range(l):
le[a[i]]+=1
for i in range(... | output | 1 | 47,258 | 7 | 94,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,259 | 7 | 94,518 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
from sys import stdin,stdout
stdin.readline
def mp(): return list(map(int, stdin.readline().strip().split()))
def it():return int(stdin.readline().strip())
from collections import defaultdict as dd,Counter as C,deque
from math import ceil,gcd,sqrt,factorial,log... | output | 1 | 47,259 | 7 | 94,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay one dollar to the sock store to either:
* ... | instruction | 0 | 47,260 | 7 | 94,520 |
Tags: greedy, sortings, two pointers
Correct Solution:
```
import sys
input = sys.stdin.readline
import math
mod=10**9+7
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - ... | output | 1 | 47,260 | 7 | 94,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,261 | 7 | 94,522 |
Yes | output | 1 | 47,261 | 7 | 94,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,262 | 7 | 94,524 |
Yes | output | 1 | 47,262 | 7 | 94,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,263 | 7 | 94,526 |
Yes | output | 1 | 47,263 | 7 | 94,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,264 | 7 | 94,528 |
Yes | output | 1 | 47,264 | 7 | 94,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,265 | 7 | 94,530 |
No | output | 1 | 47,265 | 7 | 94,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,266 | 7 | 94,532 |
No | output | 1 | 47,266 | 7 | 94,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,267 | 7 | 94,534 |
No | output | 1 | 47,267 | 7 | 94,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks has a color c_i and is either a left sock or right sock.
Phoenix can pay... | instruction | 0 | 47,268 | 7 | 94,536 |
No | output | 1 | 47,268 | 7 | 94,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,374 | 7 | 94,748 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,m=map(int,input().split())
ans=[-1]*(n+1)
for k in range(m):
dancers=list(map(int,input().split()))
need=[1,2,3]
for i in dancers:
if(ans[i]!=-1):
need.remove(ans[i])
for i in dancers:
if(ans[i]==-1):
ans[i]=need.pop(-1)
... | output | 1 | 47,374 | 7 | 94,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,375 | 7 | 94,750 |
Tags: constructive algorithms, implementation
Correct Solution:
```
from sys import stdin,stdout
stdin.readline
def mp(): return list(map(int, stdin.readline().strip().split()))
def it():return int(stdin.readline().strip())
from collections import defaultdict as dd,Counter as C,deque
from math import ceil,gcd,sqrt,fac... | output | 1 | 47,375 | 7 | 94,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,376 | 7 | 94,752 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,m=map(int,input().split())
arr=[0 for i in range(n+1)]
for i in range(m):
x,y,z=map(int,input().split())
if([arr[x],arr[y],arr[z]]==[0,0,0]):
arr[x],arr[y],arr[z]=1,2,3
else:
ans=[1,2,3]
if(arr[x]!=0):
... | output | 1 | 47,376 | 7 | 94,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,377 | 7 | 94,754 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def main():
n, m = [int(i) for i in input().split()]
colors = [0 for i in range(n + 1)]
for i in range(m):
arr = [int(i) for i in input().split()]
early = colors[arr[0]] or colors[arr[1]] or colors[arr[2]]
l = [... | output | 1 | 47,377 | 7 | 94,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,378 | 7 | 94,756 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,m = map(int,input().split(' '))
result,participated = [None]*n,{} #dancer : color
for x in range(m):
dancers = [int(i) for i in input().split(' ')]
colors,temp = set([1,2,3]),-1
for d in range(3):
if dancers[d] in participated:
... | output | 1 | 47,378 | 7 | 94,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,379 | 7 | 94,758 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,m=map(int,input().split())
ans=[-1]*(n+1)
for _ in range(m):
dancers=list(map(int,input().split()))
need=[1,2,3]
for i in dancers:
if(ans[i]!=-1):
need.remove(ans[i])
for i in dancers:
if(ans[i]==-1):
ans[i]=need.pop(-1)
print... | output | 1 | 47,379 | 7 | 94,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,380 | 7 | 94,760 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,m=map(int,input().split())
li=[]
for i in range(m):
li.append([int(x) for x in input().split()])
d={}
for i in range(m):
x=li[i]
use=[True]*3
l=[]
for ele in x:
if d.get(ele,0)!=0:
use[d.get(ele)-1]=False
f... | output | 1 | 47,380 | 7 | 94,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. He has several conditions:
* overall, there m... | instruction | 0 | 47,381 | 7 | 94,762 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n, m = map(int, input().split())
l = [-1]*n
for i in range(m):
a, b, c = map(int, input().split())
if(l[a-1] == -1 and l[b-1] == -1 and l[c-1] == -1):
l[a-1] = 1
l[b-1] = 2
l[c-1] = 3
elif(l[a-1] == -1 and l[b-1] == ... | output | 1 | 47,381 | 7 | 94,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,382 | 7 | 94,764 |
Yes | output | 1 | 47,382 | 7 | 94,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,383 | 7 | 94,766 |
Yes | output | 1 | 47,383 | 7 | 94,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,384 | 7 | 94,768 |
Yes | output | 1 | 47,384 | 7 | 94,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,385 | 7 | 94,770 |
Yes | output | 1 | 47,385 | 7 | 94,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,386 | 7 | 94,772 |
No | output | 1 | 47,386 | 7 | 94,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,387 | 7 | 94,774 |
No | output | 1 | 47,387 | 7 | 94,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,388 | 7 | 94,776 |
No | output | 1 | 47,388 | 7 | 94,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In Berland, there is the national holiday coming β the Flag Day. In the honor of this event the president of the country decided to make a big dance party and asked your agency to organize it. H... | instruction | 0 | 47,389 | 7 | 94,778 |
No | output | 1 | 47,389 | 7 | 94,779 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,854 | 7 | 95,708 |
"Correct Solution:
```
from collections import deque
def new_color(s, i, color):
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print(0)
return
another = {("r", "g"):"b", ("g", "r"):"b",
("r", "b"):"... | output | 1 | 47,854 | 7 | 95,709 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,855 | 7 | 95,710 |
"Correct Solution:
```
from collections import deque
def only_color(s, monos):
if s in monos:
return True
else:
return False
def new_color(s, i, rgb):
for color in rgb:
if color != s[i] and color != s[i + 1]:
break
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos... | output | 1 | 47,855 | 7 | 95,711 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,856 | 7 | 95,712 |
"Correct Solution:
```
from collections import deque
def change(x,y):
if [x,y] == ["r","g"] or [y,x] == ["r","g"]:
return "b"
elif [x,y] == ["g","b"] or [y,x] == ["g","b"]:
return "r"
elif [x,y] == ["r","b"] or [y,x] == ["r","b"]:
return "g"
rgb = ['r','g','b']
while True:
tim... | output | 1 | 47,856 | 7 | 95,713 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,857 | 7 | 95,714 |
"Correct Solution:
```
from collections import deque
def new_color(s, i, rgb):
for color in rgb:
if color != s[i] and color != s[i + 1]:
break
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print(0)
retur... | output | 1 | 47,857 | 7 | 95,715 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,858 | 7 | 95,716 |
"Correct Solution:
```
from collections import deque
def isOneColor(w):
sw = sorted(w)
if sw[0] == sw[-1]:
return True
else:
return False
def nextColor(c1, c2):
cs = ['r', 'g', 'b']
cs.remove(c1)
cs.remove(c2)
return cs[0]
def bfs(iw):
q = deque()
s = set()
s.... | output | 1 | 47,858 | 7 | 95,717 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,859 | 7 | 95,718 |
"Correct Solution:
```
def solve():
while True:
worm = input()
if worm == '0':
break
q = [worm]
m = {('r', 'g'): 'bb', ('g', 'r'): 'bb', ('r', 'b'): 'gg',
('b', 'r'): 'gg', ('g', 'b'): 'rr', ('b', 'g'): 'rr'}
d = {worm: True}
ans = 0
... | output | 1 | 47,859 | 7 | 95,719 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,860 | 7 | 95,720 |
"Correct Solution:
```
from collections import deque
def new_color(s, i, color):
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print(0)
return
rgb = "rgb"
another = {("r", "g"):"b", ("g", "r"):"b",
... | output | 1 | 47,860 | 7 | 95,721 |
Provide a correct Python 3 solution for this coding contest problem.
Dr. A of the Aizu Institute of Biological Research discovered a mysterious insect on a certain southern island. The shape is elongated like a hornworm, but since one segment is shaped like a ball, it looks like a beaded ball connected by a thread. Wh... | instruction | 0 | 47,861 | 7 | 95,722 |
"Correct Solution:
```
from collections import deque
def new_color(s, i, color):
return s[:i - 1] + color * 2 + s[i + 1:]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print(0)
return
another = {("r", "g"):"b", ("g", "r"):"b",
("r", "b... | output | 1 | 47,861 | 7 | 95,723 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.