【Codeforces】659A - Round House

A. Round House  time limit per test1 second  memory limit per test256 megabytes  inputstandard input  outputstandard output  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.

读题真是费了点功夫，读懂了就不难了。

代码如下：

#include <cstdio>
int main()
{
	int n,a,b;
	int re;
	while (~scanf ("%d %d %d",&n,&a,&b))
	{
		if (b > 0)
		{
			re = b % n;
			a += re;
			if (a > n)
				printf ("%d\n",a-n);
			else
				printf ("%d\n",a);
		}
		else
		{
			int t = -b;
			re = t % n;
			a -= re;
			if (a <= 0)
				printf ("%d\n",a+n);
			else
				printf ("%d\n",a);
		}
	}
	return 0;
}