POJ2183

摘要：水

 

#include <iostream>
#include <map>
using namespace std;
const int size = 10000;
int buf[size+1] = {0};

int main()
{
        for(int i=1; i<=size; i++){
                buf[i] = i*i;
        }
        int ori;
        map<int, int> num_index;
        int index = 0;

        cin >> ori;
        num_index.insert(make_pair(ori, index));
        while(true){
                index++;
               
                ori = ori % 100000;
                ori = ori / 10;
                ori = buf[ori];
                ori = ori % 1000000;
                if(num_index.find(ori) != num_index.end()){
                        break;
                }
                num_index.insert(make_pair(ori, index));
        }

        cout << ori << " " << index-num_index[ori] << " " << index << endl;

        return 0;
}