# Find kth smallest number in range [1, n] when all the odd numbers are deleted

Given two integers **n** and **k**, the task is to find the **k ^{th}** smallest element from the range

**[1, n]**after deleting all the odd numbers from the range.

**Examples:**

Input:n = 8, k = 3

Output:6

After deleting all the odd numbers from the range [1, 8]

2, 4, 6 and 8 are the only numbers left and 6 is the 3^{rd}smallest.

Input:n = 8, k = 4

Output:

**Approach:** Since all odd numbers are removed so now only even numbers are left i.e. **2, 4, 6, 8, …..**

Now, the **k ^{th}** smallest element will always be

**2 * k**.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to return the kth smallest ` `// element from the range [1, n] after ` `// removing all the odd elements ` `int` `kthSmallest(` `int` `n, ` `int` `k) ` `{ ` ` ` `return` `(2 * k); ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `n = 8, k = 4; ` ` ` `cout << kthSmallest(n, k); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation of the approach ` `class` `GFG { ` ` ` ` ` `// Function to return the kth smallest ` ` ` `// element from the range [1, n] after ` ` ` `// removing all the odd elements ` ` ` `static` `int` `kthSmallest(` `int` `n, ` `int` `k) ` ` ` `{ ` ` ` `return` `(` `2` `* k); ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `main(String args[]) ` ` ` `{ ` ` ` `int` `n = ` `8` `, k = ` `4` `; ` ` ` `System.out.print(kthSmallest(n, k)); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of the approach ` ` ` `# Function to return the kth smallest ` `# element from the range [1, n] after ` `# removing all the odd elements ` `def` `kthSmallest(n, k): ` ` ` `return` `2` `*` `k ` ` ` `# Driver code ` `n ` `=` `8` `; k ` `=` `4` `print` `(kthSmallest(n, k)) ` ` ` `# This code is contributed ` `# by Shrikant13 ` |

*chevron_right*

*filter_none*

## C#

`// C# implementation of the approach ` `using` `System; ` `class` `GFG { ` ` ` ` ` `// Function to return the kth smallest ` ` ` `// element from the range [1, n] after ` ` ` `// removing all the odd elements ` ` ` `static` `int` `kthSmallest(` `int` `n, ` `int` `k) ` ` ` `{ ` ` ` `return` `(2 * k); ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` `int` `n = 8, k = 4; ` ` ` `Console.WriteLine(kthSmallest(n, k)); ` ` ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

## PHP

**Output:**

8

**Time Complexity:** O(1)

## Recommended Posts:

- Find the number of divisors of all numbers in the range [1, n]
- Program to find count of numbers having odd number of divisors in given range
- Count all the numbers in a range with smallest factor as K
- Find the smallest twins in given range
- Find XOR of numbers from the range [L, R]
- Smallest number divisible by first n numbers
- Find numbers with n-divisors in a given range
- Find numbers with K odd divisors in a given range
- Arrange given numbers to form the smallest number
- Smallest n digit number divisible by given three numbers
- Find a range of composite numbers of given length
- Numbers that are not divisible by any number in the range [2, 10]
- Find the highest occurring digit in prime numbers in a range
- Count of Numbers in Range where the number does not contain more than K non zero digits
- Find the smallest number whose digits multiply to a given number n

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.