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.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.
You are given a string s consisting of n... | instruction | 0 | 13,418 | 0 | 26,836 |
Tags: constructive algorithms, dp, graphs, greedy, sortings
Correct Solution:
```
n=int(input())
s=input()
rama=[]
for i in range(n):
rama.append(ord(s[i])-96)
visit=[1 for i in range(27)]
a=[]
maxi=0
for i in range(n):
p=visit[rama[i]]
a.append(p)
maxi=max(maxi,p)
for j in range(rama[i]):
v... | output | 1 | 13,418 | 0 | 26,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,419 | 0 | 26,838 |
Yes | output | 1 | 13,419 | 0 | 26,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,420 | 0 | 26,840 |
Yes | output | 1 | 13,420 | 0 | 26,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,421 | 0 | 26,842 |
Yes | output | 1 | 13,421 | 0 | 26,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,422 | 0 | 26,844 |
Yes | output | 1 | 13,422 | 0 | 26,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,423 | 0 | 26,846 |
No | output | 1 | 13,423 | 0 | 26,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,424 | 0 | 26,848 |
No | output | 1 | 13,424 | 0 | 26,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,425 | 0 | 26,850 |
No | output | 1 | 13,425 | 0 | 26,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are diffe... | instruction | 0 | 13,426 | 0 | 26,852 |
No | output | 1 | 13,426 | 0 | 26,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,454 | 0 | 26,908 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
def solve(arr, n , m ) :
fix = arr[0]
for t in range(m) :
ch = fix[t]
for k in range(26) :
fix[t] = chr(ord('a') + k )
flag = True
for i in range(n) :
... | output | 1 | 13,454 | 0 | 26,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,455 | 0 | 26,910 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
t=int(input())
for _ in range(t):
n,m=map(int,input().split())
s=[]
for _ in range(n):
s.append(input())
ans=list(s[0])
l=[]
for i in range(m):
for j in range(26):
ans[i]=... | output | 1 | 13,455 | 0 | 26,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,456 | 0 | 26,912 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
import math
import string
def change(s, i, symbol):
ans = s[0:i] + symbol + s[(i + 1):]
return ans
def check(a, n, m, s):
ans = 0
for i in range(n):
cnt = 0
for j in range(m):
if(a[i][j] != s[j]):
cnt +=... | output | 1 | 13,456 | 0 | 26,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,457 | 0 | 26,914 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
import string
def spystring(words):
def neigh(word):
candidates = {word}
for i in range(len(word)):
for c in string.ascii_lowercase:
candidates.add(word[:i] + c + word[i + 1... | output | 1 | 13,457 | 0 | 26,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,458 | 0 | 26,916 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
import sys
import math
from collections import defaultdict,deque
import heapq
t = int(sys.stdin.readline())
for _ in range(t):
n,m = map(int,sys.stdin.readline().split())
l =[]
for i in range(n):
s = sys.stdin.readlin... | output | 1 | 13,458 | 0 | 26,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,459 | 0 | 26,918 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
#import math
#from functools import lru_cache
#import heapq
#from collections import defaultdict
#from collections import Counter
#from sys import stdout
#from sys import setrecursionlimit
from sys import stdin
input = stdi... | output | 1 | 13,459 | 0 | 26,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,460 | 0 | 26,920 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
# cook your dish here
import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
import math
import collections
from sys import stdin,stdout,setrecursionlimit
import bisect as bs
setrecursionli... | output | 1 | 13,460 | 0 | 26,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strings differs from s in at most one position. Form... | instruction | 0 | 13,461 | 0 | 26,922 |
Tags: bitmasks, brute force, constructive algorithms, dp, hashing, strings
Correct Solution:
```
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
def gift():
for _ in range(t):
n,m = list(map(int,input().split()))
arrys=[]
for i in range(n):
kap=list(i... | output | 1 | 13,461 | 0 | 26,923 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,463 | 0 | 26,926 |
Yes | output | 1 | 13,463 | 0 | 26,927 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,464 | 0 | 26,928 |
Yes | output | 1 | 13,464 | 0 | 26,929 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,465 | 0 | 26,930 |
Yes | output | 1 | 13,465 | 0 | 26,931 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,466 | 0 | 26,932 |
No | output | 1 | 13,466 | 0 | 26,933 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,467 | 0 | 26,934 |
No | output | 1 | 13,467 | 0 | 26,935 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,468 | 0 | 26,936 |
No | output | 1 | 13,468 | 0 | 26,937 |
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 a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,469 | 0 | 26,938 |
No | output | 1 | 13,469 | 0 | 26,939 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n strings a_1, a_2, …, a_n: all of them have the same length m. The strings consist of lowercase English letters.
Find any string s of length m such that each of the given n strin... | instruction | 0 | 13,470 | 0 | 26,940 |
No | output | 1 | 13,470 | 0 | 26,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,888 | 0 | 27,776 |
Tags: implementation
Correct Solution:
```
n = input()
s = input()
n = int(n)
print('1'*min(s.count('1'), 1)+'0'*s.count('0'))
``` | output | 1 | 13,888 | 0 | 27,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,889 | 0 | 27,778 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input()
flag=0
ans=""
for ele in s:
if ele=='1' and flag==0:
ans+=ele
flag=1
if ele=='0':
ans+=ele
print(ans)
``` | output | 1 | 13,889 | 0 | 27,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,890 | 0 | 27,780 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
m=''
counter=0
for i in range(n):
if s[i]== '1':
counter=counter+1
for j in range(n-counter):
m=m+'0'
if s=='0':
print(0)
else:
print('1'+m)
``` | output | 1 | 13,890 | 0 | 27,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,891 | 0 | 27,782 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
while('01' in s or '11' in s):
if('01' in s):
s=s.replace('01','10')
elif('11' in s):
s=s.replace('11','1')
print(s)
``` | output | 1 | 13,891 | 0 | 27,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,892 | 0 | 27,784 |
Tags: implementation
Correct Solution:
```
num = int(input())
s = input()
if "1" not in s:
print(s)
else:
ans = "1" + s.count("0")*"0"
print(ans)
``` | output | 1 | 13,892 | 0 | 27,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,893 | 0 | 27,786 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
if n==1:
print(s)
exit()
s=list(s)
zero=s.count('0')
print('1'+'0'*zero)
``` | output | 1 | 13,893 | 0 | 27,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,894 | 0 | 27,788 |
Tags: implementation
Correct Solution:
```
# int(input())
# [int(s) for s in input().split()]
# input()
def solve():
n = int(input())
s = input()
if s.count("1") == 0:
print(s)
else:
print("1"+"0"*(s.count("0")))
if __name__ == "__main__":
solve()
``` | output | 1 | 13,894 | 0 | 27,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
You can perform two different operations on this ... | instruction | 0 | 13,895 | 0 | 27,790 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
z=0
o=0
for c in s:
if c=="1":
o+=1
else:
z+=1
t=""
for i in range(z):
t+="0"
if o==0:
print(t)
else:
t="1"+t
print(t)
``` | output | 1 | 13,895 | 0 | 27,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,896 | 0 | 27,792 |
Yes | output | 1 | 13,896 | 0 | 27,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,897 | 0 | 27,794 |
Yes | output | 1 | 13,897 | 0 | 27,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,898 | 0 | 27,796 |
Yes | output | 1 | 13,898 | 0 | 27,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,899 | 0 | 27,798 |
Yes | output | 1 | 13,899 | 0 | 27,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,900 | 0 | 27,800 |
No | output | 1 | 13,900 | 0 | 27,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,901 | 0 | 27,802 |
No | output | 1 | 13,901 | 0 | 27,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,902 | 0 | 27,804 |
No | output | 1 | 13,902 | 0 | 27,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
String can be called correct if it consists of characters "0" and "1" and there are no redundant leading zeroes. Here are some examples: "0", "10", "1001".
You are given a correct string s.
Yo... | instruction | 0 | 13,903 | 0 | 27,806 |
No | output | 1 | 13,903 | 0 | 27,807 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The answer to the query is the number of substrings of... | instruction | 0 | 14,465 | 0 | 28,930 |
Tags: dp, hashing, strings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
def main():
# n, k = map(int, input().split())
# s = input()
s=input()
n=len(s)
palin = [[0 for _ in range(n)] for _ in range(n)]
dp = [[0 for _ in range(n)] for _ in range(n)]
for sz in rang... | output | 1 | 14,465 | 0 | 28,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The ans... | instruction | 0 | 14,466 | 0 | 28,932 |
No | output | 1 | 14,466 | 0 | 28,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The ans... | instruction | 0 | 14,467 | 0 | 28,934 |
No | output | 1 | 14,467 | 0 | 28,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The ans... | instruction | 0 | 14,468 | 0 | 28,936 |
No | output | 1 | 14,468 | 0 | 28,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The ans... | instruction | 0 | 14,469 | 0 | 28,938 |
No | output | 1 | 14,469 | 0 | 28,939 |
Provide a correct Python 3 solution for this coding contest problem.
Given are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.
* Let s' be the concatenation of 10^{100} copies of s. t is a... | instruction | 0 | 14,796 | 0 | 29,592 |
"Correct Solution:
```
from string import ascii_lowercase
from bisect import bisect_right
s = input()
t = input()
p = {c: [] for c in s}
for x, c in enumerate(s):
p[c].append(x)
z = 0
l = -1
for c in t:
if c not in p:
print(-1)
break
x = bisect_right(p[c], l)
if x == len(p[c]):
x... | output | 1 | 14,796 | 0 | 29,593 |
Provide a correct Python 3 solution for this coding contest problem.
Given are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.
* Let s' be the concatenation of 10^{100} copies of s. t is a... | instruction | 0 | 14,797 | 0 | 29,594 |
"Correct Solution:
```
s=input()
t=input()
ans1=0
ans2=0
m=len(s)
n=len(t)
s=s+s
for i in range(n):
a=s.find(t[i],ans2)
if a==-1:
print(-1)
exit()
if a>=m:
ans1+=1
ans2=a%m+1
print((ans1*m)+ans2)
``` | output | 1 | 14,797 | 0 | 29,595 |
Provide a correct Python 3 solution for this coding contest problem.
Given are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.
* Let s' be the concatenation of 10^{100} copies of s. t is a... | instruction | 0 | 14,798 | 0 | 29,596 |
"Correct Solution:
```
import bisect
s = list(input())
t = list(input())
if len(set(t)-set(s)) > 0:
print(-1)
exit()
c = set(s)
dic = {}
for char in c:
dic[char] = []
for i in range(len(s)):
dic[s[i]] += [i]
last = -1
r = 0
for char in t:
tmp = last
idx = bisect.bisect_right(dic[char], last)
if idx < ... | output | 1 | 14,798 | 0 | 29,597 |
Provide a correct Python 3 solution for this coding contest problem.
Given are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.
* Let s' be the concatenation of 10^{100} copies of s. t is a... | instruction | 0 | 14,799 | 0 | 29,598 |
"Correct Solution:
```
s = input()
t = input()
temp = s[:]
cnt = 0
strmax = len(t)
ans = 0
for i in t:
if s.find(i)==-1:
print("-1")
exit(0)
while cnt<strmax:
num = temp.find(t[cnt])
if num != -1:
ans+=num+1
temp = temp[num+1:]
cnt+=1
else:
ans+=len(temp)
temp = s[:]
print(ans)
``` | output | 1 | 14,799 | 0 | 29,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.