tag:blogger.com,1999:blog-3675582796619590206.comments2018-05-27T12:04:31.340+06:00 I, ME AND MYSELF !!!Zobayer Hasannoreply@blogger.comBlogger846125tag:blogger.com,1999:blog-3675582796619590206.post-6384666111601130792018-05-27T12:04:31.340+06:002018-05-27T12:04:31.340+06:00Glad that it helped.Glad that it helped.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-50199448124379688122018-05-20T01:44:08.596+06:002018-05-20T01:44:08.596+06:00thanks vaiya
I felt, recursion is critical functio...thanks vaiya<br />I felt, recursion is critical function in before.<br />But after read this articles , i am really thank to u.<br />now i feel better about recursion function.Saiful Islamhttps://www.blogger.com/profile/07799882962217989760noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-41431992187524090702018-05-07T23:25:54.617+06:002018-05-07T23:25:54.617+06:00Can you clear the line "So, while left shifti...Can you clear the line "So, while left shifting, if you push a 1 at that position, the number will be negative." by giving an example please...Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-54367965095552478852018-03-26T21:00:14.176+06:002018-03-26T21:00:14.176+06:00very helpful..thanks....very helpful..thanks....Rezowan Talukderhttps://www.blogger.com/profile/03494276916253888525noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-79119548925771979852018-02-21T15:29:51.981+06:002018-02-21T15:29:51.981+06:00It will raise warning during compilation, also, th...It will raise warning during compilation, also, the method will return a garbage value if any statement that called the function initially was expecting a value. If you do not expect a return value from a function call, then there is not problem. Look at the following example:<br /><br />int a() {<br />// do not return anything<br />}<br /><br />---- in main ---<br />a(); // no problem<br />int x = a(); // now there is a problem<br /><br />I hope this clears up the confusion.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-74157891291139568762018-02-14T18:18:43.697+06:002018-02-14T18:18:43.697+06:00Can anyone tell what is use of return statement wh...Can anyone tell what is use of return statement while returning a value in recursion...<br />What if I don't write return in front of function naming which is not of void type?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-72637619392485306602018-01-31T14:52:19.709+06:002018-01-31T14:52:19.709+06:00Really nice and learning post ever..Really nice and learning post ever..rabiul rafihttps://www.blogger.com/profile/11639005277934041950noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-6452840024414513562017-12-22T23:52:07.600+06:002017-12-22T23:52:07.600+06:00Thanks for this beautiful article. Awesome really....Thanks for this beautiful article. Awesome really.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-6656982387647190772017-12-17T15:16:59.066+06:002017-12-17T15:16:59.066+06:00Thank you for this list. :)Thank you for this list. :)Deepam Sarmahhttps://www.blogger.com/profile/13466737540234587803noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-1659051616317835812017-12-15T04:32:30.037+06:002017-12-15T04:32:30.037+06:00Sorry brother, I was wrong. Please ignore my previ...Sorry brother, I was wrong. Please ignore my previous message. Paranoid.soulhttps://www.blogger.com/profile/13127694754510658182noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-91191219733115230532017-12-15T01:01:19.367+06:002017-12-15T01:01:19.367+06:00In some problems you may need an additional dfs fo...In some problems you may need an additional dfs for bicoloring to decide the value of n and m. More precisely, you may often do some extra work to decide which nodes go to left and which nodes go to right and you may need extra bfs/dfs for bicoloring. There is a pretty similar implementation of the above algorithm which takes care of this problem. Also, it encapsulates all methods and classes used by the algorithm in a separate class which makes it a little simpler to use the algorithm as template. <br />https://pastebin.com/pvPRuGXr<br />Tested on <br />http://codeforces.com/contest/468/problem/B<br />Happy CodingParanoid.soulhttps://www.blogger.com/profile/13127694754510658182noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-32402837029874388022017-12-05T11:45:10.813+06:002017-12-05T11:45:10.813+06:00tnxtnxmonirul islamhttps://www.blogger.com/profile/08927577492621559607noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-91717489013052337312017-12-05T00:57:39.083+06:002017-12-05T00:57:39.083+06:00problem 12,20 seems very difficult than others .problem 12,20 seems very difficult than others .Assasinhttps://www.blogger.com/profile/16908667540636355299noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-25328825958767893382017-11-28T23:27:19.538+06:002017-11-28T23:27:19.538+06:00Nice post. I was checking continuously this blog a...Nice post. I was checking continuously this blog and I'm impressed!<br />Very useful information specially the last part :<br />) I care for such information a lot. I was looking for this <br />certain information for a long time. Thank you and <br />best of luck.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-74584939848563339632017-11-07T18:48:37.082+06:002017-11-07T18:48:37.082+06:00thank you brother...thank you brother...jahir islamhttps://www.blogger.com/profile/05813414963962228632noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-69956606147247564462017-10-12T18:49:52.086+06:002017-10-12T18:49:52.086+06:00I left optimization to the reader. For example you...I left optimization to the reader. For example you can break the loop after getting n-1 edges since there can be at most n-1 edges in a tree with n nodes. And there is no difference between while and for. For may be a tiny bit faster but irrelevant in the grand scheme.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-77883267229779066232017-10-09T00:19:39.826+06:002017-10-09T00:19:39.826+06:00ভালই ছিল টিউটোরিয়ালটা.......ভালই ছিল টিউটোরিয়ালটা.......BIDDUT SARKER BIJOYhttps://www.blogger.com/profile/16466843106038321587noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-68807200522748953972017-10-08T20:58:15.677+06:002017-10-08T20:58:15.677+06:00Why did you use a for loop , instead of a while ? ...Why did you use a for loop , instead of a while ? increment the counter only when we find an edge which does not create a cycle , please could you explain me this ,this is the doubt i have . Arkapravanoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-90286485710139305112017-10-04T16:57:10.670+06:002017-10-04T16:57:10.670+06:00Read so many tutorials... But this gave me super c...Read so many tutorials... But this gave me super clarity... Thank you so much...<br />Unknownhttps://www.blogger.com/profile/02912163892082336852noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-13354025988244041382017-08-10T15:01:01.101+06:002017-08-10T15:01:01.101+06:00Although i am 3 years late but i was also stuck in...Although i am 3 years late but i was also stuck in a similar situation.<br />The point query won't give the sum upto 'x' but will give the given value at that idx.<br />So indices 5 and 6 won't be changed but while calculating query(5) we will iterate through 5-->4.adihttps://www.blogger.com/profile/17510866426997997873noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-3875591484927420512017-08-02T10:29:52.424+06:002017-08-02T10:29:52.424+06:00The conditions for an Euler path to exist in a sim...The conditions for an Euler path to exist in a simple graph are: (a) All nodes must have even number of degrees. (b) If there are odd degree nodes, there will be even number of nodes with odd degrees. You just need to find a path given that there always one such path exists.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-27788249212050936102017-08-02T03:33:43.815+06:002017-08-02T03:33:43.815+06:00Thank you so much! I still don't quite underst...Thank you so much! I still don't quite understand it, but it works!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-22621302536095563292017-07-19T15:51:47.507+06:002017-07-19T15:51:47.507+06:00Your blog has given me that thing which I never ex...Your blog has given me that thing which I never expect to get from all over the websites. Nice post guys!<br /><br />App Developerhttps://www.papdan.com/services/app-development/noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-39644969779637476712017-07-11T14:58:32.877+06:002017-07-11T14:58:32.877+06:00thank you so much for awesome artificial written ...thank you so much for awesome artificial written Saddam Hossain Adnanhttps://www.blogger.com/profile/16130976497613231248noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-10697394681014044172017-07-06T15:32:55.512+06:002017-07-06T15:32:55.512+06:00Prime numbers can only be divided into integers.As...Prime numbers can only be divided into integers.Aside from divide and count test and various sieving methods, it is believed that <a href="http://nuclearstrategy.co.uk/prime-number-distribution-series" rel="nofollow">Prime Number Distribution Series (PNDS)</a> is the mathematical formula for finding prime numbers.primenumbershttp://nuclearstrategy.co.uk/prime-number-distribution-seriesnoreply@blogger.com