Problem Statement We need to write a program, that accepts a positive integer value from the user and print all the possible divisors of that number (excluding the number itself). For example Input: 100 Output : 1 2 4 5 10 25 50 Algorithm The problem statement is quite straightforward and beginner-level. To solve this problem all we… Read More »
This code checks whether the entered number is a palindrome or not. A palindrome number is a unique number which reverse is equal to it. For example, 11, 111, 121, 131… are palindrome numbers.
In this program, we will code to find the number is prime or not. A number is said to be a prime number if it has only 2 divisors 1 and the number itself.
Here we have provided two programs that calculate the simple interest when the user provides the principal, rate, and time. so let’s write a Program to Calculate Simple Interest. To calculate the simple interest, we have used this formula:
In this program, we will code to display the Fibonacci series up to number n. A Fibonacci series is a sequence starts from 0 and the next number is the sum of the previous number and the current one. For example, 0,1, 1, 2, 3, 5, 8……. Is a Fibonacci series. C++ #include<iostream.h> #include< conio.h> #include<stdio.h> #include<math.h> void… Read More »