message stringlengths 2 23.4k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 129 108k | cluster float64 6 6 | __index_level_0__ int64 258 216k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can ... | instruction | 0 | 27,396 | 6 | 54,792 |
No | output | 1 | 27,396 | 6 | 54,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,529 | 6 | 55,058 |
Tags: constructive algorithms, strings
Correct Solution:
```
n,l,k = map(int, input().strip().split())
s = input()
char_count = [0 for i in range(26)]
for c in s:
num = ord(c) - 97
char_count[num] += 1
words = [[] for i in range(n)]
def add_letter(ties,smallestLetter):
for i in range(k-ties,k):
whil... | output | 1 | 27,529 | 6 | 55,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,530 | 6 | 55,060 |
Tags: constructive algorithms, strings
Correct Solution:
```
n,m,k = map(int,input().split())
s = list(input())
s.sort()
ans = [["" for i in range(m)] for j in range(k)]
j = len(s)-1
for i in range(k):
ans[i][0] = s[i]
i = k
for x in range(1,m):
for y in range(k):
if ans[y][x-1]==ans[-1][x-1]:
ans[y][x] = s[i]
... | output | 1 | 27,530 | 6 | 55,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,531 | 6 | 55,062 |
Tags: constructive algorithms, strings
Correct Solution:
```
n,l,k=map(int,input().split())
st=input()
a=[]
for i in st:
a.append(ord(i))
a.sort()
double=[[] for i in range(n+1)]
level=0
pre="0"
i=0
k-=1
count,x=0,0
while(level<l):
pre="0"
while(i<=k):
double[i].append(chr(a[count]))
if(pre!... | output | 1 | 27,531 | 6 | 55,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,532 | 6 | 55,064 |
Tags: constructive algorithms, strings
Correct Solution:
```
n, l, k = map (int, input().split())
s = sorted(input())
res = [''] * n
w = 0
let = 0
while len (res[k -1]) != l:
for i in range (k - w):
res[w + i] += s[let]
let += 1
curr_letter = res[k - 1][-1]
for i in range(w, k):
... | output | 1 | 27,532 | 6 | 55,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,533 | 6 | 55,066 |
Tags: constructive algorithms, strings
Correct Solution:
```
from sys import stdin, stdout
from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque
from heapq import merge, heapify, heappop, heappush, nsmallest
from bisect import bisect_left as bl, bisect_right... | output | 1 | 27,533 | 6 | 55,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,534 | 6 | 55,068 |
Tags: constructive algorithms, strings
Correct Solution:
```
n,l,k = [int(x) for x in input().split()]
c = list(input())
c.sort()
w = [[] for x in range(n)]
ind = 0
cl = 0
flag = True
s = 0
if k>1:
while flag and cl<l:
for i in range(s,k):
w[i].append(c[ind])
ind += 1
cl += 1... | output | 1 | 27,534 | 6 | 55,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,535 | 6 | 55,070 |
Tags: constructive algorithms, strings
Correct Solution:
```
n , l , k = map(int,input().split(' '))
s = list(input())
s.sort()
i = 0
ans = [[] for _ in range(n)]
fill = [i for i in range(k)]
while len(ans[k-1]) < l :
temp = []
for element in fill :
ans[element].append(s[i])
i+=1
for e... | output | 1 | 27,535 | 6 | 55,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build mult... | instruction | 0 | 27,536 | 6 | 55,072 |
Tags: constructive algorithms, strings
Correct Solution:
```
def multiLineArrayOfArraysPrint(arr):
print('\n'.join([''.join([str(x) for x in y]) for y in arr]))
n,l,k=[int(x) for x in input().split()]
letters=input()
arr=list(letters)
arr.sort()
if k==1:
ans=[[] for _ in range(n)]
j=0
for i in range(l*... | output | 1 | 27,536 | 6 | 55,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,537 | 6 | 55,074 |
Yes | output | 1 | 27,537 | 6 | 55,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,538 | 6 | 55,076 |
Yes | output | 1 | 27,538 | 6 | 55,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,539 | 6 | 55,078 |
Yes | output | 1 | 27,539 | 6 | 55,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,540 | 6 | 55,080 |
Yes | output | 1 | 27,540 | 6 | 55,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,541 | 6 | 55,082 |
No | output | 1 | 27,541 | 6 | 55,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,542 | 6 | 55,084 |
No | output | 1 | 27,542 | 6 | 55,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,543 | 6 | 55,086 |
No | output | 1 | 27,543 | 6 | 55,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.
At first, she tried to construct the lexicographically smallest word out of given letter... | instruction | 0 | 27,544 | 6 | 55,088 |
No | output | 1 | 27,544 | 6 | 55,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,819 | 6 | 55,638 |
Tags: implementation, strings
Correct Solution:
```
def check(s1, s2):
for i in s1 + s2:
if s1.count(i) < s2.count(i):
return 0
return 1
def aut(s1, s2):
a1 = a2 = 0
while a2 < len(s2):
if a1 == len(s1):
return 0
while s1[a1] != s2[a2]:
a1 += ... | output | 1 | 27,819 | 6 | 55,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,820 | 6 | 55,640 |
Tags: implementation, strings
Correct Solution:
```
from collections import Counter
def check(a, b):
n = len(b)
i = 0
for c in a:
if c == b[i]:
i += 1
if i == n:
return True
return False
a = input()
b = input()
if sorted(a) == sorted(b):
print('array')
exit(0)
if check(a, b):
print('automaton')
exit... | output | 1 | 27,820 | 6 | 55,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,821 | 6 | 55,642 |
Tags: implementation, strings
Correct Solution:
```
from collections import Counter
first_string = input()
second_string = input()
def create_dict(string):
return Counter(string)
def is_automaton_enough(train_string: str, test_string: str):
if len(test_string) > len(train_string):
return False
... | output | 1 | 27,821 | 6 | 55,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,822 | 6 | 55,644 |
Tags: implementation, strings
Correct Solution:
```
from collections import defaultdict
def def_value():
return 0
def is_subsequence(s1, s2, m, n):
if m == 0:
return True
if n == 0:
return False
if s1[m - 1] == s2[n - 1]:
return is_subsequence(s1, s2, m - 1, n - 1)
return is_subsequence(s1, s2, m, n - 1)
... | output | 1 | 27,822 | 6 | 55,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,823 | 6 | 55,646 |
Tags: implementation, strings
Correct Solution:
```
str1=list(input())
str2=list(input())
alp='abcdefghijklmnopqrstuvwxyz'
trav=dict()
for i in alp:
trav[i]=False
for i in range(0,len(str2)):
if(trav[str2[i]]==False):
if(str1.count(str2[i])<str2.count(str2[i])):
print('need tree')
... | output | 1 | 27,823 | 6 | 55,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,824 | 6 | 55,648 |
Tags: implementation, strings
Correct Solution:
```
def ss(s,t):
j=0
for i in s:
if t[j]==i:
j+=1
if j==len(t):
return True
s=input()
t = input()
d1 = sorted(s)
d2 = sorted(t)
if d1==d2:
print("array")
elif ss(s,t):
print("automaton")
elif ss(d1,d2):
print("bo... | output | 1 | 27,824 | 6 | 55,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,825 | 6 | 55,650 |
Tags: implementation, strings
Correct Solution:
```
import sys,math,bisect
inf = float('inf')
mod = (10**9)+7
"=========================="
def lcm(a,b):
return int((a/math.gcd(a,b))*b)
def gcd(a,b):
return int(math.gcd(a,b))
def tobinary(n):
return bin(n)[2:]
def binarySearch(a,x):
i = bisect.bisect_l... | output | 1 | 27,825 | 6 | 55,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word ... | instruction | 0 | 27,826 | 6 | 55,652 |
Tags: implementation, strings
Correct Solution:
```
# from math import *
# from itertools import combinations
from sys import stdin
input = stdin.readline
def issub(a, b):
i = 0
for ch in a:
if i < len(b) and ch == b[i]:
i += 1
return i == len(b)
s, t = input().strip(), input().strip()... | output | 1 | 27,826 | 6 | 55,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,827 | 6 | 55,654 |
Yes | output | 1 | 27,827 | 6 | 55,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,828 | 6 | 55,656 |
Yes | output | 1 | 27,828 | 6 | 55,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,829 | 6 | 55,658 |
Yes | output | 1 | 27,829 | 6 | 55,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,830 | 6 | 55,660 |
Yes | output | 1 | 27,830 | 6 | 55,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,831 | 6 | 55,662 |
No | output | 1 | 27,831 | 6 | 55,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,832 | 6 | 55,664 |
No | output | 1 | 27,832 | 6 | 55,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,833 | 6 | 55,666 |
No | output | 1 | 27,833 | 6 | 55,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.
At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English... | instruction | 0 | 27,834 | 6 | 55,668 |
No | output | 1 | 27,834 | 6 | 55,669 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,636 | 6 | 57,272 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input().lower()
s = set(s)
if(len(s) == 26):
print("YES")
else:
print("NO")
``` | output | 1 | 28,636 | 6 | 57,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,637 | 6 | 57,274 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
my_str = input().upper()
alphabet = "QWERTYUIOPASDFGHJKLZXCVBNM"
i = 0
while i<26 and alphabet[i] in my_str:
i += 1
if i==26:
print ("YES")
else:
print ("NO")
``` | output | 1 | 28,637 | 6 | 57,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,638 | 6 | 57,276 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
s=input()
x=s.lower()
x=set(x)
if len(x)==26:
print("YES")
else:
print("NO")
``` | output | 1 | 28,638 | 6 | 57,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,639 | 6 | 57,278 |
Tags: implementation, strings
Correct Solution:
```
print("YES") if input() and len(set(input().upper()))>=26 else print("NO")
``` | output | 1 | 28,639 | 6 | 57,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,640 | 6 | 57,280 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input()
s = s.lower()
s = set(char for char in s)
if len(s) == 26:
print("YES")
else:
print("NO")
``` | output | 1 | 28,640 | 6 | 57,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,641 | 6 | 57,282 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
a = input()
a = a.lower()
b = 'abcdefghijklmnopqrstuvwxyz'
s = 0
if len(a)<26:
print('NO')
else:
for i in b:
if i in a:
s+=1
else:
s+=0
if s==26:
print('YES')
else:
print('NO')
... | output | 1 | 28,641 | 6 | 57,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,642 | 6 | 57,284 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
s=list(input())
for i in range(len(s)):
if 90>= ord(s[i]) >=65:
s[i]=chr(ord(s[i])+32)
s=set(s)
if len(s)==26:
print('YES')
else:
print('NO')
``` | output | 1 | 28,642 | 6 | 57,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A word or a sentence in some language is called a pangram if all the characters of the alphabet of this language appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.
You are given ... | instruction | 0 | 28,643 | 6 | 57,286 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
m=input()
if n<26:
print("NO")
else:
s=m.lower()
d={0,}
for i in s:
d.add(i)
if len(d)>26:
print("YES")
else:
print("NO")
``` | output | 1 | 28,643 | 6 | 57,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,749 | 6 | 57,498 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.... | output | 1 | 28,749 | 6 | 57,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,750 | 6 | 57,500 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
N = int( input() )
A = [ input() for i in range( N ) ]
for i in range( N - 1, 0, -1 ):
if A[ i - 1 ] > A[ i ]:
ptr = 0
while ptr < len( A[ i ] ) and A[ i - 1 ][ ptr ] == A[ i ][ ptr ]:
ptr += 1
A[ i - 1 ] = A[ i - 1 ][ : ptr ... | output | 1 | 28,750 | 6 | 57,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,751 | 6 | 57,502 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
import sys,os,io
# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
input = sys.stdin.readline
n = int(input())
a = []
for i in range (n):
a.append(input().strip())
a.reverse()
ans = [a[0]]
for i in range (1,n):
if a[i]>ans[... | output | 1 | 28,751 | 6 | 57,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,752 | 6 | 57,504 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
n = int(input())
hashtags = []
for i in range(n):
hashtags.append(input())
for i in range(n-2,-1,-1):
if(hashtags[i]>hashtags[i+1]):
pointer =0
while pointer<len(hashtags[i+1]) and hashtags[i][pointer]==hashtags[i+1][poin... | output | 1 | 28,752 | 6 | 57,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,753 | 6 | 57,506 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
import sys
input = sys.stdin.readline
def gcd(a, b):
if a == 0:
return b
return gcd(b % a, a)
def lcm(a, b):
return (a * b) / gcd(a, b)
def main():
n=int(input())
a=[]
for i in range(n):
s=input()
... | output | 1 | 28,753 | 6 | 57,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,754 | 6 | 57,508 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
import sys
input = sys.stdin.readline
n = int(input())
a = []
for i in range(n):
s = input()
s = s[:len(s) - 1]
a.append(s)
for i in range(n-2, -1, -1):
l, r = a[i], a[i+1]
for j in range(len(l)):
if j >= len(r) or ... | output | 1 | 28,754 | 6 | 57,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,755 | 6 | 57,510 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
def sorting(string, string1):
if len(string) > len(string1):
string = string[:len(string1)]
for q in range(len(string)):
if string[q] > string1[q]:
string = string[:q]
break
return string
n = i... | output | 1 | 28,755 | 6 | 57,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a part... | instruction | 0 | 28,756 | 6 | 57,512 |
Tags: binary search, greedy, implementation, strings
Correct Solution:
```
n = int(input())
inp = [0] * n
for i in range(n):
inp[i] = input()
def common_str(a, b):
l = 1
for i in range(1, len(a)):
if a[i] != b[i]:
break
l += 1
return a[:l]
for i in range(n - 1, 0, -1):
if inp[i] < inp[i - 1]:
inp... | output | 1 | 28,756 | 6 | 57,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates ... | instruction | 0 | 28,757 | 6 | 57,514 |
Yes | output | 1 | 28,757 | 6 | 57,515 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.