# Number of ways to choose a pair containing an even and an odd number from 1 to N

Given a number N, the task is to find the number of pairs containing an even and an odd number from numbers between 1 and N inclusive.

**Note:**Order of numbers in the pair does not matter that is (1, 2) and (2, 1) are the same.

**Examples**:

Input: N = 3 Output: 2 The pairs are (1, 2) and (2, 3). Input: N = 6 Output: 9 The pairs are (1, 2), (1, 4), (1, 6), (2, 3), (2, 5), (3, 4), (3, 6), (4, 5), (5, 6).

**Approach:** Number of ways to form the pairs is **(Total number of Even numbers*Total number of Odd numbers)**.

Thus

- if N is even number of even numbers = number of odd numbers = N/2
- if N is odd number of even numbers = N/2 and number of odd numbers = N/2+1

Below is the implementation of the above approach:

## C++

`// C++ implementation of the above approach ` `#include <iostream> ` `using` `namespace` `std; ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `N = 6; ` ` ` ` ` `int` `Even = N / 2 ; ` ` ` ` ` `int` `Odd = N - Even ; ` ` ` ` ` `cout << Even * Odd ; ` ` ` ` ` `return` `0; ` ` ` `// This code is contributed ` ` ` `// by ANKITRAI1 ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation of the above approach ` `import` `java.util.*; ` `import` `java.lang.*; ` `import` `java.io.*; ` `class` `GFG{ ` ` ` `// Driver code ` `public` `static` `void` `main(String args[]) ` `{ ` ` ` `int` `N = ` `6` `; ` ` ` ` ` `int` `Even = N / ` `2` `; ` ` ` ` ` `int` `Odd = N - Even ; ` ` ` ` ` `System.out.println( Even * Odd ); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python implementation of the above approach ` `N ` `=` `6` ` ` ` ` `# number of even numbers ` `Even ` `=` `N` `/` `/` `2` ` ` `# number of odd numbers ` `Odd ` `=` `N` `-` `Even ` `print` `(Even ` `*` `Odd) ` |

*chevron_right*

*filter_none*

## C#

`// C# implementation of the ` `// above approach ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `N = 6; ` ` ` ` ` `int` `Even = N / 2 ; ` ` ` ` ` `int` `Odd = N - Even ; ` ` ` ` ` `Console.WriteLine(Even * Odd); ` `} ` `} ` ` ` `// This code is contributed ` `// by Akanksha Rai(Abby_akku) ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP implementation of the ` `// above approach ` ` ` `// Driver code ` `$N` `= 6; ` ` ` `$Even` `= ` `$N` `/ 2 ; ` ` ` `$Odd` `= ` `$N` `- ` `$Even` `; ` ` ` `echo` `$Even` `* ` `$Odd` `; ` ` ` `// This code is contributed ` `// by ChitraNayal ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

9

GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

## Recommended Posts:

- Number of ways to split a binary number such that every part is divisible by 2
- Number of distinct ways to represent a number as sum of K unique primes
- Find the number of ways to divide number into four parts such that a = c and b = d
- Count number of ways to divide a number in 4 parts
- Ways to choose balls such that at least one ball is chosen
- Number of ways to get a given sum with n number of m-faced dices
- Number of indices pair such that element pair sum from first Array is greater than second Array
- Number of triplets such that each value is less than N and each pair sum is a multiple of K
- Count number of ways to get Odd Sum
- Greatest number that can be formed from a pair in a given Array
- Number of ways of writing N as a sum of 4 squares
- Total number of ways to place X and Y at n places such that no two X are together
- Ways to express a number as product of two different factors
- Bell Numbers (Number of ways to Partition a Set)
- Count ways to express a number as sum of exactly two numbers

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.