CodeForces 659 A. Round House（简单数学推理）

110 阅读 0 评论 73 点赞

我是靠谱客的博主忐忑雨，最近开发中收集的这篇文章主要介绍CodeForces 659 A. 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.

题目大意：
有n个数从小到大排列，需要注意的首尾相接也就是一个环，然后有一个人站在a处，他需要走b步，看能够到达什么地方，如果b是<0的那么就是倒着走，否则就是正着走（语言表达能力太差。。。）

解题思路：
其实这个题目我没就是分析一下就行，注意分情况讨论一下，假设b>0，那么我们只需要(a+b)%n取余就行了，注意取余之后如果是0的话就输出n，当b<0的时候，我们首先判断一下他能不能到达1，然后如果到达了1在走的话就是

n - a b s ((a - (b)))

$n-abs((a-(b)))$ 然后这个公式对n取余，同样注意取余之后是0的情况

然后就可以写代码了：
上代码：

#include <iostream>

using namespace std;

int main()
{
    int n, a, b;
    while(cin>>n>>a>>b)
    {
        if(b == 0)
            cout<<a<<endl;
        else if(b < 0)
        {
            if(a+b >= 1)
            {
                cout<<(a+b)<<endl;
            }
            else
            {
                cout<<n+((a+b)%n)<<endl;
            }

        }
        else
        {
            if((a+b)%n)
                cout<<(a+b)%n<<endl;
            else
                cout<<n<<endl;
        }
    }
    return 0;
}