# Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.

Given a number N. Find the count of such numbers that can be formed using digits 3 and 4 only and having length at max N.

**Examples:**

Input :N = 2Output :6Explanation :3, 4, 33, 34, 43, 44 are numbers having length 2 and digits 3 and 4 only.Input :N = 1Output :2Explanation :3, 4 are the only such numbers.

**Approach **: There are 2 numbers of length 1. They are 3 and 4. There are 4 numbers of length 2. They are 33, 34, 43 and 44. There are 8 such numbers of length 3. They are 333, 334, 343, 344, 433, 434, 443, 444. For each addition of 1 to the length, the number of numbers is increased times 2.

It is easy to prove: to any number of the previous length one can append 3 or 4, so one number of the previous length creates two numbers of the next length.

So for the length N the amount of such numbers of the length exactly N is 2*N. But in the problem, we need the number of numbers of length not greater than N. Let’s sum up them. 2^{1} = 2, 2^{1} + 2^{2} = 2 + 4 = 6, 2^{1} + 2^{2} + 2^{3} = 2 + 4 + 8 = 14, 2^{1} + 2^{2} + 2^{3} + 2^{4} = 2 + 4 + 8 + 16 = 30.

One can notice that the sum of all previous powers of two is equal to the next power of two minus the first power of two. So the answer to the problem is 2^{N+1} – 2.

Below is the implementation of the above approach :

## C++

`// Cpp program to find the count of numbers that ` `// can be formed using digits 3, 4 only and ` `// having length at max N. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find the count of numbers that ` `// can be formed using digits 3, 4 only and ` `// having length at max N. ` `long` `long` `numbers(` `int` `n) ` `{ ` ` ` `return` `(` `long` `long` `)(` `pow` `(2, n + 1)) - 2; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `n = 2; ` ` ` ` ` `cout << numbers(n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find the count of numbers that ` `// can be formed using digits 3, 4 only and ` `// having length at max N. ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find the count of numbers that ` `// can be formed using digits 3, 4 only and ` `// having length at max N. ` `static` `long` `numbers(` `int` `n) ` `{ ` ` ` `return` `(` `long` `)(Math.pow(` `2` `, n + ` `1` `)) - ` `2` `; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String args[]) ` `{ ` ` ` `int` `n = ` `2` `; ` ` ` ` ` `System.out.println( numbers(n)); ` `} ` `} ` ` ` `// This code is contributed by Arnab Kundu ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to find the count of ` `# numbers that can be formed using digits ` `# 3, 4 only and having length at max N. ` ` ` `# Function to find the count of numbers ` `# that can be formed using digits 3, 4 ` `# only and having length at max N. ` `def` `numbers(n): ` ` ` `return` `pow` `(` `2` `, n ` `+` `1` `) ` `-` `2` ` ` `# Driver code ` `n ` `=` `2` `print` `(numbers(n)) ` ` ` `# This code is contributed ` `# by Shrikant13 ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find the count of numbers that ` `// can be formed using digits 3, 4 only and ` `// having length at max N. ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find the count of numbers that ` `// can be formed using digits 3, 4 only and ` `// having length at max N. ` `static` `long` `numbers(` `int` `n) ` `{ ` ` ` `return` `(` `long` `)(Math.Pow(2, n + 1)) - 2; ` `} ` ` ` `// Driver code ` `static` `void` `Main() ` `{ ` ` ` `int` `n = 2; ` ` ` ` ` `Console.WriteLine( numbers(n)); ` `} ` `} ` ` ` `// This code is contributed by mits ` |

*chevron_right*

*filter_none*

## PHP

**Output:**

6

## Recommended Posts:

- Count numbers formed by given two digit with sum having given digits
- Sum of all numbers that can be formed with permutations of n digits
- Count of alphabets whose ASCII values can be formed with the digits of N
- Minimum sum of two numbers formed from digits of an array
- Minimum sum of two numbers formed from digits of an array
- N digit numbers divisible by 5 formed from the M digits
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
- Find all strings formed from characters mapped to digits of a number
- Find the Largest Cube formed by Deleting minimum Digits from a number
- Count numbers with same first and last digits
- Find the numbers of strings that can be formed after processing Q queries
- Find if a molecule can be formed from 3 atoms using their valence numbers
- Count of numbers from range [L, R] whose sum of digits is Y
- Count of n digit numbers whose sum of digits equals to given sum

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.