今天是練習cpe的Divide, But Not Quite Conquer!題目

程式碼

#include <bits/stdc++.h>
using namespace std;

int main() 
{
    int n, m;
    while (cin >> n >> m) 
	{
        if (n == 0 || m == 0) 
		{
            cout << "Boring!" << endl;;
            continue; 
        }

        int tmp = n;
        bool boring = false;

        while (tmp > 1) 
		{
            if (tmp % m == 0) 
			{
                tmp /= m;
            } else 
			{
                boring = true;
                break;
            }
        }

        if (boring) 
		{
            cout << "Boring!" <<endl;
        } 
		else 
		{
            cout << n;
            while (n > 1) 
			{
                n /= m;
                cout << " " << n;
            }
            cout << endl;
        }
    }
    return 0;
}

解題方向

while (tmp > 1) 
{
    if (tmp % m == 0) 
    {
        tmp /= m;
    } 
    else 
    {
        boring = true;
        break;
    }
}

• 不斷將tmp除以m。只要能整除，就繼續。否則就表示「不能一直整除到底」，所以把boring設成true跳出迴圈

cout << n;
    while (n > 1) 
    {
        n /= m;
        cout << " " << n;
    }

• 先印出起始數n。每次將n除以m。每次印出結果直到n == 1。