Задачи A-G придумал и подготовил [user:isaf27,2018-10-19]. Идею задачи A предложилProblems A-G have created by [user:isaf27,2018-10-19]. The idea of the problem A has offered by [user:i_love_isaf27,2018-10-19].↵
↵
Задачу H придумал и подготовилThe problem H has created by [user:_kun_,2018-10-19].↵
↵
[tutorial:1054A]↵
Решение жюриJury's solution: [44522356](https://codeforces.com/contest/1054/submission/44522356)↵
[tutorial:1054B]↵
Решение жюриJury's solution: [44522430](https://codeforces.com/contest/1054/submission/44522430)↵
[tutorial:1054C]↵
Решение жюриJury's solution: [44522470](https://codeforces.com/contest/1054/submission/44522470)↵
[tutorial:1054D]↵
Решение жюриJury's solution: [44522488](https://codeforces.com/contest/1054/submission/44522488)↵
[tutorial:1054E]↵
Решение жюриJury's solution: [44522506](https://codeforces.com/contest/1054/submission/44522506)↵
[tutorial:1054F]↵
Решение жюриJury's solution: [44522527](https://codeforces.com/contest/1054/submission/44522527)↵
[tutorial:1054G]↵
Решение жюриJury's solution: [44522542](https://codeforces.com/contest/1054/submission/44522542)↵
↵
РешениеSolution by [user:Endagorion,2018-10-19]: [44519413](https://codeforces.com/contest/1054/submission/44519413) (максимальный остовmaximal spanning tree)↵
[tutorial:1054H]↵
Решение жюриJury's solution: [44522571](https://codeforces.com/contest/1054/submission/44522571)