关闭

Codeforces Round #346 (Div. 2)Round House(数学,找规律)

112人阅读 评论(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;
}
题意:小明出去散步,告诉你围绕他家一圈多大。给他家排序,顺时针从1开始一直到n,还告诉你小明所在位置还有小明走了多少步b。b为负数就是逆时针走(坑到这了)。

然后问你小明最后在那个位置停住。

思路:先给小明家一圈编号,在判断b的正负值,最后根据规律输出最后所在位置就行。

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:28136次
    • 积分:2568
    • 等级:
    • 排名:第14915名
    • 原创:240篇
    • 转载:11篇
    • 译文:0篇
    • 评论:4条