Given an integer N. The task is to find the number of different ordered triplets(a, b, c) of non-negative integers such that a + b + c = N .
Input : N = 2
Output : 6
Triplets are : (0, 0, 2), (1, 0, 1), (0, 1, 1), (2, 0, 0), (0, 2, 0), (1, 1, 0)
Input : N = 50
Output : 1326
First, it is easy to see that for each non-negative integer N, the equation a + b = N can be satisfied by (N+1) different ordered pairs of (a, b). Now we can assign c values from 0 to N then the ordered pairs for a+b can be found. It will form a series of N+1 natural numbers and its sum will give the count of triplets.
Below is the implementation of the above approach :
Time Complexity : O(1)
- Count number of triplets with product equal to given number with duplicates allowed
- Count number of triplets (a, b, c) such that a^2 + b^2 = c^2 and 1 <= a <= b <= c <= n
- Count of Multiples of A ,B or C less than or equal to N
- Count numbers whose XOR with N is equal to OR with N
- Count pairs with set bits sum equal to K
- Count numbers whose difference with N is equal to XOR with N
- Count of quadruplets from range [L, R] having GCD equal to K
- Count pairs from two arrays having sum equal to K
- Count the number of subsequences of length k having equal LCM and HCF
- Count different numbers that can be generated such that there digits sum is equal to 'n'
- Count number of integers less than or equal to N which has exactly 9 divisors
- Count the numbers < N which have equal number of divisors as K
- Count pairs of natural numbers with GCD equal to given number
- Count the pairs in an array such that the difference between them and their indices is equal
- Find a number X such that (X XOR A) is minimum and the count of set bits in X and B are equal
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.