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.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following strings are subsequences: "wowwo", "wowo", "oo", "... | instruction | 0 | 84,292 | 0 | 168,584 |
Tags: dp, strings
Correct Solution:
```
s=input()
n=len(s)
num=s.count('v')
left=[0]*n
right=[0]*n
#print(s.count('o'))
for i in range(1,n):
if s[i]=='v' and s[i-1]=='v':
left[i]=left[i-1]+1
else: left[i]=left[i-1]
for i in range(n-2,-1,-1):
if s[i]=='v' and s[i+1]=='v':
right[i]=right[i+1]+... | output | 1 | 84,292 | 0 | 168,585 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following strings are subsequences: "wowwo", "wowo", "oo", "... | instruction | 0 | 84,293 | 0 | 168,586 |
Tags: dp, strings
Correct Solution:
```
def count( temp , n):
cw =0
co = 0
result = 0
C=0
for i in range(n):
if(temp[i]=='w'):
cw+=1
result+=C
continue
if(temp[i]=='o'):
co+=1
C+=cw
continue
else:
... | output | 1 | 84,293 | 0 | 168,587 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following strings are subsequences: "wowwo", "wowo", "oo", "... | instruction | 0 | 84,294 | 0 | 168,588 |
Tags: dp, strings
Correct Solution:
```
s = input()
w = o = total = 0
for i in range(len(s)):
if s[i] == 'o':
o += w
elif i > 0 and s[i - 1] == 'v':
w += 1
total += o
print(total)
``` | output | 1 | 84,294 | 0 | 168,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following strings are subsequences: "wowwo", "wowo", "oo", "... | instruction | 0 | 84,295 | 0 | 168,590 |
Tags: dp, strings
Correct Solution:
```
import sys
import math
#input = sys.stdin.readline
s=input()
count=0
if s[0]=="o":
count=0
else:
count=1
pre=[0]
for i in range(1,len(s)):
if s[i]=="v" and count>0:
pre.append(pre[-1]+1)
count+=1
elif s[i]=="v" and count==0:
pre.append(pre[i-1])
count=1
else:
pre.... | output | 1 | 84,295 | 0 | 168,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following strings are subsequences: "wowwo", "wowo", "oo", "... | instruction | 0 | 84,296 | 0 | 168,592 |
Tags: dp, strings
Correct Solution:
```
s = input()
i = 0
count = [0, 0, 0]
ans = 0
while i < len(s):
j = i
while j + 1 < len(s) and s[j + 1] == s[i]:
j += 1
size = j - i + 1
if s[i] == 'v':
num = size - 1
count[2] += num * count[1]
count[0] += num
else:
count... | output | 1 | 84,296 | 0 | 168,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,297 | 0 | 168,594 |
Yes | output | 1 | 84,297 | 0 | 168,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,298 | 0 | 168,596 |
Yes | output | 1 | 84,298 | 0 | 168,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,299 | 0 | 168,598 |
Yes | output | 1 | 84,299 | 0 | 168,599 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,300 | 0 | 168,600 |
Yes | output | 1 | 84,300 | 0 | 168,601 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,301 | 0 | 168,602 |
No | output | 1 | 84,301 | 0 | 168,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,302 | 0 | 168,604 |
No | output | 1 | 84,302 | 0 | 168,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,303 | 0 | 168,606 |
No | output | 1 | 84,303 | 0 | 168,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly zero or all) characters. For example, for the string a="wowwo", the following str... | instruction | 0 | 84,304 | 0 | 168,608 |
No | output | 1 | 84,304 | 0 | 168,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,119 | 0 | 170,238 |
Tags: data structures, dp
Correct Solution:
```
import io
import os
from collections import Counter, defaultdict, deque
def solve(N, S):
# Same color must be already sorted since they can't be swapped with each other
# Greedily build increasing subsequences
indices = [[0]]
# last value -> which list
... | output | 1 | 85,119 | 0 | 170,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,120 | 0 | 170,240 |
Tags: data structures, dp
Correct Solution:
```
n = int(input())
s = str(input())
lit = ['Z']*26
wyn = ''
m = -1
for x in s:
for y in range(26):
if lit[y] <= x:
wyn += str(y + 1)+ ' '
lit[y] = x
if y+1 >= m:
m = y+1
break
print(m)
print(wyn)
``... | output | 1 | 85,120 | 0 | 170,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,121 | 0 | 170,242 |
Tags: data structures, dp
Correct Solution:
```
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def ... | output | 1 | 85,121 | 0 | 170,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,122 | 0 | 170,244 |
Tags: data structures, dp
Correct Solution:
```
class RangeMinimumQuery:
def __init__(self, n, func=min, inf=float("inf")):
self.n0 = 2**(n-1).bit_length()
self.op = func
self.inf = inf
self.data = [self.inf]*(2*self.n0)
def query(self, l,r):
l += self.n0
r += se... | output | 1 | 85,122 | 0 | 170,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,123 | 0 | 170,246 |
Tags: data structures, dp
Correct Solution:
```
n = int(input())
a = list(map(lambda c: ord(c)-97, input()))
color = [0]*26
ans = [0]*n
last = -1
for i, c in enumerate(a):
col = 0
if last <= c:
last = c
if color[c] == 0:
col = 1
else:
col = color[c] & (-color[c])... | output | 1 | 85,123 | 0 | 170,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,124 | 0 | 170,248 |
Tags: data structures, dp
Correct Solution:
```
input()
arr = input().strip()
ans = []
color = 0
mx = [0 for i in range(26)]
for i in arr:
c = ord(i) - 97
_max = 0
for j in range(c+1,26):
_max = max(_max,mx[j])
ans.append(_max + 1)
color = max(color,ans[-1])
mx[c] = max(mx[c],_max+1)
... | output | 1 | 85,124 | 0 | 170,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,125 | 0 | 170,250 |
Tags: data structures, dp
Correct Solution:
```
from sys import stdin
input = stdin.readline
n = int(input()) ; s = input().strip()
tmp = [s[0]] + ['' for i in range(25)] ; ans = [1]
for i in range(1,len(s)):
for j in range(26):
if tmp[j] <= s[i]:
ans.append(j+1)
tmp[j] = s[i]
... | output | 1 | 85,125 | 0 | 170,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is a hard 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 | 85,126 | 0 | 170,252 |
Tags: data structures, dp
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 defaultd... | output | 1 | 85,126 | 0 | 170,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,127 | 0 | 170,254 |
Yes | output | 1 | 85,127 | 0 | 170,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,128 | 0 | 170,256 |
Yes | output | 1 | 85,128 | 0 | 170,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,129 | 0 | 170,258 |
Yes | output | 1 | 85,129 | 0 | 170,259 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,130 | 0 | 170,260 |
Yes | output | 1 | 85,130 | 0 | 170,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,131 | 0 | 170,262 |
No | output | 1 | 85,131 | 0 | 170,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,132 | 0 | 170,264 |
No | output | 1 | 85,132 | 0 | 170,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,133 | 0 | 170,266 |
No | output | 1 | 85,133 | 0 | 170,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is a hard 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 differ... | instruction | 0 | 85,134 | 0 | 170,268 |
No | output | 1 | 85,134 | 0 | 170,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,167 | 0 | 170,334 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
def stringflip(l,s):
news=""
for i in range(l):
if s[l-i-1]=="0":
news+="1"
else:
news+="0"
if l!=n:
news+=s[l:]
return news
def flip(n,a,b):
if a==b:
print(0)
... | output | 1 | 85,167 | 0 | 170,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,168 | 0 | 170,336 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
from sys import stdin
# input=stdin.buffer.readline
input=lambda : stdin.readline().strip()
lin=lambda :list(map(int,input().split()))
iin=lambda :int(input())
main=lambda :map(int,input().split())
from math import ceil,sqrt,factorial,log
fro... | output | 1 | 85,168 | 0 | 170,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,169 | 0 | 170,338 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]
for _ in range(inp()):
n = inp()
a = input().strip()
b = input().strip()
... | output | 1 | 85,169 | 0 | 170,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,170 | 0 | 170,340 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
# code by RAJ BHAVSAR
for _ in range(int(input())):
n = int(input())
a = list(str(input()))
b = list(str(input()))
res = []
for i in range(n):
if(a[i] != b[i]):
res += [i+1,1,i+1]
print(len(res),*res)
``` | output | 1 | 85,170 | 0 | 170,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,171 | 0 | 170,342 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
import sys
ii = lambda: sys.stdin.readline().strip()
idata = lambda: [int(x) for x in ii().split()]
def solve():
n = int(ii())
data_a = ii()
data_b = ii()
ans = []
for i in range(n - 1):
if data_a[i] != data_a[i ... | output | 1 | 85,171 | 0 | 170,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,172 | 0 | 170,344 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
t1=int(input())
for _ in range(t1):
n=int(input())
a2=input()
a=[]
for i in range(n):
a.append(a2[i])
b=input()
ans=[]
for i in range(n-1,-1,-1):
if a[i]!=b[i]:
temp=[]
for j in range(i+1):
temp.appen... | output | 1 | 85,172 | 0 | 170,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,173 | 0 | 170,346 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
t=int(input())
for _ in range(t):
n=int(input())
res=[]
a=input()
b=input()
i=n-1
while i>0:
if a[i]!=b[i]:
res.append(str(i+1))
res.append("1")
res.append(str(i + 1))
... | output | 1 | 85,173 | 0 | 170,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and... | instruction | 0 | 85,174 | 0 | 170,348 |
Tags: constructive algorithms, data structures, strings
Correct Solution:
```
from math import *
from collections import *
from random import *
from bisect import *
import sys
input=sys.stdin.readline
d={'1':'0','0':'1'}
t=int(input())
while(t):
t-=1
n=int(input())
a=input().rstrip("\n")
b=input().rstri... | output | 1 | 85,174 | 0 | 170,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,175 | 0 | 170,350 |
Yes | output | 1 | 85,175 | 0 | 170,351 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,176 | 0 | 170,352 |
Yes | output | 1 | 85,176 | 0 | 170,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,177 | 0 | 170,354 |
Yes | output | 1 | 85,177 | 0 | 170,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,178 | 0 | 170,356 |
Yes | output | 1 | 85,178 | 0 | 170,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,179 | 0 | 170,358 |
No | output | 1 | 85,179 | 0 | 170,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,180 | 0 | 170,360 |
No | output | 1 | 85,180 | 0 | 170,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,181 | 0 | 170,362 |
No | output | 1 | 85,181 | 0 | 170,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem ... | instruction | 0 | 85,182 | 0 | 170,364 |
No | output | 1 | 85,182 | 0 | 170,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dreamoon has a string s and a pattern string p. He first removes exactly x characters from s obtaining string s' as a result. Then he calculates <image> that is defined as the maximal number of non-overlapping substrings equal to p that can ... | instruction | 0 | 85,328 | 0 | 170,656 |
Tags: dp, strings
Correct Solution:
```
s, p = input(), input()
n, m = len(s) + 1, len(p)
d = [[0] * n for t in range(n)]
for x in range(1, n):
i, j = x, m
while i and j:
j -= s[i - 1] == p[j - 1]
i -= 1
if not j:
for y in range(i + 1): d[x][y + x - i - m] = d[i][y] + 1
for y in ... | output | 1 | 85,328 | 0 | 170,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).
Input
The only line of input contains a string s of length between 1 and 10... | instruction | 0 | 85,337 | 0 | 170,674 |
Tags: brute force, dp, greedy, implementation, strings
Correct Solution:
```
s = input()
pA = -10
pB = -10
al = []
bl = []
for i in range(len(s)):
if s[i] == 'A' and pA == -10:
pA = i
if s[i] == 'B' and pB == -10:
pB = i
if s[i] == 'A':
if (i - pB == 1):
bl.append(i)
... | output | 1 | 85,337 | 0 | 170,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).
Input
The only line of input contains a string s of length between 1 and 10... | instruction | 0 | 85,338 | 0 | 170,676 |
Tags: brute force, dp, greedy, implementation, strings
Correct Solution:
```
import re
mystr = input()
r1 = mystr.find('AB')
r2 = mystr.rfind('BA')
if r1 != -1 and r2 != -1 and r1 != r2-1 and r2 != r1-1:
print('YES')
else:
r1 = mystr.find('BA')
r2 = mystr.rfind('AB')
if r1 != -1 and r2 != -1 and r1 != r2-1 and r2 !... | output | 1 | 85,338 | 0 | 170,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).
Input
The only line of input contains a string s of length between 1 and 10... | instruction | 0 | 85,339 | 0 | 170,678 |
Tags: brute force, dp, greedy, implementation, strings
Correct Solution:
```
s = input()
ab, ba = [], []
for i in range(len(s) - 1):
if s[i:i+2] == 'AB': ab.append(i)
elif s[i:i+2] == 'BA': ba.append(i)
for u in ab:
for v in ba:
if abs(u-v) > 1:
print('YES')
exit()
print('NO... | output | 1 | 85,339 | 0 | 170,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).
Input
The only line of input contains a string s of length between 1 and 10... | instruction | 0 | 85,340 | 0 | 170,680 |
Tags: brute force, dp, greedy, implementation, strings
Correct Solution:
```
s = input()
matches = {'AB': [], 'BA': []}
for i in range(len(s) - 1):
substring = s[i:i + 2]
if substring in matches:
matches[substring].append(i)
if not matches['AB'] or not matches['BA']:
print('NO')
elif abs(max(match... | output | 1 | 85,340 | 0 | 170,681 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.