# Count non-negative triplets with sum equal to N

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 **.

**Examples:**

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

**Approach :**

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 :

## C++

`// CPP program to find triplets count ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find triplets count ` `int` `triplets(` `int` `N) ` `{ ` ` ` `// Sum of first n+1 natural numbers ` ` ` `return` `((N + 1) * (N + 2)) / 2; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `N = 50; ` ` ` ` ` `// Function call ` ` ` `cout << triplets(N); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find triplets count ` `class` `GFG ` `{ ` ` ` `// Function to find triplets count ` `static` `int` `triplets(` `int` `N) ` `{ ` ` ` `// Sum of first n+1 natural numbers ` ` ` `return` `((N + ` `1` `) * (N + ` `2` `)) / ` `2` `; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `N = ` `50` `; ` ` ` ` ` `System.out.println(triplets(N)); ` `} ` `} ` ` ` `// This code is contributed ` `// by PrinciRaj1992 ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to find triplets count ` ` ` `# Function to find triplets count ` `def` `triplets(N): ` ` ` ` ` `# Sum of first n+1 natural numbers ` ` ` `return` `((N ` `+` `1` `) ` `*` `(N ` `+` `2` `)) ` `/` `/` `2` `; ` ` ` `# Driver code ` `N ` `=` `50` `; ` ` ` `# Function call ` `print` `(triplets(N)) ` ` ` `# This code is contributed by nidhi ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find triplets count ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find triplets count ` `static` `int` `triplets(` `int` `N) ` `{ ` ` ` `// Sum of first n+1 natural numbers ` ` ` `return` `((N + 1) * (N + 2)) / 2; ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `N = 50; ` ` ` ` ` `Console.WriteLine(triplets(N)); ` `} ` `} ` ` ` `// This code is contributed ` `// by anuj_67.. ` |

*chevron_right*

*filter_none*

**Output:**

1326

**Time Complexity :** O(1)

## Recommended Posts:

- 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 of quadruplets from range [L, R] having GCD equal to K
- Count pairs from two arrays having sum equal to K
- Count pairs with set bits sum equal to K
- Count numbers whose difference with N is equal to XOR with N
- 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 number of subsequences of length k having equal LCM and HCF
- 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 contribute@geeksforgeeks.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.