Submission #5896070
Source Code Expand
#include <iostream> #include <set> #define llint long long using namespace std; llint n; llint a[10005], b[10005]; set<llint> S; int main(void) { cin >> n; for(llint i = n; i >= 0; i--) cin >> b[i]; llint k = 0; for(llint i = 0; i <= n; i++){ if(b[i]){ k = i; break; } } for(llint i = 0; i <= n-k; i++) a[i] = b[i+k]; n -= k; llint m = abs(a[0]); for(llint i = 1; i*i <= m; i++){ if(m%i) continue; S.insert(i), S.insert(m/i); } for(int i = 1; i <= n+k; i++) S.insert(i); for(auto p : S){ bool flag = true; if(p == 1) flag = false; for(llint i = 2; i*i <= p; i++){ if(p % i == 0){ flag = false; break; } } if(!flag) continue; for(llint i = 0; i <= n; i++){ b[i] = a[i]; if(b[i] < 0) b[i] = p - (-b[i]) % p; b[i] %= p; } for(llint i = n; i >= p-1; i--){ if(b[i] == 0) continue; if(k == 0 && i == p-1) continue; b[i-(p-1)] += b[i], b[i-(p-1)] %= p; b[i] = 0; } flag = true; for(llint i = 0; i <= n; i++){ if(b[i]) flag = false; } if(flag) cout << p << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Polynomial Divisors |
User | leaf1415 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1137 Byte |
Status | AC |
Exec Time | 343 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 96 ms | 768 KB |
02.txt | AC | 60 ms | 512 KB |
03.txt | AC | 82 ms | 768 KB |
04.txt | AC | 52 ms | 512 KB |
05.txt | AC | 80 ms | 768 KB |
06.txt | AC | 45 ms | 512 KB |
07.txt | AC | 90 ms | 768 KB |
08.txt | AC | 54 ms | 512 KB |
09.txt | AC | 78 ms | 768 KB |
10.txt | AC | 39 ms | 512 KB |
11.txt | AC | 283 ms | 896 KB |
12.txt | AC | 221 ms | 896 KB |
13.txt | AC | 281 ms | 896 KB |
14.txt | AC | 223 ms | 896 KB |
15.txt | AC | 164 ms | 896 KB |
16.txt | AC | 145 ms | 896 KB |
17.txt | AC | 204 ms | 896 KB |
18.txt | AC | 149 ms | 896 KB |
19.txt | AC | 299 ms | 896 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 311 ms | 896 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 312 ms | 896 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 309 ms | 896 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 311 ms | 896 KB |
28.txt | AC | 16 ms | 384 KB |
29.txt | AC | 282 ms | 896 KB |
30.txt | AC | 35 ms | 512 KB |
31.txt | AC | 301 ms | 896 KB |
32.txt | AC | 2 ms | 256 KB |
33.txt | AC | 310 ms | 896 KB |
34.txt | AC | 1 ms | 256 KB |
35.txt | AC | 301 ms | 896 KB |
36.txt | AC | 2 ms | 256 KB |
37.txt | AC | 303 ms | 896 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 301 ms | 896 KB |
40.txt | AC | 17 ms | 384 KB |
41.txt | AC | 343 ms | 896 KB |
42.txt | AC | 215 ms | 896 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 2 ms | 256 KB |