padfoot1717's blog

By padfoot1717, 8 months ago, In English

I was practising some atcoder problems and i really got fed up. In almost every third problem i had to ensure that no overflow is occuring while dealing with huge numbers. This really screws up your interest in the problem and significantly makes it more laborious without any reason. This makes using C++(which is quite a cp friendly language) in atcoder problems more difficult.

Read more »

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

By padfoot1717, history, 10 months ago, In English

I am stucked at the problem Shortest subsequence. Can someone kindly explain an optimal algorithm to solve this problem?

Read more »

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

By padfoot1717, history, 10 months ago, In English

Can someone kindly take the pain of checking my submission on which i am getting RE verdict and help me to sort the error?

Read more »

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

By padfoot1717, history, 11 months ago, In English

Friends during the previous contest (656 div-3) for problem-1385D - a-Good String i had submitted this solution 87151676 and it gave TLE, after looking at the model solution in the editorial i changed my normal "string" argument to "const string&" argument in the function that i had written and submitted this solution 87188378 which got easily accepted. Can anyone please explain the reason because of which such huge difference in execution time came just by changing the "string" argument to "const string&" argument"?

Read more »

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

By padfoot1717, history, 11 months ago, In English

Kindly try this problem and provide a detailed algorithm for solving it, i will be extremely thankfull. Link to the problem Edit-Seems to be extremely strange, that people rather than helping are delibrately downvoting just for the sake of fun.

Read more »

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

By padfoot1717, history, 12 months ago, In English

Suppose we have a string and we want to find the longest palindromic subtring which is also a prefix of the original string. Is there any way to solve this problem faster than the bruteforce technique?

Read more »

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