2.2 runround

Runaround Numbers

Runaround numbers are integers with unique digits, none of which is zero (e.g., 81362) that also have an interesting property, exemplified by this demonstration:

• If you start at the left digit (8 in our number) and count that number of digits to the right (wrapping back to the first digit when no digits on the right are available), you'll end up at a new digit (a number which does not end up at a new digit is not a Runaround Number). Consider: 8 1 3 6 2 which cycles through eight digits: 1 3 6 2 8 1 3 6 so the next digit is 6.
• Repeat this cycle (this time for the six counts designed by the `6') and you should end on a new digit: 2 8 1 3 6 2, namely 2.
• Repeat again (two digits this time): 8 1
• Continue again (one digit this time): 3
• One more time: 6 2 8 and you have ended up back where you started, after touching each digit once. If you don't end up back where you started after touching each digit once, your number is not a Runaround number.

Given a number M (that has anywhere from 1 through 9 digits), find and print the next runaround number higher than M, which will always fit into an unsigned long integer for the given test data.

PROGRAM NAME: runround

INPUT FORMAT

A single line with a single integer, M

SAMPLE INPUT (file runround.in)

81361

OUTPUT FORMAT

A single line containing the next runaround number higher than the input value, M.

SAMPLE OUTPUT (file runround.out)

81362



/*
ID: xdzhbin1
LANG: C++
TASK: runround
*/

//略有繁琐的一道题，关键的部分是把runround Num的概念理解对
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;

class Tool
{
private:
    unsigned long cur; //从哪个数开始找循环数

public:
    Tool(int num)
    {
        cur = num ;
    }
    bool isRunRound(); //判断一个数是否为循环数
    void calculate()
    {
        while(!isRunRound()) //如果不是，判断下一个
        {
            cur++;
        }
        ofstream out;
        out.open("runround.out",ios::out);
        out<<cur<<endl;
        out.close();
    }
};

bool Tool::isRunRound()
{
    int bits = 0; //当前数的位数
    int array[10]; //存储各个位，array[1]存个位，array[2]存十位，依次往后...
    int stopped[10];//stopped[5]表示从数字5开始向后数停在哪位上
    bool used[10];//used[5]表示5这个数字是否出现过
    int temp = this->cur;
    int i,times;
    int index,start,counter = 0;
    for(i=0; i<10; i++)
    {
        array[i] = 0;
        used[i] = false;
        stopped[i] = 0;
    }
    while(temp != 0)
    {
        bits++;
        array[bits] = temp % 10;
        if(temp%10==0||used[temp%10]) //出现0或者重复的数字，返回不是循环数
        {
            return false;
        }
        used[temp%10] = true;
        temp /= 10;
    }
    times = array[bits];
    start = array[bits];
    index = bits;
    while(true)
    {
        while(times>0)
        {
            index = (index -1 + bits) % bits;
			if (index == 0)
			{
				index = bits;
			}
            times--;
        }
		//cout<<cur<<" "<<start<<" "<<array[index]<<endl;
		if (stopped[start] == 0)
		{
			stopped[start] = array[index];
			times = array[index];
			start = times;
			counter++;
		}
		else if(stopped[start]!=array[index])
		{
			return false;
		}
        else
		{
			return counter == bits && start == array[bits];
		}
    }
}

int main()
{
    ifstream in("runround.in",ios::in);
    int start;
    in>>start;
    Tool t(start+1);
    t.calculate();
    return 0;
}