acm hnu 10039 Magician (easy)

最新推荐文章于 2025-03-04 06:39:30 发布

manio

最新推荐文章于 2025-03-04 06:39:30 发布

阅读量2.5k

点赞数

分类专栏： Algorithm 文章标签： output each input random go

本文链接：https://blog.csdn.net/manio/article/details/1350412

版权

这篇博客详细介绍了参与ACM HNU 10039 'Magician'问题的解题过程，包括理解题目要求、算法设计、实现和测试。博主分享了使用随机数生成和Go语言进行编程的心得，并强调了输出格式和每个测试用例的重要性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Magician

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 157, Accepted users: 151

Problem 10039 : No special judgement

Problem description

Denis Mednoepole is a famous magician. For example, he can read spectators' minds and tell the random number that a spectator has got by means of Denis's magic machine. Any spectator can check this: he or she just rotates the wheel of the machine and looks at the 10-digit number that has appeared in the window of the machine. Within two seconds Denis will read the spectator's mind and tell the number. You must write a program that will tell this number even faster - within one second. You need to know that the magic machine has a wheel with N digits written along the edge of the wheel without spaces between them. All digits are of the same width. The window is 10 digits wide, so it shows 10 successive digits. Each time the wheel turns "one digit" an audible click is produced. So you know how many clicks Denis Mednoepole heard while the spectator was rotating the wheel.

Input

There wil be several test cases. For each test case, the first line contains two integers separated with a space, N and M. Here N (11 ≤ N ≤ 1000) is the number of the digits written on the wheel

最低0.47元/天解锁文章