659A - Round House ( A - Round House)

 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 = 6a = 2b =  - 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 na 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
Copy
6 2 -5
output
Copy
3
input
Copy
5 1 3
output
Copy
4
input
Copy
3 2 7
output
Copy
3
Note
The first example is illustrated by the picture in the statements.



  1. #include
    <bits/stdc++.h>
  2. using namespace std;
  3. int main(){
  4. long n,a,b,ev=0,ans=0;
  5. cin>>n>>a>>b; int x=abs(b);
  6. if(b>0){
  7. while(b--){a=a+1;
  8. if(a>n) a=1;
  9.  
  10. }
  11. cout<<a;
  12. }
  13. else { while(x--){
  14. a=a-1;
  15. if(a==0) a=n;
  16. ans++;
  17. }
  18. cout<<a;
  19. }
  20. return 0;
  21. }

Comments

Popular posts from this blog

Codeforce Problem 1703A. YES or YES?

Aptitude test assistant programmer 2018

1041A. Heist solution