kevinsogo's blog

Invitation to ACM-ICPC Asia — Kharagpur Onsite Mirror Contest.
By kevinsogo, history, 8 years ago, In English

Hello CodeForces Community!

Being your Secret Santa this Christmas, I have packed a nice little gift for you. I am happy to invite you to the ACM-ICPC Asia — Kharagpur Onsite Mirror Contest ACM-ICPC Asia — Kharagpur Onsite Mirror Contest. Please do come and open your little gift on 17th December 1000 hours IST.

Joining me on the problem setting panel are:

Problem Testers: Errichto(Kamil Debowski), kingofnumbers(Hasan Jaddouh), kevinsogo(Kevin Charles Atienza)
Problem Setters: PraveenDhinwa(Praveen Dhinwa), Balajiganapathi(Balajiganapathi Senthilnathan), animeshf(Animesh Fatehpuria), arjunarul(Arjun Arul), adurysk(Surya Kiran), kevinsogo(Kevin Charles Atienza).

I hope you will enjoy solving them. Please give your feedback on the problem set in the comments below after the contest. You can find the rest of the details about the contest below.

Time: 17th December 2016 (1000 hrs) to 17th December 2016 (1500 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Details: https://www.codechef.com/KGP16MOS

Registration: You just need to register as a Team on CodeChef. Those who are interested and do not have a CodeChef handle are requested to register in order to participate.

Good Luck! Hope to see you participating!

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

Comments Comments (12)
| Write comment?
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

update: Onsite round delayed by 90 minutes, due to delay in Onsite contest.

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

Is there a public ranklist for the onsite?

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

Onsite Mirror has started!

→ Reply
»
8 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Hi will you please publish any editorial of the problems? ? ( Of course after the contest ) Thanks in advance.

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

Where is the final rank list?
Also, if possible, please move the problems into practise.

→ Reply
»
8 years ago, # |
  Vote: I like it +13 Vote: I do not like it

https://www.codechef.com/KGP16MOS/problems/KGP16A How to solve this one? Name of the problem is "Finding seats"

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

    IS the answer for sweet shop in kolkata always one or two??

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

      Yes, I think so..Though I did not participate in the contest So I am not sure but I think when s = q or s = n-q then answer is 1 otherwise 2.

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

        is it like when it is two u should ossicilate between odd and even numbers do you have same idea or any other??

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

          Yes something like k k+2 ... n n-1 n-3....

          → Reply