| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Does Codeforces Online Judge allow us to use Boost Library for C++ ?
It would help and ease the issue of big integers...
Or what is the alternative for that ? Obviously I can handle using mod at times...but any other easy alternative?
Any suggestion is much appreciated :)
Thanks :)
Easy alternative is to use
Python.Copy bigint implementation from other people's codes. Really fast multiplication is important, for example.
Are you allowed to copy other's people's code? Doesn't it get caught by the plagiarism checker?
No, doing it is similar to use inbuilt libraries as codeforces rules unless you use code that wasn't created before the contest started.
As much as you're allowed to plagiarize the C++ standard library.