ZIO problems

Thanks this is is a helpful information for me as I am participating for the first time and by the way in which class are you now? What happened after you were qualified through ZIO? Did they call you for the NIOI or the next round ? How did you perform there? Was it difficult? . Please share your experience @sudheerays123

1 Like

Yes we followed the same way in different approach :sweat_smile::grin::grin:

1 Like

And using the following problem you can check if you can come up with an own formula/apporach for a tiling problem:
ZIO 2009 - P.1

1 Like

Both are almost same right ?
Thanks a lot ! @denjell

1 Like

Almost but there is an interesting additional condition.

3 Likes

Great! for you @sudheerays123 . I am in 11th standard now and I recently joined NIOS which is National Institute of Open Schooling this year. Till 10th I was studying in an ICSE school, and thank god ICSE schools start teaching programming languages from 7th class itself, so now I have a good background of algorithms, data structures, time complexity, and many other things but I wish I had knowledge of IOI, ZIO, ZCO when I started programming for the first time. Now I have only 2 years trials left this year of 11th and the next year of 12th to try for IOI. I will try my best to get selected for IOI maybe not this year but next year for sure as I am already good with topics such as MST, BFS, DFS and other topics.

You are lucky that you started preparing early for these competitions. One day for sure you will be selected for IOI just keep going and try your best. We could help each other out in difficulties.

Wish you best of luck!:innocent::innocent:
Try best and qualify NIOI this time.:100:

By the way thank you @denjell you helped us a lot.
Thanks
G Ajeet :smiley::smiley:

3 Likes

It seems that you are enjoying to solve these ZIO questions :sweat_smile::sweat_smile:

2 Likes

They are funny somehow. And the dp approach for tiling did not come to my mind before reading the tutorial on the topic. Now I learned it and hopefully will remember the next time when i need it. So I also had a benefit :-). Good luck at ZIO.

3 Likes

Thanks a lot !
You reallllly helped me a lot !
Pls let us also discuss for other problems

Once again Thanks !

2 Likes

Guys I have found solution for this by codechef
Looks like they are going to do it for all the problems

here is the link for the solution :

https://drive.google.com/file/d/1nHyd1tuJQlXriNaQyXSWrfrjYtxL7R0C/view :

And here is the link of the code which is given in the editorial

Thanks
Sudheera Y S

1 Like

Where did you get this link https://drive.google.com/file/d/1nHyd1tuJQlXriNaQyXSWrfrjYtxL7R0C/view
?

1 Like

https://www.codechef.com/ioi/zio

They are going to upload editorials for every question :smiley:
YAY !

This is official by codechef

2 Likes

I think our discussions drew their attention and now they think to help us.:sweat_smile::sweat_smile::joy:
Its now really good and hope they will be updated before the competition.
Yay!:sunglasses::sunglasses:

What is this code good for? @sudheerays123

Sorry didnt understand

I mean why did you attach this link?

Is it a helpful link?

Hey @sudheerays123,
Have you solved ZIO 2019, P3?
Here’s the link https://www.iarcs.org.in/inoi/2019/zio2019/zio2019-question-paper.pdf

I think it can solved by permutation and combinations but I am not able to do it.
Please help!

@denjell you could also try.

This link contain the code for the memtioned problem

1 Like

Ok I get it.

This is how I did it ( not telling the answer) :

First write the answer for N = 2 to 5 ( answers are small) and then find the pattern out of them and then continue it till N = 15 and you will get the answers

Hope this helps
Sudheera Y S
:slightly_smiling_face::smile:

1 Like

Ok I’m gonna try!