10190 - Divide, But Not Quite Conquer!

#include <iostream>
#include <set>
#include<vector>
#include<string>
#include<sstream>
#include<algorithm>
#include<map>
using namespace std;

int main()
{
	int n, m;
	while (cin >> n >> m) {
		if (n <= 1 || m <= 1) {
			cout << "Boring!" << endl;
			continue;
		}
		vector<int> nums;
		for (int i = n ; i == 1 || (i > 1 && i % m == 0); i /= m) {
			nums.push_back(i);
		}
		int numsSize = nums.size();
		if (numsSize == 0 || nums[numsSize - 1] != 1) {
			cout << "Boring!" << endl;
			continue;
		}

		for (auto i = nums.begin(); i != nums.end(); i++) {
			cout << *i << " ";
		}
		cout << endl;
	}
}


---------------------------------------------------------------------------------------------------------------------------------------------------------------------


#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    while(cin>>n>>m){
        bool flag=true;
        vector<int> vec;
        vec.push_back(n);
        int number=0;
        while(n%m==0){
            n = n/m;
            vec.push_back(n);
            if(n==1){
                break;
            }
        }
        if(n!=1){
            cout<<"Boring!"<<endl;
            continue;
        }
        for(int i=0;i<vec.size();i++){
            cout<<vec[i]<<" ";
        }
        cout<<endl;
    }
}