| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 18164 | Atoms in the Lab | 25 | 2954 |
|
|
| 328 | Bishops | 65 | 7281 |
|
|
| 2009 | Cryptography | 76 |
|
||
| 314 | Digits of e | 1 | 2768 |
|
|
| 24 | Small factorials | 100 | 30960 |
|
|
| 6236 | Matches | 5 | 414 |
|
|
| 2906 | GCD2 | 41 | 5321 |
|
|
| 2901 | One Geometry Problem | 8 | 1523 |
|
|
| 10676 | 0110SS | 17 | 1526 |
|
|
| 54 | Julka | 118 | 15808 |
|
|
| 5699 | The last digit re-visited | 31 | 6639 |
|
|
| 3932 | Point Connection Game in a Circle | 1 | 657 |
|
|
| 3970 | Convert to Decimal Base System | 48 |
|
||
| 16034 | Minimum Number | 3 | 439 |
|
|
| 3023 | Binary multiplication | 2 | 220 |
|
|
| 18905 | Kapti and Balu | 1 | 31 |
|
|
| 8676 | Digits of Phi (Golden Ratio) | 1 | 284 |
|
|
| 270 | Digits of Pi | 7 | 5444 |
|
|
| 5294 | Recurrence | 1 | 240 |
|
|
| 29748 | Robin Hood | 24 |
|
||
| 3362 | Setnja | 221 |
|
||
| 10334 | SOLDIERS | 5 | 600 |
|
|
| 1423 | Digits of SQRT(2) | 3 | 2575 |
|
|
| 738 | Another Counting Problem | 217 |
|
||
| 71 | Tree | 2 | 394 |
|
|
| 1002 | Uncle Jack | 9 | 2753 |
|
|
| 235 | Very Fast Multiplication | 16 | 791 |
|
|
| 6479 | The Very Greatest Common Divisor | 2 | 73 |
|
|
| 1475 | Play with Digit Seven | 3 | 65 |
|
#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