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.
You are given a string s consisting only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of the given string or report that it is impossib... | instruction | 0 | 36,886 | 0 | 73,772 |
Tags: constructive algorithms, greedy, sortings, strings
Correct Solution:
```
T=int(input())
for i in range(T):
s=input()
if(s!=s[::-1]):
print(s)
elif(s==s[::-1]):
if(s.count(s[-1])==len(s)):
print(-1)
else:
print(s[1:]+s[0])
``` | output | 1 | 36,886 | 0 | 73,773 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,887 | 0 | 73,774 |
Yes | output | 1 | 36,887 | 0 | 73,775 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,888 | 0 | 73,776 |
Yes | output | 1 | 36,888 | 0 | 73,777 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,889 | 0 | 73,778 |
Yes | output | 1 | 36,889 | 0 | 73,779 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,890 | 0 | 73,780 |
Yes | output | 1 | 36,890 | 0 | 73,781 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,891 | 0 | 73,782 |
No | output | 1 | 36,891 | 0 | 73,783 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,892 | 0 | 73,784 |
No | output | 1 | 36,892 | 0 | 73,785 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,893 | 0 | 73,786 |
No | output | 1 | 36,893 | 0 | 73,787 |
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 only of lowercase Latin letters.
You can rearrange all letters of this string as you wish. Your task is to obtain a good string by rearranging the letters of... | instruction | 0 | 36,894 | 0 | 73,788 |
No | output | 1 | 36,894 | 0 | 73,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,063 | 0 | 74,126 |
Tags: constructive algorithms, games
Correct Solution:
```
def palindrome(s):
n=len(s)
for i in range ((n+1)//2):
if s[i]!=s[n-i-1]:
return 0
return 1
def one(s):
n=len(s)
c=0
for i in range ((n+1)//2):
if s[i]!=s[n-i-1]:
c+=1
return c
for _ in range... | output | 1 | 37,063 | 0 | 74,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,064 | 0 | 74,128 |
Tags: constructive algorithms, games
Correct Solution:
```
for i in range(int(input())):
n = int(input())
s = input()
if s == s[::-1]:
print('DRAW' if n == s.count('1') else('BOB' if s.count('0') % 2 == 0 or s.count('0') == 1 else 'ALICE'))
else:
print('DRAW' if s.count('0') == 2 and n %... | output | 1 | 37,064 | 0 | 74,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,065 | 0 | 74,130 |
Tags: constructive algorithms, games
Correct Solution:
```
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
S = list(input())[: -1]
zero = S.count("0")
one = n - zero
diff = 0
for i in range(n): diff += S[i] != S[-1 - i]
if diff == 0:
if zero == 1:
print("BO... | output | 1 | 37,065 | 0 | 74,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,066 | 0 | 74,132 |
Tags: constructive algorithms, games
Correct Solution:
```
def getResult(n,s):
count = 0
for c in s:
if c == "0":
count +=1
v = check(s)
if v == 0:
if count%2==0 or count == 1:
return 'BOB'
else:
return "ALICE"
elif v == 1:
count -=... | output | 1 | 37,066 | 0 | 74,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,067 | 0 | 74,134 |
Tags: constructive algorithms, games
Correct Solution:
```
def divisors(M):
d=[]
i=1
while M>=i**2:
if M%i==0:
d.append(i)
if i**2!=M:
d.append(M//i)
i=i+1
return d
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + (... | output | 1 | 37,067 | 0 | 74,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,068 | 0 | 74,136 |
Tags: constructive algorithms, games
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BufferedIOBase, BytesIO, IOBase
def ispal(arr,n):
l=0
r=n-1
count=0
while l<r:
if arr[l]==arr[r]:
pass
else:
arr[l]=1
... | output | 1 | 37,068 | 0 | 74,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,069 | 0 | 74,138 |
Tags: constructive algorithms, games
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
from heapq import *
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open... | output | 1 | 37,069 | 0 | 74,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palindrome is a string that reads the same left to ri... | instruction | 0 | 37,070 | 0 | 74,140 |
Tags: constructive algorithms, games
Correct Solution:
```
#b1
for _ in range(int(input())):
input()
inp=str(input())
zz=0
zo=0
for i in range(len(inp)):
if inp[i]==inp[-i-1] and inp[i]=="0":
zz+=1
if inp[i]!=inp[-i-1]:
zo+=1
win=0
zo/=2
... | output | 1 | 37,070 | 0 | 74,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,071 | 0 | 74,142 |
Yes | output | 1 | 37,071 | 0 | 74,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,072 | 0 | 74,144 |
Yes | output | 1 | 37,072 | 0 | 74,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,073 | 0 | 74,146 |
Yes | output | 1 | 37,073 | 0 | 74,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,074 | 0 | 74,148 |
Yes | output | 1 | 37,074 | 0 | 74,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,075 | 0 | 74,150 |
No | output | 1 | 37,075 | 0 | 74,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,076 | 0 | 74,152 |
No | output | 1 | 37,076 | 0 | 74,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,077 | 0 | 74,154 |
No | output | 1 | 37,077 | 0 | 74,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that the given string s in the easy version is initially a palindrome, this condition is not always true for the hard version.
A palind... | instruction | 0 | 37,078 | 0 | 74,156 |
No | output | 1 | 37,078 | 0 | 74,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given P, a permutation of (1,\ 2,\ ...\ N).
A string S of length N consisting of `0` and `1` is a good string when it meets the following criterion:
* The sequences X and Y are constru... | instruction | 0 | 37,571 | 0 | 75,142 |
No | output | 1 | 37,571 | 0 | 75,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Some programming website is establishing a secure communication protocol. For security reasons, they want to choose several more or less random strings.
Initially, they have a string s consisti... | instruction | 0 | 37,750 | 0 | 75,500 |
No | output | 1 | 37,750 | 0 | 75,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova has won n trophies in different competitions. Each trophy is either golden or silver. The trophies are arranged in a row.
The beauty of the arrangement is the length of the longest subsegm... | instruction | 0 | 37,780 | 0 | 75,560 |
No | output | 1 | 37,780 | 0 | 75,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova has won n trophies in different competitions. Each trophy is either golden or silver. The trophies are arranged in a row.
The beauty of the arrangement is the length of the longest subsegm... | instruction | 0 | 37,783 | 0 | 75,566 |
No | output | 1 | 37,783 | 0 | 75,567 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a permutation p consisting of exactly 26 integers from 1 to 26 (since it is a permutation, each integer from 1 to 26 occurs in p exactly once) and two strings s and t consisting of... | instruction | 0 | 37,856 | 0 | 75,712 |
No | output | 1 | 37,856 | 0 | 75,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a permutation p consisting of exactly 26 integers from 1 to 26 (since it is a permutation, each integer from 1 to 26 occurs in p exactly once) and two strings s and t consisting of... | instruction | 0 | 37,857 | 0 | 75,714 |
No | output | 1 | 37,857 | 0 | 75,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a permutation p consisting of exactly 26 integers from 1 to 26 (since it is a permutation, each integer from 1 to 26 occurs in p exactly once) and two strings s and t consisting of... | instruction | 0 | 37,858 | 0 | 75,716 |
No | output | 1 | 37,858 | 0 | 75,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a permutation p consisting of exactly 26 integers from 1 to 26 (since it is a permutation, each integer from 1 to 26 occurs in p exactly once) and two strings s and t consisting of... | instruction | 0 | 37,859 | 0 | 75,718 |
No | output | 1 | 37,859 | 0 | 75,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new str... | instruction | 0 | 38,264 | 0 | 76,528 |
Tags: bitmasks, brute force, dp, implementation, strings
Correct Solution:
```
from sys import stdin, stdout
K = 20
def findAllStrings(s):
n = len(s)
sDict = {}
for i in range(1,K+1):
sDict[i]=set()
for x in range(n-i+1):
sDict[i].add(s[x:x+i])
return sDict
n = int(stdin.r... | output | 1 | 38,264 | 0 | 76,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new str... | instruction | 0 | 38,265 | 0 | 76,530 |
Tags: bitmasks, brute force, dp, implementation, strings
Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split... | output | 1 | 38,265 | 0 | 76,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new str... | instruction | 0 | 38,266 | 0 | 76,532 |
Tags: bitmasks, brute force, dp, implementation, strings
Correct Solution:
```
from sys import stdin, stdout
k = 20
def findAllStrings(s):
n = len(s)
sdict = {}
for i in range(1,k+1):
sdict[i]=set()
for x in range(n-i+1):
sdict[i].add(s[x:x+i])
return sdict
n = int(stdin.read... | output | 1 | 38,266 | 0 | 76,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new str... | instruction | 0 | 38,267 | 0 | 76,534 |
Tags: bitmasks, brute force, dp, implementation, strings
Correct Solution:
```
from math import log
n = int(input())
p = [bin(p)[2:] for p in range(0,512)]
def mset(s):
ss = set()
for k in range(0,10):
for pi in range(0,2 ** k):
cs = p[pi]
cs = (k - len(cs)) * "0" + cs
... | output | 1 | 38,267 | 0 | 76,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new str... | instruction | 0 | 38,268 | 0 | 76,536 |
Tags: bitmasks, brute force, dp, implementation, strings
Correct Solution:
```
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
"""
created by shhuan at 2017/10/5 15:00
"""
N = int(input())
S = ['']
for i in range(N):
S.append(input())
M = int(input())
... | output | 1 | 38,268 | 0 | 76,537 |
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 s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation t... | instruction | 0 | 38,269 | 0 | 76,538 |
No | output | 1 | 38,269 | 0 | 76,539 |
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 s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation t... | instruction | 0 | 38,270 | 0 | 76,540 |
No | output | 1 | 38,270 | 0 | 76,541 |
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 s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation t... | instruction | 0 | 38,271 | 0 | 76,542 |
No | output | 1 | 38,271 | 0 | 76,543 |
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 s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation t... | instruction | 0 | 38,272 | 0 | 76,544 |
No | output | 1 | 38,272 | 0 | 76,545 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,273 | 0 | 76,546 |
Tags: brute force, dp
Correct Solution:
```
"""
tb
"""
s=input()
c=0
l=len(s)
arr=[0]
for i in s:
if i=='Q':
arr.append(arr[-1]+1)
else:
arr.append(arr[-1])
for i in range(l):
if s[i]=='A':
c=c+arr[i+1]*(arr[-1]-arr[i+1])
print(c)
``` | output | 1 | 38,273 | 0 | 76,547 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,274 | 0 | 76,548 |
Tags: brute force, dp
Correct Solution:
```
s = input()
res = 0
for i in range(0, len(s)):
if s[i] == 'Q':
for i in range(i + 1, len(s)):
if s[i] == 'A':
for i in range(i + 1, len(s)):
if s[i] == 'Q':
res += 1
print(res)
``` | output | 1 | 38,274 | 0 | 76,549 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,275 | 0 | 76,550 |
Tags: brute force, dp
Correct Solution:
```
a=[]
for i in input():
if i in "AQ":
a.append(i)
n=len(a)
count=0
for i in range(n):
for j in range(n):
for k in range(n):
if a[i]==a[k]=="Q" and a[j]=="A" and i<j<k:
count+=1
print(count)
``` | output | 1 | 38,275 | 0 | 76,551 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,276 | 0 | 76,552 |
Tags: brute force, dp
Correct Solution:
```
s = input()
res = 0
while True:
a = s.find("A")
if a == -1:
break
res += s[:a].count("Q") * s[a + 1:].count("Q")
s = s[:a] + s[a + 1:]
print(res)
``` | output | 1 | 38,276 | 0 | 76,553 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,277 | 0 | 76,554 |
Tags: brute force, dp
Correct Solution:
```
s = input()
cnt = 0
for i in range(len(s)):
for j in range(i + 1, len(s)):
for k in range(j + 1, len(s)):
if s[i] == s[k] == 'Q' and s[j] == 'A':
cnt += 1
print(cnt)
``` | output | 1 | 38,277 | 0 | 76,555 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,278 | 0 | 76,556 |
Tags: brute force, dp
Correct Solution:
```
s = str(input())
c=0
for i in range(len(s)):
for j in range(i,len(s)):
for k in range(j,len(s)):
if s[i]=="Q" and s[j]=="A" and s[k]=="Q": c+=1
print(c)
``` | output | 1 | 38,278 | 0 | 76,557 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,279 | 0 | 76,558 |
Tags: brute force, dp
Correct Solution:
```
a = 0
d = 0
ans = 0
for i in input():
if i == "Q":
ans += d
a += 1
elif i== "A":
d += a
print(ans)
``` | output | 1 | 38,279 | 0 | 76,559 |
Provide tags and a correct Python 3 solution for this coding contest problem.
"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.
Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the stri... | instruction | 0 | 38,280 | 0 | 76,560 |
Tags: brute force, dp
Correct Solution:
```
s=list(input())
cnt=0
for i in range(len(s)):
if s[i]=='Q':
for j in range(i,len(s)):
if s[j]=='A':
for k in range(j,len(s)):
if s[k]=='Q':
cnt+=1
print(cnt)
``` | output | 1 | 38,280 | 0 | 76,561 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.