Engineer, the annual technical fest of NITK, Surathkal, in association with HackerEarth presents Inscription, the online algorithmic programming contest of NITK. It is also the flagship event of Engineer's Computer Science Events' Committee. The previous editions of the event witnessed tons of participants from various countries and also successfully managed to attract some of the best coders of the world to compete for the top spot. This year once again Inscription strives to achieve its previous glory.
The details of the competition are as follows:
Timings : 21:00 IST (13-OCT-2018) to 00:00 IST (14-OCT-2018)
Contest Link : https://www.hackerearth.com/inscription-18
Prizes only for top 3 Indian winners.
- First Prize : 6000 INR
- Second Prize : 3000 INR
- Third Prize : 2000 INR
To be eligible for prizes, please fill the form : https://goo.gl/forms/8B0Zmz2lheQ2mmW63
RULES:
1. This is an individual contest.
2. You will receive hundred points for solving a problem (passing all test cases — no partial credit), regardless of the level of difficulty of that problem.
3.The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submittal of the first accepted run plus 10 penalty minutes for every previously rejected run for that problem. There is no time consumed for a problem that is not solved.
We have tried our best to create an interesting problemset, and we hope that everyone finds something interesting in the tasks.
We hope you'll have an amazing time! Happy Coding!! :)
Reminder: Contest starts in 20 minutes
How to solve Shuffle or Not?
LCM of sizes of connected components
Can you please explain the reason or idea behind it. Thanks :)
Consider N nodes, numbered from 1, 2... n. Connect ith node to p[i]th node where p is the permutation array. Now, you will have certain number of connected components of certain sizes. Answer is LCM of these.
Consider an example p[] = 3, 1, 2, 5, 4, 6. Here, there are 3 connected components of size 3, 2 and 1. The answer here would be 6. Why does this work? You can see that after x operations (x being the size of a connected component), the elements in that component line up perfectly. For all the elements to line up perfectly in the minimum number of steps you need to take LCM.
Can anyone please explain the solution to Too Many Tables?