Hello, Codeforces!
We are happy to announce that the Syrian Virtual University and Higher Institute of Applied Sciences and Technology Collegiate Programming Contest 2026 is now available for practice in the Codeforces Gym.
The official contest took place on July 23, 2026, and featured 14 problems of varying difficulty.
You can find the contest here.
The problems were prepared by:
3atori, Anas_Da, Fetfot, Jamalocopter, MOUFLESS, Mr_Coder7, and Rising-coder.
Thanks to Kaitokid for helping us improving many of the problems.
Also, we would like to deeply thank everyone who tested the problems, you guys are the best:
2nd_Chance_maybe, ADAR2002, Ahmad-Al-Ateek, Ahmad_OS, Alien-X, Amgad, Amr.7, at2c, Aziz_05, Barakat., Better_Call_Abdul, Blossom__, Buffalocopter, cgmoreda, Doraemonn, El_Qorsan, employed, FarhanHY, FTS_Problem_C, Grizoo, Hadil-sh, hammoudehib, HAYA, hocln, I_will_keep_trying, Igor_Parfenov, iMido, KAKAROT-M, Karam_Kallasi, khalaf, Khaled_Al_Awad, LazyXcoder, Lily_, limbo16, Mac.Genius, Majedh, name2, Mohammad_Hacker, MohammadAlGhareeb, Muhannadooov, Nananah, nonchALAAnt, Rei_0, samsoom, SHAWW, Shisui, SMA665, stay_in_gray, the.Mage, the_seal, theINVINCIBLE, ultra_V, Um_nik, Vectors_Master, Weird00, y0uKn0wWh0, yousefAbukhass, and Zingan.
We realized today we never had a photo together for 7 authors. I can confirm that the union of people in both photos has at least 7 authors.
 |  |
Thank you as well to everyone involved in organizing and running the onsite contest.
We hope you enjoy the problems!
Good luck and have fun!
As an author I think that team 3rr better than 7as
As a tester, I would highly recommend you to 3rr before complaining about the problems.
As a judge, don't judge by length.
As a tester, I can confirm that the authors used some kind of black sorcery to make Um_nik a tester.
Nah, he's just a nice guy :)
as a tester, i feel proud to be a part of 7asa7es than to be a tester
3rrni alshog w 3rrniii
As a tester Iam so proud to be tester in this one of the best problemset i practice in
as an author, أنا كودتا
Al3raa3ra if you want another helicopter in the upcoming battle Buffalocopter is ready
Please share your CV with Madam Kefah on the 7th floor.
As a tester, I really suggest this problemset to everyone, and I believe the 3ambaloos was the absolute menace here, but the Jamalocopter was the real GOAT!!
As testers, we would like to thank the judges for awarding us this prize during the testing phase.
Better than $1,000
As a contestant, the problem set was excellent. Thanks <3
As the 3ambaloos , I can guarantee the 7asa7ees team will rise & shine soon !
as a tester , i want my ballons for FTS on problem E :)
As a tester, I highly recommend you to try the problemset, W authors.
As a tester, it was a wonderful experience. I hope you all enjoy solving these fun problems ^_^
As a tester I will proudly put 3rr on my banner
uncling contest for sure :D
As a tester I really enjoyed the diverse problemset :)
as a tester, i just want to tell you that you're wasting your time reading these comments. xD
As a tester, I think this contest was the best
As a tester, I don't recommend you be on a team 3rr
7as is the best
As a problemset, this is the best tester ever! (Especially when you're in 3rr team)
As a contestant , The contest is excellent and have a quality problems , but there are one or two problems you should put it in
هبد sheet
to get better at getting accepted by هبد
also when you place a problem and it's rank or expected difficulty is in the middle and its solution ممكن ينهبد , that is a very big mistake. The standings will be affected. The simplest example is in testing: teams with a silver or green Codeforces rank are solving a problem that many teams having 3 experts and still couldn't solve it.
In the '90s, they used to call this a skill issue.
Get a life bro
I am talking in aspect of a contestant that get the 2nd rank in his university , and that is my opinion , maybe it's wrong maybe it's correct.
Of course, not all comments will be positive.
Please do not leave comments just to farm contribution or mock others.
I think you are refering to problem [problem:https://codeforces.me/gym/106632/problem/K]
If so , then the problem is different when we were testing and it was much more obvious . that's why teams got it in testing.
And congratulations for getting bronze :)
No I refer to problem E
thanks , but we got silver
We respect your opinion, but if you are ranked 2nd at your university, you should read all the problems and not wait for another team to open the binary search problem. Alternatively, you could solve one of the other problems that the first-place team has already opened and thanks for your opinion
Please read the comments again , My point was not about our rank or whether we read all problems. My point is that placing a problem in the middle of the set like problem E. and I discussed the issue with it
Btw there is a way to solve it without needing divine inspiration, just experimenting. I think the intended solution is fun and nice. But I solved it a different way: I think it makes sense to solve the problem in 1D on a line of $$$600$$$, because then we can populate the diagonals of a rectangle. We anyway need to solve the problem for $$$300 \times 1$$$ rectangle so if we find some good constrution for $$$n=300$$$ it will probably also fit for $$$n=600$$$. I hope you agree this part is not too hard.
Now we will make an array of size $$$600$$$ of all $$$1$$$'s, and for each $$$d$$$ from $$$d=2$$$ to $$$600$$$ we want that for any interval of size $$$d$$$ of the array, there are at least $$$2$$$ numbers divisible by $$$d$$$. One way of achieving this is by choosing two numbers $$$0 \leq u \lt v \lt d$$$, and making sure $$$u \mod d$$$ and $$$v \mod d$$$ positions are divisible by $$$d$$$.
We could just multiply those values of the array by $$$d$$$, but it seems more efficient to use $$$a_x = \text{lcm}(a_x,d)$$$, because this keeps the values smaller.
Now we can just try some $$$u$$$ and $$$v$$$ with a simple program in python (for example $$$u=0, v = 1$$$. Doing this procedure taking LCM each time does indeed give a valid solution, except the values are very large (for example the first value becomes LCM of $$$1 \dots d$$$)
From there you can either try some different $$$u$$$'s and $$$v$$$'s and check what gives a maller max value of the array. Or at each time step, the program can greedily take the best $$$u$$$ and $$$v$$$. This barely fits in the limits of $$$a_{i,j}$$$, for me I got a value of $$$260480880$$$, nice of the authors to let it pass.
If you experiment some more you can also stumble upon $$$u=d-2$$$, $$$v=d-1$$$ which is the intended solution again.
As a tester, I love JamaloCopter and his problem.
As an official contestant, it was piece of quite , but the score board didn't arrange the problems correctly.
As a contestant, next time I will make sure to submit the right problem at the last minute XD.
Thanks for the great contest guys!
as an author, I believe that 'lesa al-amana momkenah'.
As a contestant, I consider it an excellent problemset.
As a test, I want HCPC ):
more like WE want HCPC
as a tester, this contest is the best
Why you guys making cpc during theorical exams!
Who is the winner?
Do we need to mention jiangly?
orz team
also HIAST winners are 86 packs of juice
Wishing them the best of luck at the ACPC
As a contestant, I was happy to solve these problems.
As a participant I maintain my neutrality on the 3ara3eer-7asa7ees conflict. Good contest :)
As a tester