Browse Problems 
Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
Browse Problems
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Mathematics :: Ad Hoc Mathematics Problems :: Base Number Variants
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
377 - Cowculations | 3324 |
60.44%
|
1890 |
90.05%
|
|
|
|
575 - Skew Binary | 26507 |
69.72%
|
15140 |
96.75%
|
|
|
|
10093 - An Easy Problem! | 26415 |
25.41%
|
5283 |
71.99%
|
|
|
|
10931 - Parity | 34010 |
57.78%
|
12484 |
96.28%
|
|
|
|
11121 - Base -2 | 6100 |
58.07%
|
2471 |
94.33%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 5 of 5 | |