Vasya lives in a round building, whose entrances are numbered sequentially by integers from 1 to n. Entrance n and entrance 1 are adjacent.
Today Vasya got bored and decided to take a walk in the yard. Vasya lives in entrance a and he decided that during his walk he will move around the house b entrances in the direction of increasing numbers (in this order entrance n should be followed by entrance 1). The negative value of b corresponds to moving |b| entrances in the order of decreasing numbers (in this order entrance 1 is followed by entrance n). If b = 0, then Vasya prefers to walk beside his entrance.
Illustration for n = 6, a = 2, b = - 5.
Help Vasya to determine the number of the entrance, near which he will be at the end of his walk.
Input
The single line of the input contains three space-separated integers n, a and b (1 ≤ n ≤ 100, 1 ≤ a ≤ n, - 100 ≤ b ≤ 100) — the number of entrances at Vasya's place, the number of his entrance and the length of his walk, respectively.
Output
Print a single integer k (1 ≤ k ≤ n) — the number of the entrance where Vasya will be at the end of his walk.
Examples
Input
6 2 -5
Output
3
Input
5 1 3
Output
4
Input
3 2 7
Output
3
Note
The first example is illustrated by the picture in the statements.
题意:
给你三个数 , n , a , b。
n 表示一共有n个房间绕成一个圆圈。
a 表示你你起始的地方。
b>0表示顺时针走b步 , b < 0 表示逆时针走b步。
求最后到达的房间是几。
思路:
Emmmm。。。。这个想一想应该就知道推个公式啥了 , 可惜我推错了 , 后来才知道哪儿出bug了。但是已经看题解了。
可是后来想一想 ,我怎么会推成这样啊 , 手推样例都不对啊。大概是小shi shi 惹我生气了 , 气血攻心才会写错吧!!!
1.先分成俩种情况 , 分别是b >= 0 和 b < 0
(1)b >= 0时 如果a+b <= n那就直接a+b就好了 , 也不用担心超过n 取余啥了。
那反之就是要取余啦,这个式子就是我觉得贼拉神奇的 , 大概是因为我不会吧 。(所有我不会的都贼牛逼 , 仰望)
(a+b-1)%n+1;(好像特判一下也行 , 但是麻烦啊)前面减一后面加一 , 当(a+b)%n= 0 时 , 也可以得到答案 , 而不会是0.
(2)b < 0时 如果abs(b) < a ,那也就直接减就可以了。 反之拿n 减去他们相减取余的数就行了 。 这样n-((b-a)%n);
解释完毕 , 收工睡觉!!!!!!
代码:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n , a , b , k;
scanf("%d %d %d" , &n , &a , &b);
if(b >= 0)
{
if(a + b <= n)
{
k = a+b;
}
else
{
k = (a+b-1)%n+1;
}
}
else
{
b = -b;
if(b < a)
{
k = a-b;
}
else
{
k = n-((b-a)%n);
}
}
printf("%d\n" , k);
return 0;
}