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 a correct Python 3 solution for this coding contest problem.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and U be the string obtained by concatenating S and T in th... | instruction | 0 | 60,437 | 0 | 120,874 |
"Correct Solution:
```
n,k=map(int,input().split())
s=input()
u=s+s[::-1]
u=min((u[i:i+n])for i in range(n))
for i in range(n):
if u[i]!=u[0]:break
c=i
for _ in range(k-1):
c*=2
if c>n:break
print((u[0]*c+u[i:])[:n])
``` | output | 1 | 60,437 | 0 | 120,875 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and U be the string obtained by concatenating S and T in th... | instruction | 0 | 60,438 | 0 | 120,876 |
"Correct Solution:
```
N, K = map(int, input().split())
S = input()
SS = S + S[::-1]
D = []
for i in range(N):
D.append(SS[i:i+N])
D.sort()
B = D[0]
for i in range(N):
if B[i] != B[0]:
break
if i * 1 << (K - 1) > N:
print(B[0] * N)
else:
print((B[0] * (i * (1 << (K - 1))) + B[i:])[:N])
``` | output | 1 | 60,438 | 0 | 120,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,439 | 0 | 120,878 |
Yes | output | 1 | 60,439 | 0 | 120,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,440 | 0 | 120,880 |
Yes | output | 1 | 60,440 | 0 | 120,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,441 | 0 | 120,882 |
Yes | output | 1 | 60,441 | 0 | 120,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,442 | 0 | 120,884 |
Yes | output | 1 | 60,442 | 0 | 120,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,443 | 0 | 120,886 |
No | output | 1 | 60,443 | 0 | 120,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,444 | 0 | 120,888 |
No | output | 1 | 60,444 | 0 | 120,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,445 | 0 | 120,890 |
No | output | 1 | 60,445 | 0 | 120,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:
* Let T be the string obtained by reversing S, and... | instruction | 0 | 60,446 | 0 | 120,892 |
No | output | 1 | 60,446 | 0 | 120,893 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,495 | 0 | 120,990 |
"Correct Solution:
```
from collections import Counter
s = input()
counter = Counter(s)
a, b, c = [counter[e] for e in "abc"]
if max(a, b, c) - min(a, b, c) <= 1:
ans = "YES"
else:
ans = "NO"
print(ans)
``` | output | 1 | 60,495 | 0 | 120,991 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,496 | 0 | 120,992 |
"Correct Solution:
```
import collections
import math
S = list(input())
count = dict(collections.Counter(S))
m = list(count.values())
if len(m) == 1 and len(S) == 1: # 文字1種類のとき
print("YES")
elif len(m) == 1 and len(S) > 1:
print("NO")
elif len(m) == 2 and len(S) == 2:
print("YES")
elif len(m) == 2 and le... | output | 1 | 60,496 | 0 | 120,993 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,497 | 0 | 120,994 |
"Correct Solution:
```
S = input()
a = S.count('a')
b = S.count('b')
c = S.count('c')
if max(a, b, c) - min(a, b, c) > 1:
print('NO')
else:
print('YES')
``` | output | 1 | 60,497 | 0 | 120,995 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,498 | 0 | 120,996 |
"Correct Solution:
```
from collections import Counter
def solve(s):
freq = sorted(Counter(s).values())
if sum(freq) == 1:
return True
if sum(freq) == 2:
return freq[-1] == 1
return len(freq) == 3 and freq[2] - freq[0] <= 1
print('YES' if solve(input()) else 'NO')
``` | output | 1 | 60,498 | 0 | 120,997 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,499 | 0 | 120,998 |
"Correct Solution:
```
def main():
S = input()
a = S.count("a")
b = S.count("b")
c = S.count("c")
diff = max((a, b, c)) - min((a, b, c))
if diff <= 1:
print("YES")
else:
print("NO")
if __name__ == "__main__":
main()
``` | output | 1 | 60,499 | 0 | 120,999 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,500 | 0 | 121,000 |
"Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import Counter
def main():
S = input()
cnt = Counter()
for c in "abc":
cnt[c] = 0
cnt.update(S)
v = sorted(cnt.values())
ok = v[2] - v[0] <= 1
print("YES" if ok else "NO")
if __name__ == "__ma... | output | 1 | 60,500 | 0 | 121,001 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this... | instruction | 0 | 60,502 | 0 | 121,004 |
"Correct Solution:
```
S = input().strip()
C = {"a":0,"b":0,"c":0}
for i in range(len(S)):
C[S[i]] += 1
cmin = min(C["a"],C["b"],C["c"])
for x in C:
C[x] -= cmin
cmax = max(C["a"],C["b"],C["c"])
if cmax<=1:
print("YES")
else:
print("NO")
``` | output | 1 | 60,502 | 0 | 121,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of... | instruction | 0 | 60,503 | 0 | 121,006 |
Yes | output | 1 | 60,503 | 0 | 121,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of... | instruction | 0 | 60,505 | 0 | 121,010 |
Yes | output | 1 | 60,505 | 0 | 121,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of... | instruction | 0 | 60,507 | 0 | 121,014 |
No | output | 1 | 60,507 | 0 | 121,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of... | instruction | 0 | 60,508 | 0 | 121,016 |
No | output | 1 | 60,508 | 0 | 121,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.
He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of... | instruction | 0 | 60,509 | 0 | 121,018 |
No | output | 1 | 60,509 | 0 | 121,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like hi... | instruction | 0 | 61,075 | 0 | 122,150 |
Tags: constructive algorithms, greedy, math, strings
Correct Solution:
```
import math
import time
from collections import defaultdict,deque
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
s=stdin.readline().strip()
n=len(s)
m=int(stdin.readline())
arr=[0]*(n+1)
a=list(map(int,stdin.readline().... | output | 1 | 61,075 | 0 | 122,151 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like hi... | instruction | 0 | 61,076 | 0 | 122,152 |
Tags: constructive algorithms, greedy, math, strings
Correct Solution:
```
s = [""]+list(input())
n = int(input())
n = len(s)
l = n * [0]
for q in map(int, input().split()):
l[q]+=1
for i in range(1,n//2+1):
l[i]+=l[i-1]
if l[i] & 1:
s[i], s[n-i] = s[n-i], s[i]
print("".join(s))
``` | output | 1 | 61,076 | 0 | 122,153 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like hi... | instruction | 0 | 61,078 | 0 | 122,156 |
Tags: constructive algorithms, greedy, math, strings
Correct Solution:
```
string = input()
string = list(string)
Slen = len(string)
m = int(input())
inline = input().split()
a = []
for i in range (m):
a.append(int(inline[i]))
a.append(Slen // 2 + 1)
a.sort()
changes = [0 for i in range(Slen)]
flag = 0
for i in ran... | output | 1 | 61,078 | 0 | 122,157 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like hi... | instruction | 0 | 61,079 | 0 | 122,158 |
Tags: constructive algorithms, greedy, math, strings
Correct Solution:
```
s = input()
n = len(s)
ans = ["a"]*(n)
if len(s)%2 == 1:
x = n//2
else:
x = (n//2)-1
p = [0]*(x+1)
m = int(input())
l = list(map(int,input().split()))
for i in l:
p[i-1] += 1
for i in range(len(p)):
if p[i]%2 == 0:
p[i... | output | 1 | 61,079 | 0 | 122,159 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like hi... | instruction | 0 | 61,080 | 0 | 122,160 |
Tags: constructive algorithms, greedy, math, strings
Correct Solution:
```
# print ("Input the string")
st = input()
ln = len(st)
switches = [0 for i in range(ln)]
answer = [0 for i in range(ln)]
# print ("Input number of reversals")
m = int(input())
# print ("Input all the switch values")
arr = input().split()
arr =... | output | 1 | 61,080 | 0 | 122,161 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.
Pasha didn't like hi... | instruction | 0 | 61,082 | 0 | 122,164 |
Tags: constructive algorithms, greedy, math, strings
Correct Solution:
```
st = list(input())
n = int(input())
s = [0] * len(st)
for x in input().split():
s[int(x)-1] += 1
for i in range(1 , len(st)):
s[i] += s[i-1]
for i in range(len(st)//2):
if s[i] & 1 :
st[i] , st[len(st)-i-1] = st[len(st)-i-1] ... | output | 1 | 61,082 | 0 | 122,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,083 | 0 | 122,166 |
Yes | output | 1 | 61,083 | 0 | 122,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,084 | 0 | 122,168 |
Yes | output | 1 | 61,084 | 0 | 122,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,086 | 0 | 122,172 |
Yes | output | 1 | 61,086 | 0 | 122,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,087 | 0 | 122,174 |
No | output | 1 | 61,087 | 0 | 122,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,088 | 0 | 122,176 |
No | output | 1 | 61,088 | 0 | 122,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,089 | 0 | 122,178 |
No | output | 1 | 61,089 | 0 | 122,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the le... | instruction | 0 | 61,090 | 0 | 122,180 |
No | output | 1 | 61,090 | 0 | 122,181 |
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 n lowercase Latin letters. Some indices in this string are marked as forbidden.
You want to find a string a such that the value of |a|·f(a) is maximum pos... | instruction | 0 | 61,199 | 0 | 122,398 |
No | output | 1 | 61,199 | 0 | 122,399 |
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 n lowercase Latin letters. Some indices in this string are marked as forbidden.
You want to find a string a such that the value of |a|·f(a) is maximum pos... | instruction | 0 | 61,200 | 0 | 122,400 |
No | output | 1 | 61,200 | 0 | 122,401 |
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 n lowercase Latin letters. Some indices in this string are marked as forbidden.
You want to find a string a such that the value of |a|·f(a) is maximum pos... | instruction | 0 | 61,201 | 0 | 122,402 |
No | output | 1 | 61,201 | 0 | 122,403 |
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 n lowercase Latin letters. Some indices in this string are marked as forbidden.
You want to find a string a such that the value of |a|·f(a) is maximum pos... | instruction | 0 | 61,202 | 0 | 122,404 |
No | output | 1 | 61,202 | 0 | 122,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,954 | 0 | 123,908 |
Tags: data structures, greedy, strings
Correct Solution:
```
f = lambda q: ord(q) - 97
s, t, u = input(), [], ''
k = [0] * 26
for i in s: k[f(i)] += 1
for i in s:
t.append(i)
k[f(i)] -= 1
while t and sum(k[:f(t[-1])]) == 0: u += t.pop()
print(u)
``` | output | 1 | 61,954 | 0 | 123,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,957 | 0 | 123,914 |
Tags: data structures, greedy, strings
Correct Solution:
```
from queue import deque
dp = {}
def sol_1():
idx = 0
while True:
min_idx = get_min_char_idx(s, idx)
if min_idx == -1:
break
if len(t) > 0 and ord(t[-1]) <= ord(s[min_idx]):
# we need to take t
... | output | 1 | 61,957 | 0 | 123,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* Extract the first character of s and append t wi... | instruction | 0 | 61,958 | 0 | 123,916 |
Tags: data structures, greedy, strings
Correct Solution:
```
s=input()
t=[]
u=[]
n=len(s)
a=[0]*26
for i in range(len(s)):
z=ord(s[i])-97
a[z]+=1
FirstLetterInS=0
LengthT=0
while len(u)!=n:
if len(t)==0:
a[ord(s[FirstLetterInS])-97]-=1
z=s[FirstLetterInS]
t.append(z)
FirstL... | output | 1 | 61,958 | 0 | 123,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has two possible moves:
* E... | instruction | 0 | 61,968 | 0 | 123,936 |
No | output | 1 | 61,968 | 0 | 123,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,990 | 0 | 123,980 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
from sys import exit
n = int(input())
letters_prev = [None for i in range(30)]
letters_fow = [None for i in range(30)]
okk = [False for i in range(30)]
for i in range(n):
task = [ord(i) - ord('a') for i in input()]
if len(task) == 1:... | output | 1 | 61,990 | 0 | 123,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,991 | 0 | 123,982 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
n=int(input())
m=[]
sc=[]
for i in range(n):
m.append(input())
sc.append(set(m[i]))
if len(sc[i])!=len(m[i]):
print('NO')
break
else:
i=0
pX=False
while i<len(m):
j=i+1
p=False
whi... | output | 1 | 61,991 | 0 | 123,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,992 | 0 | 123,984 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
def generate_good_string(subs : list):
In, Out, S = {}, {}, set()
for s in subs:
if len(s) == 1:
S.add(s)
for fr, to in zip(s, s[1:]):
if fr != In.get(to, fr) or to != Out.get(fr, to):
... | output | 1 | 61,992 | 0 | 123,985 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,993 | 0 | 123,986 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
u, v, d = {}, {}, set()
for i in range(int(input())):
t = input()
if len(t) == 1: d.add(t)
for a, b in zip(t, t[1:]):
if u.get(a, b) != b or v.get(b, a) != a: exit(print('NO'))
u[a], v[b] = b, a
d = d - set(u) - set(... | output | 1 | 61,993 | 0 | 123,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,994 | 0 | 123,988 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
StringsNumber = int(input())
FinalStrings = []
Strings = []
for i in range(StringsNumber):
Strings.append(input())
LetterGraph = {}
# Генерим граф
for i in range(len(Strings)):
if len(Strings[i]) == 1:
if Strings[i] not in L... | output | 1 | 61,994 | 0 | 123,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,995 | 0 | 123,990 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
#https://codeforces.com/problemset/problem/886/D
def is_all_used(used):
for val in used.values():
if val != True:
return False
return True
def is_circle(d, pre):
used = {x:False for x in d}
pre_none ... | output | 1 | 61,995 | 0 | 123,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any other substring.
You are given a set of strings. A string (not necessarily from this set) is called good ... | instruction | 0 | 61,996 | 0 | 123,992 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
n = int(input())
u = []
s = []
ok = True
for i in range(n):
u.append(input())
s.append(set(u[i]))
if len(s[i]) != len(u[i]):
print('NO')
ok = False
break
if ok:
i = 0
ok = False
while i < len(u):
... | output | 1 | 61,996 | 0 | 123,993 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.