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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping b". Each ping command sends exactly ten packets... | instruction | 0 | 95,563 | 24 | 191,126 |
Tags: implementation
Correct Solution:
```
n=int(input())
sum1=0
sum2=0
z=0
c=0
for i in range(n):
t,x,y=map(int,input().split())
if t==1:
sum1+=x
z+=1
if t==2:
sum2+=x
c+=1
if sum1>=int(5*z):
print("LIVE")
else:
print("DEAD")
if sum2>=int(5*c):
print("LIVE")
else:
print("DEAD")
``` | output | 1 | 95,563 | 24 | 191,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping b". Each ping command sends exactly ten packets... | instruction | 0 | 95,564 | 24 | 191,128 |
Tags: implementation
Correct Solution:
```
x=int(input())
a,b,c,d=0,0,0,0
for i in range(x):
t,x,y=map(int,input().split())
if t==1:
a+=1
b+=x
if t==2:
c+=1
d+=x
if b>=a*5:
print('LIVE')
else:
print('DEAD')
if d>=c*5:
print('LIVE')
else:
print('DEAD')
``` | output | 1 | 95,564 | 24 | 191,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,565 | 24 | 191,130 |
Yes | output | 1 | 95,565 | 24 | 191,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,566 | 24 | 191,132 |
Yes | output | 1 | 95,566 | 24 | 191,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,567 | 24 | 191,134 |
Yes | output | 1 | 95,567 | 24 | 191,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,568 | 24 | 191,136 |
Yes | output | 1 | 95,568 | 24 | 191,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,569 | 24 | 191,138 |
No | output | 1 | 95,569 | 24 | 191,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,570 | 24 | 191,140 |
No | output | 1 | 95,570 | 24 | 191,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,571 | 24 | 191,142 |
No | output | 1 | 95,571 | 24 | 191,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers' performance, Polycarpus executes commands "ping a" and "ping ... | instruction | 0 | 95,572 | 24 | 191,144 |
No | output | 1 | 95,572 | 24 | 191,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,764 | 24 | 191,528 |
Tags: data structures, implementation, math
Correct Solution:
```
n,k=map(int,input().split())
arr=list(map(int,input().split()))
ww=n-k+1
a=[]
a.append(0)
for i in range(n):
a.append(arr[i])
for i in range(1,n+1):
a[i]=a[i]+a[i-1]
ans=0
for i in range(k,n+1):
tmp=a[i]-a[i-k]
ans+=(tmp/ww)
print(ans)
``` | output | 1 | 95,764 | 24 | 191,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,765 | 24 | 191,530 |
Tags: data structures, implementation, math
Correct Solution:
```
n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
s, v = sum(a[:k]), 0
for i in range(k, n + 1):
s += a[i] - a[i - k]
v += s
print(v / (n - k + 1))
``` | output | 1 | 95,765 | 24 | 191,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,766 | 24 | 191,532 |
Tags: data structures, implementation, math
Correct Solution:
```
from sys import stdin
a,b=map(int,stdin.readline().split())
c=list(map(int,stdin.readline().split()))
s=sum(c[:b]);k=s
for i in range(1,a-b+1):k=k-c[i-1]+c[i+b-1];s+=k
print((s)/(a-b+1))
``` | output | 1 | 95,766 | 24 | 191,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,767 | 24 | 191,534 |
Tags: data structures, implementation, math
Correct Solution:
```
while True:
try:
n, k = map(int, input().split(' '))
except:
break
L = [int(x) for x in input().split(' ')]
ans = sum = 0.0
for x in L[:k]:
sum += x
ans += sum
for i in range(k, n):
sum = sum - ... | output | 1 | 95,767 | 24 | 191,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,768 | 24 | 191,536 |
Tags: data structures, implementation, math
Correct Solution:
```
def solve(n,k,a):
s = sum(a[:k])
tot = 0
l = 0
tot += s
for r in range(k,n):
s = s-a[l]+a[r]
tot += s
l+=1
return tot/(n-k+1)
def main():
n,k = map(int,input().split(' '))
a = [int(x) for x in in... | output | 1 | 95,768 | 24 | 191,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,769 | 24 | 191,538 |
Tags: data structures, implementation, math
Correct Solution:
```
n,k=list(map(int,input().strip().split(' ')))
A=list(map(int,input().strip().split(' ')))
temp=0
total=0
for i in range(n-k+1):
if i==0:
temp=sum(A[:k])
total+=temp
else:
temp-=A[i-1]
temp+=A[i+k-1]
total+=... | output | 1 | 95,769 | 24 | 191,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,770 | 24 | 191,540 |
Tags: data structures, implementation, math
Correct Solution:
```
import sys
input = sys.stdin.readline
'''
week = k days
ai sleep time on i-th day
'''
n, k = map(int, input().split())
a = list(map(int, input().split()))
k_sum = sum(a[:k])
tot = k_sum
left, right = 0, k
while right < n:
k_sum -= a[left]
k_... | output | 1 | 95,770 | 24 | 191,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor asked him about his sleeping schedule (more spec... | instruction | 0 | 95,771 | 24 | 191,542 |
Tags: data structures, implementation, math
Correct Solution:
```
n,k = map(int, input().split())
values = list(map(int, input().split()))
total = sum(values[:k])
hours = total
for i in range(k,n):
total += values[i] - values[i-k]
hours += total
print("%.6f" % (hours/(n-k+1)))
``` | output | 1 | 95,771 | 24 | 191,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,772 | 24 | 191,544 |
Yes | output | 1 | 95,772 | 24 | 191,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,773 | 24 | 191,546 |
Yes | output | 1 | 95,773 | 24 | 191,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,774 | 24 | 191,548 |
Yes | output | 1 | 95,774 | 24 | 191,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,775 | 24 | 191,550 |
Yes | output | 1 | 95,775 | 24 | 191,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,776 | 24 | 191,552 |
No | output | 1 | 95,776 | 24 | 191,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,777 | 24 | 191,554 |
No | output | 1 | 95,777 | 24 | 191,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,778 | 24 | 191,556 |
No | output | 1 | 95,778 | 24 | 191,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been almost a week since Polycarp couldn't get rid of insomnia. And as you may already know, one week in Berland lasts k days!
When Polycarp went to a doctor with his problem, the doctor a... | instruction | 0 | 95,779 | 24 | 191,558 |
No | output | 1 | 95,779 | 24 | 191,559 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if there is at least one letter 'a', remove the le... | instruction | 0 | 95,839 | 24 | 191,678 |
Tags: implementation
Correct Solution:
```
from collections import Counter
N,K = map(int,input().split())
S = input()
C = Counter(S)
cnt = 0
for i in range(26):
c = chr(97+i)
if cnt + C[c] >= K:
break
else:
cnt += C[c]
S = S.replace(c,"")
t = ""
for s in S:
if s == c and cnt <... | output | 1 | 95,839 | 24 | 191,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if there is at least one letter 'a', remove the le... | instruction | 0 | 95,842 | 24 | 191,684 |
Tags: implementation
Correct Solution:
```
_, k = map(int, input().split())
s = input()
for ch in 'abcdefghijklmnopqrstuvwxyz':
x = s.count(ch)
if x < k:
s = s.replace(ch, '', x)
k -= x
else:
s = s.replace(ch, '', k)
break
print(s)
``` | output | 1 | 95,842 | 24 | 191,685 |
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. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if ... | instruction | 0 | 95,847 | 24 | 191,694 |
Yes | output | 1 | 95,847 | 24 | 191,695 |
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. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if ... | instruction | 0 | 95,848 | 24 | 191,696 |
Yes | output | 1 | 95,848 | 24 | 191,697 |
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. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if ... | instruction | 0 | 95,849 | 24 | 191,698 |
Yes | output | 1 | 95,849 | 24 | 191,699 |
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. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if ... | instruction | 0 | 95,850 | 24 | 191,700 |
Yes | output | 1 | 95,850 | 24 | 191,701 |
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. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:
* if ... | instruction | 0 | 95,851 | 24 | 191,702 |
No | output | 1 | 95,851 | 24 | 191,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,117 | 24 | 194,234 |
Tags: brute force, graphs, greedy
Correct Solution:
```
def main():
for _ in range(int(input())):
n=int(input())
visited=[False]*n
q=[list(map(int,input().split())) for i in range(n)]
t1,x=0,0
for i in range(n):
t=-1
if(len(q[i])>1):
t=... | output | 1 | 97,117 | 24 | 194,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,118 | 24 | 194,236 |
Tags: brute force, graphs, greedy
Correct Solution:
```
input = __import__('sys').stdin.readline
print = __import__('sys').stdout.write
for _ in range(int(input())):
n = int(input())
prince = set(range(1, n+1))
princess = set(range(1, n+1))
princess_list = [[] for _ in range(n+1)]
for i in range(n)... | output | 1 | 97,118 | 24 | 194,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,119 | 24 | 194,238 |
Tags: brute force, graphs, greedy
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
# daughters = [False for _ in range(n+1)]
# boys = [False for _ in range(n+1)]
boys = [False]*(n+1)
dul = -1
boys[0] = True
chk = True
for i in range(n):
x = list(map(int... | output | 1 | 97,119 | 24 | 194,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,120 | 24 | 194,240 |
Tags: brute force, graphs, greedy
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
dc ={}
for i in range(1,n+1):
dc[i] = []
prc = [False for i in range(n+1)]
pcc = [False for i in range(n+1)]
b = []
for i in range(1,n+1):
x = [int(o) for o i... | output | 1 | 97,120 | 24 | 194,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,121 | 24 | 194,242 |
Tags: brute force, graphs, greedy
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
used = [False for i in range(n)]
v = -1
for i in range(n):
l = [int(x) - 1 for x in input().split()][1:]
for j in l:
if not used[j]:
used[j] = True
... | output | 1 | 97,121 | 24 | 194,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,122 | 24 | 194,244 |
Tags: brute force, graphs, greedy
Correct Solution:
```
def main():
n = int(input())
prince = set()
princes = set()
for i in range(1, n + 1):
prince.add(i)
to_change = -1
for i in range(n):
lst = list(map(int, input().split()))
have = False
for k in lst[1:]:
... | output | 1 | 97,122 | 24 | 194,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,123 | 24 | 194,246 |
Tags: brute force, graphs, greedy
Correct Solution:
```
t=int(input())
for _ in range(t):
n=int(input())
l1=[False]*n
l2=[False]*n
for i in range(n):
l=list(map(int,input().split()))[1:]
for j in l:
if not l2[j-1]:
l1[i]=True
l2[j-1]=True
break
f1=0
f2=0
s=" "
for i in range(n):
if f1==0 an... | output | 1 | 97,123 | 24 | 194,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence there are n other kingdoms as well.
So Polycar... | instruction | 0 | 97,124 | 24 | 194,248 |
Tags: brute force, graphs, greedy
Correct Solution:
```
import sys
input=sys.stdin.readline
from math import *
t=int(input())
while t>0:
t-=1
n=int(input())
f=[0 for i in range(n+1)]
l=[]
flag=0
for i in range(n):
a=[int(x) for x in input().split()]
a=a[1:]
a.sort()
... | output | 1 | 97,124 | 24 | 194,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,125 | 24 | 194,250 |
Yes | output | 1 | 97,125 | 24 | 194,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,126 | 24 | 194,252 |
Yes | output | 1 | 97,126 | 24 | 194,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,127 | 24 | 194,254 |
Yes | output | 1 | 97,127 | 24 | 194,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,128 | 24 | 194,256 |
Yes | output | 1 | 97,128 | 24 | 194,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,129 | 24 | 194,258 |
No | output | 1 | 97,129 | 24 | 194,259 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,130 | 24 | 194,260 |
No | output | 1 | 97,130 | 24 | 194,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,131 | 24 | 194,262 |
No | output | 1 | 97,131 | 24 | 194,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The King of Berland Polycarp LXXXIV has n daughters. To establish his power to the neighbouring kingdoms he wants to marry his daughters to the princes of these kingdoms. As a lucky coincidence ... | instruction | 0 | 97,132 | 24 | 194,264 |
No | output | 1 | 97,132 | 24 | 194,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has been working in the analytic department of the "F.R.A.U.D." company for as much as n days. Right now his task is to make a series of reports about the company's performance for the last n days. We know that the main informatio... | instruction | 0 | 97,267 | 24 | 194,534 |
Tags: greedy
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
c,x=0,0
d=[]
for i in range(n):
if(l[i]<0):
c=c+1
x=x+1
if(x==2):
d.append(c)
x=0
c=0
else:
c=c+1
if(d==[]):
d.append(c)
c=0
if(c>0 and x==0):
d[-1]+=c
elif(c>0 and x!=0):
d.append(c)
print(len(d))
print(*d)
``` | output | 1 | 97,267 | 24 | 194,535 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.