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 have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,351 | 0 | 136,702 |
Yes | output | 1 | 68,351 | 0 | 136,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,352 | 0 | 136,704 |
Yes | output | 1 | 68,352 | 0 | 136,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,353 | 0 | 136,706 |
Yes | output | 1 | 68,353 | 0 | 136,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,354 | 0 | 136,708 |
Yes | output | 1 | 68,354 | 0 | 136,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,355 | 0 | 136,710 |
No | output | 1 | 68,355 | 0 | 136,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,356 | 0 | 136,712 |
No | output | 1 | 68,356 | 0 | 136,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,357 | 0 | 136,714 |
No | output | 1 | 68,357 | 0 | 136,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a string s consisting of n characters. Each character is either 0 or 1.
You can perform operations on the string. Each operation consists of two steps:
1. select an integer i from 1... | instruction | 0 | 68,358 | 0 | 136,716 |
No | output | 1 | 68,358 | 0 | 136,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,374 | 0 | 136,748 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
# from sys import stdin,stdout
# input=stdin.readline
import math
# t=int(input())
from collections import Counter
import bisect
for _ in range(int(input())):
n = int(input())
a = list(map(int,input()))
b = list(map(int,input(... | output | 1 | 68,374 | 0 | 136,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,375 | 0 | 136,750 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys,os,io
# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
input = sys.stdin.readline
for _ in range (int(input())):
n = int(input())
a = input().strip()
b = input().strip()
ind = [0]*len(a)
zc = 0... | output | 1 | 68,375 | 0 | 136,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,376 | 0 | 136,752 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
#region Header
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq
def input():
return sys.stdin.readline()[:-1]
# sys.setre... | output | 1 | 68,376 | 0 | 136,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,377 | 0 | 136,754 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
# aadiupadhyay
import os.path
from math import gcd, floor, ceil
from collections import *
from bisect import *
import sys
mod = 1000000007
INF = float('inf')
def st(): return list(sys.stdin.readline().strip())
def li(): return list(map(in... | output | 1 | 68,377 | 0 | 136,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,378 | 0 | 136,756 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
a = input()
b = input()
a = a + ' '
b = b + ' '
count = prefix = x = 0
for j in range(n):
if a[j] == '1':
x = x+1
else:
... | output | 1 | 68,378 | 0 | 136,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,379 | 0 | 136,758 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
"""
inp_start
6
10
0111010000
0100101100
4
0000
0000
3
001
000
12
010101010101
100110011010
6
000111
110100
1
1
0
inp_end
"""
tcs = int(input())
for tc in range(tcs):
n = int(input())
a = list(map(int, list(input())))
b = list(map(int... | output | 1 | 68,379 | 0 | 136,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,380 | 0 | 136,760 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import sys
from collections import *
from heapq import *
import math
import bisect
def input():
return sys.stdin.readline()
for _ in range(int(input())):
n=int(input())
a=list(input())
b=list(input())
same=False
... | output | 1 | 68,380 | 0 | 136,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 and each 1 becomes 0.
For example, suppose a=011... | instruction | 0 | 68,381 | 0 | 136,762 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
a = input()
b = input()
a = a + " "
b = b + " "
count = prefix = x = 0
for j in range(n):
if a[j] == '1':
x = x+1
else:
... | output | 1 | 68,381 | 0 | 136,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,382 | 0 | 136,764 |
Yes | output | 1 | 68,382 | 0 | 136,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,383 | 0 | 136,766 |
Yes | output | 1 | 68,383 | 0 | 136,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,384 | 0 | 136,768 |
Yes | output | 1 | 68,384 | 0 | 136,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,385 | 0 | 136,770 |
Yes | output | 1 | 68,385 | 0 | 136,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,386 | 0 | 136,772 |
No | output | 1 | 68,386 | 0 | 136,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,387 | 0 | 136,774 |
No | output | 1 | 68,387 | 0 | 136,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,388 | 0 | 136,776 |
No | output | 1 | 68,388 | 0 | 136,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a binary string a of length n. In one operation, you can select any prefix of a with an equal number of 0 and 1 symbols. Then all symbols in the prefix are inverted: each 0 becomes 1 an... | instruction | 0 | 68,389 | 0 | 136,778 |
No | output | 1 | 68,389 | 0 | 136,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of t... | instruction | 0 | 68,550 | 0 | 137,100 |
Tags: divide and conquer, hashing, sortings, strings
Correct Solution:
```
def getmin(s):
ls = len(s)
if ls % 2 == 1:
return s
s1 = getmin(s[:ls//2])
s2 = getmin(s[ls//2:])
return s1 + s2 if s1 < s2 else s2 + s1
s1 = input()
s2 = input()
print("YES") if getmin(s1) == getmin(s2) else print... | output | 1 | 68,550 | 0 | 137,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:
1. They are equal.
2. If we split string a into two halves of t... | instruction | 0 | 68,553 | 0 | 137,106 |
Tags: divide and conquer, hashing, sortings, strings
Correct Solution:
```
def smallest(s):
if len(s) % 2 == 1:
return s
s1 = smallest(s[:len(s)//2])
s2 = smallest(s[len(s)//2:])
if s1 < s2:
return s1 + s2
else:
return s2 + s1
a = input()
b = input()
if smallest(a) == smalle... | output | 1 | 68,553 | 0 | 137,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice wants to send an important message to Bob. Message a = (a1, ..., an) is a sequence of positive integers (characters).
To compress the message Alice wants to use binary Huffman coding. We ... | instruction | 0 | 68,591 | 0 | 137,182 |
No | output | 1 | 68,591 | 0 | 137,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice wants to send an important message to Bob. Message a = (a1, ..., an) is a sequence of positive integers (characters).
To compress the message Alice wants to use binary Huffman coding. We ... | instruction | 0 | 68,592 | 0 | 137,184 |
No | output | 1 | 68,592 | 0 | 137,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice wants to send an important message to Bob. Message a = (a1, ..., an) is a sequence of positive integers (characters).
To compress the message Alice wants to use binary Huffman coding. We ... | instruction | 0 | 68,593 | 0 | 137,186 |
No | output | 1 | 68,593 | 0 | 137,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice wants to send an important message to Bob. Message a = (a1, ..., an) is a sequence of positive integers (characters).
To compress the message Alice wants to use binary Huffman coding. We ... | instruction | 0 | 68,594 | 0 | 137,188 |
No | output | 1 | 68,594 | 0 | 137,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak prepares problems for a programming competition. Of course, it would be unprofessional to mention the sponsor name in the statement. Limak takes it seriously and he is going to change some words. To make it still possible to read,... | instruction | 0 | 68,611 | 0 | 137,222 |
Tags: dp
Correct Solution:
```
# http://codeforces.com/contest/771/problem/D
"""
DP-solution.
For each state (v, k, x, v_is_last_letter) we trial a step along the v, k and x
axes and check that
dp[future_state] = min(dp[future_state], dp[state] + cost_of_move)
Hence this implicitly reults in the one with least cost.
... | output | 1 | 68,611 | 0 | 137,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak prepares problems for a programming competition. Of course, it would be unprofessional to mention the sponsor name in the statement. Limak takes it seriously and he is going to change... | instruction | 0 | 68,612 | 0 | 137,224 |
No | output | 1 | 68,612 | 0 | 137,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak prepares problems for a programming competition. Of course, it would be unprofessional to mention the sponsor name in the statement. Limak takes it seriously and he is going to change... | instruction | 0 | 68,613 | 0 | 137,226 |
No | output | 1 | 68,613 | 0 | 137,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak prepares problems for a programming competition. Of course, it would be unprofessional to mention the sponsor name in the statement. Limak takes it seriously and he is going to change... | instruction | 0 | 68,614 | 0 | 137,228 |
No | output | 1 | 68,614 | 0 | 137,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak prepares problems for a programming competition. Of course, it would be unprofessional to mention the sponsor name in the statement. Limak takes it seriously and he is going to change... | instruction | 0 | 68,615 | 0 | 137,230 |
No | output | 1 | 68,615 | 0 | 137,231 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,853 | 0 | 137,706 |
"Correct Solution:
```
def change(n):
x=n[0]
count=1
ans=""
for i in n[1:]:
if i==x:count+=1
else:
ans+=str(count)
ans+=x
x=i
count=1
ans+=str(count)
ans+=x
return(ans)
while 1:
n=int(input())
if n==0:break
word=inpu... | output | 1 | 68,853 | 0 | 137,707 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,854 | 0 | 137,708 |
"Correct Solution:
```
while True:
n = int(input())
if not n:
break
ss = [s for s in input()[::-1]]
for i in range(n):
new = []
app = new.append
last = ss.pop()
count = 1
while ss:
a = ss.pop()
if a == last:
count += 1
else:
app(str(count))
app(l... | output | 1 | 68,854 | 0 | 137,709 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,855 | 0 | 137,710 |
"Correct Solution:
```
while True:
n = int(input())
if not n:
break
s = input().strip()
while n:
prev, cnt, new = s[0], 1, ''
for c in s[1:]:
if c == prev:
cnt += 1
else:
new += str(cnt) + prev
prev, cnt = c... | output | 1 | 68,855 | 0 | 137,711 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,856 | 0 | 137,712 |
"Correct Solution:
```
def runlen(a):
n = len(a)
result = []
count = 1
for i in range(n):
if i == n - 1 or a[i] != a[i + 1]:
result.append((count, a[i]))
count = 1
else:
count += 1
return result
def f(s):
rl = runlen(s)
result = ""
for... | output | 1 | 68,856 | 0 | 137,713 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,857 | 0 | 137,714 |
"Correct Solution:
```
def compress(digits):
compressed_list = list()
for digit in digits:
if compressed_list == [] or compressed_list[-1][1] != digit:
compressed_list.append([1, digit])
else:
compressed_list[-1][0] += 1
return compressed_list
def decompress(compressed_list):
new_digits =... | output | 1 | 68,857 | 0 | 137,715 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,858 | 0 | 137,716 |
"Correct Solution:
```
def main():
while True:
n = int(input())
if not n:
break
ss = [s for s in reversed(input())]
for i in range(n):
new = []
app = new.append
last = ss.pop()
count = 1
while ss:
a = ss.pop()
if a == last:
count += 1
... | output | 1 | 68,858 | 0 | 137,717 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,859 | 0 | 137,718 |
"Correct Solution:
```
while True:
n=int(input())
if n==0:break
s=input()
conv=""
for _ in range(n):
seq=1
pr=s[0]
for i in range(1,len(s)):
if pr==s[i]:seq+=1
else:
conv+=str(seq)+pr
pr=s[i]
seq=1
... | output | 1 | 68,859 | 0 | 137,719 |
Provide a correct Python 3 solution for this coding contest problem.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a time from the left end. Go, if the same number a contin... | instruction | 0 | 68,860 | 0 | 137,720 |
"Correct Solution:
```
def main():
while True:
n = int(input())
if not n:
break
ss = [s for s in input()[::-1]]
for i in range(n):
new = []
ext = new.extend
last = ss.pop()
count = 1
while ss:
a = ss.pop()
if a == last:
count += 1
e... | output | 1 | 68,860 | 0 | 137,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a string consisting of only numbers from 0 to 9, consider the operation of creating a new string from that string according to the following rules. Read the given string one character at a... | instruction | 0 | 68,867 | 0 | 137,734 |
No | output | 1 | 68,867 | 0 | 137,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,982 | 0 | 137,964 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
from functools import cmp_to_key
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if rank[i] <... | output | 1 | 68,982 | 0 | 137,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,983 | 0 | 137,966 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
from functools import cmp_to_key
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if... | output | 1 | 68,983 | 0 | 137,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,984 | 0 | 137,968 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if rank[i] < len(s) - 1:
while s[i ... | output | 1 | 68,984 | 0 | 137,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,985 | 0 | 137,970 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if rank[i] < len(s) - 1:
while max(... | output | 1 | 68,985 | 0 | 137,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,986 | 0 | 137,972 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
from functools import cmp_to_key
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if rank[i] <... | output | 1 | 68,986 | 0 | 137,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,987 | 0 | 137,974 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if rank[i] < len(s) - 1:
while max(... | output | 1 | 68,987 | 0 | 137,975 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.