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) :: Graph :: Special Graph (Directed Acyclic Graph) :: Counting Paths in DAG
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
825 - Walking on the Safe Side | 17879 |
29.09%
|
3422 |
84.13%
|
|
|
|
926 - Walking Around Wisely | 4023 |
33.36%
|
975 |
85.54%
|
|
|
|
986 - How Many? | 1021 |
66.31%
|
487 |
92.61%
|
|
|
|
988 - Many Paths, One Destination | 4448 |
39.82%
|
1471 |
90.89%
|
|
|
|
10401 - Injured Queen Problem | 4124 |
43.40%
|
1315 |
93.08%
|
|
|
|
10926 - How Many Dependencies? | 9465 |
36.94%
|
2492 |
88.72%
|
|
|
|
11067 - Little Red Riding Hood | 3170 |
45.62%
|
1092 |
94.32%
|
|
|
|
11655 - Waterland | 1520 |
28.29%
|
345 |
79.71%
|
|
|
|
11957 - Checkers | 2640 |
44.47%
|
907 |
93.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |