zoukankan      html  css  js  c++  java
  • poj 2183 Bovine Math Geniuses

    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.
    #include <iostream>
    #include <stdio.h>
    #include <string>
    #include <vector>
    #include <cmath>
    using namespace std;
    int main()
    {
       long int input;
       while(cin>>input)
       {
        long int output[100],temp;
        int count=0;
        output[0]=input;
        bool find=false;
        for (int i=1;i<100;i++)
        {
            if(find==false)
            {
    //得到中间四位数字 temp=(output[i-1]%(long int)pow(10.0,5))/10; //得到后六位数字 output[i]=(temp*temp)%(long int)pow(10.0,6); count++; for (int j=0;j<i;j++) { if (output[i]==output[j]) { cout<<output[j]<<" "<<i-j<<" "<<count<<endl; find=true; break; } } } } } return 0; }
  • 相关阅读:
    pycharm中报错:ImportError: No module named 'skimage'
    pycharm 怎么能像在命令行中输入参数进行调试
    python在pycharm中导包一直出错的问题
    安装tensorflow遇到:Your CPU supports instructions that this TensorFlow binary was not compiled to use
    curses is not supported on this machine:(curses 在pycharm(Windows)中的安装 )
    python 2 和python 3 中的编码对比
    用python 遍历文件夹中所有.dcm文件
    pycharm 安装 tensorflow
    如何在Eclipse中写Processing的sketch
    Random Target Moving~
  • 原文地址:https://www.cnblogs.com/T8023Y/p/3213860.html
Copyright © 2011-2022 走看看