hi all I need a efficient implementation of AKS algorithm in c++.. I searched alot but i couldn't find what i need... I would be happy if some one helps me... also if you have another implementation in c++ for testing wether n(number with at least 500 digits) is prime or not please share it with me : ) Regards, DHM
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3734 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3581 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3479 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | nor | 156 |
| 4 | adamant | 155 |
| 4 | cry | 155 |
| 4 | atcoder_official | 155 |
| 4 | -is-this-fft- | 155 |
| 8 | maroonrk | 153 |
| 9 | SecondThread | 147 |
| 10 | Petr | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Aug/23/2024 22:00:16 (j2).
Desktop version, switch to mobile version.
Supported by
If you ask a question, it helps to state the problem itself rather than the way you chose to solve it. Otherwise, it is quite possible that the way you chose is wrong in some sense.
This seems to cover your question in its entirety: http://stackoverflow.com/questions/347811/aks-primes-algorithm-in-python. See links in the answer.