Відео

except for last one i understood everything

Janek chcesz żeby dał ci więcej?

20:00 a bipartite graph should be for even Edges with even Vertices. (It should be Hamilton cycle as well? )

backtraking please...

thanks for this explanation

I really find this helpful, understanding the concepts in a simpler way. Hope you continue this streams till next year like you mentioned in this stream. Thank you.

Last year, there were zero submissions with JAVA So, a challenge for y'all is to use JAVA in at least one of the problems. 🤣

i couldnt join the stream but it seems fun

Hii

it will be very nice to add a sheet contaning the problems of each session

Can you please put the links to the problems ??

Very good video,this cleared logic building in graphs. Eagerly waiting for DP live stream

Help! with problem C. why if x=8, y=0, k=2 there should be 7 steps and not 8 steps it would take to get from 0,0 to 8,0. please explain....

In the last problem why do cnt[i] * pw[cnt[i]-1]; during explaination you told pw[cnt[i]]-1

I am a newbie on Codeforces with a current rating of 642. Following your tips, I go to the CF problemset and try to solve brute-force, math, and implementation problems rated 900 to 1200. Do you think this is the right way to practice

Every prpblem was beautifully explained Master, I was able to visualize everything that you said ,and was able to do the code by myself ,keep it up master

Nice teaching sir

In C, we could generate all the numbers while unsetting the bit at every position that a bit in N is set starting from the least significant bit Here is the code for that ll n; cin >> n; vector<ll> ans; if(__builtin_popcount(n)==1){ cout<<1<<endl; cout<<n<<endl; return; } for(ll i=63;i>=0;i--){ if((1ll<<i) & n){ ll new_number = n^(1ll<<i); ans.push_back(new_number); } } ans.push_back(n); cout<<ans.size()<<endl; for(ll i=0;i<ans.size();i++)cout<<ans[i]<<" "; cout<<endl;

amazing!!! make same type of practice video for dp and graph

really helpful, can you show a better code version in the upcoming streams, i always find it difficult to write a clean code

make one for expert to master 🙏

pls show solutions

nice

Great!

really helpful, thanks Shayan, I follow you from Codeforce to now forever

This stream was so so helpful. It was awesome. Thank you for you amaizing dedication. Keep up the great work please.

عالی بود ممنون داداش زیرنویس فارسی نمیزاری؟

I think Trees then range-queries after graph would be great :)

❤❤❤❤❤❤

not only I learned solving a dp problem, but also learned how to not get a TLE when solving such dp problems on CF. Nice! Thanks for it!

Sir, I am practising all the coding question in only python... Could you suggest me some things as to continue the same? or move on to learn some other language as a backup? Please suggest something, sir!

Thankyou Shayan i love your explanations.

Problem C has the wrong answer on test 2.

How (0,10) is possible if k<10. since he/she can move in only positive directions ??

Thanks a lot i hope u will do more this topic basic algoritm ❤

I am a at 1100 rating , hopefully , one day I will reach great hights

I repeated the video 3 times but when I understood it , I realized how accurate your logic of explanation is

It's nice to see how a grandmaster think. Thanks Shayan brother

chal be chinki

THANK YOU MAN THATS HELP A LOT

Janek chcesz żeby dał ci więcej?

What an amazing teacher, you are awesome!

Keep going sir ❤ great teaching 🤗 thanx a lot 🙏

I couldnt understand this part. X and Y can be negative but in our problem, X and Y are >= 1. How this doesnt change our answer? Can anyone please explain me this?

Thanx bhai

چطوری بلند ترین رشتش رو خروجی بدیم یعنی خود همون استرینگه؟

Problem C was brilliant

waiting for next streams... with alot of problem on dfs and bfs

Hey Shayan, would you be able to explain the old Codedorces question at the end of the session??

First of all shayan Thanks a lot for making these videos and it would be extremly helpful if some unusal question like c appeared tommorow u can share one or two question which might follow the same approach and thank you gain