## C/C++ program for Armstrong Numbers

Given a number N, the task is to check whether the given number is Armstrong number or not. If the given number is Armstrong Number… Read More »

- Count rotations which are divisible by 10
- Find the Kth number which is not divisible by N
- Program to balance the given Chemical Equation
- Find the Nth Pure number
- Find any K distinct odd integers such that their sum is equal to N
- Represent N as sum of K even or K odd numbers with repetitions allowed
- Check if a given pair of Numbers are Betrothed numbers or not
- Minimum operations required to make two numbers equal
- Program to find absolute value of a given number
- Largest value of x such that ax
^{x}is N-digit number of base b - Represent N as sum of K even numbers
- Curzon Numbers
- Find N distinct integers with zero sum
- Represent N as sum of K odd numbers with repetitions allowed
- Minimize steps to reach K from 0 by adding 1 or doubling at each step
- Minimize the cost of selecting two numbers whose product is X
- Find two Fibonacci numbers whose sum can be represented as N
- Check if a number has prime count of divisors
- Check if a number ends with another number or not
- Count of Fibonacci pairs with sum N in range 0 to N
- Check whether a given number N is a Nude Number or not
- Count of numbers in Array ending with digits of number N
- Length of Longest Perfect number Subsequence in an Array
- Find all ranges of consecutive numbers from Array
- Find N distinct integers with sum N
- Count of possible permutations of a number represented as a sum of 2's, 4's and 6's only
- Modulus of a Complex Number
- Find Maximum and Minimum of two numbers using Absolute function
- Print a pair of numbers with the given Sum and Product
- Compositorial of a number

Given a number N, the task is to check whether the given number is Armstrong number or not. If the given number is Armstrong Number… Read More »

Given two numbers N and K, the task is to find the minimum value X such that N < X*K. Examples: Input: N = 8,… Read More »

Given an integer N, the task is to find all numbers up to N, which are both Pentagonal as well as Hexagonal. Example: Input: N… Read More »

Given four integers a, b, c, and d which represents two complex numbers of the form (a + bi) and (c + di), the task… Read More »

Binary Coded Decimal, or BCD, is another process for converting decimal numbers into their binary equivalents. It is a form of binary encoding where each… Read More »

The Pentanacci series is a generalization of the Fibonacci sequence where each term is the sum of the five preceding terms. The first few Pentanacci… Read More »

Given an array arr[] and an integer S, the task is to choose maximum count of numbers from the array such that sum of numbers… Read More »

Given a natural number N, the task is to find the Nth compositorial number. Compositorial of a number refers to the product of all the… Read More »

Given a positive integer K, the task is to find the minimum number of operations of the following two types, required to change 0 to… Read More »

Given two integer N and K, the task is to find an array of size K containing only even or odd elements where the sum… Read More »

Given an integer N, the task is to check whether N is a Nude number or not. A Nude number is a number that is… Read More »

Given an integer N, the task is to find out the number of permutations in which N can be represented as a sum of 2s,… Read More »

Given a number N and an array arr[] consisting of K numbers, the task is to find the count of numbers in the array which… Read More »

Given two numbers A and B where (A > B), the task is to check if B is a suffix of A or not. Print… Read More »

Given an integer N, the task is to find N distinct integers whose sum is N. If there is more than one combination of the… Read More »