Golden October online programming Competition No. 1: Little Girl count

A little girl is counting from 1 to n with her left hand fingers. She starts counting from the thumb as 1. Then, the index finger is 2, the middle finger is 3, the ring finger is 4, and the small finger is 5. Next, adjust the direction. The ring finger is counted as 6, the middle finger is 7, the index finger is 8, and the thumb is 9. Which finger will be parked at the end of the question? The numbers 1, 2, 3, 4, and 5 represent the thumb, index finger, middle finger, ring finger, and small finger in sequence.

Input Format:

Enter multiple groups of data. Each group of data occupies one row and contains only one integer N (1 <=n <= 1000000000 ).

Output Format:

Each group of data occupies one row and only contains an integer between 1 and 5, indicating the last stop finger.

Q & A description:

Input example:

1

10

1000000000

Output example:

1

2

2

Analysis: This is a very simple question. I started to see that the question was always rough. I couldn't think of the punctuality point. In fact, it was very simple. Just find the cycle of the number, and use the thumb as the benchmark. The eight numbers are a cycle, so you only need to determine the N % 8 situations ...... Failed again

Code

#include<iostream>using namespace std;int main(){long n;while(cin >> n){long t=n%8;if(t<=5 && t>0){cout << t << endl;}else if(t==0){cout << 2 << endl;}else{cout << 5-(t%5) << endl;}}return 0;}

Golden October online programming Competition No. 1: Little Girl count