message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is constraints.
The BerTV channel every day broadcasts one episode of one of the k TV shows. You know the schedule for the next n days: a sequ... | instruction | 0 | 27,505 | 10 | 55,010 |
Yes | output | 1 | 27,505 | 10 | 55,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is constraints.
The BerTV channel every day broadcasts one episode of one of the k TV shows. You know the schedule for the next n days: a sequ... | instruction | 0 | 27,506 | 10 | 55,012 |
Yes | output | 1 | 27,506 | 10 | 55,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is constraints.
The BerTV channel every day broadcasts one episode of one of the k TV shows. You know the schedule for the next n days: a sequ... | instruction | 0 | 27,507 | 10 | 55,014 |
No | output | 1 | 27,507 | 10 | 55,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is constraints.
The BerTV channel every day broadcasts one episode of one of the k TV shows. You know the schedule for the next n days: a sequ... | instruction | 0 | 27,508 | 10 | 55,016 |
No | output | 1 | 27,508 | 10 | 55,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is constraints.
The BerTV channel every day broadcasts one episode of one of the k TV shows. You know the schedule for the next n days: a sequ... | instruction | 0 | 27,509 | 10 | 55,018 |
No | output | 1 | 27,509 | 10 | 55,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is constraints.
The BerTV channel every day broadcasts one episode of one of the k TV shows. You know the schedule for the next n days: a sequ... | instruction | 0 | 27,510 | 10 | 55,020 |
No | output | 1 | 27,510 | 10 | 55,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,681 | 10 | 55,362 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
import sys
import math
import collections
import heapq
import decimal
input=sys.stdin.readline
n=int(input())
l=[]
for i in range(n):
a,b=(int(i) for i in input().split())
l.append((b,a))
l.sort()
s=0
for i in range(n):
... | output | 1 | 27,681 | 10 | 55,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,682 | 10 | 55,364 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
t=int(input())
a=[]
for T in range(t):
b=list(map(int,input().split()))
a.append(b)
h=sorted(a,key=lambda x: (x[1]))
s=0
j=0
i=len(h)-1
cost=0
while(j<=i):
k=h[i][0]
if(k+s<h[j][1]):
s=s+k
i=i-1
... | output | 1 | 27,682 | 10 | 55,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,683 | 10 | 55,366 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
N = int(input())
A = [0] * N
for i in range(N):
A[i] = list(map(int, input().split()))
A.sort(key=lambda a: a[1])
low = 0
high = N - 1
bought = 0
cost = 0
while low <= high:
if bought >= A[low][1]: # buy from min Bi to ge... | output | 1 | 27,683 | 10 | 55,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,684 | 10 | 55,368 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
l.sort(key=lambda l:l[1])
i=0;j=n-1
ans=0
x=0
while i<=j:
if x>=l[i][1]:
ans += l[i][0]
x += l[i][0]
i += 1
... | output | 1 | 27,684 | 10 | 55,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,685 | 10 | 55,370 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "... | output | 1 | 27,685 | 10 | 55,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,686 | 10 | 55,372 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
a=sorted([*map(int,s.split())][::-1]for s in[*open(0)][1:])
i=c=r=0
j=len(a)-1
while i<=j:
x=_,y=a[j];d=min(a[i][0]-c,y)
if d>0:x[1]-=d;r+=d;j-=d==y
else:d=a[i][1];i+=1
c+=d
print(c+r)
``` | output | 1 | 27,686 | 10 | 55,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,687 | 10 | 55,374 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
# Author Name: Ajay Meena
# Codeforce : https://codeforces.com/profile/majay1638
import sys
import math
import bisect
import heapq
from bisect import bisect_right
from sys import stdin, stdout
# -------------- INPUT FUNCTIONS ---... | output | 1 | 27,687 | 10 | 55,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
* The store has an infinite number of items of... | instruction | 0 | 27,688 | 10 | 55,376 |
Tags: binary search, greedy, implementation, sortings, two pointers
Correct Solution:
```
from sys import stdin, stdout
n = int(stdin.readline())
products = []
for _ in range(n):
products.append([int(x) for x in stdin.readline().split()])
products.sort(key = lambda x:x[1], reverse = True)
answer = 0
volume = 0
... | output | 1 | 27,688 | 10 | 55,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,689 | 10 | 55,378 |
Yes | output | 1 | 27,689 | 10 | 55,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,690 | 10 | 55,380 |
Yes | output | 1 | 27,690 | 10 | 55,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,691 | 10 | 55,382 |
Yes | output | 1 | 27,691 | 10 | 55,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,692 | 10 | 55,384 |
Yes | output | 1 | 27,692 | 10 | 55,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,693 | 10 | 55,386 |
No | output | 1 | 27,693 | 10 | 55,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,694 | 10 | 55,388 |
No | output | 1 | 27,694 | 10 | 55,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,695 | 10 | 55,390 |
No | output | 1 | 27,695 | 10 | 55,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the best store — "PriceFixed". Here are some rules of that store:
... | instruction | 0 | 27,696 | 10 | 55,392 |
No | output | 1 | 27,696 | 10 | 55,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,745 | 10 | 55,490 |
Tags: greedy, math
Correct Solution:
```
from sys import stdin, stdout
input = stdin.readline
print = stdout.write
n=int(input())
a,g=0,0
sol=""
for i in range (n):
prva, druga = map(int, input().split())
if a+prva-g<=500:
a+=prva
print("A")
else:
g+=druga
print("G")
``` | output | 1 | 27,745 | 10 | 55,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,746 | 10 | 55,492 |
Tags: greedy, math
Correct Solution:
```
from math import ceil,radians,cos,sin,atan,degrees
from sys import stdin,stdout
def main():
s1,s2 = 0,0
n = int(stdin.readline().strip())
r = ''
for i in range(n):
a,b = [int(i) for i in stdin.readline().split()]
if abs(s1-b-s2) <= 500:
... | output | 1 | 27,746 | 10 | 55,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,747 | 10 | 55,494 |
Tags: greedy, math
Correct Solution:
```
sum = 0
s = ''
n = int(input())
for _ in range(n):
a,g = map(int,input().split())
if sum+a <= 500:
sum+=a
s+='A'
else:
sum-=g
s += 'G'
print(s)
``` | output | 1 | 27,747 | 10 | 55,495 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,748 | 10 | 55,496 |
Tags: greedy, math
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from types import GeneratorType
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
self.os = os
self._fd = file.fileno()
self.buffe... | output | 1 | 27,748 | 10 | 55,497 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,749 | 10 | 55,498 |
Tags: greedy, math
Correct Solution:
```
import sys
n=int(sys.stdin.readline())
A=[]
B=[]
diff=0
Ans=""
for i in range(n):
x,y=map(int,sys.stdin.readline().split())
if(diff+x<=500):
diff+=x
Ans+="A"
else:
diff-=y
Ans+="G"
if(abs(diff)<=500):
sys.stdout.write(Ans)
else:
... | output | 1 | 27,749 | 10 | 55,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,750 | 10 | 55,500 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
numa = 0
for i in range(n):
a, b = [int(x) for x in input().split()]
numa += a
if numa < 500:
li = ['A'] * n
print(''.join(li))
else:
i = 0
while numa >= 500:
numa -= 1000
i += 1
li = ['G'] * i + ['A'] * (n - i)
pr... | output | 1 | 27,750 | 10 | 55,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,751 | 10 | 55,502 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
k = (sum(int(input().split()[0]) for i in range(n))+499)//1000
print('G'*k+'A'*(n-k))
``` | output | 1 | 27,751 | 10 | 55,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.
The kids are excited because j... | instruction | 0 | 27,752 | 10 | 55,504 |
Tags: greedy, math
Correct Solution:
```
from sys import stdin, stdout
def main():
n = int(stdin.readline())
a = []
ind = []
total = 0
for i in range(n):
x, y = map(int, stdin.readline().split())
a.append(x)
total += x
ind.append(i)
ind.sort(key=lambda k: a[k], ... | output | 1 | 27,752 | 10 | 55,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,753 | 10 | 55,506 |
Yes | output | 1 | 27,753 | 10 | 55,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,754 | 10 | 55,508 |
Yes | output | 1 | 27,754 | 10 | 55,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,755 | 10 | 55,510 |
Yes | output | 1 | 27,755 | 10 | 55,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,756 | 10 | 55,512 |
Yes | output | 1 | 27,756 | 10 | 55,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,757 | 10 | 55,514 |
No | output | 1 | 27,757 | 10 | 55,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,758 | 10 | 55,516 |
No | output | 1 | 27,758 | 10 | 55,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,759 | 10 | 55,518 |
No | output | 1 | 27,759 | 10 | 55,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Bitlandians are quite weird people. They have very peculiar customs.
As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. ... | instruction | 0 | 27,760 | 10 | 55,520 |
No | output | 1 | 27,760 | 10 | 55,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will either buy one share, sell one share, or... | instruction | 0 | 27,975 | 10 | 55,950 |
Tags: constructive algorithms, data structures, greedy
Correct Solution:
```
import heapq as hq
n = int(input())
a = list(map(int,input().split()))
ans = 0
q = []
for i in range(n):
if q:
x = hq.heappop(q)
if x < a[i]:
ans += a[i]-x
hq.heappush(q,a[i])
else:
hq.heappush(q,x)
hq.heappus... | output | 1 | 27,975 | 10 | 55,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will either buy one share, sell one share, or... | instruction | 0 | 27,976 | 10 | 55,952 |
Tags: constructive algorithms, data structures, greedy
Correct Solution:
```
import math
from heapq import *
def maxProfit(prices, days):
payoff = 0
maxPrice, minPrice = max(prices), min(prices)
maxIndex, minIndex = prices.index(maxPrice), prices.index(minPrice)
iterator = iter(prices)
h = [] # ... | output | 1 | 27,976 | 10 | 55,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will either buy one share, sell one share, or... | instruction | 0 | 27,977 | 10 | 55,954 |
Tags: constructive algorithms, data structures, greedy
Correct Solution:
```
from heapq import *
N = int(input())
price = [int(i) for i in input().split()]
total = 0
inf = (10**6) + 1
h = [inf]
#Assume we bought and sold optimally for the first k prices.
#We adjust our answer for the (k+1)th price that comes up.
for... | output | 1 | 27,977 | 10 | 55,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will either buy one share, sell one share, or... | instruction | 0 | 27,978 | 10 | 55,956 |
Tags: constructive algorithms, data structures, greedy
Correct Solution:
```
from heapq import heappush,heappop
n=int(input())
ar=list(map(int,input().split()))
unsed=[]
selled=[]
sm=0
for x in ar:
U,S=len(unsed),len(selled)
u=heappop(unsed) if U else float('inf')
s=heappop(selled) if S else float('inf')
... | output | 1 | 27,978 | 10 | 55,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day yo... | instruction | 0 | 27,979 | 10 | 55,958 |
No | output | 1 | 27,979 | 10 | 55,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day yo... | instruction | 0 | 27,980 | 10 | 55,960 |
No | output | 1 | 27,980 | 10 | 55,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day yo... | instruction | 0 | 27,981 | 10 | 55,962 |
No | output | 1 | 27,981 | 10 | 55,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day yo... | instruction | 0 | 27,982 | 10 | 55,964 |
No | output | 1 | 27,982 | 10 | 55,965 |
Provide a correct Python 3 solution for this coding contest problem.
To become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives.
He is famous across the country for his ability to for... | instruction | 0 | 28,016 | 10 | 56,032 |
"Correct Solution:
```
N=int(input())
A=list(map(int, input().split()))
mon=1000
for i in range(1,N):
if A[i]>A[i-1]:
sho,mod=divmod(mon,A[i-1])
mon=sho*A[i]+mod
print(mon)
``` | output | 1 | 28,016 | 10 | 56,033 |
Provide a correct Python 3 solution for this coding contest problem.
To become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives.
He is famous across the country for his ability to for... | instruction | 0 | 28,017 | 10 | 56,034 |
"Correct Solution:
```
N=int(input())
A=list(map(int, input().split()))
mon=1000
for i in range(1,N):
if A[i]>A[i-1]:
mon=mon//A[i-1]*A[i]+mon%A[i-1]
print(mon)
``` | output | 1 | 28,017 | 10 | 56,035 |
Provide a correct Python 3 solution for this coding contest problem.
To become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives.
He is famous across the country for his ability to for... | instruction | 0 | 28,018 | 10 | 56,036 |
"Correct Solution:
```
n = int(input())
a = [int(i) for i in input().split()]
assets = 1000
for i in range(n - 1):
if a[i] < a[i + 1]:
assets = assets//a[i] * a[i + 1] + assets%a[i]
print(assets)
``` | output | 1 | 28,018 | 10 | 56,037 |
Provide a correct Python 3 solution for this coding contest problem.
To become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives.
He is famous across the country for his ability to for... | instruction | 0 | 28,019 | 10 | 56,038 |
"Correct Solution:
```
N = int(input())
A = list(map(int,input().split()))
m = 1000
stock = 0
for i in range(N-1):
if A[i] < A[i+1]:
stock = m//A[i]
m = m%A[i] + stock*A[i+1]
print(m)
``` | output | 1 | 28,019 | 10 | 56,039 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.