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 | 19156 |
28.98%
|
3478 |
84.07%
|
|
|
|
926 - Walking Around Wisely | 4398 |
33.27%
|
1003 |
85.54%
|
|
|
|
986 - How Many? | 1031 |
66.44%
|
495 |
92.53%
|
|
|
|
988 - Many Paths, One Destination | 4558 |
39.71%
|
1500 |
90.73%
|
|
|
|
10401 - Injured Queen Problem | 4211 |
43.24%
|
1336 |
92.81%
|
|
|
|
10926 - How Many Dependencies? | 9839 |
37.19%
|
2520 |
88.65%
|
|
|
|
11067 - Little Red Riding Hood | 3315 |
45.43%
|
1110 |
94.05%
|
|
|
|
11655 - Waterland | 1529 |
28.32%
|
348 |
79.60%
|
|
|
|
11957 - Checkers | 2741 |
44.66%
|
932 |
93.35%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |