Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official. ×

kingofnumbers's blog

By kingofnumbers, 3 years ago, In English,

If you want to understand recursion then follow the link

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

»
3 years ago, # |
  Vote: I like it +7 Vote: I do not like it

The link opens this page (your blog),please check the link again.

»
3 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Did you learn from there only :D

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there any elementary case? :P

»
3 years ago, # |
  Vote: I like it +5 Vote: I do not like it

if you got the general idea of recursion — don't follow the link posted above

»
3 years ago, # |
  Vote: I like it +2 Vote: I do not like it

when it ends oh kingofnumbers

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I think you got an overflow there.

»
2 years ago, # |
  Vote: I like it -46 Vote: I do not like it

Good one kingofnumbers.

»
2 years ago, # |
  Vote: I like it -28 Vote: I do not like it

Well Played :-D & Nicely Explained.

»
2 years ago, # |
Rev. 2   Vote: I like it -23 Vote: I do not like it

Lol nice

»
2 years ago, # |
Rev. 11   Vote: I like it -11 Vote: I do not like it

Persistence

»
2 years ago, # |
  Vote: I like it +9 Vote: I do not like it
»
2 years ago, # |
  Vote: I like it -15 Vote: I do not like it

This is wittily(no)

»
2 years ago, # |
  Vote: I like it -11 Vote: I do not like it

OHHH!!! I get it :D . It took me a while. I thought you gave a wrong link.

»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

And if you want to understand memoization click the link once and close the tab :D

  • »
    »
    2 years ago, # ^ |
      Vote: I like it -6 Vote: I do not like it

    No, This is not a DAG. Memorization isn't possible.

»
2 years ago, # |
Rev. 2   Vote: I like it -16 Vote: I do not like it

sorry

»
3 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

Actually this trick is used when you search recursion in google.

»
3 weeks ago, # |
  Vote: I like it -32 Vote: I do not like it

LooOooOooOoooL. That's not recursion. Recursion requires the problem to become smaller each time.