New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

問題を追加しましょう: DAG の最小パス被覆・最大独立集合 #1511

Open

3 of 8 tasks

KATO-Hiro opened this issue Nov 20, 2024 · 1 comment

Open

3 of 8 tasks

問題を追加しましょう: DAG の最小パス被覆・最大独立集合 #1511

KATO-Hiro opened this issue Nov 20, 2024 · 1 comment

Labels

priority middle

Collaborator

KATO-Hiro commented Nov 20, 2024 •

edited

Loading

AtCoder

https://atcoder.jp/contests/ttpc2022/tasks/ttpc2022_h
- Solved by ✨ Add tasks for TTPC (#1524) #1525

AOJ

https://onlinejudge.u-aizu.ac.jp/problems/1532
- UAPC 2014
https://onlinejudge.u-aizu.ac.jp/problems/2251
- JAG Regional 2010
https://onlinejudge.u-aizu.ac.jp/problems/2828
- JAG Prelim 2017
https://onlinejudge.u-aizu.ac.jp/problems/2352
- OUPC 2012

Codeforces

KATO-Hiro added the priority middle label

KATO-Hiro changed the title ~~問題の追加: DAG の最小パス被覆・最大独立集合~~ 問題を追加しましょう: DAG の最小パス被覆・最大独立集合

Collaborator Author

KATO-Hiro commented Nov 20, 2024 •

edited

Loading

CodeforcesのAPI に関するdocs

https://codeforces.com/apiHelp

CF problemsの作者による技術解説記事

記事が書かれてから3年経過していますが、APIに関する注意事項が参考になります

https://kira000.hatenadiary.jp/entry/2021/03/06/123556

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment