Home >Web Front-end >HTML Tutorial >Codeforces Beta Round #75 (Div. 2)-A. Chips_html/css_WEB-ITnose
Codeforces Beta Round #75 (Div. 2)-A. Chips_html/css_WEB-ITnose
- WBOYOriginal
- 2016-06-24 11:55:051102browse
Chips
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There are n walruses sitting in a circle. All of them are numbered in the clockwise order: the walrus number 2 sits to the left of the walrus number 1, the walrus number 3 sits to the left of the walrus number 2, ..., the walrus number 1 sits to the left of the walrus number n.
The presenter has m chips. The presenter stands in the middle of the circle and starts giving the chips to the walruses starting from walrus number 1 and moving clockwise. The walrus number i gets i chips. If the presenter can't give the current walrus the required number of chips, then the presenter takes the remaining chips and the process ends. Determine by the given n and m how many chips the presenter will get in the end.
Input
The first line contains two integers n and m (1?≤?n?≤?50, 1?≤?m?≤?104) ? the number of walruses and the number of chips correspondingly.
Output
Print the number of chips the presenter ended up with.
Sample test(s)
input
4 11
output
input
17 107
output
input
3 8
output
Note
In the first sample the presenter gives one chip to the walrus number 1, two chips to the walrus number 2, three chips to the walrus number 3, four chips to the walrus number 4, then again one chip to the walrus number 1. After that the presenter runs out of chips. He can't give anything to the walrus number 2 and the process finishes.
In the third sample the presenter gives one chip to the walrus number 1, two chips to the walrus number 2, three chips to the walrus number 3, then again one chip to the walrus number 1. The presenter has one chip left and he can't give two chips to the walrus number2, that's why the presenter takes the last chip.
解题思路：有1~n依次循环相连，即1 -> 2 -> ... -> n-1 -> n -> 1.现有数m，从依次从1的位置开始，如果m >= 1,则m -= 1.依次i循环移动，直到m < i时，输出m即可。直接判断一下当i是n的倍数时，i = n；否则i = i%n即可。
AC代码：
#include#include #include #include #include #include #include #include