We are happy to invite you to participate in 2024 Aleppo Collegiate Programming Contest that was held on the 27th of June in Aleppo, Syria.
The problems are authored and prepared by ahmad_alghadban, Ahmad7_7, Zaher, Go8, Hosen_ba, JaberSH1, Khaled_Mardini, SaeedSabbagh, Neodoomer, Yaman_Alwaza, OmarAlzakout, and me.
Thanks to Guess.Who, Kaitokid, Modar_Ali, ZoTH, yaser.harba, BallzCrasher, Harraaak, anas_allaham, Hamzeh_Miqdad, AboModar, The_Hallak, skahl15, Khaled_Al_Awad, better.call.grizo, HeMoo, Anas_Da, Kh_Decode_1024, Shahd, KactusJack, Richtofen, AbeerB, yumna for testing the contest.
We would love to hear your feedback on the problems in the comments section. Hope you enjoy solving the problems!
as a tester
thank you uncles for that great gym
and give me upvotes ^_^
As a problem setter ,I hope you enjoy the problems. good luck have fun (:
as a tester thank you uncles for that great gym and thanks for Anas_Da for writing the comment. give me upvotes ^_^
As a participant in the official contest, problems are great! Have fun everyone <3
As a tester , It was a super-duper contest !
As a problem setter, عجل بالله يا خاي وخدني لحلب
دورني حول الألعة وسمعني طرب
How to solve F? I tried max flow matching but TLE at test 11.
Great gym overall but was the nsqrtnlogn intended for D ?if so the tests are so weak because nsqrtnlogn won't even work for 1e5 with really good implementation
The intended solution is $$$N*sqrt(N)$$$
where is the editorial ?
help me to solve this
https://codeforces.net/gym/105316/problem/G
i brute forced it with segment tree u can check my submission
tnx man
As a castle problem setter, I hope you find the problems interesting <3.
Too castly omg
As a participant in the official contest................
Great gym! Thanks to everyone who made any efforts to produce it.
As A problem setter
درب حلب مشيييتو كلو سجر كلووو
كلوووو
I wanna thank all the castles
testers participants and problem setters <3
Pretty complex to understand.
as a no one <3, the problem setters is my uncles
How to solve problem I? + will there be any editorial? EyadBT
Hints Think about R. R is only 10. So you can go and visit all the intger point of each circle. Maximum point can be 20*20 = 400.
As a problem-setter <3