message stringlengths 2 23.4k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 129 108k | cluster float64 6 6 | __index_level_0__ int64 258 216k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,343 | 6 | 214,686 |
Tags: implementation
Correct Solution:
```
def isvowel(c):
return c.lower() in ['a', 'e', 'i', 'o', 'u', 'y']
s = input()
for x in s[-2::-1]:
if x.isalpha():
if isvowel(x):
print('YES')
else:
print('NO')
break
``` | output | 1 | 107,343 | 6 | 214,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,344 | 6 | 214,688 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue Mar 30 19:32:51 2021
@author: nehas
"""
s=input()
s=s.replace(" ","")
l=['a','e','i','o','u','y','A','I','E','O','U','Y']
s1=""
for char in s:
if(char.isalpha()==True):
s1=s1+char
if s1[len(s1)-1] in l:
print("YES")
e... | output | 1 | 107,344 | 6 | 214,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,345 | 6 | 214,690 |
Tags: implementation
Correct Solution:
```
s=input()
s=s.replace(" ","")
if(s[-2].lower()=="a" or s[-2].lower()=="e" or s[-2].lower()=="i" or s[-2].lower()=="o" or s[-2].lower()=="u" or s[-2].lower()=="y"):
print("YES")
else:
print("NO")
``` | output | 1 | 107,345 | 6 | 214,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,346 | 6 | 214,692 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue Mar 10 22:10:44 2020
@author: DELL
"""
o=input()
v='aeiouyAEIOUY'
for i in range(len(o)-1,-1,-1):
k=o[i]
if k.isalpha():
if k in v:
print('YES')
else:
print('NO')
break
``` | output | 1 | 107,346 | 6 | 214,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,347 | 6 | 214,694 |
Tags: implementation
Correct Solution:
```
s=list(map(str,input()))
for i in range(len(s)):
if s[-2]==' ':
s.remove(s[-2])
k=s[-2]
if k=='A' or k=='E' or k=='I' or k=='O' or k=='U' or k=='Y' or k=='a' or k=='e' or k=='i' or k=='o' or k=='u' or k=='y':
print('YES')
else:
print('NO')
``` | output | 1 | 107,347 | 6 | 214,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,348 | 6 | 214,696 |
Tags: implementation
Correct Solution:
```
s = input().replace(' ', '')
vowels, ln = 'aAeEiIoOuUyY', len(s)
print('YES' if s[ln-2] in vowels else 'NO')
``` | output | 1 | 107,348 | 6 | 214,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,349 | 6 | 214,698 |
Tags: implementation
Correct Solution:
```
n = input().lower().split("?")
a = list(n[0].strip())[-1]
if(a == "a" or a == "e" or a == "o" or a == "i" or a == "u" or a == "y"):
print("YES")
else:
print("NO")
``` | output | 1 | 107,349 | 6 | 214,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a "crime" and find out what is happening. He can ask any questions whatsoeve... | instruction | 0 | 107,350 | 6 | 214,700 |
Tags: implementation
Correct Solution:
```
s=input()
s=s[::-1]
s=s[1:]
s=s.strip()
#print(s)
v=['a','e','i','o','u','y','A','E','I','O','U','Y']
if(s[0] in v):
print("YES")
else:
print("NO")
``` | output | 1 | 107,350 | 6 | 214,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,359 | 6 | 214,718 |
Tags: *special, greedy
Correct Solution:
```
from collections import Counter
import string
import math
import sys
from fractions import Fraction
def array_int():
return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
if arrber_of_variables==1:
return int(sys.stdin.readline(... | output | 1 | 107,359 | 6 | 214,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,360 | 6 | 214,720 |
Tags: *special, greedy
Correct Solution:
```
s = input()
t = input()
m = len(s)
n = len(t)
first = 0
last = n
j = 0
flag = 0
i = 0
while i < n and j < m:
if t[i] == s[j]:
j += 1
i += 1
first = i - 1
if j == m:
flag = 1
i = n - 1
j = m - 1
while i >= 0 and j >= 0:
if t[i] == s[j]:
j -= 1
... | output | 1 | 107,360 | 6 | 214,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,361 | 6 | 214,722 |
Tags: *special, greedy
Correct Solution:
```
#! /usr/bin/python3
def solve():
s = input()
t = input()
ls = len(s)
if s[ls - 1] == '\n':
ls = ls - 1
lt = len(t)
if t[lt - 1] == '\n':
lt = lt - 1
#print("ls = ",ls," lt = ", lt)
i = 0
j = 0
pos = -1
... | output | 1 | 107,361 | 6 | 214,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,362 | 6 | 214,724 |
Tags: *special, greedy
Correct Solution:
```
import sys
count = 0
matrix = []
for line in sys.stdin:
if count == 0:
pattern = line.strip()
count += 1
else:
s = line.strip()
dp1 = [0 for i in range(len(s))]
dp2 = [0 for i in range(len(s))]
i = 0
j = 0
while i < len(pattern) and j < len... | output | 1 | 107,362 | 6 | 214,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,363 | 6 | 214,726 |
Tags: *special, greedy
Correct Solution:
```
s1 = input().rstrip()
s2 = input().rstrip()
len1 = len(s1)
len2 = len(s2)
l = 1
r = 0
got = 0
for i in range(0,len2):
if s2[ i ] == s1[ got ] :
got = got + 1
if got == len1 :
l = i
break
got = len1 - 1
for j in range(0,len2):
i... | output | 1 | 107,363 | 6 | 214,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,364 | 6 | 214,728 |
Tags: *special, greedy
Correct Solution:
```
import sys
# def solution(a, b, c, d, k):
def solution(s, l):
char_pos = dict()
charset = set(s)
for i in range(len(l)):
c = l[i]
if c in charset:
if c not in char_pos:
char_pos[c] = [i]
else:
... | output | 1 | 107,364 | 6 | 214,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,365 | 6 | 214,730 |
Tags: *special, greedy
Correct Solution:
```
t = input()
s = input()
l_t = len(t)
l_s = len(s)
x = 0
f = l_s+1
for i in range(l_s):
if t[x] == s[i]: x += 1
if x == l_t:
f = i
break
c = -1
y = l_t-1
for i in range(l_s-1,-1,-1):
if t[y] == s[i]: y -= 1
if y == -1:
c = i
bre... | output | 1 | 107,365 | 6 | 214,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more l... | instruction | 0 | 107,366 | 6 | 214,732 |
Tags: *special, greedy
Correct Solution:
```
def search_podstroki(t,s):
c1 = 0
for i in range(len(t)):
if (t[i] == s[0]):
s = s[1::]
if (len(s) == 0):
c1 = -1
return i+1
if (c1 == 0):
return -1
s = input()
t = input(... | output | 1 | 107,366 | 6 | 214,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,876 | 6 | 215,752 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
def solve(s):
n = len(s)
for i in range(n):
s2 = s[i:] + s[:i]
# print(s2)
if s != s2 and s2[::-1] == s2:
return 1
for i in range( (n // 2) + 1, n):
if s[i] != s[0]:
return 2
... | output | 1 | 107,876 | 6 | 215,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,877 | 6 | 215,754 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
import sys
s = input()
n = len(s)
for i in range(n):
t = s[i:] + s[:i]
if t != s and t == t[::-1]:
print(1)
sys.exit(0)
if s[:n//2] != s[n-n//2:]:
print(2)
sys.exit(0)
is4 = True
for i in range(n):
if not (n % 2 == 1 and i == n//2):
... | output | 1 | 107,877 | 6 | 215,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,878 | 6 | 215,756 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
def is_palindrome(S):
a = S[::-1]
return S == a
s = input()
if len(s) == 1:
print('Impossible')
exit(0)
hop = 0
if len(s) % 2:
if len(set(s[:len(s)//2])) == 1:
print('Impossible')
else:
print(2)
else:
if ... | output | 1 | 107,878 | 6 | 215,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,879 | 6 | 215,758 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
st=input()
le=len(st)
if(le==1):
print('Impossible')
else:
flag=False
for i in range(1,le//2):
if(st[i]!=st[i-1]):
flag=True
break
if(not(flag)):
print('Impossible')
else:
flag=True
... | output | 1 | 107,879 | 6 | 215,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,880 | 6 | 215,760 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
# cook your dish here
s=input()
lz=len(s)
found=0
ans=-1
for i in range(0,lz//2):
k=s[0:i+1]
if k!=k[::-1]:
found=1
ans=2
for i in range(0,lz-1):
k=s[i+1:lz]+s[0:i+1]
if k==k[::-1] and k!=s:
found=1
an... | output | 1 | 107,880 | 6 | 215,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,881 | 6 | 215,762 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
s = input()
if len(set(s[:len(s) // 2])) <= 1:
print("Impossible")
exit()
if len(s) % 2 == 0:
for i in range(1, len(s)):
n = s[i:] + s[:i]
if (n == n[::-1]) and (n != s):
print("1")
exit()
print("2")
``` | output | 1 | 107,881 | 6 | 215,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,882 | 6 | 215,764 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
s=input()
hai=False
if(len(s)%2==0):
for i in range(1,len(s)):
s1=s[i:]+s[:i]
if(s1!=s and s1==s1[::-1]):
print(1)
exit()
cur=len(s)//2
cur2=cur
cur-=1
while(cur>0):
if(s[:cur+1]!=s[cur2:]):
print(2)
exit()
cur-=1
c... | output | 1 | 107,882 | 6 | 215,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in many countries. Mithrandir among the Elves, Thark... | instruction | 0 | 107,883 | 6 | 215,766 |
Tags: constructive algorithms, hashing, strings
Correct Solution:
```
s = input()
if len(set(s[:len(s) // 2])) <= 1:
print("Impossible");exit()
if len(s) % 2 == 0:
for i in range(1, len(s)):
n = s[i:] + s[:i]
if (n == n[::-1]) and (n != s):
print(1);exit()
print(2)
``` | output | 1 | 107,883 | 6 | 215,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,884 | 6 | 215,768 |
Yes | output | 1 | 107,884 | 6 | 215,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,885 | 6 | 215,770 |
Yes | output | 1 | 107,885 | 6 | 215,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,886 | 6 | 215,772 |
Yes | output | 1 | 107,886 | 6 | 215,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,887 | 6 | 215,774 |
Yes | output | 1 | 107,887 | 6 | 215,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,888 | 6 | 215,776 |
No | output | 1 | 107,888 | 6 | 215,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,889 | 6 | 215,778 |
No | output | 1 | 107,889 | 6 | 215,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,890 | 6 | 215,780 |
No | output | 1 | 107,890 | 6 | 215,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Reading books is one of Sasha's passions. Once while he was reading one book, he became acquainted with an unusual character. The character told about himself like that: "Many are my names in ma... | instruction | 0 | 107,891 | 6 | 215,782 |
No | output | 1 | 107,891 | 6 | 215,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's analyze a program written on some strange programming language. The variables in this language have names consisting of 1 to 4 characters, and each character is a lowercase or an uppercase Latin letter, or a digit. There is an extra co... | instruction | 0 | 107,892 | 6 | 215,784 |
Tags: graphs, greedy, hashing, implementation
Correct Solution:
```
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(65536)
vars, reserved = {}, set()
rules, irules, R = [], {}, 0
def wwj():
n__ = 0
def dak():
nonlocal n__
while 'a' + str(n__) in reserved:
n__ += 1
n__ += 1
return 'a' + str(n__... | output | 1 | 107,892 | 6 | 215,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's analyze a program written on some strange programming language. The variables in this language have names consisting of 1 to 4 characters, and each character is a lowercase or an uppercase Latin letter, or a digit. There is an extra co... | instruction | 0 | 107,893 | 6 | 215,786 |
Tags: graphs, greedy, hashing, implementation
Correct Solution:
```
from random import seed, randint
import sys
sys.setrecursionlimit(10000)
opr = ['#', '^', '&', '$']
namespace = { "res" : (False, "res") }
rules = dict()
lookup = dict()
cnt = -1
def get_tag(var):
if var in namespace:
return namespace[var... | output | 1 | 107,893 | 6 | 215,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya trains to compose crossword puzzles. He can only compose crosswords of a very simplе type so far. All of them consist of exactly six words; the words can be read only from top to bottom vertically and from the left to the right horizon... | instruction | 0 | 108,217 | 6 | 216,434 |
Tags: implementation
Correct Solution:
```
ar = [input() for i in range(6)]
ar.sort()
ans = []
for i in range(6):
for j in range(6):
if(i == j): continue
if(ar[i][0] != ar[j][0]): continue
for k in range(6):
if(i==k or j==k): continue
if(len(ar[k]) < 5): continu... | output | 1 | 108,217 | 6 | 216,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya trains to compose crossword puzzles. He can only compose crosswords of a very simplе type so far. All of them consist of exactly six words; the words can be read only from top to bottom vertically and from the left to the right horizon... | instruction | 0 | 108,218 | 6 | 216,436 |
Tags: implementation
Correct Solution:
```
from itertools import permutations
v = []
for p in permutations(input() for i in range(6)):
if len(p[1]) != len(p[0]) + len(p[2]) - 1 or len(p[4]) != len(p[3]) + len(p[5]) - 1:
continue
elif p[0][0] != p[3][0] or p[0][-1] != p[4][0]:
continue
elif p... | output | 1 | 108,218 | 6 | 216,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya trains to compose crossword puzzles. He can only compose crosswords of a very simplе type so far. All of them consist of exactly six words; the words can be read only from top to bottom vertically and from the left to the right horizon... | instruction | 0 | 108,219 | 6 | 216,438 |
Tags: implementation
Correct Solution:
```
from itertools import permutations
v = []
for p in permutations(input() for i in range(6)):
if len(p[1]) != len(p[0]) + len(p[2]) - 1 or len(p[4]) != len(p[3]) + len(p[5]) - 1:
continue
elif p[0][0] != p[3][0] or p[0][-1] != p[4][0]:
continue
elif p... | output | 1 | 108,219 | 6 | 216,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya trains to compose crossword puzzles. He can only compose crosswords of a very simplе type so far. All of them consist of exactly six words; the words can be read only from top to bottom vertically and from the left to the right horizon... | instruction | 0 | 108,220 | 6 | 216,440 |
Tags: implementation
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
from itertools import permutations
def main():
s = [input().strip() for _ in range(6)]
ans = ['a'*30 for _ in range(30)]
dx = [0,1,0,-1,0,-1]
dy = [1,0,1... | output | 1 | 108,220 | 6 | 216,441 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya trains to compose crossword puzzles. He can only compose crosswords of a very simplе type so far. All of them consist of exactly six words; the words can be read only from top to bottom vertically and from the left to the right horizon... | instruction | 0 | 108,221 | 6 | 216,442 |
Tags: implementation
Correct Solution:
```
import sys
from array import array # noqa: F401
from itertools import permutations
def input():
return sys.stdin.buffer.readline().decode('utf-8')
a = [input().rstrip() for _ in range(6)]
ans = ['z' * 100 for _ in range(6)]
inf = ['z' * 100 for _ in range(6)]
for wor... | output | 1 | 108,221 | 6 | 216,443 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.