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.
There are n boxes with colored balls on the table. Colors are numbered from 1 to n. i-th box contains ai balls, all of which have color i. You have to write a program that will divide all balls ... | instruction | 0 | 9,576 | 7 | 19,152 |
No | output | 1 | 9,576 | 7 | 19,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On one of the planets of Solar system, in Atmosphere University, many students are fans of bingo game.
It is well known that one month on this planet consists of n^2 days, so calendars, represe... | instruction | 0 | 10,543 | 7 | 21,086 |
No | output | 1 | 10,543 | 7 | 21,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On one of the planets of Solar system, in Atmosphere University, many students are fans of bingo game.
It is well known that one month on this planet consists of n^2 days, so calendars, represe... | instruction | 0 | 10,544 | 7 | 21,088 |
No | output | 1 | 10,544 | 7 | 21,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,051 | 7 | 22,102 |
Tags: implementation
Correct Solution:
```
s = sorted(list(map(int, input().split())))
d = 3
for i in range(3):
if(s[i] != s[i+1]):
d -= 1
print(d)
``` | output | 1 | 11,051 | 7 | 22,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,052 | 7 | 22,104 |
Tags: implementation
Correct Solution:
```
arr = [int(i) for i in input().split()]
arr.sort()
c = 0
for i in range(3):
if arr[i]==arr[i+1]:
c += 1
print(c)
``` | output | 1 | 11,052 | 7 | 22,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,053 | 7 | 22,106 |
Tags: implementation
Correct Solution:
```
l = [int(x) for x in input().split()]
l = set(l)
print(4-len(l))
``` | output | 1 | 11,053 | 7 | 22,107 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,054 | 7 | 22,108 |
Tags: implementation
Correct Solution:
```
def s(a):
u=set()
u.update(a)
return 4-len(u)
a=map(int,input().split(" "))
print(s(a))
``` | output | 1 | 11,054 | 7 | 22,109 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,055 | 7 | 22,110 |
Tags: implementation
Correct Solution:
```
colors = list(map(int, input().split(' ')))
print(4-len(list(set(colors))))
``` | output | 1 | 11,055 | 7 | 22,111 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,056 | 7 | 22,112 |
Tags: implementation
Correct Solution:
```
shoes_coulur =list(map(int,input().split()))
uni_colur =[]
for i in shoes_coulur :
if i not in uni_colur :
uni_colur.append(i)
print(len(shoes_coulur)-len(uni_colur))
``` | output | 1 | 11,056 | 7 | 22,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,057 | 7 | 22,114 |
Tags: implementation
Correct Solution:
```
s=list(map(int,input().split()))
print(len(s)-len(set(s)))
``` | output | 1 | 11,057 | 7 | 22,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year... | instruction | 0 | 11,058 | 7 | 22,116 |
Tags: implementation
Correct Solution:
```
a=input().split()
b=len(a)
c=len(set(a))
print(b-c)
``` | output | 1 | 11,058 | 7 | 22,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,059 | 7 | 22,118 |
Yes | output | 1 | 11,059 | 7 | 22,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,060 | 7 | 22,120 |
Yes | output | 1 | 11,060 | 7 | 22,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,061 | 7 | 22,122 |
Yes | output | 1 | 11,061 | 7 | 22,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,062 | 7 | 22,124 |
Yes | output | 1 | 11,062 | 7 | 22,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,063 | 7 | 22,126 |
No | output | 1 | 11,063 | 7 | 22,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,064 | 7 | 22,128 |
No | output | 1 | 11,064 | 7 | 22,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,065 | 7 | 22,130 |
No | output | 1 | 11,065 | 7 | 22,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera ... | instruction | 0 | 11,066 | 7 | 22,132 |
No | output | 1 | 11,066 | 7 | 22,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innocentius has a problem — his computer monitor has broken. Now some of the pixels are "dead", that is, they are always black. As consequence, Innocentius can't play the usual computer games. He is recently playing the following game with h... | instruction | 0 | 11,104 | 7 | 22,208 |
Tags: brute force, constructive algorithms, greedy, implementation
Correct Solution:
```
from itertools import chain
# To draw square: if point isn't 'w', draw '+'
def draw_square(scr, square_a, ymin, xmin):
for i in range(square_a + 1):
if scr[ymin][xmin + i] != 'w':
scr[ymin] = scr[ymin][:xmin... | output | 1 | 11,104 | 7 | 22,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Innocentius has a problem — his computer monitor has broken. Now some of the pixels are "dead", that is, they are always black. As consequence, Innocentius can't play the usual computer games. He is recently playing the following game with h... | instruction | 0 | 11,105 | 7 | 22,210 |
Tags: brute force, constructive algorithms, greedy, implementation
Correct Solution:
```
#!/usr/bin/python3
def readln(): return list(map(int, input().split()))
import sys
def exit():
print(-1)
sys.exit()
n, m = readln()
mon = [list(input()) for _ in range(n)]
hor = [i for i in range(n) if mon[i] != ['.'] * m... | output | 1 | 11,105 | 7 | 22,211 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.
In one second, Genos i... | instruction | 0 | 11,205 | 7 | 22,410 |
Tags: dp
Correct Solution:
```
import sys
from math import *
def input():
return sys.stdin.readline().strip()
def inputy():
return int(input())
def input_l():
return map(int, input().split())
n = inputy()
c = list(input_l())
dp = [[1e9]*n for i in range(n)]
for i in range(n):
dp[i][i] = 1
for i in range(n-1):
... | output | 1 | 11,205 | 7 | 22,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.
In one second, Genos i... | instruction | 0 | 11,207 | 7 | 22,414 |
Tags: dp
Correct Solution:
```
def main():
n, l = int(input()), list(map(int, input().split()))
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = 1
for i in range(n - 1, 0, -1):
ci, row = l[i - 1], dp[i]
for j in range(i, n):
tmp = [1 + row[j]]
... | output | 1 | 11,207 | 7 | 22,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.
In one second, Genos i... | instruction | 0 | 11,208 | 7 | 22,416 |
Tags: dp
Correct Solution:
```
n = int(input())
C = list(map(int, input().split()))
dp = [[0]*n for _ in range(n)]
for i in range(n) :
dp[i][i] = 1
for i in range(n-2, -1, -1) :
for j in range(i+1, n) :
dp[i][j] = 1 + dp[i+1][j]
if C[i] == C[i+1] : dp[i][j] = min( dp[i][j], 1 + (dp[i+2][j] if ... | output | 1 | 11,208 | 7 | 22,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.
In one second, Genos i... | instruction | 0 | 11,209 | 7 | 22,418 |
Tags: dp
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
from collections import defaultdict
... | output | 1 | 11,209 | 7 | 22,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.
In one second, Genos i... | instruction | 0 | 11,211 | 7 | 22,422 |
Tags: dp
Correct Solution:
```
def main():
n, l = int(input()), list(map(int, input().split()))
dp = [[0] * n for _ in range(n + 1)]
for le in range(1, n + 1):
for lo, hi in zip(range(n), range(le - 1, n)):
row, c = dp[lo], l[lo]
if le == 1:
row[hi] = 1
... | output | 1 | 11,211 | 7 | 22,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,214 | 7 | 22,428 |
Yes | output | 1 | 11,214 | 7 | 22,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,215 | 7 | 22,430 |
Yes | output | 1 | 11,215 | 7 | 22,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,216 | 7 | 22,432 |
Yes | output | 1 | 11,216 | 7 | 22,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,217 | 7 | 22,434 |
Yes | output | 1 | 11,217 | 7 | 22,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,218 | 7 | 22,436 |
No | output | 1 | 11,218 | 7 | 22,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,219 | 7 | 22,438 |
No | output | 1 | 11,219 | 7 | 22,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,220 | 7 | 22,440 |
No | output | 1 | 11,220 | 7 | 22,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line ... | instruction | 0 | 11,221 | 7 | 22,442 |
No | output | 1 | 11,221 | 7 | 22,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,321 | 7 | 22,642 |
Tags: constructive algorithms, implementation
Correct Solution:
```
a=int(input())
if a%2==0:
print("aabb"*(a//4)+"aabb"[:a%4])
print("ccdd" * (a // 4) + "ccdd"[:a % 4])
a-=2
print('z'+"eeff"*(a//4)+"eeff"[:a%4]+'x')
print('z' + "iijj" * (a // 4) + "iijj"[:a % 4] + 'x')
else:
a-=1
print("z"+... | output | 1 | 11,321 | 7 | 22,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,322 | 7 | 22,644 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n = int(input())
k = n // 4
if n % 2:
if (n - 1) % 4:
a = 'aabb' * k + 'aac'
b = 'bbaa' * k + 'bbc'
c = 'dee' + 'ffee' * k
d = 'dff' + 'eeff' * k
else:
a = 'aabb' * k + 'c'
b = 'bbaa' * k + 'c'
... | output | 1 | 11,322 | 7 | 22,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,323 | 7 | 22,646 |
Tags: constructive algorithms, implementation
Correct Solution:
```
from sys import stdin
a=int(stdin.readline())
if a%2==0:
for b in range(0,int(a/2)):
if b%2==0:
if b==int(a/2)-1:
print('aa')
else:
print('aa',end='')
else:
if b==int(a/2)-... | output | 1 | 11,323 | 7 | 22,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,324 | 7 | 22,648 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n = int(input())
field = [[None] * n for _ in range(4)]
for i in range(0, n - 1, 2):
if i > 0 and field[0][i - 1] == 'a':
field[0][i] = field[0][i + 1] = 'b'
field[1][i] = field[1][i + 1] = 'd'
else:
field[0][i] = fiel... | output | 1 | 11,324 | 7 | 22,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,325 | 7 | 22,650 |
Tags: constructive algorithms, implementation
Correct Solution:
```
import string
n = int(input())
l = 0
def get_next_l(exclusions = []):
global l
a = string.ascii_lowercase[l]
while a in exclusions:
l = (l + 1) % 26
a = string.ascii_lowercase[l]
l = (l + 1) % 26
return a
rows ... | output | 1 | 11,325 | 7 | 22,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,326 | 7 | 22,652 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def computeTiling(n):
if n == 1:
print("a\na\nf\nf")
return
for tiling in generateRowTilings(n):
print("".join(tiling))
def generateRowTilings(n):
for (rowNum, firstTile, pattern) in generateRowTilingPatterns(n... | output | 1 | 11,326 | 7 | 22,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,327 | 7 | 22,654 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def computeTiling(n):
printEvenLengthTiling(n) if isEven(n) else printOddLengthTiling(n)
def isEven(n):
return n%2 == 0
def printEvenLengthTiling(n):
print(buildRowFromPattern( '', 'nnoo', '', n))
print(buildRowFromPattern('l', 'xxzz... | output | 1 | 11,327 | 7 | 22,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem below, there you also are going to deal with t... | instruction | 0 | 11,328 | 7 | 22,656 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n=int(input())
s1,s2="aabb",'ccdd'
if n % 2 == 0:
print((s1*n)[:n])
print('e'+(s2*n)[:n-2]+'f')
print('e'+(s1*n)[:n-2]+'f')
print((s2*n)[:n])
else:
print((s1*n)[:n-1]+'e')
print((s1*n)[2:n+1]+'e')
print('f'+(s2*n)[:n-1])
... | output | 1 | 11,328 | 7 | 22,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem... | instruction | 0 | 11,329 | 7 | 22,658 |
No | output | 1 | 11,329 | 7 | 22,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem... | instruction | 0 | 11,330 | 7 | 22,660 |
No | output | 1 | 11,330 | 7 | 22,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem... | instruction | 0 | 11,331 | 7 | 22,662 |
No | output | 1 | 11,331 | 7 | 22,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We all know the problem about the number of ways one can tile a 2 × n field by 1 × 2 dominoes. You probably remember that it goes down to Fibonacci numbers. We will talk about some other problem... | instruction | 0 | 11,332 | 7 | 22,664 |
No | output | 1 | 11,332 | 7 | 22,665 |
Provide a correct Python 3 solution for this coding contest problem.
problem
There are the following games.
N characters are lined up in a vertical row. The color of these characters is red, blue, or yellow, and in the initial state, four or more characters of the same color are not lined up in a row. The player can... | instruction | 0 | 12,418 | 7 | 24,836 |
"Correct Solution:
```
def myinput(n):
C=[int(input())]
L=[1]
for i in range(1,n):
c = int(input())
if C[-1] == c:
L[-1]+=1
else:
C.append(c)
L.append(1)
return [C,L]
def check(C,L,low, hih):
m = len(C)
ret = 0
if 0<=low and L[low]>=4 and (hih>=m or C[low] != C[hih]):
ret += L[low]
low -= 1
... | output | 1 | 12,418 | 7 | 24,837 |
Provide a correct Python 3 solution for this coding contest problem.
problem
There are the following games.
N characters are lined up in a vertical row. The color of these characters is red, blue, or yellow, and in the initial state, four or more characters of the same color are not lined up in a row. The player can... | instruction | 0 | 12,419 | 7 | 24,838 |
"Correct Solution:
```
# p周辺の4つは消えることが前提
def erase(array, i, N):
if array[i - 1] == array[i]:
up = i - 1
down = i
elif array[i] == array[i + 1]:
up = i
down = i + 1
else:
return N - 2
while True:
if array[up] == -1 or array[down] == -1 or not array[up] ==... | output | 1 | 12,419 | 7 | 24,839 |
Provide a correct Python 3 solution for this coding contest problem.
problem
There are the following games.
N characters are lined up in a vertical row. The color of these characters is red, blue, or yellow, and in the initial state, four or more characters of the same color are not lined up in a row. The player can... | instruction | 0 | 12,420 | 7 | 24,840 |
"Correct Solution:
```
def doChain(ar, si, ei):
p, c = 0, [] #p:ar[i]のcolor, c:4連続以上のarのindex
for i in range(si, ei):
if ar[i]==p:
c.append(i)
if i==len(ar)-1 and len(c)>=4:
del ar[min(c):max(c)+1]
return True, max(0, si-3),min(ei+5, len(ar))
else:
if len(c)>=4:
del ar[min(c):max(c)+1]
r... | output | 1 | 12,420 | 7 | 24,841 |
Provide a correct Python 3 solution for this coding contest problem.
problem
There are the following games.
N characters are lined up in a vertical row. The color of these characters is red, blue, or yellow, and in the initial state, four or more characters of the same color are not lined up in a row. The player can... | instruction | 0 | 12,421 | 7 | 24,842 |
"Correct Solution:
```
while True:
n = int(input())
if not n:
break
puyos = []
pre = int(input())
cnt = 1
for _ in range(n - 1):
p = int(input())
if pre != p:
puyos.append((pre, cnt))
pre = p
cnt = 0
cnt += 1
puyos.append((... | output | 1 | 12,421 | 7 | 24,843 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.