该博客讨论了AtCode ABC148的C题，即如何在预计人数为A或B的聚会上，找到能均匀分配给所有嘉宾的最少零食数量，确保无论人数是A还是B，都能整除零食总数。题目要求不拆分零食，博主提供了通过计算最小公倍数来解决问题的方法。
标签
- 数学、最大公约数、最小公倍数
题目地址
C - Snack
- https://atcoder.jp/contests/abc148/tasks/abc148_c?lang=en
问题描述
Problem Statement
Takahashi is organizing a party.
At the party, each guest will receive one or more snack pieces.
Takahashi predicts that the number of guests at this party will be A or B.
Find the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.
We assume that a piece cannot be divided and distributed to multiple guests.
Constraints
- 1 ≤ \leq
最低0.47元/天 解锁文章
扫一扫
421
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
