The contest is over! Everyone did a great job!!

We want to thank the first 5 places for their more than wonderful efforts:

1- Hosen_ba, EyadBT, and JaberSH1.

2- BluoCaroot, M0N, and Moataz_Muhammed.

3- Islam_Imad, Mr_Turtle_, and 7oSkaaa.

4- ahmedalaa22, MUZAN, and detective...dots.

5- Eslam_Saleh, Mohamed_M.M.R, and EslamSamy2002.

And for everyone who participated in the contest, please vote in the Feedback box for every problem, Thank you.

A. Nuclear Experiment

Problem setter: hmsh

B. qaruti and Rooks

Problem setter: qaruti

C. Long queries

Problem setter: OmarAli.

D. abcadc

Problem setter: Kilani

E. Chrysalis

Problem setter: fettucci

F. Hashem and knights

Problem setter: hmsh

G. largest box

Problem setter: mahmoud_zoubi

H. qaruti between brackets

Problem setter: qaruti

I. YIPPIE!

Problem setter: fettucci

J. The Thrift is Real

Problem setter: fettucci

K. Your password is weak!

Problem setter: TravisBickle

L. ExtraGalaxical Numbers

Problem setter: sharaf_makahleh

M. Does it work?

Problem setter: Saleh_Elnaji

N. Watermelon? again!

Problem setter: JUST_Ace

O. Subsequence Construction

Problem setter: Yaseen_Ahmad

P. Maximum Subarray

Problem setter: Kilani

Q. K operations

Problem setter: Kilani

R. qaruti's rank list

Problem setter: qaruti

S. LISsion Impossible

Problem setter: Rayano

T. Middle Earth

Problem setter: ayham_alsalman

U. A lot of flips

Problem setter: M-Qawasmeh03

V. qaruti's shop

Problem setter: qaruti

Hi everyone, I'm very excited to announce JUST ACM HALF EXTREME!

This contest simulates IEEExtreme with the same rules.

It will be held in this group. Note the unusual start time. The contest will run for 12 hours, and there are no penalties for time or wrong answers, just like in IEEEXTREME.

The contest will begin with 5-7 problems, and every two hours, 2-4 additional problems will be released.

Each problem is worth between 50 and 250 points. Even if you cannot fully solve a problem, you can still earn points by partially solving it. For example, if the optimal solution for a problem is O(N) but your solution is O(N^2), you can still score some points. The more you optimize your code, the more points you can earn.

You can participate as a team of up to 3 members. Any team with more than 3 members will be disqualified.

Any attempt to cheat between teams, or using AI tools, will result in disqualification. Please enjoy the problems without cheating.

Finally, special thanks to the writers and the testers of the contest : Kilani,qaruti,OmarAli.,Rayano,sharaf_makahleh,TravisBickle,Yaseen_Ahmad,Saleh_Elnaji,M-Qawasmeh03,ayham_alsalman,JUST_Ace,hmsh,fettucci,mahmoud_zoubi,ZeroNeroIV

And of course, thanks to MikeMirzayanov for codeforces and polygon.

And thanks to You for participating in our contest.

I hope you all enjoy the contest, good luck!

Hello guys!

It's a pleasure to invite you to participate in [contest:532454], , that will begin at [contest_time:532454], note the unusual starting time .

Please join this group.

The contest is the same level as div.3, you will be given 8 problems to solve in 3 hours.Please read all the problems.

Big thanks to Kilani for testing and helping me in writing the contest.

I hope you all enjoy the contest, and we will see you in the next JUST ACM Contests.