Search This Blog
HackerRank Solutions provides solutions to all problems like Algorithms, Data Structures, C, C++, Python, Java, Interview Preparation Kit in Hackerrank
Featured
- Get link
- X
- Other Apps
Calculate the Nth term in C Hackerrank Solution
Objective
This challenge will help you learn the concept of recursion.
A function that calls itself is known as a recursive function. The C programming language supports recursion. But while using recursion, one needs to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
To prevent infinite recursion,if…else statement (or similar approach) can be used where one branch makes the recursive call and other doesn’t.
void recurse() { ..... recurse() //recursive call ..... } int main() { ..... recurse(); //function call ..... }
Task
There is a series, , where the next term is the sum of pervious three terms. Given the first three terms of the series, , , and respectively, you have to output the nth term of the series using recursion.
Recursive method for calculating nth term is given below.
Input Format
- The first line contains a single integer, .
- The next line contains 3 space-separated integers, , , and .
Constraints
Output Format
Print the nth term of the series, S(n) .
Sample Input 0
5 1 2 3
Sample Output 0
11
Explanation 0
Consider the following steps:
Code
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
//Complete the following function.
int find_nth_term(int n, int a, int b, int c) {
//Write your code here.
int i,arr[100];
arr[1]=a;
arr[2]=b;
arr[3]=c;
for(i=4;i<=n;i++)
{
arr[i]=arr[i-1]+arr[i-2]+arr[i-3];
}
return arr[n];
}
int main() {
int n, a, b, c;
scanf("%d %d %d %d", &n, &a, &b, &c);
int ans = find_nth_term(n, a, b, c);
printf("%d", ans);
return 0;
}
- Get link
- X
- Other Apps
Popular Posts
say hello world with C++ - Solution in Hacker Rank - hackerranksolutions8
- Get link
- X
- Other Apps
Comments
Post a Comment