“模拟“题，运用哈希，不断地按照一定运算规律对一个结果进行计算，如果重复出现就停止并且输出该数。注意到仔细看题，这种题一定要细心！
POJ - 2183 Bovine Math Geniuses
Time Limit: 1000MS |
|
Memory Limit: 65536KB |
|
64bit IO Format: %I64d & %I64u |
Description
Farmer John loves to help the cows further their mathematical skills. He has promised them Hay-flavored ice cream if they can solve various mathematical problems.
He said to Bessie, "Choose a six digit integer, and tell me what it is. Then extract the middle four digits. Square them and discard digits at the top until you have another number six digits or shorter. Tell me the result."
Bessie, a mathematical genius in disguise, chose the six digit number 655554. "Moo: 6 5 5 5 5 4", she said. She then extracted the middle four digits: 5555 and squared them: 30858025. She kept only the bottom six digits: 858025. "Moo: 8 5 8 0 2 5", she replied to FJ.
FJ nodded wisely, acknowledging Bessie's prowess in arithmetic. "Now keep doing that until you encounter a number that repeats a number already seen," he requested.
Bessie decided she'd better create a table to keep everything straight:
Middle Middle Shrunk to
Num 4 digits square 6 or fewer
655554 5555 30858025 858025
858025 5802 33663204 663204
663204 6320 39942400 942400
942400 4240 17977600 977600
977600 7760 60217600 217600 <-+
217600 1760 3097600 97600 |
97600 9760 95257600 257600 |
257600 5760 33177600 177600 |
177600 7760 60217600 217600 --+
Bessie showed her table to FJ who smiled and produced a big dish of delicious hay ice cream. "That's right, Bessie," he praised. "The chain repeats in a loop of four numbers, of which the first encountered was 217600. The loop was detected after nine iterations."
Help the other cows win ice cream treats. Given a six digit number, calculate the total number of iterations to detect a loop, the first looping number encountered, and also the length of the loop.
FJ wondered if Bessie knew all the tricks. He had made a table to help her, but she never asked:
Middle Middle Shrunk to
Num 4 digits square 6 or fewer
200023 0002 4 4
4 0 0 0
0 0 0 0 [a self-loop]
whose results would be: three iterations to detect a loop, looping on 0, and a length of loop equal to 1.
Remember: Your program can use no more than 16MB of memory.
Input
* Line 1: A single six digit integer that is the start of the sequence testing.
Output
* Line 1: Three space-separated integers: the first number of a loop, the length of the loop, and the minimum number of iterations to detect the loop.
Sample Input
655554
Sample Output
217600 4 9
Source
1 #include<stdio.h> 2 #include<string.h> 3 #include<math.h> 4 #include<stdlib.h> 5 6 int hash[1000000]; 7 char str[20]; 8 int main() 9 { 10 int n = 0, t = 0/*, len = 0*/, cnt = 0; 11 while(~scanf("%d", &n)) { 12 memset(hash, 0, sizeof(hash)); 13 t = n; 14 cnt = 0; 15 while(true) { 16 if(hash[t]) { 17 printf("%d %d %d ", t, cnt - hash[t] + 1, cnt); 18 break; 19 } 20 cnt++; 21 hash[t] = cnt; 22 t /= 10; 23 t %= 10000; 24 t = t * t; 25 t %= 1000000; 26 27 } 28 } 29 return 0; 30 }