Sahilamin219's blog

By Sahilamin219, history, 3 days ago, In English

I m in my semi-final year of my college and i have been practising a lot over on codeforces than any other cp site. And as of current state of pandemic i m pretty sure that not many of the companies are going to visit our college for internships and a pupil like me stand no chance for off-campus. Also besides competitive programming i haven't done any great projects as i m told not to do any before becoming candidate master .I think that's enough reason for me to become Div1 candidate as soon as possible.

However, i m not concerned about getting any kind internship this year than i m in improving my competitive coding skills. But it really sucks when every time i m asked how many question i did in contest from my family side because it have never went more than three.Now i don't even look on how many question are there in contest because its always has been three for me.

I love giving contest than studying algorithms , watching any youtube tutorial or just simply solving problem but this just doesn't feel any great now when you know what the result is going to be before giving contest. Recently, i have studied some nice algorithm on graphs like bridges finding, kosaraju algorithm, DSU but when i came on codeforces to solve these topic related problems they all seems to be too tough.

So i just wanted to ask where should i practise most that will help my increase my problem solving skill? Because i just tired of looking into to tutorial every time and moreover i don't believe anymore that this thing really helps as my friends who are not regular in competitive programming are able to solve more problems than me in less time and many time come with a better and easy on implementing solutions . Looking into tutorial is like mugging up one technique for one kind of problem which you sure going to forget after looking hundreds of them.

I also made a notebook and started writing all the key points for question which i fail to do but its like every time there come always some new approach to solve the problem in contest.

I really want to enjoy giving contest and keep doing competitive coding as long as i can .I m aware that there is no magic but i want you to share what you all did most which made you see the improvement in yourself.

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

By Sahilamin219, history, 2 months ago, In English

I was stuck in this question Your text to link here... and the editorial doesn't seem to be much helpful to me . However in the discussion section someone explained that this is the dp formula . dp[i][j] = dp[i][j-1]*i + dp[i-1][j]*j-dp[i-1][j-1]*(i-1)*(j-1) i m not able to understand how did he get the third term in the expression and more over i think this needs some correction as i was not able to get the right ans from this.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Sahilamin219, history, 3 months ago, In English

link for question Your text to link here... i m getting wa on testcase 11 Your text to link here... after wards i modified my solution but its not working even on testcase 1.Your text to link here... i m no where able to see where is it going wrong. If you have any other idea please describe it.. i have spend a lot of time on this question

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Sahilamin219, history, 3 months ago, In English

In this problem Your text to link here... i m getting memory limit exceeded error after submitting . I have solved this question in two other ways and may be in this i may get tle even after debugging this . But i m just curious that my map will be not be constructed of more than 10^5 key values ..than why mle ? please help. submitted codeYour text to link here...

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Sahilamin219, history, 3 months ago, In English

I m easily able to come up with an recursive approach for dp problems and sometimes able to modify that solution using memoization when it is easy to see if its 1D or 2D dp but as the variable increase i totally get messed up. And for tabulation i m not even able to think how to even approach for it ..ans keep guessing randomly...i m totaly naive in it. like in this question Your text to link here... i just got wonder is it even 2d or 3d dp ? my recursive solution is this Your text to link here... which is just useless due to exponential time complexity. please can any one tell me how to solve such question using tabulation.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Sahilamin219, history, 4 months ago, In English
  • Which question should i do first in contest (div2 and div3) . is it better to solve first c or d questions in codeforces contest ? will it be helfull to increase my rating ?

Read more »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it