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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Every string was counted only one time.
Then, he ... | instruction | 0 | 28,296 | 0 | 56,592 |
Tags: greedy, strings
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,k=map(int,input().split())
s=list(input())
t=list(input())
z,ans=0,0
# idx=-1
# for i in range(n):
# if s[i]=... | output | 1 | 28,296 | 0 | 56,593 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Every string was counted only one time.
Then, he ... | instruction | 0 | 28,297 | 0 | 56,594 |
Tags: greedy, strings
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
... | output | 1 | 28,297 | 0 | 56,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Every string was counted only one time.
Then, he ... | instruction | 0 | 28,298 | 0 | 56,596 |
Tags: greedy, strings
Correct Solution:
```
n,k=map(int,input().split())
s,t,cu=input(),input(),[1]
for i in range(n):
cu+=[cu[-1]*2-(s[i]=='b')-(t[i]=='a')]
if cu[-1]>=k:cu[-1]=k;break
print(sum(cu)+(n-i-1)*k-1)
``` | output | 1 | 28,298 | 0 | 56,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Every string was counted only one time.
Then, he ... | instruction | 0 | 28,299 | 0 | 56,598 |
Tags: greedy, strings
Correct Solution:
```
d = {'a': 0, 'b': 1}
def process(s, t, k):
n = len(s)
answer = 0
D = 0
final_i = n
for i in range(n):
d1 = d[s[i]]
d2 = d[t[i]]
D = 2*(D)+d2-d1
if D+1 < k:
answer+=(D+1)
else:
final_i = i
... | output | 1 | 28,299 | 0 | 56,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Every string was counted only one time.
Then, he ... | instruction | 0 | 28,300 | 0 | 56,600 |
Tags: greedy, strings
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
def main():
n, k = map(int, input().split())
s = input().strip()
t = input().strip()
diff, ans = 0, 0
for i in range(n):
if diff +... | output | 1 | 28,300 | 0 | 56,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Every string was counted only one time.
Then, he ... | instruction | 0 | 28,301 | 0 | 56,602 |
Tags: greedy, strings
Correct Solution:
```
n, k = map(int, input().split())
a = input()
b = input()
res = 0
ans = 0
for i in range(0, n):
res = min(res * 2 + (b[i] == 'b') - (a[i] == 'b'), k)
ans += min(res + 1, k)
print(ans)
``` | output | 1 | 28,301 | 0 | 56,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Eve... | instruction | 0 | 28,302 | 0 | 56,604 |
No | output | 1 | 28,302 | 0 | 56,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Eve... | instruction | 0 | 28,303 | 0 | 56,606 |
No | output | 1 | 28,303 | 0 | 56,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Eve... | instruction | 0 | 28,304 | 0 | 56,608 |
No | output | 1 | 28,304 | 0 | 56,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, the Fair Nut has written k strings of length n, consisting of letters "a" and "b". He calculated c β the number of strings that are prefixes of at least one of the written strings. Eve... | instruction | 0 | 28,305 | 0 | 56,610 |
No | output | 1 | 28,305 | 0 | 56,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,306 | 0 | 56,612 |
Tags: greedy, strings
Correct Solution:
```
def replace(f :int, t :int, c :int):
if c == 0:
return
global s
tc = c
if t < f:
for i in range(n):
if tc == 0:
break
if s[i] == f:
s[i] = t
tc -= 1
else:
for i... | output | 1 | 28,306 | 0 | 56,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,307 | 0 | 56,614 |
Tags: greedy, strings
Correct Solution:
```
from sys import stdin,stdout
# input=stdin.readline
mod=10**9+7
t=1
for _ in range(t):
n=int(input())
s=input()
a=s.count('0')
b=s.count('1')
c=s.count('2')
ans=[i for i in s]
val=n//3
ind=-1
while c>val:
ind+=1
if ans[ind]=... | output | 1 | 28,307 | 0 | 56,615 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,308 | 0 | 56,616 |
Tags: greedy, strings
Correct Solution:
```
if __name__ == '__main__':
n = int(input())
row = input()
totals = [row.count('0'), row.count('1'), row.count('2')]
flows = []
for i in range(3):
flows.append([0, 0, 0])
goal = n // 3
goals = [t - goal for t in totals]
for i, g ... | output | 1 | 28,308 | 0 | 56,617 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,309 | 0 | 56,618 |
Tags: greedy, strings
Correct Solution:
```
from collections import Counter
n = int(input())
s = input().strip()
x = n // 3
cnt = Counter(s)
cnt.update({'0': 0, '1': 0, '2': 0})
if cnt['0'] == cnt['1'] == cnt['2']:
print(s)
exit()
while max(cnt.values()) != min(cnt.values()):
p = cnt['0']
q = cnt['1']... | output | 1 | 28,309 | 0 | 56,619 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,310 | 0 | 56,620 |
Tags: greedy, strings
Correct Solution:
```
n = int(input())
m = n//3
s = list(input())
zero, one, two = 0, 0, 0
for si in s:
if si=='0':
zero += 1
elif si=='1':
one += 1
else:
two += 1
zero_lack = max(0, m-zero)
one_lack = max(0, m-one)
two_lack = max(0, m-two)
if zero>m:
zer... | output | 1 | 28,310 | 0 | 56,621 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,311 | 0 | 56,622 |
Tags: greedy, strings
Correct Solution:
```
n = int(input())
s = input()
s = list(s)
import collections
c = collections.Counter(s)
num_balance = n // 3
c0, c1, c2 = 0,0,0
c0 = c["0"] - num_balance
c1 = c["1"] - num_balance
c2 = c["2"] - num_balance
#print("{0} {1} {2}: {3}".format(c0,c1,c2,s))
for i in range(n):
i... | output | 1 | 28,311 | 0 | 56,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,312 | 0 | 56,624 |
Tags: greedy, strings
Correct Solution:
```
# v.3
n = int(input())
s = input()
c = [0] * 3
for i in ['0','1','2']:
c[int(i)] = s.count(i)
td = [0] * 3
ndiv3 = n // 3
for i in range(3):
td[i] = ndiv3 - c[i]
md = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
for f in range(3):
for t in range(3):
if td[f] < 0 a... | output | 1 | 28,312 | 0 | 56,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of characters in this string with other characters to... | instruction | 0 | 28,313 | 0 | 56,626 |
Tags: greedy, strings
Correct Solution:
```
# 265ms 4500KB
def replace_char_from_start(n, result, nb_to_replace_counter, char, char1, char2=None):
index = 0
while index < n and nb_to_replace_counter[char] > 0:
if result[index] == char:
if nb_to_replace_counter[char1] < 0:
re... | output | 1 | 28,313 | 0 | 56,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,314 | 0 | 56,628 |
Yes | output | 1 | 28,314 | 0 | 56,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,315 | 0 | 56,630 |
Yes | output | 1 | 28,315 | 0 | 56,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,316 | 0 | 56,632 |
Yes | output | 1 | 28,316 | 0 | 56,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,317 | 0 | 56,634 |
Yes | output | 1 | 28,317 | 0 | 56,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,318 | 0 | 56,636 |
No | output | 1 | 28,318 | 0 | 56,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,319 | 0 | 56,638 |
No | output | 1 | 28,319 | 0 | 56,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,320 | 0 | 56,640 |
No | output | 1 | 28,320 | 0 | 56,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of exactly n characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings.
Your task is to replace minimum number of cha... | instruction | 0 | 28,321 | 0 | 56,642 |
No | output | 1 | 28,321 | 0 | 56,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,454 | 0 | 56,908 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import os
import heapq
import sys,threading
import math
import bisect
import operator
from collections import defaultdict
sys.setrecursionlimit(10**5)
from io import BytesIO, IOBase
def gcd(a,b):
if b==0:
return a
... | output | 1 | 28,454 | 0 | 56,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,455 | 0 | 56,910 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
#from __future__ import print_function, division #... | output | 1 | 28,455 | 0 | 56,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,456 | 0 | 56,912 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
# I am not talented. I am obsessed. Conor McGregor
# by : Blue Edge - Create some chaos
# import sys
# sys.stdin = open('input.txt', 'r')
for _ in range(int(input())):
n=int(input())
s=list(map(int,input()))
if n=... | output | 1 | 28,456 | 0 | 56,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,457 | 0 | 56,914 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math
#setrecursionlimit(10**6)
rl = lambda: stdin.... | output | 1 | 28,457 | 0 | 56,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,458 | 0 | 56,916 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
from collections import deque
def main():
for _ in range(int(input())):
n = int(input())
s = list(input())
ans = []
... | output | 1 | 28,458 | 0 | 56,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,459 | 0 | 56,918 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
"""
Code of Ayush Tiwari
Codeforces: servermonk
Codechef: ayush572000
"""
# import sys
# input = sys.stdin.buffer.readline
def solution():
# This is the main code
n=int(input())
s=list(input())
zero=[]
... | output | 1 | 28,459 | 0 | 56,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,460 | 0 | 56,920 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = input()
cans = 1
ans = [1]
now = 1
lasts = [2, int(a[0])]
if int(a[0]) == 0:
zero = [1]
one = []
else:
zero = []
... | output | 1 | 28,460 | 0 | 56,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subs... | instruction | 0 | 28,461 | 0 | 56,922 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import sys
reader = (line.rstrip() for line in sys.stdin)
input = reader.__next__
def getInts():
return [int(s) for s in input().split()]
def getInt():
return int(input())
def getStrs():
return [s for s in input(... | output | 1 | 28,461 | 0 | 56,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,462 | 0 | 56,924 |
Yes | output | 1 | 28,462 | 0 | 56,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,463 | 0 | 56,926 |
Yes | output | 1 | 28,463 | 0 | 56,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,464 | 0 | 56,928 |
Yes | output | 1 | 28,464 | 0 | 56,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,465 | 0 | 56,930 |
Yes | output | 1 | 28,465 | 0 | 56,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,466 | 0 | 56,932 |
No | output | 1 | 28,466 | 0 | 56,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,467 | 0 | 56,934 |
No | output | 1 | 28,467 | 0 | 56,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,468 | 0 | 56,936 |
No | output | 1 | 28,468 | 0 | 56,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string b... | instruction | 0 | 28,469 | 0 | 56,938 |
No | output | 1 | 28,469 | 0 | 56,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings s1 and s2 from two different frequencies as signals. They are suspecting tha... | instruction | 0 | 28,592 | 0 | 57,184 |
No | output | 1 | 28,592 | 0 | 57,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings s1 and s2 from two different frequencies as signals. They are suspecting tha... | instruction | 0 | 28,593 | 0 | 57,186 |
No | output | 1 | 28,593 | 0 | 57,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings s1 and s2 from two different frequencies as signals. They are suspecting tha... | instruction | 0 | 28,594 | 0 | 57,188 |
No | output | 1 | 28,594 | 0 | 57,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings s1 and s2 from two different frequencies as signals. They are suspecting tha... | instruction | 0 | 28,595 | 0 | 57,190 |
No | output | 1 | 28,595 | 0 | 57,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings ti. Each string has cost ci.
Let's define the function of string <image>, where ps, i is the number of occurrences of s in ti, |s| is the length of the string s. Find th... | instruction | 0 | 28,675 | 0 | 57,350 |
No | output | 1 | 28,675 | 0 | 57,351 |
Provide a correct Python 3 solution for this coding contest problem.
You are given strings s and t. Find one longest string that is a subsequence of both s and t.
Constraints
* s and t are strings consisting of lowercase English letters.
* 1 \leq |s|, |t| \leq 3000
Input
Input is given from Standard Input in the f... | instruction | 0 | 28,908 | 0 | 57,816 |
"Correct Solution:
```
s = list(input())
t = list(input())
dp = [[0] * (len(t) + 1) for i in range(len(s) + 1)]
num = []
for i in range(len(s)):
for j in range(len(t)):
if(s[i] == t[j]):
dp[i + 1][j + 1] = dp[i][j] + 1
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1], dp[i + 1][j + 1])
a... | output | 1 | 28,908 | 0 | 57,817 |
Provide a correct Python 3 solution for this coding contest problem.
You are given strings s and t. Find one longest string that is a subsequence of both s and t.
Constraints
* s and t are strings consisting of lowercase English letters.
* 1 \leq |s|, |t| \leq 3000
Input
Input is given from Standard Input in the f... | instruction | 0 | 28,909 | 0 | 57,818 |
"Correct Solution:
```
s,t=input(),input()
a,b=len(s),len(t)
DP=[[0]*(b+1) for _ in range(a+1)]
for i in range(a):
for j in range(b):
if s[i]==t[j]:
DP[i+1][j+1]=DP[i][j]+1
else:
DP[i+1][j+1]=max(DP[i+1][j],DP[i][j+1])
ans=''
while a and b:
if DP[a][b]==DP[a-1][b]:
... | output | 1 | 28,909 | 0 | 57,819 |
Provide a correct Python 3 solution for this coding contest problem.
You are given strings s and t. Find one longest string that is a subsequence of both s and t.
Constraints
* s and t are strings consisting of lowercase English letters.
* 1 \leq |s|, |t| \leq 3000
Input
Input is given from Standard Input in the f... | instruction | 0 | 28,910 | 0 | 57,820 |
"Correct Solution:
```
S = input()
T = input()
dp = [[0] * (len(T) + 1) for i in range(len(S) + 1)]
for i in range(len(S)):
for j in range(len(T)):
if S[i] == T[j]:
dp[i + 1][j + 1] = dp[i][j] + 1
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
s = len(S)
t = len(T)
ans = ""
whil... | output | 1 | 28,910 | 0 | 57,821 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.