| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 18164 | Atoms in the Lab | 28 | 3201 |
|
|
| 328 | Bishops | 75 | 7665 |
|
|
| 2009 | Cryptography | 1 | 79 |
|
|
| 314 | Digits of e | 3 | 2835 |
|
|
| 24 | Small factorials | 129 | 33910 |
|
|
| 6236 | Matches | 6 | 421 |
|
|
| 36563 | Hard Fibonacci | 6 | 36 |
|
|
| 2906 | GCD2 | 48 | 5659 |
|
|
| 2901 | One Geometry Problem | 8 | 1567 |
|
|
| 10676 | 0110SS | 23 | 1611 |
|
|
| 54 | Julka | 137 | 16884 |
|
|
| 5699 | The last digit re-visited | 37 | 6908 |
|
|
| 16034 | Minimum Number | 4 | 461 |
|
|
| 35954 | New Data Type | 85 |
|
||
| 18905 | Kapti and Balu | 1 | 32 |
|
|
| 8676 | Digits of Phi (Golden Ratio) | 1 | 287 |
|
|
| 270 | Digits of Pi | 10 | 5576 |
|
|
| 5294 | Recurrence | 1 | 246 |
|
|
| 29748 | Robin Hood | 25 |
|
||
| 10334 | SOLDIERS | 5 | 619 |
|
|
| 1423 | Digits of SQRT(2) | 5 | 2623 |
|
|
| 738 | Another Counting Problem | 217 |
|
||
| 71 | Tree | 2 | 401 |
|
|
| 1002 | Uncle Jack | 10 | 2819 |
|
|
| 235 | Very Fast Multiplication | 18 | 911 |
|
|
| 6479 | The Very Greatest Common Divisor | 2 | 77 |
|
|
| 1475 | Play with Digit Seven | 4 | 77 |
|
#big-numbers
The problem involves arbitrary precision arithmetic
https://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic https://en.wikipedia.org/wiki/Karatsuba_algorithm - efficient multiplication algorithm https://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication - as above https://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strassen_algorithm - as above https://en.wikipedia.org/wiki/F%C3%BCrer%27s_algorithm - as above
RSS