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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of times.
Vasya currently has s roubles, and he wants... | instruction | 0 | 105,275 | 10 | 210,550 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
l = [list(map(int, input().split())) for i in range(n)]
for t in l:
count = (t[0]//t[3])//t[1]
print(count*t[1] + count*t[2] + (t[0]//t[3])%t[1])
``` | output | 1 | 105,275 | 10 | 210,551 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of times.
Vasya currently has s roubles, and he wants... | instruction | 0 | 105,276 | 10 | 210,552 |
Tags: implementation, math
Correct Solution:
```
t = int(input())
ans = [0]*t
for i in range(t):
s,a,b,c = [int(j) for j in input().split()]
s //= c
ans[i] = (s//a)*(a+b) + s%a
for j in ans:
print(j)
``` | output | 1 | 105,276 | 10 | 210,553 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of times.
Vasya currently has s roubles, and he wants... | instruction | 0 | 105,277 | 10 | 210,554 |
Tags: implementation, math
Correct Solution:
```
t = int( input() )
for T in range(t):
s, a, b, c = list( map( int, input().split() ) )
how = int( s / (a*c ) )
s -= a*c*how
#print( 'rem', s)
ans = how*(a+b)
print( ans + int(s/c) )
``` | output | 1 | 105,277 | 10 | 210,555 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of times.
Vasya currently has s roubles, and he wants... | instruction | 0 | 105,278 | 10 | 210,556 |
Tags: implementation, math
Correct Solution:
```
t = int(input())
for _ in range(t):
s, a, b, c = map(int, input().split())
chocolates = s//c
print(chocolates + (chocolates//a * b))
``` | output | 1 | 105,278 | 10 | 210,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,279 | 10 | 210,558 |
Yes | output | 1 | 105,279 | 10 | 210,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,280 | 10 | 210,560 |
Yes | output | 1 | 105,280 | 10 | 210,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,281 | 10 | 210,562 |
Yes | output | 1 | 105,281 | 10 | 210,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,282 | 10 | 210,564 |
Yes | output | 1 | 105,282 | 10 | 210,565 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,283 | 10 | 210,566 |
No | output | 1 | 105,283 | 10 | 210,567 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,284 | 10 | 210,568 |
No | output | 1 | 105,284 | 10 | 210,569 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,285 | 10 | 210,570 |
No | output | 1 | 105,285 | 10 | 210,571 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of time... | instruction | 0 | 105,286 | 10 | 210,572 |
No | output | 1 | 105,286 | 10 | 210,573 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Lunar New Year is approaching, and Bob is going to receive some red envelopes with countless money! But collecting money from red envelopes is a time-consuming process itself.
Let's describe th... | instruction | 0 | 105,288 | 10 | 210,576 |
No | output | 1 | 105,288 | 10 | 210,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,882 | 10 | 211,764 |
Tags: dp, greedy
Correct Solution:
```
l=[100,20,10,5,1]
n=int(input())
s=0
for i in l:
s+=n//i
n=n%i
print(s)
``` | output | 1 | 105,882 | 10 | 211,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,883 | 10 | 211,766 |
Tags: dp, greedy
Correct Solution:
```
N = int(input())
F, tmp = [0]*(N%100+1), 0
F[0] = 0
if N >= 100:
tmp = N // 100
#print(N)
for i in range(1, N%100+1):
if i >= 100: F[i] = 1 + min(F[i-1], F[i-5], F[i-10], F[i-20], F[i-100])
elif i >= 20: F[i] = 1 + min(F[i-1], F[i-5], F[i-10], F[i-20])
elif i >= 10... | output | 1 | 105,883 | 10 | 211,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,884 | 10 | 211,768 |
Tags: dp, greedy
Correct Solution:
```
import math
n = int(input())
ans = n//100
n=n%100
ans += n//20
n = n%20
ans += n//10
n = n%10
ans += n//5
n = n%5
ans += n
print(ans)
``` | output | 1 | 105,884 | 10 | 211,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,885 | 10 | 211,770 |
Tags: dp, greedy
Correct Solution:
```
n=int(input().replace(',',''))
c=0
if(n>=100):
c+=n//100
n=n%100
if(n>=20):
c+=n//20
n=n%20
if(n>=10):
c+=n//10
n=n%10
if(n>=5):
c+=n//5
n=n%5
print(c+n)
``` | output | 1 | 105,885 | 10 | 211,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,886 | 10 | 211,772 |
Tags: dp, greedy
Correct Solution:
```
def main():
n = int(input())
bill = 0
if n >= 100:
bill += n//100
n %= 100
if n >= 20:
bill+= n//20
n %= 20
if n >= 10:
bill+= n//10
n %= 10
if n >= 5:
bill+= n//5
n... | output | 1 | 105,886 | 10 | 211,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,887 | 10 | 211,774 |
Tags: dp, greedy
Correct Solution:
```
# https://codeforces.com/problemset/problem/996/A
# variation of unbounded knapsack and also has greedy appraoch to it
# O(Nd) time - TLE for 10^9 input
# def lottery(total, coins):
# dp = [float("inf")] * (total + 1)
# dp[0] = 0
# for coin in coins:
# for am... | output | 1 | 105,887 | 10 | 211,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,888 | 10 | 211,776 |
Tags: dp, greedy
Correct Solution:
```
n = int(input())
ans=0
ans+=int(n/100)
n%=100
ans+=int(n/20)
n%=20
ans+=int(n/10)
n%=10
ans+=int(n/5)
n%=5
ans+=n
print(ans)
``` | output | 1 | 105,888 | 10 | 211,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bi... | instruction | 0 | 105,889 | 10 | 211,778 |
Tags: dp, greedy
Correct Solution:
```
n=int(input())
c=0
c=c+n//100
n=n%100
c=c+n//20
n=n%20
c=c+n//10
n=n%10
c=c+n//5
n=n%5
c=c+n
print(c)
``` | output | 1 | 105,889 | 10 | 211,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,890 | 10 | 211,780 |
Yes | output | 1 | 105,890 | 10 | 211,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,891 | 10 | 211,782 |
Yes | output | 1 | 105,891 | 10 | 211,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,892 | 10 | 211,784 |
Yes | output | 1 | 105,892 | 10 | 211,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,893 | 10 | 211,786 |
Yes | output | 1 | 105,893 | 10 | 211,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,894 | 10 | 211,788 |
No | output | 1 | 105,894 | 10 | 211,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,895 | 10 | 211,790 |
No | output | 1 | 105,895 | 10 | 211,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,896 | 10 | 211,792 |
No | output | 1 | 105,896 | 10 | 211,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5... | instruction | 0 | 105,897 | 10 | 211,794 |
No | output | 1 | 105,897 | 10 | 211,795 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,023 | 10 | 212,046 |
"Correct Solution:
```
class Data:
def __init__(self,n,p):
self.name = str(n)
self.price = int(p)
self.recipe = []
def minCost(self):
if self.recipe == []:
return self.price
else:
return min(self.price,
sum(list(map(lambda x... | output | 1 | 106,023 | 10 | 212,047 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,024 | 10 | 212,048 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
def_dic = {}
for _ in range(n):
s, p = input().split()
def_dic[s] = int(p)
m = int(input())
com_dic = {}
for _ in range(m):
lst = input().split()
com_dic[lst[0]] = lst[2:]
price_dic = {}
def get_price(t)... | output | 1 | 106,024 | 10 | 212,049 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,025 | 10 | 212,050 |
"Correct Solution:
```
# AOJ 0201: Wrought Gold Master
# Python3 2018.6.26 bal4u
INF = 0x7fffffff
def calc(t):
ans = INF
if len(mono[t][1]) > 0:
ans = 0
for i in mono[t][1]: ans += calc(i)
return min(ans, mono[t][0])
while True:
n = int(input())
if n == 0: break
mono = {}
for i in range(n):
s, p = input... | output | 1 | 106,025 | 10 | 212,051 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,026 | 10 | 212,052 |
"Correct Solution:
```
# from pprint import pprint as pprint
import copy
def findrecipe(rec,ite,obj):
# pprint(rec)
# print("obj: ",obj)
# print("=-")
try:
mat = rec[obj]
rec2 = copy.copy(rec)
del rec2[obj]
price = min(ite[obj],sum([findrecipe(rec2,ite,m) for m in mat]))... | output | 1 | 106,026 | 10 | 212,053 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,027 | 10 | 212,054 |
"Correct Solution:
```
# Aizu Problem 0201: Wrought Gold Master
#
import sys, math, os
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
class DirectedGraph():
def __init__(self):
self.edges = {}
def AddNode(self, node):
if node not... | output | 1 | 106,027 | 10 | 212,055 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,028 | 10 | 212,056 |
"Correct Solution:
```
items = {}
recipes = {}
def reset():
items.clear()
recipes.clear()
def algorithm():
while True:
item_number = int(input())
if item_number == 0:
break
reset()
for _ in range(item_number):
item, price = input().split()
... | output | 1 | 106,028 | 10 | 212,057 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,029 | 10 | 212,058 |
"Correct Solution:
```
items = {}
recipes = {}
def reset():
items.clear()
recipes.clear()
def algorithm():
while True:
reset()
for _ in range(int(input())):
item, price = input().split()
items[item] = int(price)
if len(items) == 0:
break
... | output | 1 | 106,029 | 10 | 212,059 |
Provide a correct Python 3 solution for this coding contest problem.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an ... | instruction | 0 | 106,030 | 10 | 212,060 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
#import pdb;pdb.set_trace()
if False:
fh = open('vol2_0201.txt', 'r')
else:
fh = sys.stdin
def input():
return(fh.readline())
def tot(item, pr, rec):
if item in rec:
ret = min(pr[item], sum([tot(p,pr,rec) for p in rec[item]]))
... | output | 1 | 106,030 | 10 | 212,061 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,031 | 10 | 212,062 |
Yes | output | 1 | 106,031 | 10 | 212,063 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,032 | 10 | 212,064 |
Yes | output | 1 | 106,032 | 10 | 212,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,033 | 10 | 212,066 |
Yes | output | 1 | 106,033 | 10 | 212,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,034 | 10 | 212,068 |
No | output | 1 | 106,034 | 10 | 212,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,035 | 10 | 212,070 |
No | output | 1 | 106,035 | 10 | 212,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,036 | 10 | 212,072 |
No | output | 1 | 106,036 | 10 | 212,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A... | instruction | 0 | 106,037 | 10 | 212,074 |
No | output | 1 | 106,037 | 10 | 212,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a set of n weights. You know that their masses are a_1, a_2, ..., a_n grams, but you don't know which of them has which mass. You can't distinguish the weights.
However, your friend do... | instruction | 0 | 106,150 | 10 | 212,300 |
No | output | 1 | 106,150 | 10 | 212,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants ... | instruction | 0 | 106,492 | 10 | 212,984 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
T=int(input())
while T>0:
T-=1
n,l,r=map(int,input().split())
t = n//l
if t*r>=n:
print("Yes")
else:
print("No")
``` | output | 1 | 106,492 | 10 | 212,985 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants ... | instruction | 0 | 106,493 | 10 | 212,986 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
# https://codeforces.com/problemset/problem/397/B
import sys
sys.setrecursionlimit(1500)
inst_num = int(input())
#reading data
n = 0
l = 0
r = 0
def payment_possible(total, l, r):
max_coins = int(total/l)
if r * max_coins >= total:
... | output | 1 | 106,493 | 10 | 212,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants ... | instruction | 0 | 106,494 | 10 | 212,988 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
import sys; sys.setrecursionlimit(1000000)
def solve():
tests, = rv()
for test in range(tests):
n,l,r, = rv()
largestused = (n + r - 1) // r
totalnum = largestused * r
mostcansubtract = largestused * (r - ... | output | 1 | 106,494 | 10 | 212,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants ... | instruction | 0 | 106,495 | 10 | 212,990 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
def possible(numbers):
return int(numbers[0])//int(numbers[1])!=0 and int(numbers[0])%int(numbers[1])//(int(numbers[0])//int(numbers[1]))<=int(numbers[2])-int(numbers[1]) and int(numbers[0])%int(numbers[1])%int(numbers[0])//int(numbers[1]... | output | 1 | 106,495 | 10 | 212,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants ... | instruction | 0 | 106,496 | 10 | 212,992 |
Tags: constructive algorithms, implementation, math
Correct Solution:
```
# from dust i have come, dust i will be
t=int(input())
while t>0:
t-=1
n,l,r=map(int,input().split())
k=n//l
if r*k>=n:
print('Yes')
else:
print('No')
``` | output | 1 | 106,496 | 10 | 212,993 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.