超级会员免费看
这是一道关于计算机算法的问题，描述了在满月时牛的哞叫行为。每头牛的初始叫声时长由整数c决定（1 <= c <= 100），接着通过两个公式f1(c) = floor(a1 * c / d1) + b1和f2(c) = floor(a2 * c / d2) + b2生成更多时长。给定c和N，任务是找出第N次叫声的时长。题目提供了输入输出格式和样例，并指出内存限制为64MB。
题目描述
A full moon casts some sort of spell on the cows and, like their cousins the wolves and coyotes, they bay at the moon -- mooing instead of howling, of course.
Each 'moo' lasts a certain amount of time. A short 'moo' might last time 1; a longer one might last time 24 or even 1,000,000,000 or longer (cows can really moo when they want to). No 'moo' will last more than or equal to 2^63.
It should come as no surprise that the cows have a pattern to their moos. Bessie will choose an integer c (1 <= c <= 100) that is the initial length of a moo.
After Bessie moos for length c, the cows calculate times for
subsequent moos. They apply two formulae to each moo time to yield even more moo times. The two formulae
订阅专栏 解锁全文
扫一扫
147
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
