306A - Candies - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

n,m = map(int,input().split())
for i in range(n%m):
    print((n//m)+1)
for i in range(m-n%m):
    print(n//m)


Comments

Submit
1 Comments
  • 29/1/2024 10:59 - Asia/Calcutta

n,m = map(int,input().split()) for i in range(n%m): print((n//m)+1) for i in range(m-n%m): print(n//m)


More Questions

1051. Height Checker
695. Max Area of Island
402. Remove K Digits
97. Interleaving String
543. Diameter of Binary Tree
124. Binary Tree Maximum Path Sum
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
501A - Contest
160A- Twins
752. Open the Lock
1535A - Fair Playoff
1538F - Interesting Function
1920. Build Array from Permutation
494. Target Sum
797. All Paths From Source to Target
1547B - Alphabetical Strings
1550A - Find The Array
118B - Present from Lena
27A - Next Test
785. Is Graph Bipartite
90. Subsets II
1560A - Dislike of Threes
36. Valid Sudoku
557. Reverse Words in a String III
566. Reshape the Matrix
167. Two Sum II - Input array is sorted
387. First Unique Character in a String
383. Ransom Note
242. Valid Anagram
141. Linked List Cycle