message stringlengths 2 23.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 97 109k | cluster float64 0 0 | __index_level_0__ int64 194 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n consisting of lowercase Latin letters. You may apply some operations to this string: in one operation you can delete some contiguous substring of this string... | instruction | 0 | 66,495 | 0 | 132,990 |
No | output | 1 | 66,495 | 0 | 132,991 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n consisting of lowercase Latin letters. You may apply some operations to this string: in one operation you can delete some contiguous substring of this string... | instruction | 0 | 66,496 | 0 | 132,992 |
No | output | 1 | 66,496 | 0 | 132,993 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce the designation <image>, where x is a string, n is a positive integer and operation " + " is the string concatenation operation. For example, [abc, 2] = abcabc.
We'll say that string s can be obtained from string t, if we ca... | instruction | 0 | 66,730 | 0 | 133,460 |
Tags: binary search, dfs and similar, strings
Correct Solution:
```
b, p = map(int, input().split())
s1 = input()
s2 = input()
cnt = [0] * len(s2)
nxt = [0] * len(s2)
for i in range(len(s2)):
pos = i
for j in range(len(s1)):
if s1[j] == s2[pos]:
pos += 1
if pos == len(s2):
... | output | 1 | 66,730 | 0 | 133,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce the designation <image>, where x is a string, n is a positive integer and operation " + " is the string concatenation operation. For example, [abc, 2] = abcabc.
We'll say that s... | instruction | 0 | 66,731 | 0 | 133,462 |
No | output | 1 | 66,731 | 0 | 133,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce the designation <image>, where x is a string, n is a positive integer and operation " + " is the string concatenation operation. For example, [abc, 2] = abcabc.
We'll say that s... | instruction | 0 | 66,732 | 0 | 133,464 |
No | output | 1 | 66,732 | 0 | 133,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce the designation <image>, where x is a string, n is a positive integer and operation " + " is the string concatenation operation. For example, [abc, 2] = abcabc.
We'll say that s... | instruction | 0 | 66,733 | 0 | 133,466 |
No | output | 1 | 66,733 | 0 | 133,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasily the Bear loves beautiful strings. String s is beautiful if it meets the following criteria:
1. String s only consists of characters 0 and 1, at that character 0 must occur in string s... | instruction | 0 | 66,734 | 0 | 133,468 |
No | output | 1 | 66,734 | 0 | 133,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasily the Bear loves beautiful strings. String s is beautiful if it meets the following criteria:
1. String s only consists of characters 0 and 1, at that character 0 must occur in string s... | instruction | 0 | 66,735 | 0 | 133,470 |
No | output | 1 | 66,735 | 0 | 133,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,969 | 0 | 133,938 |
Tags: greedy, strings
Correct Solution:
```
s = list(input())
word = 'a'
for i in range(len(s)):
if s[i] <= word:
s[i] = word
word = chr(ord(word) + 1)
if word > 'z':
break
if word <= 'z':
print(-1)
else:
print(''.join(s))
``` | output | 1 | 66,969 | 0 | 133,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,970 | 0 | 133,940 |
Tags: greedy, strings
Correct Solution:
```
def next_char(c):
return chr(ord(c) + 1)
s = list(input().strip())
c = 'a'
for i in range(len(s)):
if s[i] <= c:
s[i] = c
c = next_char(c)
if ord(c) > ord('z'):
break
if ord(c) <= ord('z'):
print(-1)
else:
print(*s, ... | output | 1 | 66,970 | 0 | 133,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,971 | 0 | 133,942 |
Tags: greedy, strings
Correct Solution:
```
s = input()
l = list(s)
t = 'abcdefghijklmnopqrstuvwxyz'
i = 0
n = len(l)
impossible = False
for c in t:
for j in range(i, n):
if l[j] <= c:
l[j] = c
i = j + 1
break
else:
impossible = True
if impossible:
print... | output | 1 | 66,971 | 0 | 133,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,972 | 0 | 133,944 |
Tags: greedy, strings
Correct Solution:
```
def solve(stg):
check = False
stg = list(stg)
x = 'a'
for i in range(len(stg)):
if stg[i] <= x:
stg[i] = x
x = chr(ord(x) + 1)
if x > 'z':
check = True
break
if check:
... | output | 1 | 66,972 | 0 | 133,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,973 | 0 | 133,946 |
Tags: greedy, strings
Correct Solution:
```
x = "abcdefghijklmnopqrstuvwxyz"
y = str(input())
yLista =list(y)
k=0
t=0
if(len(x)>len(y)):
k=1
else:
for i in range(len(y)):
if(t>=26):
continue
if(x[t]==yLista[i]):
t = t+1
continue
if(x[t]>=yLista[i]):
yLista[i]=x[t]
t=t+1
... | output | 1 | 66,973 | 0 | 133,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,974 | 0 | 133,948 |
Tags: greedy, strings
Correct Solution:
```
'''
Auther: ghoshashis545 Ashis Ghosh
College: Jalpaiguri Govt Enggineering College
'''
from os import path
from io import BytesIO, IOBase
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,Counter,defa... | output | 1 | 66,974 | 0 | 133,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,975 | 0 | 133,950 |
Tags: greedy, strings
Correct Solution:
```
str = input("")
str_len = len(str)
cur = 'a'
res = ""
for i in range(0,str_len):
if str[i] <= cur <= 'z':
res += cur
cur = chr(ord(cur)+1)
else:
res += str[i]
if ord(cur)!= ord('z')+1:
print("-1")
else:
print(res)
``` | output | 1 | 66,975 | 0 | 133,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot ... | instruction | 0 | 66,976 | 0 | 133,952 |
Tags: greedy, strings
Correct Solution:
```
s = list(input())
st = 'a'
for i in range(len(s)):
if (s[i] <= st):
s[i] = st
st = chr(ord(st) + 1)
if st > 'z':
break
if (st <= 'z'):
print(-1)
else:
print(*s,sep = '')
``` | output | 1 | 66,976 | 0 | 133,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,977 | 0 | 133,954 |
Yes | output | 1 | 66,977 | 0 | 133,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,978 | 0 | 133,956 |
Yes | output | 1 | 66,978 | 0 | 133,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,979 | 0 | 133,958 |
Yes | output | 1 | 66,979 | 0 | 133,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,980 | 0 | 133,960 |
Yes | output | 1 | 66,980 | 0 | 133,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,981 | 0 | 133,962 |
No | output | 1 | 66,981 | 0 | 133,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,982 | 0 | 133,964 |
No | output | 1 | 66,982 | 0 | 133,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,983 | 0 | 133,966 |
No | output | 1 | 66,983 | 0 | 133,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of |s| small english letters.
In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b... | instruction | 0 | 66,984 | 0 | 133,968 |
No | output | 1 | 66,984 | 0 | 133,969 |
Provide a correct Python 3 solution for this coding contest problem.
The unlucky Ikta-kun has rewritten the important character string T that he had to a different character string T'by the virus. It is known that the virus has rewritten one letter of T to a different letter. That is, T and T'are different by exactly ... | instruction | 0 | 67,215 | 0 | 134,430 |
"Correct Solution:
```
import string
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
s0 = "^" + string.ascii_uppercase + string.ascii_lowercase
*S, = map(s0.index, readline().strip()); N = len(S)
*T, = map(s0.index, readline().strip()); M = len(T)
base = 59; mod = 10**9 ... | output | 1 | 67,215 | 0 | 134,431 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Here is a list of strings. Let's take a break and play with shiritori. Shiritori is performed according to the following rules.
1. First of all, select one of your favorite strings from the list and exclude that string from the list.
2. Nex... | instruction | 0 | 67,218 | 0 | 134,436 |
"Correct Solution:
```
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy impo... | output | 1 | 67,218 | 0 | 134,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,323 | 0 | 134,646 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
s = str(input())
lst = []
l = 0
h = len(s)-1
while(h>=l):
if s[l] == s[h]:
lst.append(s[l])
l = l+1
h = h-1
elif s[l] == s[h-1]:
h = h-1
elif s[l+1] == s[h]:
l = l+1
else:
l... | output | 1 | 67,323 | 0 | 134,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,324 | 0 | 134,648 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
s=input()
char=set()
n=len(s)
i=0
j=n-1
fin=''
lis=[]
while(j>=i+3):
if s[i]==s[j]:
lis.append(i)
i+=1
j-=1
elif s[i]==s[j-1]:
lis.append(i)
i+=1
j-=2
elif s[i+1]==s[j]:... | output | 1 | 67,324 | 0 | 134,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,325 | 0 | 134,650 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
s = input()
if len(s) == 3:
print(s[0])
else:
ans = ["a"] * (len(s) // 4)
for i in range(len(s) // 4):
#print(s[2*i + 1], s[-2*i - 1], s[2*i], s[-2*i - 2])
#print(2*i + 1, -2*i - 1, 2*i, -2*i - 2)
if s... | output | 1 | 67,325 | 0 | 134,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,326 | 0 | 134,652 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
s = input()
p = 0
k = len(s) - 1
dl = 0
odp = []
while p + 1 < k - 1:
if s[p] == s[k]:
odp.append(s[p])
p += 1
k -= 1
dl += 2
elif s[p] == s[k-1]:
odp.append(s[p])
p += 1
k -= 2
elif s[p+1] == s[k]:
odp.append(s[p+1])
... | output | 1 | 67,326 | 0 | 134,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,327 | 0 | 134,654 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
from collections import deque
s = input()
left = deque([])
right = deque([])
def solve():
l,r = 0, len(s)
while(l<=r):
if(r-l == 0):
print("".join(left+right))
return
elif(r-l <= 3):
print("".join(left+deque([s[l]])+rig... | output | 1 | 67,327 | 0 | 134,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,328 | 0 | 134,656 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
s=input()
length=len(s)
left=0
right=len(s)-1
endStr=""
while left<right-2:
if s[left]==s[right]:
endStr=endStr+s[left]
left+=1
right-=1
elif s[left]==s[right-1]:
endStr=endStr+s[left]
left+... | output | 1 | 67,328 | 0 | 134,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,329 | 0 | 134,658 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
from sys import stdin, stdout
#N = int(input())
s = input()
N = len(s)
#W,H = [int(x) for x in stdin.readline().split()]
#arr = [int(x) for x in stdin.readline().split()]
required = N//2
front = []
tail = []
left = 0
right = N-1
wh... | output | 1 | 67,329 | 0 | 134,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,330 | 0 | 134,660 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
import sys
for line in sys.stdin:
line = line[:-1]
ans = ['a']*(len(line)//4)
for i in range(len(line)//4):
if line[2*i] in {line[-2*i-1], line[-2*i-2]}:
ans[i] = line[2*i]
else:
ans[i]... | output | 1 | 67,330 | 0 | 134,661 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whose age and origin are unknown. Perhaps Alice can... | instruction | 0 | 67,331 | 0 | 134,662 |
Tags: brute force, constructive algorithms, greedy, strings
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
retur... | output | 1 | 67,331 | 0 | 134,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,332 | 0 | 134,664 |
Yes | output | 1 | 67,332 | 0 | 134,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,333 | 0 | 134,666 |
Yes | output | 1 | 67,333 | 0 | 134,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,334 | 0 | 134,668 |
Yes | output | 1 | 67,334 | 0 | 134,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,335 | 0 | 134,670 |
Yes | output | 1 | 67,335 | 0 | 134,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,336 | 0 | 134,672 |
No | output | 1 | 67,336 | 0 | 134,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,337 | 0 | 134,674 |
No | output | 1 | 67,337 | 0 | 134,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,338 | 0 | 134,676 |
No | output | 1 | 67,338 | 0 | 134,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,339 | 0 | 134,678 |
No | output | 1 | 67,339 | 0 | 134,679 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice bought a Congo Prime Video subscription and was watching a documentary on the archaeological findings from Factor's Island on Loch Katrine in Scotland. The archaeologists found a book whos... | instruction | 0 | 67,340 | 0 | 134,680 |
No | output | 1 | 67,340 | 0 | 134,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the size of the input.
You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'.
You are also given an integer k. Your task is to change the minimum number... | instruction | 0 | 67,341 | 0 | 134,682 |
Tags: data structures, dp, implementation, two pointers
Correct Solution:
```
def naiveSolve():
return
def getMinChanges(s,t,n,k):
arr=[0]*n
for i in range(n):
if s[i]!=t[i]:
arr[i]=1
p=arr
for i in range(1,n):
p[i]+=p[i-1]
def query(l,r):
res... | output | 1 | 67,341 | 0 | 134,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the size of the input.
You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'.
You are also given an integer k. Your task is to change the minimum number... | instruction | 0 | 67,342 | 0 | 134,684 |
Tags: data structures, dp, implementation, two pointers
Correct Solution:
```
import sys
import math
q = int(sys.stdin.readline())
for _ in range(q):
n, k = map(int, sys.stdin.readline().split())
sub = sys.stdin.readline().strip()
ori = ['RGB', 'GBR', 'BRG']
minVal = sys.maxsize
for i in range(3):
... | output | 1 | 67,342 | 0 | 134,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the size of the input.
You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'.
You are also given an integer k. Your task is to change the minimum number... | instruction | 0 | 67,343 | 0 | 134,686 |
Tags: data structures, dp, implementation, two pointers
Correct Solution:
```
import sys
def process(S, k, n):
if k==1:
return 0
answer = float('inf')
current = [0, 0, 0]
indexes = {'R': 0, 'G': 1, 'B': 2}
for i in range(k):
c = chr(S[i])
index = (indexes[c]-i) % 3
fo... | output | 1 | 67,343 | 0 | 134,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the size of the input.
You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'.
You are also given an integer k. Your task is to change the minimum number... | instruction | 0 | 67,344 | 0 | 134,688 |
Tags: data structures, dp, implementation, two pointers
Correct Solution:
```
import sys
input = sys.stdin.readline
Q = int(input())
D = {"R":0, "G":1, "B":2}
for _ in range(Q):
N, K = map(int, input().split())
S = input()
mi = K
for i in range(3):
d = 0
for j in range(N):
if... | output | 1 | 67,344 | 0 | 134,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the size of the input.
You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'.
You are also given an integer k. Your task is to change the minimum number... | instruction | 0 | 67,345 | 0 | 134,690 |
Tags: data structures, dp, implementation, two pointers
Correct Solution:
```
t = int(input())
for _ in range(t):
n,k = map(int,input().split())
s = input()
if(n==1): print(0);continue
A1 = "RGB"*n
A2 = "GBR"*n
A3 = "BRG"*n
ans = k
x1 = 0
x2 =0
x3 =0
for j in range(0,k):
... | output | 1 | 67,345 | 0 | 134,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the size of the input.
You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'.
You are also given an integer k. Your task is to change the minimum number... | instruction | 0 | 67,346 | 0 | 134,692 |
Tags: data structures, dp, implementation, two pointers
Correct Solution:
```
def main():
q = int(input())
ans = []
for i in range(q):
n, k = map(int, input().split())
s = input()
min_ans = 10 ** 9
pr1 = [0]
pr2 = [0]
pr3 = [0]
for i in range(n... | output | 1 | 67,346 | 0 | 134,693 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.