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 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Mathematics :: Game Theory :: Standard
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
847 - A Multiplication Game | 18852 |
52.52%
|
8398 |
88.94%
|
|
|
|
10111 - Find the Winning Move | 2724 |
39.65%
|
910 |
78.24%
|
|
|
|
10165 - Stone Game | 5572 |
63.60%
|
2817 |
90.98%
|
|
|
|
10368 - Euclid's Game | 7817 |
37.12%
|
2680 |
78.77%
|
|
|
|
10404 - Bachet's Game | 9805 |
57.97%
|
3296 |
93.63%
|
|
|
|
10578 - The Game of 31 | 1805 |
56.23%
|
793 |
88.40%
|
|
|
|
11311 - Exclusively Edible | 2464 |
52.60%
|
844 |
90.52%
|
|
|
|
11489 - Integer Game | 7558 |
47.25%
|
2218 |
88.28%
|
|
|
|
12293 - Box Game | 5137 |
55.36%
|
1522 |
89.88%
|
|
|
|
12469 - Stones | 904 |
67.37%
|
378 |
92.86%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |