HELLOW ! TKAE MY SALAM , Asslamualikum guys;

like i was downloading cph book as i heard that it is a very good book to know and get idea about some techniques and topic,

and doing random shuffle as i do not understand that much till now , but in the last page of chapter 4 it said like there are two arrays and we have to find the count of common elements , so they use in the algorithm 2 a unordered set and it take o(n)complecity but by sorting (algo 3) it takes o(nlongn) by stl sort i personally never use unordered set so I do not know how to use it but in theoretical prespective if n>10 then nlongn>n so why the book says it cosume less time(algo3) than algo 2 kindly pls help me it will be a great pleasure for me ^-^; and also I found the chapter 5 very hard like i do not understnad it at all so any advie regrading it also be appreciated :) thanks in advance :)

hellow friends like i was solving the g problem of codeforces latest div 4 and everyone uses deque but i have a querry can n;t we use vector so i tried the approach and it geeting wa ! can any one help me to understnad can;t we use a vector in thsi problem ? if yes where my code is failing ?

the submission :316105508

Thanks for the help :)(in advacne )

hellow, cf frined

u can go to my submission and check the last problem c in my submission, that has got ac, but how idk. Can anyone explain the right approach

I go to google;s xor calculator and input some values, find a pattern, and implement it with a random guess , and it has got AC :)

pls help,

Thanks in advance.:) here is it how it passed

hellow,

i was solving a div 4 c so i am wondering why my code fialed can anyone give me a where it will help pls 306053812

thanks ! in advice

hello, hope all is well, my code and me is not well, here is my submission here my submission...

pls hlep do i need do learn anything or what was my fault pls thanks in advance >3.

300520956 got wa and it get AC 300520087

Your title here...

Some straight lines are drawn on a piece of paper, none of which are parallel to each other and have no points of intersection where more than two lines intersect. What is the minimum number of lines that can be drawn to ensure that the paper is divided into at least 2024 parts?