message stringlengths 2 43.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 853 107k | cluster float64 24 24 | __index_level_0__ int64 1.71k 214k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is an experienced participant in Codehorses programming contests. Now he wants to become a problemsetter.
He sent to the coordinator a set of n problems. Each problem has it's quality,... | instruction | 0 | 53,536 | 24 | 107,072 |
No | output | 1 | 53,536 | 24 | 107,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is an experienced participant in Codehorses programming contests. Now he wants to become a problemsetter.
He sent to the coordinator a set of n problems. Each problem has it's quality,... | instruction | 0 | 53,537 | 24 | 107,074 |
No | output | 1 | 53,537 | 24 | 107,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is an experienced participant in Codehorses programming contests. Now he wants to become a problemsetter.
He sent to the coordinator a set of n problems. Each problem has it's quality,... | instruction | 0 | 53,538 | 24 | 107,076 |
No | output | 1 | 53,538 | 24 | 107,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,893 | 24 | 109,786 |
Tags: brute force, strings, two pointers
Correct Solution:
```
t = int(input())
for i in range(t):
s = input()
ans = ""
j=0
while(j<len(s)):
if(j==len(s)-1):
if s[j] not in ans:
ans += s[j]
break
elif (s[j]==s[j+1]):
j+=2
co... | output | 1 | 54,893 | 24 | 109,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,894 | 24 | 109,788 |
Tags: brute force, strings, two pointers
Correct Solution:
```
def broken_keyboard(s1):
if len(s1) == 1:
return s1
size = len(s1)
letters = []
count = 0
for i in range(size):
if(i == size-1) or (s1[i] != s1[i+1]):
count += 1
if(count % 2 != 0):
letters.append(s1[i])
c... | output | 1 | 54,894 | 24 | 109,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,895 | 24 | 109,790 |
Tags: brute force, strings, two pointers
Correct Solution:
```
for item in [0]*int(input()):
x = input()
d = sorted(set(x))
answer = ''
for tiem in d:
if x.count(tiem)>2*x.count(tiem+tiem):
answer = answer+tiem
print(answer)
``` | output | 1 | 54,895 | 24 | 109,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,896 | 24 | 109,792 |
Tags: brute force, strings, two pointers
Correct Solution:
```
t = int(input())
def run_length_compress(string):
"""ๆๅญๅใใฉใณใฌใณใฐในๅง็ธฎใใ
ไพ) string = "aabccaaabb" -> [(2, a), (1, b), (2, c), (3, a), (2, b)]
"""
string = string + "@" # stringไธญใซ็ตถๅฏพใซ็พใใชใๆๅญใ็ชๅ
ตใจใใ
n = len(string)
begin = 0
end = 1
... | output | 1 | 54,896 | 24 | 109,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,897 | 24 | 109,794 |
Tags: brute force, strings, two pointers
Correct Solution:
```
n = int(input())
for _ in range(n):
s = input()
l = len(s)
if l == 1:
print(s)
continue
inx = 0
ones = set()
while inx < l-1:
if s[inx] == s[inx+1]:
inx += 1
else:
... | output | 1 | 54,897 | 24 | 109,795 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,898 | 24 | 109,796 |
Tags: brute force, strings, two pointers
Correct Solution:
```
for _ in range(int(input())):
s = input()
i = 0
correct = set()
while i < len(s):
if i == len(s) - 1:
correct.add(s[i])
break
if s[i] == s[i+1]:
i += 2
continue
correc... | output | 1 | 54,898 | 24 | 109,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,899 | 24 | 109,798 |
Tags: brute force, strings, two pointers
Correct Solution:
```
t=int(input())
while t:
t-=1
s=input()
i=0
if(len(s)==1):
print(s)
continue
ans=[]
while(i<len(s)-1):
if(s[i] != s[i+1]):
ans+=[s[i]]
i+=1
else:
i+=2
if(i==len(s... | output | 1 | 54,899 | 24 | 109,799 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin alphabet). Each button is either working fine or ... | instruction | 0 | 54,900 | 24 | 109,800 |
Tags: brute force, strings, two pointers
Correct Solution:
```
N = int(input())
counts = []
for _ in range(N):
s = input()
last_c = None
last_count = 0
ans = set()
for c in s:
if last_c == None:
last_c = c
last_count = 1
else:
if c == last_c:
... | output | 1 | 54,900 | 24 | 109,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,901 | 24 | 109,802 |
Yes | output | 1 | 54,901 | 24 | 109,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,902 | 24 | 109,804 |
Yes | output | 1 | 54,902 | 24 | 109,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,903 | 24 | 109,806 |
Yes | output | 1 | 54,903 | 24 | 109,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,904 | 24 | 109,808 |
Yes | output | 1 | 54,904 | 24 | 109,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,905 | 24 | 109,810 |
No | output | 1 | 54,905 | 24 | 109,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,906 | 24 | 109,812 |
No | output | 1 | 54,906 | 24 | 109,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,907 | 24 | 109,814 |
No | output | 1 | 54,907 | 24 | 109,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 26 buttons (one for each letter of the Latin al... | instruction | 0 | 54,908 | 24 | 109,816 |
No | output | 1 | 54,908 | 24 | 109,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,323 | 24 | 110,646 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input()
ans = ""
array_from_s = s.split("0")
for c in array_from_s:
ans += str(len(c))
print(ans)
``` | output | 1 | 55,323 | 24 | 110,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,324 | 24 | 110,648 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()+'0'
i=0
for x in range(n):
if s[x]=='1':
i+=1
elif s[x]=='0':
print(i,end='')
i=0
print(i,end='')
``` | output | 1 | 55,324 | 24 | 110,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,325 | 24 | 110,650 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = input()
new = ""
c = 0
m = "1"
for i in a:
if(i == m):
c += 1
else:
if(m == "0"):
new += ("0" * (c - 1))
else:
new += str(c)
m = i
c = 1
if(m == "0"):
new += ("0" * (c))
else:
new += str(c)
print(new)
``` | output | 1 | 55,325 | 24 | 110,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,326 | 24 | 110,652 |
Tags: implementation
Correct Solution:
```
length = input("")
string = input("")
string = string.split('0')
result = ""
for i in string:
result += str(len(i))
print(int(result))
``` | output | 1 | 55,326 | 24 | 110,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,327 | 24 | 110,654 |
Tags: implementation
Correct Solution:
```
n=input()
s=input()
d=0
c=0
for i in range(len(s)):
if s[i]=='0':
c=c*10+d
d=0
else:
d=d+1
c=c*10+d
print(c)
``` | output | 1 | 55,327 | 24 | 110,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,328 | 24 | 110,656 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input() + '0'
ans = ''
c = 0
for i in s:
if i == '0':
ans += str(c)
c = 0
else:
c += 1
print(ans)
``` | output | 1 | 55,328 | 24 | 110,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,329 | 24 | 110,658 |
Tags: implementation
Correct Solution:
```
input()
print(''.join([str(len(i)) for i in input().strip().split('0')]))
``` | output | 1 | 55,329 | 24 | 110,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented with number of '1' characters equal to the valu... | instruction | 0 | 55,330 | 24 | 110,660 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=input()
c=0
r=''
if(n==1):
print(s)
else:
for i in range(n-1):
if(s[0]=='0'):
c=0
elif(s[i]=='1'):
c=c+1
elif(s[i-1]=='1' and s[i]=='0'):
r=r+str(c)
c=0
elif(s[i-1]=='0' an... | output | 1 | 55,330 | 24 | 110,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,331 | 24 | 110,662 |
Yes | output | 1 | 55,331 | 24 | 110,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,332 | 24 | 110,664 |
Yes | output | 1 | 55,332 | 24 | 110,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,333 | 24 | 110,666 |
Yes | output | 1 | 55,333 | 24 | 110,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,334 | 24 | 110,668 |
Yes | output | 1 | 55,334 | 24 | 110,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,335 | 24 | 110,670 |
No | output | 1 | 55,335 | 24 | 110,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,336 | 24 | 110,672 |
No | output | 1 | 55,336 | 24 | 110,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,337 | 24 | 110,674 |
No | output | 1 | 55,337 | 24 | 110,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:
* Each digit is represented ... | instruction | 0 | 55,338 | 24 | 110,676 |
No | output | 1 | 55,338 | 24 | 110,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,019 | 24 | 112,038 |
Tags: greedy
Correct Solution:
```
t = int(input())
for i in range(t):
input()
m, k = [int(l) for l in input().split()]
a = [int(j) for j in input().split()]
upset = -1
unknown = 0
unknownBeforeUpset = 0
ti, r = [], []
for i1 in range(m-1):
n = input().split()
ti.append(... | output | 1 | 56,019 | 24 | 112,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,020 | 24 | 112,040 |
Tags: greedy
Correct Solution:
```
t = int(input())
for i in range(t):
input()
m,k = map(int,input().split())
ak = list(map(int,input().split()))
ak2 = [0]*k
tjrj = [list(map(int,input().split())) for j in range(m-1)]
num = 0
num2 = 0
num3 = 100002
for j in range(m-1):
if num... | output | 1 | 56,020 | 24 | 112,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,021 | 24 | 112,042 |
Tags: greedy
Correct Solution:
```
import sys
test_count = int(sys.stdin.readline())
for test in range(test_count):
sys.stdin.readline()
m, k = map(int, sys.stdin.readline().split())
counts = list(map(int, sys.stdin.readline().split()))
took = []
unhappy = []
for i in range(m - 1):
t, r... | output | 1 | 56,021 | 24 | 112,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,022 | 24 | 112,044 |
Tags: greedy
Correct Solution:
```
n=int(input())
for i in range(n):
input().strip()
q,w=map(int,input().strip().split())
kol=list(map(int,input().strip().split()))
r=[]
e=[]
for ii in range(q-1):
a,s=map(int,input().strip().split())
a-=1
r.append(a)
e.append(s)
... | output | 1 | 56,022 | 24 | 112,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,023 | 24 | 112,046 |
Tags: greedy
Correct Solution:
```
def ris():
return map(int, input().split())
def testCase():
m, k = ris()
q = 0
a = list(ris())
some_is_out = False
tmp = set()
for i in range(m - 1):
t, r = ris()
t -= 1
if r == 1 and not some_is_out:
some_is_out = True... | output | 1 | 56,023 | 24 | 112,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,024 | 24 | 112,048 |
Tags: greedy
Correct Solution:
```
t = int(input())
for j in range(t):
e = input()
m, k = map(int, input().split())
arr = [int(i) for i in input().split()]
sum, bfail = [0] * k, [0] * k
ffail, undef = -1, 0
used = [False] * k
ubfail = 0
for i in range(m - 1):
c, ns = map(int, inp... | output | 1 | 56,024 | 24 | 112,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,025 | 24 | 112,050 |
Tags: greedy
Correct Solution:
```
import sys
n=int(input())
for i in range(n):
sys.stdin.readline()
q,w=map(int,sys.stdin.readline().split())
kol=list(map(int,sys.stdin.readline().split()))
r=[]
e=[]
for ii in range(q-1):
a,s=map(int,sys.stdin.readline().split())
a-=1
r.... | output | 1 | 56,025 | 24 | 112,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that me... | instruction | 0 | 56,026 | 24 | 112,052 |
Tags: greedy
Correct Solution:
```
import sys
t = int(input())
for i in range(t):
remove_from_all = 0
input()
m, k = (int(x) for x in input().split())
dishes = [int(x) for x in input().split()]
inputs = []
for j in range(m - 1):
t, r = (int(x) for x in input().split())
inputs.a... | output | 1 | 56,026 | 24 | 112,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the l... | instruction | 0 | 56,027 | 24 | 112,054 |
Yes | output | 1 | 56,027 | 24 | 112,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the l... | instruction | 0 | 56,028 | 24 | 112,056 |
No | output | 1 | 56,028 | 24 | 112,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the l... | instruction | 0 | 56,029 | 24 | 112,058 |
No | output | 1 | 56,029 | 24 | 112,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the l... | instruction | 0 | 56,030 | 24 | 112,060 |
No | output | 1 | 56,030 | 24 | 112,061 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp is flying in the airplane. Finally, it is his favorite time โ the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the l... | instruction | 0 | 56,031 | 24 | 112,062 |
No | output | 1 | 56,031 | 24 | 112,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
Polycarp loves to listen to music, so he never leaves the player, even on the way home from the university. Polycarp overcomes the distance from the university to the house ... | instruction | 0 | 56,458 | 24 | 112,916 |
Tags: bitmasks, combinatorics, dp
Correct Solution:
```
import sys
input=sys.stdin.readline
mod=10**9+7
n,t=map(int,input().split())
a=[] #Denote song number by it's index in this list
for i in range(n):
time,genre=map(int,input().split())
genre-=1 #converting to 0-based indexing
a.append((time,genre))
dp=... | output | 1 | 56,458 | 24 | 112,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
Polycarp loves to listen to music, so he never leaves the player, even on the way home from the university. Polycarp overcomes the distance from the university to the house ... | instruction | 0 | 56,459 | 24 | 112,918 |
Tags: bitmasks, combinatorics, dp
Correct Solution:
```
import sys
input = sys.stdin.readline
n,T=map(int,input().split())
S=[list(map(int,input().split())) for i in range(n)]
DP=[[0]*(4) for i in range(T+1)]
mod=10**9+7
from functools import lru_cache
@lru_cache(maxsize=None)
def calc(used,recent,time):
ANS=0
... | output | 1 | 56,459 | 24 | 112,919 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.