# Codeforces Round #346 (Div. 2)Round House（数学，找规律）

153人阅读 评论(0)

Description
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.

Sample Input
Input
6 2 -5
Output
3
Input
5 1 3
Output
4
Input
3 2 7
Output

3

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int q[101];
memset(q,0,sizeof(q));
int a,b;
scanf("%d %d",&a,&b);
int p=b;
q[1]=a;
if(b<=0)
{
b=abs(b);
b=b%n;
for(int i=2;i<=n;i++)
{
if(i<=a)
q[i]=a-i+1;
else
q[i]=n-i+1+a;
}
printf("%d\n",q[b+1]);
}
else
{
b=b%n;
for(int i=2;i<=n;i++)
{
q[i]=a+i-1;
if(q[i]>n)
q[i]=q[i]-n;
}
printf("%d\n",q[b+1]);
}
}
return 0;
}

0
0

个人资料
• 访问：39841次
• 积分：2790
• 等级：
• 排名：第15172名
• 原创：248篇
• 转载：13篇
• 译文：0篇
• 评论：4条