### saurabhsuniljain's blog

By saurabhsuniljain, history, 7 years ago,

Every time we give a contest on Codeforces we need to solve 5 problems. We need to perform some repetitive routine tasks like creating folders for each contest, then for each question and then executing for some inputs. I have created a plugin / file manager action that will do these tasks just by right clicking in the specified folder. Also it will copy a specified template c++ program every questions folders.

The git repository is maintained here with instructions for installations.

Future Works : I also would like to add some new features like automatically submitting a solution to codeforces during the contest. Also downloading pdfs for all the problems.

• +23

By saurabhsuniljain, history, 7 years ago,

Every time we solve questions in google code we need to solve it for both small and large inputs. We need to perform some repetitive routine tasks like creating folders for each question, then folders for small and large and then executing for both inputs. I have created a plugin / file manager action that will do these tasks just by right clicking in the specified folder. Also it will copy a specified template c++ program in both Small and Large folders.

The git repository is maintained here with instructions for installations.

Future Works : I also would like to add some new features like automatically submitting a solution and output file, automatically fetching the problem list and creating the folders for all the problems. Also downloading pdfs for all the problems.

I would also be creating a plugin for Codeforces Regular Division Rounds.

UPDATE 1 : I have created a plugin for Codeforces regular round with basic functionalities to create folders and execute programs. I have added a blog here

• +5

By saurabhsuniljain, history, 7 years ago,

Problem : Rupsa and the Game Editorial : link

Wrong thing with Editorial :

But how many already existing sequence are there? Clearly, 2^(k−1) but when two pairs equal numbers are there then there will not 2^(k-1) sequences because of repetion of sequences, like suppose we have 1, 2, 2, 3, 3 We can obtain : 1 -> 1 2 -> 1 2 3 -> 2 1 2 3 -> 3 2 1 2 3 Also, : 1 -> 2 1 -> 3 2 1 -> 3 2 1 2 -> 3 2 1 2 3. So I think the approach is wrong and all have blind folded solved this problem.

I have also commented it there, but admin haven't replied yet. Can someone please check what I am saying is correct or not.

• -7