samiemad's blog

gym: HIAST Collegiate Programming Contest 2015
By samiemad, history, 9 years ago, In English

Hi Codeforces!

I'd like to invite you to participate in an online mirror of HIAST Collegiate Programming Contest 2015. (Higher Institute for Applied Science and Technology is one of the best academic Institution in Syria) The contest will be held on codeforces gym, and will start on Saturday 2/4/2016 at 10:00 AM UTC+2, registration will open 6 hours before the start time.

The contest consists of 10 problems, and you have 5 hours to solve them, ICPC rules.

The original contest was held in HIAST, Damascus, Syria as a qualification round to the Syrian Collegiate programming contest 2015.

The problems difficulty is easy-medium, although the problems are designed for new comers into the competitive programming world, but I believe that all Div2 participants will find very interesting problems to solve!

Some other Similar Contests are :

Although I believe this one is a bit easier than the previous contests.

I want to thank everyone who participated in the previous contests, I am glad you enjoyed them. I think you will like this one too.

I would like to thank codeforces community and MikeMirzayanov for the codeforces and polygon platforms.

Wish you all happy coding, and lots of greens! :D

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

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by samiemad (previous revision, new revision, compare).

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

Problem G .. Why Bob wins when N = 1? I think Alice can choose M = 1, then the jar will be empty and Bob loses.

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

    The person who cannot make a move in his/her turn wins the game.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

in problem G can anyone prove that bob will win if and only if N=1 ,please?

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

    At first suppose that Alice took number $$$1$$$ and Bob won that game, then instead of taking $$$1$$$, Alice will follow same strategy as Bob did and they will continue same game without $$$1$$$.

    Else Alice just won game by taking number $$$1$$$.

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

      i really don't understand the strategy that alice will win with it ,can you explain it with example ,please?

      → Reply
      • »
        »
        »
        »
        2 years ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        $$$N=4$$$ , $$$S:1,2,3,4$$$ and game goes like this:

        Alice took number $$$1 , S : 2, 3, 4 $$$

        Bob took number $$$4 , S : 3 $$$

        Alice took number $$$3 , S : $$$

        Bob wins because he's unable to make move.

        Now what i'm saying is that if Alice lost such game(starting with taking $$$1$$$) she could start with taking same number as Bob did and follow same strategy as Bob did.

        Alice took number $$$4 , S : 3$$$

        Bob took number $$$3 , S : $$$

        Alice wins because he's unable to make move.

        Notice that after taking $$$4$$$ they play same game as previous one just Alice and Bob swapped places.

        → Reply