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.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,204 | 6 | 78,408 |
Yes | output | 1 | 39,204 | 6 | 78,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,205 | 6 | 78,410 |
Yes | output | 1 | 39,205 | 6 | 78,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,206 | 6 | 78,412 |
Yes | output | 1 | 39,206 | 6 | 78,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,207 | 6 | 78,414 |
Yes | output | 1 | 39,207 | 6 | 78,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,208 | 6 | 78,416 |
No | output | 1 | 39,208 | 6 | 78,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,209 | 6 | 78,418 |
No | output | 1 | 39,209 | 6 | 78,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,210 | 6 | 78,420 |
No | output | 1 | 39,210 | 6 | 78,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The process of mammoth's genome decoding in Berland comes to its end!
One of the few remaining tasks is to restore unrecognized nucleotides in a found chain s. Each nucleotide is coded with a c... | instruction | 0 | 39,211 | 6 | 78,422 |
No | output | 1 | 39,211 | 6 | 78,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,965 | 6 | 79,930 |
Tags: brute force, implementation
Correct Solution:
```
def adjacent(M,i,j,n):
count=0
x=[-1,1,0,0]
y=[0,0,1,-1]
for q in range(4):
a=x[q]+i
b=y[q]+j
if(a>=0 and a<n and b>=0 and b<n):
if (M[a][b]=='o'):
count+=1
return count
n=int(input())
M=[]
f... | output | 1 | 39,965 | 6 | 79,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,966 | 6 | 79,932 |
Tags: brute force, implementation
Correct Solution:
```
def pad(a):
l = [[0 for i in range(len(a[0])+2)]]
for i in range(len(a)):
c = [0]
c+=a[i]
c+=[0]
l.append(c)
l.append([0 for i in range(len(a[0])+2)])
return l
n = int(input())
c = []
for i in range(n):
s = list(... | output | 1 | 39,966 | 6 | 79,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,967 | 6 | 79,934 |
Tags: brute force, implementation
Correct Solution:
```
import sys
import math
n = int(sys.stdin.readline())
varr = []
for i in range(n):
varr.append([x for x in (sys.stdin.readline())[:n]])
for i in range(n):
val = 0
for j in range(n):
if(j - 1 >= 0):
val += 1 if varr[i][j ... | output | 1 | 39,967 | 6 | 79,935 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,968 | 6 | 79,936 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
a = []
for i in range(n):
a.append(input()[0:n])
for i in range(n):
for j in range(n):
c = 0
f = 0
if i-1 >= 0 and a[i-1][j] == 'o':
c += 1
if j-1 >= 0 and a[i][j-1] == 'o':
c += 1
... | output | 1 | 39,968 | 6 | 79,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,969 | 6 | 79,938 |
Tags: brute force, implementation
Correct Solution:
```
import sys
inf = float("inf")
# sys.setrecursionlimit(10000000)
# abc='abcdefghijklmnopqrstuvwxyz'
# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's':... | output | 1 | 39,969 | 6 | 79,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,970 | 6 | 79,940 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
l1=[]
flag=0
for i in range(n):
l2=list(input())
l1.append(l2)
flag=0
for i in range(n):
for j in range(n):
c=0
if (i+1)<n:
if l1[i+1][j]=='o':
c+=1
if (i-1)>-1:
if l1[i-1][... | output | 1 | 39,970 | 6 | 79,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,971 | 6 | 79,942 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
a=[]
for i in range(0,n):
a.append(input())
s=''
for i in range(0,n):
s=s+'t'
a.append(s)
a.insert(0,s)
for i in range(0,len(a)):
a[i]='t'+a[i]+'t'
flag=0
for i in range(1,n+1):
c=0
for j in range(1,n+1):
... | output | 1 | 39,971 | 6 | 79,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesn't know how to solve it. Can you help him?
Given a n × n checkerboard. Each cell of the board has either character 'x', or character 'o'. Is it true that eac... | instruction | 0 | 39,972 | 6 | 79,944 |
Tags: brute force, implementation
Correct Solution:
```
a=int(input())
b=[]
for i in range(a):
b.append(input())
true='YES'
for i in range(a):
for j in range(a):
total=0
for k in [[1,0],[-1,0],[0,1],[0,-1]]:
try:
if b[i+k[0]][j+k[1]]=='o' and i+k[0]>-1 and j+k[1]>-1:
... | output | 1 | 39,972 | 6 | 79,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,981 | 6 | 79,962 |
Tags: math, strings
Correct Solution:
```
s = input()
lst=[0]
for i in range(1,len(s)+1):
lst.append(lst[-1]+1/i)
x=lst[len(s)]
res=0
for i,j in enumerate(s):
if j in 'AEIOUY':
res+=x
x+=lst[len(s)-i-1]-lst[i+1]
print(res)
``` | output | 1 | 39,981 | 6 | 79,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,982 | 6 | 79,964 |
Tags: math, strings
Correct Solution:
```
def main():
s = input()
n = len(s)
b = [1.0 / (i + 1) for i in range(n)]
d = [(n - i) / (i + 1) for i in range(n)]
d = d[::-1]
for i in range(1, n):
b[i] += b[i - 1]
d[i] += d[i - 1]
res = 0.0
for i in range(n):
if not(s[i... | output | 1 | 39,982 | 6 | 79,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,983 | 6 | 79,966 |
Tags: math, strings
Correct Solution:
```
"""
Codeforces Contest 289 Div 2 Problem E
Author : chaotic_iak
Language: Python 3.4.2
"""
################################################### SOLUTION
def main():
s = read(0)
m = [1 if i in "AEIOUY" else 0 for i in s]
n = len(m)
m1 = [0]
m2 = [0]
fo... | output | 1 | 39,983 | 6 | 79,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,984 | 6 | 79,968 |
Tags: math, strings
Correct Solution:
```
arr = []
for i in input():
arr.append(i)
n = len(arr)
res = 0
add = [0] * (n + 10)
add[n] = 1 / n
for i in range(n - 1, 0, -1):
add[i] = add[i + 1] + 1 / i
for i in range(n):
if arr[i] in ['I', 'E', 'A', 'O', 'U', 'Y']:
x = min(i, n - i - 1)
y = max(... | output | 1 | 39,984 | 6 | 79,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,985 | 6 | 79,970 |
Tags: math, strings
Correct Solution:
```
def sum_vowels(s, i, j):
ans = 0
for index in range(i, j + 1):
if s[index] in "AEIOUY":
ans += 1
return ans
if __name__ == "__main__":
s = input()
n = len(s)
ans = 0
num = 0
den_inv = 0
prev_sum = sum_vowels(s, 0, n - 1)
for i in range(int(n / 2)):
num += ... | output | 1 | 39,985 | 6 | 79,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,986 | 6 | 79,972 |
Tags: math, strings
Correct Solution:
```
from itertools import accumulate
vowels = set('AIUEOY')
s = input()
n = len(s)
vs = list(accumulate(0 if i == 0 else 1 / i for i in range(n + 1)))
r = 0
v = 0
for i in range(n):
v += vs[n - i] - vs[i]
if s[i] in vowels:
r += v
print(r)
``` | output | 1 | 39,986 | 6 | 79,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,987 | 6 | 79,974 |
Tags: math, strings
Correct Solution:
```
lst = [0] + [_ in "IEAOUY" for _ in input()]
n = len(lst) - 1
for _ in range(1, n + 1):
lst[_] += lst[_ - 1]
ans = 0
s = 0
for l in range(1, n // 2 + 1):
s += lst[n - l + 1] - lst[l - 1]
ans += s / l + s / (n - l + 1)
if n % 2:
s += lst[n // 2 + 1] - lst[n // 2]... | output | 1 | 39,987 | 6 | 79,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Sasha was studying in the seventh grade, he started listening to music a lot. In order to evaluate which songs he likes more, he introduced the notion of the song's prettiness. The title of the song is a word consisting of uppercase Lat... | instruction | 0 | 39,988 | 6 | 79,976 |
Tags: math, strings
Correct Solution:
```
ss = list(map(lambda c: c in "IEAOUY", input()))
n = len(ss)
w = [0] * n
for i in range(1, n+1):
w[0] += 1 / i
w[n-1] = w[0]
sigma = w[0]
for i in range(1, (n - 1) // 2 + 1):
sigma -= 1 / i + 1 / (n + 1 - i)
w[n-i-1] = w[i] = w[i-1] + sigma
ans = 0
for i in ran... | output | 1 | 39,988 | 6 | 79,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,690 | 6 | 81,380 |
Tags: implementation
Correct Solution:
```
str = input()
ln = len(str)
for i in range(ln):
str = str.replace('//', '/', 1)
i -= 1
if str[len(str) - 1] == '/' and len(str) > 1:
str = str[:-1]
print(str)
``` | output | 1 | 40,690 | 6 | 81,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,691 | 6 | 81,382 |
Tags: implementation
Correct Solution:
```
a=input()
b=0
bb=list(a)
d=len(bb)
for c in range(d-1,0,-1):
if(bb[c]=='/'):
del bb[c]
else:
break
for c in bb:
if c=='/' and b==0:
b=b+1
print("/",end="")
elif c!='/':
b=0
print(c,end="")
``` | output | 1 | 40,691 | 6 | 81,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,692 | 6 | 81,384 |
Tags: implementation
Correct Solution:
```
s = input()
out = ''
slash = 0
for elem in s:
if elem=='/':
if slash==0:
slash=1
out+='/'
else:
out+=elem
slash=0
if len(out)>1:
if out[-1]=='/':
out = out[:-1]
print(out)
``` | output | 1 | 40,692 | 6 | 81,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,693 | 6 | 81,386 |
Tags: implementation
Correct Solution:
```
seq=input()
b="/"+"/".join(s for s in seq.split("/")if s)
print(b)
``` | output | 1 | 40,693 | 6 | 81,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,694 | 6 | 81,388 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 3 11:39:52 2020
@author: gajraj
"""
a = input().split('/')
print('/' + '/'.join([i for i in a if i != '']))
``` | output | 1 | 40,694 | 6 | 81,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,695 | 6 | 81,390 |
Tags: implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
read_tuple = lambda _type: map(_type, input().split(' '))
def solve():
string = list(input().replace('\n', ''))
res = []
prev = None
for ch in string:
if not (ch == '/' and ch == prev):
res.append(ch)
... | output | 1 | 40,695 | 6 | 81,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,696 | 6 | 81,392 |
Tags: implementation
Correct Solution:
```
def main():
#get the input
path = input()
#iterate over the string
for charIndex in range(len(path)-1):
#while we have 2 consecutive // and we didnt excedte the limit of the list delete one of them
while charIndex + 1 < l... | output | 1 | 40,696 | 6 | 81,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new operating system BerOS has a nice feature. It is possible to use any number of characters '/' as a delimiter in path instead of one traditional '/'. For example, strings //usr///local//nginx/sbin// and /usr/local/nginx///sbin are equ... | instruction | 0 | 40,697 | 6 | 81,394 |
Tags: implementation
Correct Solution:
```
s = input()
a = []
p =True
a.append("")
i = 0
for x in s:
if x != '/':
p = True
a[i] += x
else:
if p and a[len(a) - 1] != "":
a.append("")
i += 1
p = False
if len(a) == 1 and a[0] == "":
print('/')
else:
r... | output | 1 | 40,697 | 6 | 81,395 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of... | instruction | 0 | 40,751 | 6 | 81,502 |
Tags: implementation
Correct Solution:
```
from sys import stdin
def main():
n= int(stdin.readline())
t=[]
c=[]
while n > 0:
t.append(stdin.readline().strip())
n-=1
for i in t:
if i not in c:
c.append(i)
print(len(c))
main()
``` | output | 1 | 40,751 | 6 | 81,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,855 | 6 | 81,710 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
n = int(input())
s = input()
sens = [[]]
for i in s:
sens[-1].append(i)
if i in ['.', '!', '?']:
sens.append([])
for i in range(len(sens)):
if sens[i]:
sens[i] = ''.join(sens[i])
sens[i] = sens[i].strip()
if len(... | output | 1 | 40,855 | 6 | 81,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,856 | 6 | 81,712 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
import re
n = int(input())
s = input()
l = re.split(r"\.|\?|\!", s)
r = [len(x.strip())+1 for x in l if len(x.strip())>0]
if max(r)>n:
print("Impossible")
else:
cur = -1
ans = 1
for i in r:
if cur+i+1<=n:
cur=cur+i+1
... | output | 1 | 40,856 | 6 | 81,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,857 | 6 | 81,714 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
n=int(input())
q,w,r=[],[],[]
for x in input().split('.'):q+=x.split('!')
for x in q:w+=x.split('?')
for x in w:
if x:r+=[x.strip()+'.']
i=0
while i<len(r):
if len(r[i])>n:print('Impossible');exit()
while i+1<len(r) and len(r[i])+len(r... | output | 1 | 40,857 | 6 | 81,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,858 | 6 | 81,716 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
n=int(input())
s=input()
S=[]
e=""
for i in range(len(s)):
if(s[i] in ".?!"):
e+=s[i]
S.append(e)
e=""
else:
e+=s[i]
acc=0
ans=0
for item in S:
x=len(item)
if(acc==0):
i=0
while(item[i]=='... | output | 1 | 40,858 | 6 | 81,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,859 | 6 | 81,718 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
class CodeforcesTask70BSolution:
def __init__(self):
self.result = ''
self.n = 0
self.message = ''
def read_input(self):
self.n = int(input())
self.message = input()
def process_task(self):
sent... | output | 1 | 40,859 | 6 | 81,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,860 | 6 | 81,720 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
n = int(input())
text = input()
text = text.replace("?", ".").replace("!", ".").split(".")
ans = True
qnt = 0
acu = n+1
for i in range (len(text)):
if (len (text[i]) == 0):
continue
#text[i] = text[i].strip()
#print ("|" + text[i])
... | output | 1 | 40,860 | 6 | 81,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,861 | 6 | 81,722 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
import re
segment_size = int(input())
sentences = re.findall('\w.*?[.?!]', input())
for sentence in sentences:
if len(sentence) > segment_size:
print('Impossible')
import sys
sys.exit()
len_current = len(sentences[0])
num_seg... | output | 1 | 40,861 | 6 | 81,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each containing n characters (which is the size of one... | instruction | 0 | 40,862 | 6 | 81,724 |
Tags: expression parsing, greedy, strings
Correct Solution:
```
# /*******************************************************************************
# * Author : Quantum Of Excellence
# * email : quantumofexcellence (at) gmail (dot) com
# * copyright : 2014 - 2015
# * date : 6 - 11 - 2015
# * Judg... | output | 1 | 40,862 | 6 | 81,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,863 | 6 | 81,726 |
Yes | output | 1 | 40,863 | 6 | 81,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,864 | 6 | 81,728 |
Yes | output | 1 | 40,864 | 6 | 81,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,865 | 6 | 81,730 |
Yes | output | 1 | 40,865 | 6 | 81,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,866 | 6 | 81,732 |
Yes | output | 1 | 40,866 | 6 | 81,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,867 | 6 | 81,734 |
No | output | 1 | 40,867 | 6 | 81,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,868 | 6 | 81,736 |
No | output | 1 | 40,868 | 6 | 81,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,869 | 6 | 81,738 |
No | output | 1 | 40,869 | 6 | 81,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fangy the little walrus, as all the modern walruses, loves to communicate via text messaging. One day he faced the following problem: When he sends large texts, they are split into parts each co... | instruction | 0 | 40,870 | 6 | 81,740 |
No | output | 1 | 40,870 | 6 | 81,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange.
Victor thinks that if a word contains two consecutive vowels, then it's kinda weird and it needs to be repla... | instruction | 0 | 40,926 | 6 | 81,852 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
i=0
while i<len(s):
if s[i]=='a' or s[i]=='i' or s[i]=='u' or s[i]=='e' or s[i]=='o' or s[i]=='y':
j=i
while j<len(s) and (s[j]=='a' or s[j]=='i' or s[j]=='u' or s[j]=='e' or s[j]=='o' or s[j]=='y'):
j+=1
s=s[:i+... | output | 1 | 40,926 | 6 | 81,853 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.