LotiyaPathan's blog

By LotiyaPathan, history, 5 weeks ago, In English,

Hello everyone!

I am super excited to bring to you this year's edition of ATMOS CodeDash.

CodeDash is BITS — Pilani, Hyderabad Campus' premier annual competitive programming competition. With participation rapidly increasing every year, it is becoming one of India's most popular university level coding competitions. It is organized by our university's programming club, Crux. You can find more about Crux here.

The contest will be hosted on CodeChef on this link: Contest Link

You will be given 2.5 hours to solve 6 problems. The contest will be a standard ICPC style contest with no freeze period.

Day and Date: Sunday, 13th October, 2019

Time(UTC): 11:30 — 14:00
Time(IST): 17:00 — 19:30

There are prizes worth INR 40000 for top 3 Indian participants. The distribution is as follows:

1st prize — INR 20k
2nd prize — INR 13k
3rd prize — INR 7k

I would like to thank everyone involved in the problem setting and testing process, as well as CodeChef for providing us the platform to host our contest. The problems have been created by me LotiyaPathan, Raghu150999, wreck_count, PyAlpha, z3r0dmg and 8.30662. The problems have been tested by kAAzukiHoshino, Nikhil_Medam, ExplodingFreeze, shadowreaper810 and kklash.

More about ATMOS:

ATMOS is BITS — Pilani, Hyderabad Campus' annual technical fest. It is one of the biggest Hyderabad's university technical fests over the year. It will take place from 18th October — 20th October this year. You can learn about more events at ATMOS at ATMOS' Official Website.

GLHF!

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

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

On codechef it says, the contest starts at 2pm IST, but here it is 5pm IST. can you clarify, which one is correct?

»
5 weeks ago, # |
  Vote: I like it -17 Vote: I do not like it

Will it be rated?

»
5 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

What is the distribution of INR 40000 among top 3?

»
5 weeks ago, # |
  Vote: I like it +12 Vote: I do not like it

Amazing! Looking forward to a great problemset.

»
5 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

Can someone tell me how to solve CHJERRY

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Bellman Ford.

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it +24 Vote: I do not like it

    You can also do improvised 0-1-2-3 BFS to solve it in O(N). Here is my solution with dijkstra in O(nlogn) with the same idea. code

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Can you share the approach for CHACAND. I can see people using fft, can you explain the logic behind fft in this problem?

»
5 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

Editorial pls. at least for the last two problems.