Submission #5891599

---

Source Code Expand

#include <iostream>
#include <set>

using namespace std;

int n;
int a[10005], b[10005];
set<int> S;

int main(void)
{
	cin >> n;
	for(int i = n; i >= 0; i--) cin >> b[i];
	
	int k = 0;
	for(int i = 0; i <= n; i++){
		if(b[i]){
			k = i;
			break;
		}
	}
	for(int i = 0; i <= n-k; i++) a[i] = b[i+k];
	n -= k;
	
	for(int i = 1; i*i <= a[0]; i++){
		if(a[0]%i) continue;
		S.insert(i), S.insert(a[0]/i);
	}
	for(auto p : S){
		bool flag = true;
		if(p == 1) flag = false;
		for(int i = 2; i*i <= p; i++){
			if(p % i == 0){
				flag = false;
				break;
			}
		}
		if(!flag) continue;
		
		for(int i = 0; i <= n; i++){
			b[i] = a[i];
			if(b[i] < 0) b[i] = p - (-b[i]) % p;
			b[i] %= p;
		}
		for(int i = n; i >= p; i--){
			if(b[i] == 0) continue;
			b[i-(p-1)] += b[i], b[i-(p-1)] %= p;
			b[i] = 0;
		}
		flag = true;
		for(int i = 0; i <= n; i++){
			if(b[i]) flag = false;
		}
		if(flag) cout << p << endl;
	}
	return 0;
}

Submission Info

Judge Result