hdoj1163_Eddy's digital Roots_数根

//数根：百度一下得到很简单的求法

//1.直接n%9,余数即为所求数根,特别的,若余数为0,则数根为9,当然若n为0例外

//2.直接n的各个数位数字相加之和模9,同样,若余数为0,则数根为9,当然若n为0例外

//3.(n-1)%9+1,不用考虑余数为0的情况



#include<iostream>
using namespace std;

int main(int argc, char* argv[])
{
    int n;
    while (cin >> n&&n)
    {
        int sum = 1;
        for (int i = 0; i < n; i++)
            sum=(sum*(n % 9))%9;
        if (sum == 0)
            cout << 9 << endl;
        else
            cout << sum << endl;
    }
    cin >> n;
    return 0;
}