Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
C++ Articles
Page 57 of 597
Express an odd number as sum of prime numbers in C++
In this problem, we are given an odd number N. Our task is to express an odd number as the sum of prime numbers.There can be at max three prime numbers while expressing the number.Let’s take an example to understand the problem, Input: N = 55Output: 53 + 2Solution Approach: The odd number can be represented as a sum of primes. Taking these primes into consideration we have three cases.Case 1: If n is a prime number, it is represented as the sum of one prime number n.Case 2: If (n - 2) is a prime number, it is represented as the sum of two ...
Read MoreMaximum sum of increasing order elements from n arrays in C++ program
In this problem, we are given a 2-D matrix of size nXm. Our task is to create a program to find the maximum sum of increasing order elements from n arrays.Program Description − Here, we need to find the maximum sum of elements by taking one element from each row in such a way that the element from ith row is less than the element from (i+1)th row. And so on. If no such sum is possible, return −1 denoting no result possible.Let’s take an example to understand the problem, Inputmat[][] = { {4, 5, 1, 3, 6}, ...
Read MoreMaximum sum of nodes in Binary tree such that no two are adjacent using Dynamic Programming in C++ program
In this problem, we are given a Binary Tree with each node having a value. Our task is to create a program to find the Maximum sum of nodes in Binary tree such that no two are adjacent using Dynamic Programming.Problem Description − We will be choosing the subsets of the binary tree to make the sum maximum in such a way that the nodes are not connected directly.Let’s take an example to understand the problem, InputOutput24ExplanationElements to be taken under consideration are: 8 + 5 + 9 + 2 = 24Solution ApproachA solution to the problem is by using ...
Read MoreFast average of two numbers without division in C++
In this problem, we are given two numbers A and B. Our task is to create a program to calculate the Fast average of two numbers without division. Let’s take an example to understand the problem, Input: A = 34 B = 54Output: 44Solution Approach: Normally, the average is calculated by adding two numbers and then divide it by 2. This requires division but we need to find the average without using division. This can be done using right shift operator >> and shift the binary expansion instead of using division operator.Program to illustrate the working of our solution, Example#include ...
Read MoreMaximum sum of pairs with specific difference C++ program
In this problem, we are given an array arr[] of n integers and a number d. Our task is to create a program to find the maximum sum of pairs with specific difference in c++.Problem Description − We will find pairs in such a way that the difference of elements of pairs is less than d. The sum of all such pairs should be maximum.Let’s take an example to understand the problem, Inputarr[] = {5, 9, 11, 7, 2, 12, 3} d = 5Output47ExplanationPairs that contribute to maximum sum: (3, 5), (7, 9), (11, 12). Sum = 3 + 5 ...
Read MoreFast inverse square root in C++
In this problem, we are given an integers x. Our task is to calculate Fast inverse square root () of a 32-bit floating point number. The algorithm to find the inverse square root of the number is of great use in programming, such as vector normalization in video games, in 3D graphics, etc. Algorithm: Step 1: The algorithm converts the floating point value to integer. Step 2: Operate on the integer value and return approximate value of the inverse square root.Step 3: Convert the integer value back to floating point using the same method used in step 1.Step 4: The approximation is made for improving precision using ...
Read MoreMaximum sum of pairwise product in an array with negative allowed in C++ program
In this problem, we are given an array arr[] that contains n integers values (negative values allowed). Our task is to create a program to find the maximum sum of pairwise products in an array with negative allowed.Problem Description − We need to create pairs using the elements of the array such that the sum of the product of elements of pairs is maximum.Let’s take an example to understand the problem, Inputarr[] = {−5, 2, 3, 7, −1, 1, −3, 12}Output104ExplanationThe pairs to be considered: (−5, −3), (2, 3), (−1, 1), (7, 12) Sum of product = (−5 * −3) ...
Read MoreMaximum sum path in a matrix from top to bottom and back in C++ Program
In this problem, we are given a matrix mat[][] of size nXm. Our task is to create a program to find the maximum sum path in a matrix from top to bottom and back.Problem Description − We need to find the maximum path sum from topleft to bottom−right and then back.Valid movesFrom mat[0][0] to mat[n−1][m−1]: Right (mat[i][j] to mat[i][j+1]) and Down (mat[i][j] to mat[i+1][j]). From mat[n−1][m−1] to mat[0][0]: left (mat[i][j] to mat[i][j−1]) and up (mat[i][j] to mat[i−1][j]).One important thing is that both paths cannot be the same. There should be one or more elements different in both paths.Let’s take an ...
Read MoreFermat's little theorem in C++
Fermat’s little theorem −This theorem states that for any prime number p, Ap - p is a multiple of p.This statement in modular arithmetic is denoted as, ap ≡ a (mod p)If a is not divisible by p then, ap - 1 ≡ 1 (mod p)In this problem, we are given two numbers a and p. Our task is to verify fermat’s little theorem on these values.We need to check if ap ≡ a (mod p) or ap - 1 ≡ 1 (mod p)Holds true for the given values of a and p.Let’s take ...
Read MoreMaximum sum possible for a sub-sequence such that no two elements appear at a distance < K in the array in C++ program
In this problem, we are given an array arr[] of size n and an integer k. Our task is to create a program to find the maximum sum possible for a subsequence such that no two elements appear at a distance < K in the array.Problem Description − We need to find the maximum sum of sub−seqeunce that considers elements that are k distance from each other.Let’s take an example to understand the problem, Inputarr[] = {6, 2, 5, 1, 9, 11, 4} k = 2Output16ExplanationAll possible sub−sequences of elements that differ by k or more. {6, 1, 4}, sum ...
Read More