Here's the problem : [problem:227C] ↵
↵
In the editorial here: http://codeforces.me/blog/entry/5378?locale=en We ended up having Fn(n) = 3*(F(n-1) + 1) — 1↵
Could somebody please elaborate on how to get we got ((3^n) — 1) from the recurrence? Sorry if this is a newbie question I'm trying to learn more on the topic.
↵
In the editorial here: http://codeforces.me/blog/entry/5378?locale=en We ended up having F
Could somebody please elaborate on how to get we got ((3^n) — 1) from the recurrence? Sorry if this is a newbie question I'm trying to learn more on the topic.
