message stringlengths 2 43.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 853 107k | cluster float64 24 24 | __index_level_0__ int64 1.71k 214k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 39,287 | 24 | 78,574 |
No | output | 1 | 39,287 | 24 | 78,575 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 39,288 | 24 | 78,576 |
No | output | 1 | 39,288 | 24 | 78,577 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 39,289 | 24 | 78,578 |
No | output | 1 | 39,289 | 24 | 78,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 39,290 | 24 | 78,580 |
No | output | 1 | 39,290 | 24 | 78,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he cons... | instruction | 0 | 39,673 | 24 | 79,346 |
Tags: implementation
Correct Solution:
```
a = str(input().strip())
add = 0
for i in (a):
add += int(i)
# temp = add
while (add % 4) != 0:
a = str(int(a)+ 1)
add = 0
for i in a:
add += int(i)
print(a)
``` | output | 1 | 39,673 | 24 | 79,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he cons... | instruction | 0 | 39,676 | 24 | 79,352 |
Tags: implementation
Correct Solution:
```
# your code goes here
a=int(input())
res=0
while res==0:
l=list(map(int,list(str(a))))
if sum(l)%4==0:
res=a
break
a+=1
print(res)
``` | output | 1 | 39,676 | 24 | 79,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by 4, are also somewhat interesting. Thus, he cons... | instruction | 0 | 39,679 | 24 | 79,358 |
Tags: implementation
Correct Solution:
```
a=[int(i) for i in list(input())]
while(True):
if(sum(a)%4==0):
a=[str(i) for i in a]
a="".join(a)
print(a)
exit()
else:
a=[str(i) for i in a]
a="".join(a)
a=int(a)+1
a=[int(i) for i in str(a)]
``` | output | 1 | 39,679 | 24 | 79,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,680 | 24 | 79,360 |
Yes | output | 1 | 39,680 | 24 | 79,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,681 | 24 | 79,362 |
Yes | output | 1 | 39,681 | 24 | 79,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,682 | 24 | 79,364 |
Yes | output | 1 | 39,682 | 24 | 79,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,683 | 24 | 79,366 |
Yes | output | 1 | 39,683 | 24 | 79,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,684 | 24 | 79,368 |
No | output | 1 | 39,684 | 24 | 79,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,685 | 24 | 79,370 |
No | output | 1 | 39,685 | 24 | 79,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,686 | 24 | 79,372 |
No | output | 1 | 39,686 | 24 | 79,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the sum of the digits of which is divisible by ... | instruction | 0 | 39,687 | 24 | 79,374 |
No | output | 1 | 39,687 | 24 | 79,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,119 | 24 | 80,238 |
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
numbers = []
for i in range(0,n):
number = input()
numbers.append(number)
telep = {}
count = 1
for number in numbers:
for l in range(1, len(number)+1):
for i in range(0, len(number) - l + 1):
key = num... | output | 1 | 40,119 | 24 | 80,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,120 | 24 | 80,240 |
Tags: data structures, implementation, sortings
Correct Solution:
```
import math
from collections import *
a=int(input())
indx=defaultdict(list)
done=defaultdict(list)
for t in range(a):
s=input()
for i in range(len(s)):
for j in range(i,len(s)):
m=s[i:j+1]
if(len(... | output | 1 | 40,120 | 24 | 80,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,121 | 24 | 80,242 |
Tags: data structures, implementation, sortings
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 = "x" in file.mode ... | output | 1 | 40,121 | 24 | 80,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,122 | 24 | 80,244 |
Tags: data structures, implementation, sortings
Correct Solution:
```
"""
-----------------------------Pseudo---------------------------------
"""
import sys
from collections import defaultdict
def input(): return sys.stdin.readline()
def print(arg, *argv, end=None):
sys.stdout.write(str(arg))
for i in argv: sy... | output | 1 | 40,122 | 24 | 80,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,123 | 24 | 80,246 |
Tags: data structures, implementation, sortings
Correct Solution:
```
h = [(i, j) for i in range(9) for j in range(i + 1, 10)]
n = int(input())
s, p = {}, [''] * n
for k in range(n):
t = input()
for q in [t[i: j] for i, j in h]:
s[q] = -1 if q in s and s[q] != k else k
for q, k in s.items():
if k >=... | output | 1 | 40,123 | 24 | 80,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,124 | 24 | 80,248 |
Tags: data structures, implementation, sortings
Correct Solution:
```
def podstroki(s):
return sorted(set(s[i: i1] for i in range(9) for i1 in range (i+1, 10)), key=len)
res = {}
spisok = [podstroki(input()) for i in range (int(input()))]
for s in spisok:
for podstr in s:
if podstr in res:
... | output | 1 | 40,124 | 24 | 80,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,125 | 24 | 80,250 |
Tags: data structures, implementation, sortings
Correct Solution:
```
n=int(input())
a=[]
d={}
for _ in range(n):
s=input()
g=set()
for i in range(len(s)):
for k in range(i,len(s)):
st=s[i:k+1]
if st in g:
continue
else:
g.add(st)
... | output | 1 | 40,125 | 24 | 80,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest version of Berdroid OS installed on Polycarp's phone.... | instruction | 0 | 40,126 | 24 | 80,252 |
Tags: data structures, implementation, sortings
Correct Solution:
```
n = int(input())
l = []
for i in range(n):
l.append(input())
d = {}
for k in l:
for i in range(1, 9 + 1):
for j in range(9 - i + 1):
a = k[j:j + i]
z = d.keys()
if a in z:
if k != d... | output | 1 | 40,126 | 24 | 80,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,127 | 24 | 80,254 |
Yes | output | 1 | 40,127 | 24 | 80,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,128 | 24 | 80,256 |
Yes | output | 1 | 40,128 | 24 | 80,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,129 | 24 | 80,258 |
Yes | output | 1 | 40,129 | 24 | 80,259 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,130 | 24 | 80,260 |
Yes | output | 1 | 40,130 | 24 | 80,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,131 | 24 | 80,262 |
No | output | 1 | 40,131 | 24 | 80,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,132 | 24 | 80,264 |
No | output | 1 | 40,132 | 24 | 80,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,133 | 24 | 80,266 |
No | output | 1 | 40,133 | 24 | 80,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.
There is the latest versio... | instruction | 0 | 40,134 | 24 | 80,268 |
No | output | 1 | 40,134 | 24 | 80,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,643 | 24 | 81,286 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
from collections import defaultdict as dc
from collections import Counter
from bisect import bisect_right, bisect_left
import math
from operator import itemgetter
from heapq import heapify, heappop, he... | output | 1 | 40,643 | 24 | 81,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,644 | 24 | 81,288 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writa... | output | 1 | 40,644 | 24 | 81,289 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,645 | 24 | 81,290 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
ctr = {}
for i in a:
ctr[i] = ctr.get(i, 0) + 1
borders = set([j for i, j in ctr.items()])
best = 10**9
for bord in bo... | output | 1 | 40,645 | 24 | 81,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,646 | 24 | 81,292 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
import sys,math,itertools
from collections import Counter,deque,defaultdict
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify, nlargest
from copy import deepcopy
mod = 10**9+7
INF = float('inf')
def ... | output | 1 | 40,646 | 24 | 81,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,647 | 24 | 81,294 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
from collections import Counter
from sys import stdin
def solve(arr, n):
c = Counter(arr)
s = sorted(c.values(), reverse=True)
#print(s)
res = n
d = Counter(s)
#print(d)
for i in range(s[0]+1):
tmp =... | output | 1 | 40,647 | 24 | 81,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,648 | 24 | 81,296 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
def solve(a):
li = get_counts(a)
solution = 0
for i in range(len(li)):
temp_solution = li[i] * (len(li) - i)
if temp_solution > solution:
solution = temp_solution
print(len(a) - solution)
de... | output | 1 | 40,648 | 24 | 81,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,649 | 24 | 81,298 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
def solve():
n = int(input())
arr = [int(i) for i in input().split()]
dic = {}
for i in range(n):
if arr[i] in dic:
dic[arr[i]] += 1
else:
dic[arr[i]] = 1
values = list(dic.valu... | output | 1 | 40,649 | 24 | 81,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to remove some elements from the array a to make i... | instruction | 0 | 40,650 | 24 | 81,300 |
Tags: binary search, data structures, greedy, math, sortings
Correct Solution:
```
from collections import*
for t in range(int(input())):
z=s=int(input())
c=0
for x,y in sorted(Counter(Counter(input().split()).values()).items())[::-1]:
c+=y
z=min(z,s-c*x)
print(z)
``` | output | 1 | 40,650 | 24 | 81,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,651 | 24 | 81,302 |
Yes | output | 1 | 40,651 | 24 | 81,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,652 | 24 | 81,304 |
Yes | output | 1 | 40,652 | 24 | 81,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,653 | 24 | 81,306 |
Yes | output | 1 | 40,653 | 24 | 81,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,654 | 24 | 81,308 |
Yes | output | 1 | 40,654 | 24 | 81,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,655 | 24 | 81,310 |
No | output | 1 | 40,655 | 24 | 81,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,656 | 24 | 81,312 |
No | output | 1 | 40,656 | 24 | 81,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,657 | 24 | 81,314 |
No | output | 1 | 40,657 | 24 | 81,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp was gifted an array a of length n. Polycarp considers an array beautiful if there exists a number C, such that each number in the array occurs either zero or C times. Polycarp wants to ... | instruction | 0 | 40,658 | 24 | 81,316 |
No | output | 1 | 40,658 | 24 | 81,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants ... | instruction | 0 | 42,400 | 24 | 84,800 |
Tags: implementation
Correct Solution:
```
n, m = [int(i) for i in input().split()]
print(*[n // m + 1 if i < n % m else n // m for i in range(m)])
``` | output | 1 | 42,400 | 24 | 84,801 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants ... | instruction | 0 | 42,401 | 24 | 84,802 |
Tags: implementation
Correct Solution:
```
m,n=input().split()
m=int(m)
n=int(n)
while(n!=0):
if m%n:
print(int(m/n))
m=m-int(m/n)
n -= 1
else:
for i in range(n):
print(int(m/n))
exit()
``` | output | 1 | 42,401 | 24 | 84,803 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarpus has got n candies and m friends (n ≥ m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants ... | instruction | 0 | 42,402 | 24 | 84,804 |
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split( ))
a=[]
for i in range(0,m):
a.append(n//m)
n=n%m
for i in range(0,n):
a[i]+=1
for i in a:
print(i,end=' ')
``` | output | 1 | 42,402 | 24 | 84,805 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.