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) :: Graph :: Special Graph (Directed Acyclic Graph) :: Counting Paths in DAG
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
825 - Walking on the Safe Side | 18896 |
28.97%
|
3463 |
84.09%
|
|
|
|
926 - Walking Around Wisely | 4289 |
33.27%
|
993 |
85.50%
|
|
|
|
986 - How Many? | 1025 |
66.34%
|
490 |
92.45%
|
|
|
|
988 - Many Paths, One Destination | 4529 |
39.68%
|
1493 |
90.76%
|
|
|
|
10401 - Injured Queen Problem | 4174 |
43.27%
|
1327 |
92.77%
|
|
|
|
10926 - How Many Dependencies? | 9822 |
37.14%
|
2514 |
88.66%
|
|
|
|
11067 - Little Red Riding Hood | 3232 |
45.51%
|
1105 |
94.03%
|
|
|
|
11655 - Waterland | 1527 |
28.29%
|
347 |
79.54%
|
|
|
|
11957 - Checkers | 2712 |
44.69%
|
924 |
93.29%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |