Dear coders,
The Techkriti team presents the 2015 edition of IOPC, the annual International Online Programming Contest of IIT Kanpur. This 24 hour long contest will have you competing with some of the best coders in the world in solving very challenging problems of an algorithmic nature. There will be total prizes worth 2500$ as well.
IOPC 2015 will be held from 1800 hrs on March 14 to 1800 hrs on March 15 (IST) check here for the exact time for you. Teams of upto 3 members can participate in the contest. The contest is open to all — however, to be eligible for prizes, the teams need to be comprised of students who are currently registered in some university only. It is not necessary that all students be from the same university.
IOPC 2015 will be hosted on Codechef platform (Link to the contest page).
To participate in the contest, teams need to register on Codechef before the start of the contest. To be eligible for prizes, teams and members have to register on the IOPC page as well.
The last year's contest link can be found here . Visit the Codechef contest page and the IOPC site for rules and more details.
The contest has been prepared by infiniteloop17, abhilak, triveni, sshekh and AIgen .
Important Notes
* Team registration needs to be done on the Codechef site bparticipate the contest. Even if the members of the team have individual Codechef IDs, a new team has to be registered for the contest.
* The event is part of Techkriti 2015. Prize dispatch will be done along with prizes for other events of Techkriti, and can be expected to arrive in two to three months.
Expecting a grand participation!
Hope you will enjoy the problems !
Best of Luck and Happy Coding !
UPD : The Contest is now over. Thank you all for participating. The final scoreboard of the contest can be found here: (Link). We will publish the editorials soon.
Can anyone give hints on how to solve H (Fibonacci Wars II)? We came up with solution that requires calculating sqrt(5), but unfortunately it doesn't exist in modulo 109 + 7 :(
Here is how I solved it.
Notice that Sn = x.Sn - 1 + f(n)k
If you can find some way such that f(n)k depends on f(n - 1)k, f(n - 2)k... then you will be able to convert this into a linear recurrence solvable by matrix exponentiation.
Have a look at this link .
Once you have a way to find f(n)k based on f(n - 1)k, ..., f(n - (k + 1))k then you can store:
and then find a suitable matrix such that multiplying it with that you will get:
You can do calculations in Z[sqrt(5)]. Here is my submission. It's not very clean but does the job.
When will the editorials be published?