题目大意:uva 10273 - Eat or Not to Eat? 题目大意:在一个农场里有n头牛,每头牛都有一个产奶周期,然后n行就是每头牛的产奶周期;然后农场主想要杀一些奶牛来吃,所以每天就把产奶量最小的杀来吃;如果有两只产奶量一样小,那今天就不杀。输出没有杀掉的牛的个数,以及最后杀牛的日子。 解题思路:暴力枚举, 注意说停止的时间,即当前天数 - 上一次吃牛的日子 > t
文章目录 一、题目二、题解 一、题目 There are n oranges in the kitchen and you decided to eat some of these oranges every day as follows: Eat one orange. If the number of remaining oranges n is divisible by
bool x, y 打成int 搞了我好久QAQ #include<cstdio>#include<algorithm>#include<cstring>#include<iostream>#include<queue>#include<map>#define SF scanf#define PF printfusing namespace std;typedef long