message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,662 | 14 | 131,324 |
Yes | output | 1 | 65,662 | 14 | 131,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,663 | 14 | 131,326 |
Yes | output | 1 | 65,663 | 14 | 131,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,664 | 14 | 131,328 |
Yes | output | 1 | 65,664 | 14 | 131,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,665 | 14 | 131,330 |
No | output | 1 | 65,665 | 14 | 131,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,666 | 14 | 131,332 |
No | output | 1 | 65,666 | 14 | 131,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,667 | 14 | 131,334 |
No | output | 1 | 65,667 | 14 | 131,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This morning, Roman woke up and opened the browser with n opened tabs numbered from 1 to n. There are two kinds of tabs: those with the information required for the test and those with social ne... | instruction | 0 | 65,668 | 14 | 131,336 |
No | output | 1 | 65,668 | 14 | 131,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,706 | 14 | 131,412 |
Tags: math
Correct Solution:
```
n, a, b = map(int, input().split())
s = a+1
e = n - b
ans = n-max(s, e) + 1
print(ans)
``` | output | 1 | 65,706 | 14 | 131,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,707 | 14 | 131,414 |
Tags: math
Correct Solution:
```
n,a,b = [int(i) for i in input().split()[:3]]
x = n-a
y = b+1
print(min(x,y))
``` | output | 1 | 65,707 | 14 | 131,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,708 | 14 | 131,416 |
Tags: math
Correct Solution:
```
n,a,b=map(int,input().split())
kol=0
for i in range(b+1):
x=n-i-1
if x>a-1:
kol+=1
print(kol)
``` | output | 1 | 65,708 | 14 | 131,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,709 | 14 | 131,418 |
Tags: math
Correct Solution:
```
n,a,b=map(int,input().split())
if (a+b)<n:
print(b+1)
else:
print(n-a)
``` | output | 1 | 65,709 | 14 | 131,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,710 | 14 | 131,420 |
Tags: math
Correct Solution:
```
n,A,B=map(int,input().split())
C=[int(x) for x in range(n+1)]
cnt=0
for i in range(n,0,-1):
b=abs(i-n)
a=i-1
if a<A or b>B:
break
cnt+=1
print(cnt)
``` | output | 1 | 65,710 | 14 | 131,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,711 | 14 | 131,422 |
Tags: math
Correct Solution:
```
n, a, b = map(int, input().split())
min_pos = max(a+1, n - b)
print(n - min_pos + 1)
``` | output | 1 | 65,711 | 14 | 131,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,712 | 14 | 131,424 |
Tags: math
Correct Solution:
```
n,a,b=map(int,input().split())
d=min(n-a,b+1)
print(d)
``` | output | 1 | 65,712 | 14 | 131,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standing behind him. Find the number of different pos... | instruction | 0 | 65,713 | 14 | 131,426 |
Tags: math
Correct Solution:
```
n,a,b=map(int,input().split())
if n-b>a:
print(b+1)
elif n-b==a:
print(b)
elif n-b<a:
print(n-a)
``` | output | 1 | 65,713 | 14 | 131,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,714 | 14 | 131,428 |
Yes | output | 1 | 65,714 | 14 | 131,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,715 | 14 | 131,430 |
Yes | output | 1 | 65,715 | 14 | 131,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,716 | 14 | 131,432 |
Yes | output | 1 | 65,716 | 14 | 131,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,718 | 14 | 131,436 |
No | output | 1 | 65,718 | 14 | 131,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,719 | 14 | 131,438 |
No | output | 1 | 65,719 | 14 | 131,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,720 | 14 | 131,440 |
No | output | 1 | 65,720 | 14 | 131,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petr stands in line of n people, but he doesn't know exactly which position he occupies. He can say that there are no less than a people standing in front of him and no more than b people standi... | instruction | 0 | 65,721 | 14 | 131,442 |
No | output | 1 | 65,721 | 14 | 131,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,722 | 14 | 131,444 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
s = list(input().rstrip())
ans = []
while True:
ok = True
epoch = []
for i, (s1, s2) in enumerate(... | output | 1 | 65,722 | 14 | 131,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,723 | 14 | 131,446 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
# print(out)
# pass
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
mod = 1000000007
def main():
# global out
n, k = [int(j) for j in input().split()]
# sys.stdout.wr... | output | 1 | 65,723 | 14 | 131,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,724 | 14 | 131,448 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from... | output | 1 | 65,724 | 14 | 131,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,725 | 14 | 131,450 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
# region fastio
import sys, io, os
BUFSIZE = 8192
class FastIO(io.IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = io.BytesIO()
self.wr... | output | 1 | 65,725 | 14 | 131,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,726 | 14 | 131,452 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
n, k = map(int, input().split())
in_ = input()
arr = []
S = 0
s = [1 if x == 'R' else 0 for x in in_]
while True:
next_ = [i for i in range(n-1) if s[i]==1 and s[i+1]==0]
if ... | output | 1 | 65,726 | 14 | 131,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,727 | 14 | 131,454 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
N, K = map(int, input().split())
S = [1 if a == "R" else 0 for a in input()]
t = 0
a = 0
for s in S:
if s:
a += 1
... | output | 1 | 65,727 | 14 | 131,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,728 | 14 | 131,456 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from... | output | 1 | 65,728 | 14 | 131,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n children, who study at the school β41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the ri... | instruction | 0 | 65,729 | 14 | 131,458 |
Tags: brute force, constructive algorithms, games, graphs, greedy, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from... | output | 1 | 65,729 | 14 | 131,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,911 | 14 | 131,822 |
Tags: constructive algorithms, dp
Correct Solution:
```
s = input()
g,no,ans = 0,0,0
for i in range(len(s)):
if(s[i] == 'M'):
no = max(no-1,0)
else:
if(i != g):
ans = max(ans,i-g+no)
no += 1
g += 1
print(ans)
``` | output | 1 | 65,911 | 14 | 131,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,912 | 14 | 131,824 |
Tags: constructive algorithms, dp
Correct Solution:
```
t = input()[:: -1]
i = t.find('F')
if i < 0:
print(0)
else:
j = t.find('M', i + 1)
if j < 0:
print(0)
else:
s, t = 0, t[j:t.rfind('M') + 1]
for k in t:
if k == 'M':
s += 1
else:
... | output | 1 | 65,912 | 14 | 131,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,913 | 14 | 131,826 |
Tags: constructive algorithms, dp
Correct Solution:
```
# https://codeforces.com/problemset/problem/353/D
s = [0 if x=='M' else 1 for x in input()]
ans = 0
pre = -1
num1 = 0
flg=False
for i in range(len(s)-1, -1, -1):
if s[i]==1:
flg=True
num1+=1
else:
if flg==True:
... | output | 1 | 65,913 | 14 | 131,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,914 | 14 | 131,828 |
Tags: constructive algorithms, dp
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
from collect... | output | 1 | 65,914 | 14 | 131,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,915 | 14 | 131,830 |
Tags: constructive algorithms, dp
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('inp... | output | 1 | 65,915 | 14 | 131,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,916 | 14 | 131,832 |
Tags: constructive algorithms, dp
Correct Solution:
```
def main():
for _ in inputt(1):
P = [ch == "F" for ch in input()]
t = 0
d = 0
for i, e in enumerate(P):
if e:
if i != d:
t = max(t + 1, i - d)
d += 1
prin... | output | 1 | 65,916 | 14 | 131,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,917 | 14 | 131,834 |
Tags: constructive algorithms, dp
Correct Solution:
```
a=input();n=len(a);o,k=0,0
for i in range(n):
if(a[i]=='F'):
k=k+1
if(i+1!=k):o=max(o+1,i+1-k)
print(o)
``` | output | 1 | 65,917 | 14 | 131,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys that stand right in front of girls, simultaneously... | instruction | 0 | 65,918 | 14 | 131,836 |
Tags: constructive algorithms, dp
Correct Solution:
```
s = input()
n = len(s)
try:
ai = s.index('M')
bi = n - s[::-1].index('F')
s = s[ai:bi]
n = len(s)
femcount = sum(map(lambda s: 1 if s == 'F' else 0, s))
cong = 0
for a in s:
if a == 'M':
cong = max(0, cong - 1)
... | output | 1 | 65,918 | 14 | 131,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys tha... | instruction | 0 | 65,919 | 14 | 131,838 |
Yes | output | 1 | 65,919 | 14 | 131,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys tha... | instruction | 0 | 65,920 | 14 | 131,840 |
Yes | output | 1 | 65,920 | 14 | 131,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys tha... | instruction | 0 | 65,921 | 14 | 131,842 |
No | output | 1 | 65,921 | 14 | 131,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys tha... | instruction | 0 | 65,922 | 14 | 131,844 |
No | output | 1 | 65,922 | 14 | 131,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys tha... | instruction | 0 | 65,923 | 14 | 131,846 |
No | output | 1 | 65,923 | 14 | 131,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stall. The buns aren't ready yet and the line is undergoing some changes.
Each second all boys tha... | instruction | 0 | 65,924 | 14 | 131,848 |
No | output | 1 | 65,924 | 14 | 131,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to a1 ... | instruction | 0 | 65,925 | 14 | 131,850 |
Tags: greedy
Correct Solution:
```
n = int(input())
lis = list(map(int,input().split()))
li=[]
c=1
for i in range(n):
if(lis[i]==c):
li.append(2000+i+1)
c+=1
if(c==1):
print('0')
else:
print(len(li),*li)
``` | output | 1 | 65,925 | 14 | 131,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to a1 ... | instruction | 0 | 65,926 | 14 | 131,852 |
Tags: greedy
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
tf = False
k = 1
ans = []
for i in range(0,len(a)):
if (a[i]==k):
k+=1
tf = True
ans.append(i+2001)
print(k-1)
for i in ans:
print(i,end = ' ')
``` | output | 1 | 65,926 | 14 | 131,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to a1 ... | instruction | 0 | 65,927 | 14 | 131,854 |
Tags: greedy
Correct Solution:
```
i=input
n=i()
m=list(map(int,i().split()))
t=1
p=[]
for x in range(len(m)):
if(t==m[x]):
p.append(2001+x)
t+=1
print(t-1)
for _ in range(len(p)):
print(p[_],end=" ")
# Made By Mostafa_Khaled
``` | output | 1 | 65,927 | 14 | 131,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to a1 ... | instruction | 0 | 65,928 | 14 | 131,856 |
Tags: greedy
Correct Solution:
```
from sys import stdin, stdout
years = int(input())
incomes = list(map(int,list(stdin.readline().split(' '))))
respuestas = list()
cnt = 1
for x in range(years):
if incomes[x] == cnt:
respuestas.append(str(2000+x+1))
cnt+=1
print(len(respuestas))
if respuesta... | output | 1 | 65,928 | 14 | 131,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to a1 ... | instruction | 0 | 65,929 | 14 | 131,858 |
Tags: greedy
Correct Solution:
```
n = int(input())
container = list(map(int, input().split()))
years = list()
if 1 in container:
indexOfOne = container.index(1)
years.append(2001 + indexOfOne)
while indexOfOne < len(container) - 1:
for j in range(indexOfOne + 1, len(container)):
if (... | output | 1 | 65,929 | 14 | 131,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to a1 ... | instruction | 0 | 65,930 | 14 | 131,860 |
Tags: greedy
Correct Solution:
```
input()
t = []
for y, d in enumerate(map(int, input().split()), 2001):
if d == len(t) + 1: t.append(y)
print(len(t), *t)
``` | output | 1 | 65,930 | 14 | 131,861 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.