thanks for the good work as always errichto !!

This is really helpful, especially for beginners like me. I hope to see lot more this kind of video in near future.

The division 1's bar is so high. It's amazing to see many are able to implement this within 5 minutes or less.

I remember doing this problem in the live contest! It is a very fun one.

man, you are a great person .(from my heart)

Nice, this one to me seemed to be more of a challenge of finding a simple way to do what you knew you had to do. I wish they had said explicitly how to evaluate a grid that is clear except for the top-left cell being lava.

Great video, keep your videos like this. Doing mistakes and solving them.

This is extremely helpful, especially for beginners. Keep it up!

Really Helpful, brother. Thanks

I hope there will be more tutorials from divs in future

Great video sir keep doing the good work and upload more solution videos of codeforces contests

I was about to write a comment that you are suggesting an incorrect solution and then... you stated it yourself, either way, the realization felt good :D

Thank you for this :)

Very helpful! Thanks 😊

14:25, what you said is very true, whether it is cp or making any project like web, app etc

thanks please keep up those great videos

thanks , it helped a lot

Great Explanation

This video very helpful for me

I'd love to see you code a program that prints solutions to a random 24 Game (input 4 numbers 1-13, using all numbers and operators + - / *, find expressions that are equal to 24). Or have you done it already?

Good video!

best way to show the struggle of programmer great video brother love from India

for C you can try: int blocked = 0, r, c; int cells[2][n+2] ={0}; //vertical matrix while(t--){ scanf("%d%d",&c,&r); //since vertical c--; if(cells[c][r]) blocked-=cells[c^1][r-1]+cells[c^1][r]+cells[c^1][r+1]; else blocked+=cells[c^1][r-1]+cells[c^1][r]+cells[c^1][r+1]; cells[c][r]^=1; printf("%s",(blocked)?"No":"Yes"); } there might be some minor issues, pls ignore them.

Thank you 🌹

Wow. You made it seem so easy. I wish I could approach problems in such a simple manner.

PRGORAMMING GOD

Can you make a video on bitsets?

can u please so hashcode 2020 pizza problem

I’m stuck on Div2 green on codeforces, would you say I should practice solving the problems Div2A, B problems faster or would you say I should dive into Div2C,D or Div1 problems?

@nanda_8

3 жыл бұрын

how are u doing now?? crossed green?? I am stuck on newbie..

@fpcuber5077

3 жыл бұрын

@@nanda_8 Just upsolve problems. My lowest is 800 and now im 1270. Not that high but theres an improvment

Question, are you an interviewer on interviewing.io? I swear my interviewer had a very similar accent a couple of days ago :)

@alliecuake7728

4 жыл бұрын

No, I think not. I could be wrong though.

please post more contest problems editorial s

What is the cell 1,1 or 2,n is marked forbidden? Don't we ned a separate check for these two scenarios?

what ide did you used here?

It's a 2*n grid, so you can just iterate from column i-1 to i+1 of row (1-currentRow), (or 3-currentRow without the renumbering). Otherwise this tutorial should be easy to understand. When I solved, I stored all the pairs of cells and then insert/delete as needed; yours only need a count/badNeighbor variable so that's much better I guess :D

@Errichto

4 жыл бұрын

Yup, it's enough to iterate three cells in the other row. I wanted to make it simpler by iterating everything around me... didn't end well :D

@vikasvishwakarma5263

4 жыл бұрын

@@Errichto Its awesome the way you think dude!

Which application is this that you using to teach??

I think you could have made it a little faster to type out the solution if you assumed a 2 by (n+2) grid, put lava in the bottom left corner, lava into the top right corner, then you could skip some if statements since col+1 and col-1 are always in the grid .

One Question:- Why you do not come live for a long time on errichto2

Hi, errichto. Please make marathon coding tutorial. l am very curious. Thank you.

Hello I am new to cp. Could you please make a tutorial on how to solve SPOJ PRIME1? thanks

Hey can u please take up Kickstart2019 Round H Diagonal Puzzle Problem.Will be thankful.

What if all of the bottom row, for instance, is blocked. Does your algorithm solve for this?

@alliecuake7728

4 жыл бұрын

Try making a custom test case for the algorithm!

Its fun to watch but I don't understand what he saying

Hey

You should school the Path of Exile Dev's at GGG. They need someone that can do math bad. They've totally thrown game theory out the window.

Fifth😂😂

First!

@Errichto

4 жыл бұрын

so what?

@techwithwhiteboard3483

4 жыл бұрын

@@Errichto so can u please solve the 2020 hashcode pizza sample problem please

@techwithwhiteboard3483

4 жыл бұрын

@@Errichto and please reply

@29saiharsha

4 жыл бұрын

Savage

@rkv88kanyan39

4 жыл бұрын

@@Errichto very clever response