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 | 18600 |
28.89%
|
3441 |
84.07%
|
|
|
|
926 - Walking Around Wisely | 4236 |
33.31%
|
988 |
85.63%
|
|
|
|
986 - How Many? | 1023 |
66.37%
|
488 |
92.62%
|
|
|
|
988 - Many Paths, One Destination | 4520 |
39.65%
|
1489 |
90.80%
|
|
|
|
10401 - Injured Queen Problem | 4152 |
43.30%
|
1323 |
92.97%
|
|
|
|
10926 - How Many Dependencies? | 9706 |
36.79%
|
2511 |
88.69%
|
|
|
|
11067 - Little Red Riding Hood | 3193 |
45.69%
|
1099 |
94.27%
|
|
|
|
11655 - Waterland | 1526 |
28.31%
|
346 |
79.77%
|
|
|
|
11957 - Checkers | 2698 |
44.66%
|
919 |
93.36%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |