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 | 19242 |
28.98%
|
3485 |
84.05%
|
|
|
|
926 - Walking Around Wisely | 4414 |
33.33%
|
1005 |
85.47%
|
|
|
|
986 - How Many? | 1032 |
66.47%
|
495 |
92.53%
|
|
|
|
988 - Many Paths, One Destination | 4563 |
39.75%
|
1503 |
90.75%
|
|
|
|
10401 - Injured Queen Problem | 4214 |
43.26%
|
1337 |
92.82%
|
|
|
|
10926 - How Many Dependencies? | 9844 |
37.21%
|
2521 |
88.66%
|
|
|
|
11067 - Little Red Riding Hood | 3316 |
45.45%
|
1110 |
94.05%
|
|
|
|
11655 - Waterland | 1530 |
28.37%
|
349 |
79.66%
|
|
|
|
11957 - Checkers | 2744 |
44.68%
|
934 |
93.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |