# Count the total number of triangles after Nth operation

Given an equilateral triangle, the task is to compute the total number of triangles after performing the following operation **N** times.

For every operation, the uncolored triangles are taken and divided into 4 equal equilateral triangles. Every inverted triangle formed is colored. Refer to the below figure for more details.

For **N=1** the triangle formed is:

For **N=2** the triangle formed is:

**Examples:**

Input :N = 10

Output :118097

Input :N = 2

Output :17

**Approach:**

At every operation, 3 uncolored triangles, 1 colored triangle and the triangle itself is formed On writing the above statement mathematically; count of triangles at Nth move = 3 * count of triangles at (N-1)th move + 2 Therefore, initializing a variable curr = 1andtri_count = 0Next, a loop is iterated from 1 to N For every iteration, the operation mentioned above is performed. Finally, the tri_count is returned

Below is the implementation of the above approach:

## C++

`#include <bits/stdc++.h> ` `using` `namespace` `std; ` `// function to return the ` `// total no.of Triangles ` `int` `CountTriangles(` `int` `n) ` `{ ` ` ` `int` `curr = 1; ` ` ` `int` `Tri_count = 0; ` ` ` `for` `(` `int` `i = 1; i <= n; i++) { ` ` ` `// For every subtriangle formed ` ` ` `// there are possibilities of ` ` ` `// generating (curr*3)+2 ` ` ` ` ` `Tri_count = (curr * 3) + 2; ` ` ` `// Changing the curr value to Tri_count ` ` ` `curr = Tri_count; ` ` ` `} ` ` ` `return` `Tri_count; ` `} ` ` ` `// driver code ` `int` `main() ` `{ ` ` ` `int` `n = 10; ` ` ` `cout << CountTriangles(n); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`class` `Gfg { ` ` ` `// Method to return the ` ` ` `// total no.of Triangles ` ` ` `public` `static` `int` `CountTriangles(` `int` `n) ` ` ` `{ ` ` ` `int` `curr = ` `1` `; ` ` ` `int` `Tri_count = ` `0` `; ` ` ` `for` `(` `int` `i = ` `1` `; i <= n; i++) { ` ` ` `// For every subtriangle formed ` ` ` `// there are possibilities of ` ` ` `// generating (curr*3)+2 ` ` ` ` ` `Tri_count = (curr * ` `3` `) + ` `2` `; ` ` ` `// Changing the curr value to Tri_count ` ` ` `curr = Tri_count; ` ` ` `} ` ` ` `return` `Tri_count; ` ` ` `} ` ` ` ` ` `// driver code ` ` ` `public` `static` `void` `main(String[] args) ` ` ` `{ ` ` ` `int` `n = ` `10` `; ` ` ` `System.out.println(CountTriangles(n)); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

## Python

`# Function to return the ` `# total no.of Triangles ` `def` `countTriangles(n): ` ` ` ` ` `curr ` `=` `1` ` ` `Tri_count ` `=` `0` ` ` `for` `i ` `in` `range` `(` `1` `, n ` `+` `1` `): ` ` ` ` ` `# For every subtriangle formed ` ` ` `# there are possibilities of ` ` ` `# generating (curr * 3)+2 ` ` ` `Tri_count ` `=` `(curr ` `*` `3` `) ` `+` `2` ` ` `# Changing the curr value to Tri_count ` ` ` `curr ` `=` `Tri_count ` ` ` `return` `Tri_count ` ` ` `n ` `=` `10` `print` `(countTriangles(n)) ` |

*chevron_right*

*filter_none*

## C#

`using` `System; ` ` ` `class` `Gfg ` `{ ` ` ` `// Method to return the ` ` ` `// total no.of Triangles ` ` ` `public` `static` `int` `CountTriangles(` `int` `n) ` ` ` `{ ` ` ` `int` `curr = 1; ` ` ` `int` `Tri_count = 0; ` ` ` `for` `(` `int` `i = 1; i <= n; i++) ` ` ` `{ ` ` ` `// For every subtriangle formed ` ` ` `// there are possibilities of ` ` ` `// generating (curr*3)+2 ` ` ` `Tri_count = (curr * 3) + 2; ` ` ` ` ` `// Changing the curr value to Tri_count ` ` ` `curr = Tri_count; ` ` ` `} ` ` ` `return` `Tri_count; ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main(String[] args) ` ` ` `{ ` ` ` `int` `n = 10; ` ` ` `Console.WriteLine(CountTriangles(n)); ` ` ` `} ` `} ` ` ` `// This code is contributed by 29AjayKumar ` |

*chevron_right*

*filter_none*

**Output:**

118097

## Recommended Posts:

- Count of triangles with total n points with m collinear
- Total number of triangles formed when there are H horizontal and V vertical lines
- Count the number of possible triangles
- Count number of unique Triangles using STL | Set 1 (Using set)
- Count number of right triangles possible with a given perimeter
- Count total number of digits from 1 to n
- Count total number of even sum sequences
- Count total number of N digit numbers such that the difference between sum of even and odd digits is 1
- Count the total number of squares that can be visited by Bishop in one move
- Count total set bits in all numbers from 1 to n | Set 2
- Count total divisors of A or B in a given range
- Number of triangles after N moves
- Number of triangles that can be formed
- Count total unset bits in all the numbers from 1 to N
- Count pairs from two arrays whose modulo operation yields K

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.