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 | 19068 |
28.93%
|
3472 |
84.10%
|
|
|
|
926 - Walking Around Wisely | 4369 |
33.19%
|
1002 |
85.53%
|
|
|
|
986 - How Many? | 1027 |
66.41%
|
492 |
92.48%
|
|
|
|
988 - Many Paths, One Destination | 4541 |
39.66%
|
1498 |
90.72%
|
|
|
|
10401 - Injured Queen Problem | 4197 |
43.22%
|
1332 |
92.79%
|
|
|
|
10926 - How Many Dependencies? | 9831 |
37.16%
|
2517 |
88.64%
|
|
|
|
11067 - Little Red Riding Hood | 3315 |
45.43%
|
1110 |
94.05%
|
|
|
|
11655 - Waterland | 1529 |
28.32%
|
348 |
79.60%
|
|
|
|
11957 - Checkers | 2739 |
44.65%
|
932 |
93.35%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |