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 | 18674 |
28.90%
|
3448 |
84.08%
|
|
|
|
926 - Walking Around Wisely | 4247 |
33.34%
|
989 |
85.64%
|
|
|
|
986 - How Many? | 1024 |
66.41%
|
489 |
92.64%
|
|
|
|
988 - Many Paths, One Destination | 4522 |
39.67%
|
1490 |
90.81%
|
|
|
|
10401 - Injured Queen Problem | 4164 |
43.32%
|
1324 |
92.90%
|
|
|
|
10926 - How Many Dependencies? | 9709 |
36.79%
|
2512 |
88.69%
|
|
|
|
11067 - Little Red Riding Hood | 3198 |
45.68%
|
1102 |
94.19%
|
|
|
|
11655 - Waterland | 1526 |
28.31%
|
346 |
79.77%
|
|
|
|
11957 - Checkers | 2706 |
44.64%
|
921 |
93.38%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |