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 108 of 597
Count pairs with Bitwise AND as ODD number in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the AND operation on the pairs will result in an odd number.The truth table for AND operation is given belowABA^B000100010111Input − int arr[] = {2, 5, 1, 8, 9}Output − Count of pairs with Bitwise AND as ODD number are − 3Explanation −a1a2a1^a2250210280290511580591180191898Approach used in the below program is as followsInput an array of integer elements to form an pairCalculate the size of an array pass the data to the function for ...
Read MoreMaximum of sum and product of digits until number is reduced to a single digit in C++
In this tutorial, we will be discussing a program to find maximum of sum and product of digits until number is reduced to a single digitFor this we will be provided with a random number. Our task is to find and print out the maximum of sum and product of the digits of the given number until it coverts to a single digitExample#include using namespace std; //converting number to single digit by adding long repeatedSum(long n) { if (n == 0) return 0; return (n % 9 == 0) ? 9 : (n % 9); ...
Read MoreCount pairs with Bitwise-AND as even number in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the AND operation on the pairs will result in an even number.The truth table for AND operation is given belowABA^B000100010111Input − int arr[] = {2, 5, 1, 8, 9}Output − Count of pairs with Bitwise AND as EVEN number are − 7Explanation −a1a2a1^a2250210280290511580591180191898Approach used in the below program is as followsInput an array of integer elements to form an pairCalculate the size of an array pass the data to the function for ...
Read MoreMaximum parent children sum in Binary tree in C++
In this tutorial, we will be discussing a program to find maximum parent children sum in Binary treeFor this we will be provided with a binary tree. Our task is to add up the parent node with its children nodes and finally find the maximum of all of that and print it out.Example#include using namespace std; struct Node { int data; struct Node *left, *right; }; //inserting nodes struct Node* newNode(int n) { struct Node* root = new Node(); root->data = n; root->left = root->right = NULL; return root; } int maxSum(struct Node* ...
Read MoreCount pairs with Bitwise OR as Even number in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the OR operation on the pairs will result in an even number.The truth table for OR operation is given belowABAVB000101011111Input − int arr[] = {2, 5, 1, 8, 9}Output − Count of pairs with Bitwise OR as EVEN number are − 2Explanation −a1a2a1Va225721328102911515581359131891910899Approach used in the below program is as followsInput an array of integer elements to form an pairCalculate the size of an array pass the data to the function for ...
Read MoreMaximum path sum for each position with jumps under divisibility condition in C++
In this tutorial, we will be discussing a program to find maximum path sum for each position with jumps under divisibility conditionFor this we will be provided with an array of n random integers. Our task is to jump from one position to another if it divides it and finally provide the maximum sum path for every given position.Example#include using namespace std; //finding maximum sum path void printMaxSum(int arr[], int n) { int dp[n]; memset(dp, 0, sizeof dp); for (int i = 0; i < n; i++) { dp[i] = arr[i]; ...
Read MoreCount pairs with bitwise OR less than Max in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the OR operation on the pairs will result in the value less than MAX value in the given pair.The truth table for OR operation is given belowABAVB000101011111Input − int arr[] = {2, 5, 1, 8, 9}Output − Count of pairs with bitwise OR less than Max are − 3Explanation −XYX V Y257>5=FALSE213>2=FALSE2810>8=FALSE2911>9=FALSE515=5 TRUE5813>8=FALSE5913>9=FALSE189>8=FALSE1910>9=FALSE899=9= TRUEApproach used in the below program is as followsInput an array of integer elements to form an pairCalculate the ...
Read MoreCount pairs with Bitwise XOR as EVEN number in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the XOR operation on the pairs will result in an EVEN value.The truth table for XOR operation is given belowABA XOR B000101011110Input − int arr[] = {2, 8, 1, 5, 11}Output − Count of pairs with Bitwise XOR as EVEN number are − 4Explanation −a1a2a1 XOR a228102132572119819851381131541111051114Approach used in the below program is as followsInput an array of integer elements to form an pairCalculate the size of an array pass the data ...
Read MoreCount pairs with Bitwise XOR as ODD number in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the XOR operation on the pairs will result in an ODD value.The truth table for XOR operation is given belowABA XOR B000101011110Input − int arr[] = {2, 8, 1, 5, 11}Output − Count of pairs with Bitwise XOR as ODD number are − 6ExplanationExplanation −a1a2a1 XOR a228102132572119819851381131541111051114Approach used in the below program is as followsInput an array of integer elements to form an pairCalculate the size of an array pass the data ...
Read MoreCount pairs with given sum in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the sum of the pairs is equal to the given sum.Input − int arr[] = {2, 8, 1, 5, 11}, sum = 10Output − Count of pairs with given sum 13 is − 2Explanation −a1a2a1 + a22810213257211138198513811191561111251116Input − int arr[] = {2, 8, -1, 5, -11}, sum = 6Output − Count of pairs with given sum 6 is − 1Explanation −a1a2a1 + a228102-112572-11-98-1785138-11-31561-11-105-11-6Approach used in the below program is as followsInput an ...
Read More