Find minimum possible values of A, B and C when two of the (A + B), (A + C) and (B + C) are given
Given two integers X and Y. X and Y represent any two values among (A + B), (A + C) and (B + C). The… Read More »
Given two integers X and Y. X and Y represent any two values among (A + B), (A + C) and (B + C). The… Read More »
Prerequisite: Switch Case in C/C++ Problem Statement: Write a menu-driven program using the Switch case to convert the CGS system to MKS system and vice… Read More »
Given two integer N and R, the task is to calculate the number of ways to distribute N identical objects into R distinct groups such… Read More »
Given two integers N and R, the task is to calculate the number of ways to distribute N identical objects into R distinct groups. Examples:… Read More »
Given an integer N and the sum of its divisors. The task is to find the sum of the inverse of the divisors of N.… Read More »
Given two integers L and R denoting a range [L, R]. The task is to find the total count of numbers in the given range… Read More »
Given two integers N and K. Find the numbers of triplets (a, b, c) such that 0 ≤ a, b, c ≤ N and (a… Read More »
Given an array p[] of odd length N where p[i] denotes the probability of getting a head on the ith coin. As the coins are… Read More »
Given two integers A and B. The task is to check whether it is possible to convert A into B by performing below operations any… Read More »
Given an integer N, the task is to find the MDAS factorial. The general factorial of a no. N is given by : Factorial(N) =… Read More »
Given an integer N, the task is to find the total number of composite factors of N. Composite factors of a number are the factors… Read More »
Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More »
Given two integer N and K, the task is to find the sum of all the numbers from the range [1, N] excluding those which… Read More »
There are infinite people standing in a row, indexed from 1. A person having index i has strength of i2. You have strength P and… Read More »
Given a positive integer n, the task is to generate all possible unique ways to represent n as sum of positive integers. Examples: Input: 4… Read More »