题解 | #大整数的因子#

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#define MAX 10000
using namespace std;

//返回余数
int strmod(string s,int k) {
	if (s == "0")return 0;

	int res;
	int carry = 0;
	for (int i = 0; i < s.size(); i++) {
		res = (carry * 10 + s[i] - '0') % k;
		carry = res;
	}
	return res;
}
int main() {
	
	string s;
	while (cin >> s) {
		if (s[0] == '-')return 0;
		bool flag = false;//不存则为false
		for (int i = 2; i < 10; i++) {
			if (strmod(s, i) == 0) {//能整除
				cout << i << " ";
				flag = true;
			}
		}
		if (flag) {
			cout << endl;
		}
		else {
			cout << "none" << endl;
		}
	}

	
	return 0;
}