Submission #5891624
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; for(llint 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(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; i--){ if(b[i] == 0) 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 | 0 |
Code Size | 1032 Byte |
Status | WA |
Exec Time | 6 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 3 ms | 384 KB |
02.txt | WA | 3 ms | 256 KB |
03.txt | WA | 3 ms | 384 KB |
04.txt | AC | 4 ms | 256 KB |
05.txt | WA | 3 ms | 384 KB |
06.txt | WA | 2 ms | 256 KB |
07.txt | AC | 4 ms | 384 KB |
08.txt | AC | 4 ms | 384 KB |
09.txt | WA | 3 ms | 384 KB |
10.txt | WA | 2 ms | 256 KB |
11.txt | WA | 6 ms | 384 KB |
12.txt | WA | 4 ms | 384 KB |
13.txt | WA | 5 ms | 384 KB |
14.txt | WA | 4 ms | 384 KB |
15.txt | WA | 4 ms | 384 KB |
16.txt | WA | 3 ms | 384 KB |
17.txt | WA | 3 ms | 384 KB |
18.txt | WA | 3 ms | 384 KB |
19.txt | WA | 4 ms | 384 KB |
20.txt | WA | 1 ms | 256 KB |
21.txt | WA | 3 ms | 384 KB |
22.txt | WA | 1 ms | 256 KB |
23.txt | WA | 4 ms | 384 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 4 ms | 384 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | WA | 3 ms | 384 KB |
28.txt | WA | 2 ms | 256 KB |
29.txt | AC | 4 ms | 384 KB |
30.txt | AC | 2 ms | 384 KB |
31.txt | AC | 3 ms | 384 KB |
32.txt | WA | 2 ms | 256 KB |
33.txt | WA | 4 ms | 384 KB |
34.txt | WA | 1 ms | 256 KB |
35.txt | WA | 3 ms | 384 KB |
36.txt | WA | 1 ms | 256 KB |
37.txt | AC | 4 ms | 384 KB |
38.txt | WA | 1 ms | 256 KB |
39.txt | WA | 3 ms | 384 KB |
40.txt | WA | 2 ms | 256 KB |
41.txt | WA | 5 ms | 384 KB |
42.txt | AC | 6 ms | 384 KB |
43.txt | WA | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | WA | 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 |