Naseem17's blog

[GYM] Invitation to Aleppo Collegiate Programming Contest 2023 V.2
By Naseem17, history, 12 months ago, In English

Hello codeforces community!

I am happy to invite you to participate in the Aleppo Collegiate Programming Contest 2023 V.2 (V.2 because the first version of the contest was dismissed, so this is version 2) that was held at Damascus University on [contest_time:459931]. The online training will be on codeforces gyms and will start on Aug/29/2023 14:00 (Moscow time).

Thanks to Kaitokid, AboAbdoMC, Mahmoud_Haddad, Obada_Saleh, Mohanad_Nahhal, YazanAlattar, A.D., Helal_Salloum, Wael_Mchantaf and radi__07 for creating and preparing the contest. Special thanks to Majedh and Anas_Da who did most of the work.

Thanks to Baraa_Armoush and HeMoo for their contribution and constructive feedback.

Thanks to Vectors_Master, TripleM5da, IsaacMoris, BabaVoss, Abdelrahman_Etman, LastDance_NotLastOfMe and Assem_albitar for solo testing.

Thanks to the team testers:

Thanks to Damascus University for hosting the onsite contest.

Thanks to polygon for providing the amazing platform for creating and preparing the problems, and to codeforces for the hosting of the online training.

I hope you enjoy solving the problems. Any feedback will be appreciated.

  • Vote: I like it
  • +94
  • Vote: I do not like it

Comments Comments (33)
| Write comment?
»
12 months ago, # |
  Vote: I like it +42 Vote: I do not like it

As a tester, I'd like to say that naseem makes some good matcha.

→ Reply
»
12 months ago, # |
  Vote: I like it +31 Vote: I do not like it

As a tester , I think I deserve some contribution LOL

→ Reply
»
12 months ago, # |
← Rev. 2   Vote: I like it +31 Vote: I do not like it

As a problem setter

Naseem is the greatest chief judge I've ever seen

→ Reply
»
12 months ago, # |
  Vote: I like it +20 Vote: I do not like it

Excited for this round. It is expected that this round will be enjoyable :)

→ Reply
»
12 months ago, # |
  Vote: I like it +26 Vote: I do not like it

As a tester, I can say that the authors did a great job on this contest with all the interesting problems.

→ Reply
»
12 months ago, # |
  Vote: I like it +21 Vote: I do not like it

Thanks, you are the best

→ Reply
»
12 months ago, # |
  Vote: I like it +23 Vote: I do not like it

Lk 3ashhh <3

→ Reply
»
12 months ago, # |
  Vote: I like it +23 Vote: I do not like it

Thanks to everyone who contributed to this

→ Reply
»
12 months ago, # |
  Vote: I like it +26 Vote: I do not like it

Thanks for the nice problem ideas and strong testing :)

→ Reply
»
12 months ago, # |
  Vote: I like it +6 Vote: I do not like it

As a tester , I'd like to say I'm so proud of you Naseem17

→ Reply
»
12 months ago, # |
  Vote: I like it +11 Vote: I do not like it

is it team contest?

→ Reply
  • »
    »
    12 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It’s an ICPC style contest, so a team is recommended, but you can register as a person if you want

    → Reply
»
12 months ago, # |
  Vote: I like it +5 Vote: I do not like it

Are the problems provided in English?

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Editorial?

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    which problem do you need ?

    → Reply
    • »
      »
      »
      11 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      want G and M

      → Reply
      • »
        »
        »
        »
        11 months ago, # ^ |
        ← Rev. 3   Vote: I like it 0 Vote: I do not like it
        Editorial For G :
        Code
        → Reply
»
12 months ago, # |
  Vote: I like it +5 Vote: I do not like it

As a tester I am too late to write comment.

→ Reply
»
10 months ago, # |
← Rev. 4   Vote: I like it 0 Vote: I do not like it

How do you solve Problem I?

This is my code, and I can't figure out what's wrong with it (it gets a WA on test 7).

→ Reply
»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How do you solve problem A?

→ Reply
  • »
    »
    10 months ago, # ^ |
    ← Rev. 3   Vote: I like it 0 Vote: I do not like it

    As $$$x <= 10^9$$$ You can replace every $$$a_i$$$ with $$$g = gcd(x, a[i])$$$ because you can't get more contribution than $$$g$$$ from $$$a_i$$$. Now all integers are the divisors of $$$x$$$. So, there will be about $$$10^3$$$ distinct integers. You can store maximum $$$q$$$ duplicates from each of them where $$$q$$$ is maximum power of a prime factor of $$$x$$$. Now, try using dp to find a proper subset.

    → Reply
    • »
      »
      »
      10 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      How did you know that there will be at most 1000 distinct numbers ?

      → Reply
      • »
        »
        »
        »
        10 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Maximum number of divisor of x can be $$$10^3$$$

        → Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hints on H?

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Where can I find the editorial of Problem F

→ Reply
»
8 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Someone please provide Editorial for problem D

I have tried Binary search to find b.. assuming a = x;

but getting WA on test 4

CODE
→ Reply