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.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,891 | 0 | 115,782 |
Yes | output | 1 | 57,891 | 0 | 115,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,892 | 0 | 115,784 |
Yes | output | 1 | 57,892 | 0 | 115,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,893 | 0 | 115,786 |
Yes | output | 1 | 57,893 | 0 | 115,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,894 | 0 | 115,788 |
Yes | output | 1 | 57,894 | 0 | 115,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,895 | 0 | 115,790 |
No | output | 1 | 57,895 | 0 | 115,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,896 | 0 | 115,792 |
No | output | 1 | 57,896 | 0 | 115,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,897 | 0 | 115,794 |
No | output | 1 | 57,897 | 0 | 115,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a string X, which has an even number of characters. Half the characters are `S`, and the other half are `T`.
Takahashi, who hates the string `ST`, will perform the following operation 1... | instruction | 0 | 57,898 | 0 | 115,796 |
No | output | 1 | 57,898 | 0 | 115,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dreamoon likes strings. Today he created a game about strings:
String s_1, s_2, …, s_n is beautiful if and only if for each 1 ≤ i < n, s_i ≠ s_{i+1}.
Initially, Dreamoon has a string a. In eac... | instruction | 0 | 58,179 | 0 | 116,358 |
No | output | 1 | 58,179 | 0 | 116,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dreamoon likes strings. Today he created a game about strings:
String s_1, s_2, …, s_n is beautiful if and only if for each 1 ≤ i < n, s_i ≠ s_{i+1}.
Initially, Dreamoon has a string a. In eac... | instruction | 0 | 58,180 | 0 | 116,360 |
No | output | 1 | 58,180 | 0 | 116,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dreamoon likes strings. Today he created a game about strings:
String s_1, s_2, …, s_n is beautiful if and only if for each 1 ≤ i < n, s_i ≠ s_{i+1}.
Initially, Dreamoon has a string a. In eac... | instruction | 0 | 58,181 | 0 | 116,362 |
No | output | 1 | 58,181 | 0 | 116,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Little Elephant has found a ragged old black-and-white string s on the attic.
The characters of string s are numbered from the left to the right from 1 to |s|, where |s| is the length of the string. Let's denote the i-th character of st... | instruction | 0 | 58,308 | 0 | 116,616 |
Tags: dp
Correct Solution:
```
Mod=1000000007
n,k=map(int,input().split(' '))
s=' '+input()
f,fs,g,gs,w=[0]*1000005,[0]*1000005,[0]*1000005,[0]*1000005,[0]*1000005
qx,qw,qb=[0]*1000005,[0]*1000005,[0]*1000005
q=0
f[0]=fs[0]=1
for i in range(1,n+1):
lg=(i-k if i-k>=q else q)
if s[i]!='B':
f[i]=fs[i-1]-fs[lg-1]+Mod
... | output | 1 | 58,308 | 0 | 116,617 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,315 | 0 | 116,630 |
Tags: brute force, strings
Correct Solution:
```
I=input
s=' '.join(I()for _ in '0'*int(I()))
R=list(map(chr,range(122,96,-1)))
for i in R:
for j in R:
if s.count(i+j)==0:r=i+j
for i in R:
if s.count(i)==0:r=i
print(r)
``` | output | 1 | 58,315 | 0 | 116,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,316 | 0 | 116,632 |
Tags: brute force, strings
Correct Solution:
```
n=int(input())
ch=""
while(n):
sh=input()
ch+=' ' +sh
n-=1
l=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
t=False
for x in l:
if x not in ch:
t=True
print(x)
break
if not... | output | 1 | 58,316 | 0 | 116,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,317 | 0 | 116,634 |
Tags: brute force, strings
Correct Solution:
```
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int,minp().split())
all = set()
def subs(s):
for i in range(len(s)):
for j in range(i+1,len(s)+1):
all.add(s[i:j])
n = mint()
for i in range(n)... | output | 1 | 58,317 | 0 | 116,635 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,318 | 0 | 116,636 |
Tags: brute force, strings
Correct Solution:
```
n = int(input())
arr = []
for i in range(n):
arr += [input()]
s = '+'.join(arr)
q = 'abcdefghijklmnopqrstuvwxyz'
for i in q:
if i not in s:
print(i)
break
else:
for i in q:
for j in q:
if i+j not in s:
print(i... | output | 1 | 58,318 | 0 | 116,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,319 | 0 | 116,638 |
Tags: brute force, strings
Correct Solution:
```
alpha = "abcdefghijklmnopqrstuvwxyz"
n = int(input())
s = ""
for _ in range(n):
s += input() + " "
for x in alpha:
if x not in s:
print(x)
break
else:
for i in alpha:
for j in alpha:
if i+j not in s:
print(i+j)
quit()
``` | output | 1 | 58,319 | 0 | 116,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,320 | 0 | 116,640 |
Tags: brute force, strings
Correct Solution:
```
import re
import itertools
from collections import Counter
class Task:
strings = []
answer = ""
def getData(self):
numberOfStrings = int(input())
for i in range(0, numberOfStrings):
self.strings += [input()]
def solve(self... | output | 1 | 58,320 | 0 | 116,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,321 | 0 | 116,642 |
Tags: brute force, strings
Correct Solution:
```
n = int(input())
t = ' '.join(input() for i in range(n))
ans = 0
for i in 'abcdefghijklmnopqrstuvwxyz':
if not i in t:
ans = i
break
if not ans:
for i in 'abcdefghijklmnopqrstuvwxyz':
for j in 'abcdefghijklmnopqrstuvwxyz':
if n... | output | 1 | 58,321 | 0 | 116,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Codeforces problems.
You've got the titles ... | instruction | 0 | 58,322 | 0 | 116,644 |
Tags: brute force, strings
Correct Solution:
```
import string
s=' '.join(input()for i in range(int(input())))
alph= string.ascii_lowercase
for i in alph:
if i not in s:print(i);exit()
for i in alph:
for j in alph:
if i+j not in s:print(i+j);exit()
``` | output | 1 | 58,322 | 0 | 116,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,323 | 0 | 116,646 |
Yes | output | 1 | 58,323 | 0 | 116,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,324 | 0 | 116,648 |
Yes | output | 1 | 58,324 | 0 | 116,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,325 | 0 | 116,650 |
Yes | output | 1 | 58,325 | 0 | 116,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,326 | 0 | 116,652 |
Yes | output | 1 | 58,326 | 0 | 116,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,327 | 0 | 116,654 |
No | output | 1 | 58,327 | 0 | 116,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,328 | 0 | 116,656 |
No | output | 1 | 58,328 | 0 | 116,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,329 | 0 | 116,658 |
No | output | 1 | 58,329 | 0 | 116,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recen... | instruction | 0 | 58,330 | 0 | 116,660 |
No | output | 1 | 58,330 | 0 | 116,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,377 | 0 | 116,754 |
Tags: brute force, implementation, strings
Correct Solution:
```
s, r = input(), int(input())
def compare(a, b):
return a[:len(b)] == b
def f(s, n, N):
if not s or n < 2*N:
return N
for i in range(n//2, 0, -1):
#print(s, n, i, N)
if compare(s[:i], s[i:2 * i]):
return f... | output | 1 | 58,377 | 0 | 116,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,378 | 0 | 116,756 |
Tags: brute force, implementation, strings
Correct Solution:
```
# Author : raj1307 - Raj Singh
# Date : 03.01.2020
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import a... | output | 1 | 58,378 | 0 | 116,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,379 | 0 | 116,758 |
Tags: brute force, implementation, strings
Correct Solution:
```
a=input()
b=int(input())
j=0
l=0
for start in range(len(a)+b):
for end in range(start+1,len(a)+b):
if ((end-start)+1)%2==0:
middle=(start+end)//2+1
k=0
for traverse in range(start,len(a)):
if... | output | 1 | 58,379 | 0 | 116,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,380 | 0 | 116,760 |
Tags: brute force, implementation, strings
Correct Solution:
```
s = input()
k = int(input())
s = s + '?'*k
for i in range(len(s)//2 + 1):
a=[0]*len(s)
for j in range(len(s)-i):
if (s[j] == s[j+i])or (s[j+i] == '?'):
a[j] = 1
c = 0
mx = 0
for j in a:
if j == 1:
... | output | 1 | 58,380 | 0 | 116,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,381 | 0 | 116,762 |
Tags: brute force, implementation, strings
Correct Solution:
```
def tandem(s,start,l,max_len,n):
if start >= n:
if max_len-start >= 2*l:
return True
return False
if max_len-start < 2*l:
return False
for i in range(start,start+l):
si = s[start]
if i+l >... | output | 1 | 58,381 | 0 | 116,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,382 | 0 | 116,764 |
Tags: brute force, implementation, strings
Correct Solution:
```
s = input()
k = int(input())
s += "?"*k
for i in range(len(s)-len(s)%2, 0, -2):
for j in range(len(s)-i+1):
if all(s[x+i//2] in {"?", s[x]} for x in range(j, j+i//2)):
print(i)
exit(0)
``` | output | 1 | 58,382 | 0 | 116,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,383 | 0 | 116,766 |
Tags: brute force, implementation, strings
Correct Solution:
```
s = input()
k = int(input())
ans = 0
for l in range(1,(len(s)+k)//2+1):
cur = s+'a'*k
cur = ''.join(cur[i] if i < max(l,len(s)) else cur[i-l] for i in range(len(s)+k))
check = ''.join('01'[cur[i] == cur[i+l]] for i in range(len(s)+k-l))
if '1'*l in ch... | output | 1 | 58,383 | 0 | 116,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new string contained a tandem repeat of length l as a su... | instruction | 0 | 58,384 | 0 | 116,768 |
Tags: brute force, implementation, strings
Correct Solution:
```
s=input()
k=int(input())
s+='?'*k
n=len(s)
best=0
for i in range(n):
for j in range(i+1,n):
if((j-i+1)%2!=0):
continue
x=j-i+1
valid=True
for e in range(i,j+1):
if(e+x//2>j):
bre... | output | 1 | 58,384 | 0 | 116,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,385 | 0 | 116,770 |
Yes | output | 1 | 58,385 | 0 | 116,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,386 | 0 | 116,772 |
Yes | output | 1 | 58,386 | 0 | 116,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,387 | 0 | 116,774 |
Yes | output | 1 | 58,387 | 0 | 116,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,388 | 0 | 116,776 |
Yes | output | 1 | 58,388 | 0 | 116,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,389 | 0 | 116,778 |
No | output | 1 | 58,389 | 0 | 116,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,390 | 0 | 116,780 |
No | output | 1 | 58,390 | 0 | 116,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,391 | 0 | 116,782 |
No | output | 1 | 58,391 | 0 | 116,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kolya got string s for his birthday, the string consists of small English letters. He immediately added k more characters to the right of the string.
Then Borya came and said that the new strin... | instruction | 0 | 58,392 | 0 | 116,784 |
No | output | 1 | 58,392 | 0 | 116,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substring of length 2 or more.
Paul has found a tolera... | instruction | 0 | 58,393 | 0 | 116,786 |
Tags: greedy, strings
Correct Solution:
```
import sys
def main():
# fin = open("input.txt", "r")
fin = sys.stdin
fout = sys.stdout
L = list("abcdefghijklmnopqrstuvwxyz")
n, p = map(int, fin.readline().split())
A = list(fin.readline())
for i in range(n - 1, 1, -1):
pr = ord(A[i -... | output | 1 | 58,393 | 0 | 116,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substring of length 2 or more.
Paul has found a tolera... | instruction | 0 | 58,394 | 0 | 116,788 |
Tags: greedy, strings
Correct Solution:
```
def trans(c):
return chr(ord(c) + 1)
n, p = list(map(int, input().split()))
s = list(input())
s[n-1] = trans(s[n-1])
i = n - 1
while i >= 0 and i < n:
if ord(s[i]) >= ord('a') + p:
s[i] = 'a'
i -= 1
s[i] = trans(s[i])
elif i > 0 and s[i] == s[... | output | 1 | 58,394 | 0 | 116,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substring of length 2 or more.
Paul has found a tolera... | instruction | 0 | 58,395 | 0 | 116,790 |
Tags: greedy, strings
Correct Solution:
```
def nxt(c):
return chr(ord(c) + 1) if c < maxc else 'a'
n, p = map(int, input().split())
s = input()
if p == 2 and s != 'ab' and s != 'a':
print("NO")
else:
s = list("#%" + s)
maxc = chr(ord('a') + p - 1)
found = False
for i in range(-1, -n - 1, -1):
... | output | 1 | 58,395 | 0 | 116,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substring of length 2 or more.
Paul has found a tolera... | instruction | 0 | 58,396 | 0 | 116,792 |
Tags: greedy, strings
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
# from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', '... | output | 1 | 58,396 | 0 | 116,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substring of length 2 or more.
Paul has found a tolera... | instruction | 0 | 58,397 | 0 | 116,794 |
Tags: greedy, strings
Correct Solution:
```
def nxt(c):
return chr(ord(c) + 1) if c < maxc else 'a'
n, p = map(int, input().split())
s = input()
if p == 2 and s != 'ab' and s != 'a':
print("NO")
else:
s = list("#%" + s)
maxc = chr(ord('a') + p - 1)
found = False
for i in range(-1, -n - 1, -1):
... | output | 1 | 58,397 | 0 | 116,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substrin... | instruction | 0 | 58,398 | 0 | 116,796 |
No | output | 1 | 58,398 | 0 | 116,797 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.