Divide, But Not Quite Conquer

最近想说把CPE的一星题给补完，然后就没什么时间写其他的题目与打文章了XD

题目连结

解题

虽然这也是CPE 一星题，但写完后看了一下网路上有人的code只跑得过zerojudge跑online judge 会超，所以还是来写一篇

code

#include <iostream>#include <cstdio>#include <vector>#include <string>using namespace std;int main(){    int n, m;    while (cin >> n >> m)    {        if (n <= 1 || m <= 1)        {            cout << "Boring!" << endl;            continue;        }        vector<int> ans;        for (int i = n; i == 1 || (i > 1 && i % m == 0); i /= m)        {            ans.push_back(i);        }        int sequenceSize = ans.size();        if (sequenceSize == 0 || ans[sequenceSize - 1] != 1)        {            cout << "Boring!" << endl;            continue;        }        for (int i = 0; i < sequenceSize; ++i)        {            cout << ans[i] << " ";        }        cout << endl;    }    return 0;}