poj 2183 Bovine Math Geniuses
来源:互联网 发布:阿里云服务器流量攻击 编辑:程序博客网 时间:2024/04/30 08:32
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:
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:
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.
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
USACO 2003 U S Open Orange
很简单的一道题,就是不断的取余,求整
#include <iostream>#include <cstring>#define MAX 1000001using namespace std;int a[MAX];int main(){ int n; while(cin>>n) { memset(a,0,sizeof(a)); int sum=0; while(1) { n=n/10; n=n%10000; n=n*n; n=n%1000000; if(a[n]!=0) { sum++; cout<<n<<" "<<sum-a[n]<<" "<<sum<<endl; break; } a[n]=++sum; //cout<<sum<<endl; } } return 0;}
0 0
- POJ - 2183 Bovine Math Geniuses
- Poj 2183 Bovine Math Geniuses
- poj 2183 Bovine Math Geniuses
- POJ 2183 Bovine Math Geniuses
- POJ 2183 Bovine Math Geniuses 找循环
- POJ 2183 : Bovine Math Geniuses - 平方取尾法
- POJ 2183 Bovine Math Geniuses G++ 再想想
- POJ2183 Bovine Math Geniuses【伪随机数】
- poj 3407 Bovine Birthday
- poj 3047 Bovine Birthday
- POJ 3175 Finding Bovine Roots
- POJ 3175 Finding Bovine Roots
- POJ 3175 Finding Bovine Roots
- POJ 3175 Finding Bovine Roots
- POJ 3175 Finding Bovine Roots
- POJ 3047 Bovine Birthday 笔记
- poj 2458 Rigging the Bovine Election
- POJ 3175 Finding Bovine Roots (枚举)
- DP-母函数
- asp.net 数据提交中的GET,POST, PUT,DELETE,四种方式
- android开发 权限大全
- s3c2440上的nor flash启动与nand flash启动的区别
- 河南留守少年杀害奶奶受审 视双亲如陌路
- poj 2183 Bovine Math Geniuses
- python数据挖掘领域工具包
- string类实现
- 指定字符删除
- yaffs2的补丁文件patch-ker分析
- Lua 八皇后问题
- Unix使用互斥量保护数据结构
- 你不在我身边
- 题目1157:中位数:快速排序思想