#B. 猴子选大王

    Type: Default 1000ms 256MiB

猴子选大王

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

题目描述

有n只猴子围成一圈,从1~n编号,大家决定从中选出一个大王。经过协商,决定选大王的规则为:从编号为1的猴子开始报数,报到k的猴子出圈,然后再从下一只开始继续报1到k……最后剩下来的那一只就是大王。要求编程从键盘输入n、k,输出成为大王的猴子编号。

输入

一行两个正整数n和k,2n10002k1092≤n≤1000,2≤k≤10^9

输出

一行一个正整数,代表猴王的编号。

3 2
3

周六下午 结构体

Not Claimed
Status
Done
Problem
3
Open Since
2026-5-16 0:00
Deadline
2026-5-24 23:59
Extension
24 hour(s)