This is the solution to the program in Hackerrank. This program can be found in the Algorithm Domain. Basically the Utopian Tree goes through 2 cycles of growth every year. The first growth cycle occurs during the spring, when it doubles in height. The second growth cycle occurs during the summer, when its height increases by 1 meter.
int t, n, a;
for(int i=1; i<=n; i++)
Found bugs, report them !
Latest posts by Bikash Panda (see all)
- Automatic project structure/git creation in Windows - January 27, 2019
- ESP32 LoRaWAN Node using Arduino - December 31, 2018
- Wi-FI Remote for MI TV using ESP8266 - November 15, 2018