HDU--2104--hide handkerchief--解题报告（辗转相除的运用）

最新推荐文章于 2020-12-24 20:18:09 发布

xiaotaoqibao

最新推荐文章于 2020-12-24 20:18:09 发布

阅读量1.8k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ACM/ICPC 文章标签： search input each fun 任务 c

本文链接：https://blog.youkuaiyun.com/xiaotaoqibao/article/details/4432973

这篇博客详细介绍了如何使用辗转相除法解决HDU 2104问题。内容包括解题思路、算法实现及C语言代码展示，帮助读者理解辗转相除在数学问题求解中的应用。

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

Problem Description

The Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.
Now I introduce the game to you. Suppose there are N people played the game ,who sit on the ground forming a circle ,everyone owns a box behind them .Also there is a beautiful handkerchief hid in a box which is one of the boxes .
Then Haha(a friend of mine) is called to find the handkerchief. But he has a strange habit. Each time he will search the next box which is separated by M-1 boxes from the current box. For example, there are three boxes named A,B,C, and now Haha is at place of A. now he decide the M if equal to 2, so he will search A first, then he will search the C box, for C is separated by 2-1 = 1 box B from the current box A . Then he will search the box B ,then he will search the box A.
So after thre