题解 | 大整数的因子

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


int qiuyv(string str,int n) { //将m进制转换为n进制
    int len = str.length(), k = 0;
        for (int j = 0; j < len; j++) {
            int t = (k * 10 + str[j] - '0') % n;
            str[j] = (k * 10 + str[j] - '0') / n + '0';
            k = t;
    }
    return k;
}

int main() {
    string k;
    while (cin >> k) {
        if (k == "-1") {
            break;
        }
        int flag = 0;
        for (int i = 2; i <= 9; i++) {
            if (qiuyv(k,i) == 0) {
                cout << i << " ";
                flag = 1;
            }
        }
        if (flag == 0) {
            cout << "none";
        }
        cout << endl;
    }
    return 0;
}