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 | 18996 |
28.93%
|
3468 |
84.08%
|
|
|
|
926 - Walking Around Wisely | 4315 |
33.26%
|
997 |
85.56%
|
|
|
|
986 - How Many? | 1025 |
66.34%
|
490 |
92.45%
|
|
|
|
988 - Many Paths, One Destination | 4537 |
39.67%
|
1496 |
90.78%
|
|
|
|
10401 - Injured Queen Problem | 4190 |
43.15%
|
1329 |
92.70%
|
|
|
|
10926 - How Many Dependencies? | 9825 |
37.15%
|
2515 |
88.67%
|
|
|
|
11067 - Little Red Riding Hood | 3241 |
45.51%
|
1109 |
94.05%
|
|
|
|
11655 - Waterland | 1527 |
28.29%
|
347 |
79.54%
|
|
|
|
11957 - Checkers | 2736 |
44.66%
|
931 |
93.34%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |