# Find N integers with given difference between product and sum

Given two integers N and D, Find a set of N integers such that difference between their product and sum is equal to D.

Examples :

Input : N = 2, D = 1 Output : 2 3 Explanation: product = 2*3 = 6, Sum = 2 + 3 = 5. Hence, 6 - 5 = 1(D). Input : N = 3, D = 5. Output : 1 2 8 Explanation : Product = 1*2*8 = 16 Sum = 1+2+8 = 11. Hence, 16-11 = 5(D).

A tricky solution is to keep the difference D to choose N numbers as N-2 ‘1’s, one ‘2’ and one remaining number as ‘N+D’.

Sum = (N-2)*(1) + 2 + (N+D) = 2*N + D.

Product = 1*2*(N+D) = 2*N+2*D

Difference = (2*N+2*D) – (2*N+D) = D.

## C++

`// CPP code to generate numbers ` `// with difference between ` `// product and sum is D ` `#include <iostream> ` `using` `namespace` `std; ` ` ` `// Function to implement calculation ` `void` `findNumbers(` `int` `n, ` `int` `d) ` `{ ` ` ` `for` `(` `int` `i = 0; i < n - 2; i++) ` ` ` `cout << ` `"1"` `<< ` `" "` `; ` ` ` ` ` `cout << ` `"2"` `<< ` `" "` `; ` ` ` `cout << n + d << endl; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `N = 3, D = 5; ` ` ` `findNumbers(N, D); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java code to generate numbers ` `// with difference between ` `// product and sum is D ` `import` `java.io.*; ` ` ` `class` `GFG { ` ` ` ` ` `// Function to implement calculation ` ` ` `static` `void` `findNumbers(` `int` `n, ` `int` `d) ` ` ` `{ ` ` ` `for` `(` `int` `i = ` `0` `; i < n - ` `2` `; i++) ` ` ` `System.out.print(` `"1"` `+ ` `" "` `); ` ` ` ` ` `System.out.print(` `"2"` `+ ` `" "` `); ` ` ` `System.out.println(n + d); ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `main(String args[]) ` ` ` `{ ` ` ` `int` `N = ` `3` `, D = ` `5` `; ` ` ` `findNumbers(N, D); ` ` ` `} ` `} ` ` ` `/* This code is contributed by Nikita Tiwari.*/` |

*chevron_right*

*filter_none*

## Python3

`# Python3 code to generate numbers with ` `# difference between product and sum is D ` ` ` `# Function to implement calculation ` `def` `pattern(n, d) : ` ` ` ` ` `for` `i ` `in` `range` `(` `0` `, n ` `-` `2` `) : ` ` ` `print` `(` `"1"` `, end` `=` `" "` `) ` ` ` ` ` `print` `(` `"2"` `, end` `=` `" "` `) ` ` ` `print` `(n ` `+` `d) ` ` ` `# Driver code ` `N ` `=` `3` `D ` `=` `5` `pattern(N, D) ` ` ` ` ` `# This code is contributed by 'Akanshgupta' ` |

*chevron_right*

*filter_none*

## C#

`// C# code to generate numbers ` `// with difference between ` `// product and sum is D ` `using` `System; ` ` ` `class` `GFG { ` ` ` ` ` `// Function to implement calculation ` ` ` `static` `void` `findNumbers(` `int` `n, ` `int` `d) ` ` ` `{ ` ` ` `for` `(` `int` `i = 0; i < n - 2; i++) ` ` ` `Console.Write(` `"1"` `+ ` `" "` `); ` ` ` ` ` `Console.Write(` `"2"` `+ ` `" "` `); ` ` ` `Console.Write(n + d); ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` `int` `N = 3, D = 5; ` ` ` `findNumbers(N, D); ` ` ` `} ` `} ` ` ` `/* This code is contributed by vt_m.*/` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP code to generate numbers ` `// with difference between ` `// product and sum is D ` ` ` `// Function to implement ` `// calculation ` `function` `findNumbers(` `$n` `, ` `$d` `) ` `{ ` ` ` `for` `(` `$i` `= 0; ` `$i` `< ` `$n` `- 2; ` `$i` `++) ` ` ` `echo` `"1"` `,` `" "` `; ` ` ` ` ` `echo` `"2"` `, ` `" "` `; ` ` ` `echo` `$n` `+ ` `$d` `,` `"\n"` `; ` `} ` ` ` ` ` `// Driver Code ` ` ` `$N` `= 3; ` ` ` `$D` `= 5; ` ` ` `findNumbers(` `$N` `, ` `$D` `); ` ` ` `// This code is contributed by ajit ` `?> ` |

*chevron_right*

*filter_none*

Output :

1 2 8

## Recommended Posts:

- Find a pair with maximum product in array of Integers
- Find an index such that difference between product of elements before and after it is minimum
- Maximum GCD of N integers with given product
- Check whether product of integers from a to b is positive , negative or zero
- Counting numbers whose difference from reverse is a product of k
- Absolute difference between sum and product of roots of a quartic equation
- Find two integers A and B such that A ^ N = A + N and B ^ N = B + N
- Find the prime P using given four integers
- Find three integers less than or equal to N such that their LCM is maximum
- Find the number of integers from 1 to n which contains digits 0's and 1's only
- Find the first N integers such that the sum of their digits is equal to 10
- Find n positive integers that satisfy the given equations
- Find the integers that doesnot ends with T1 or T2 when squared and added X
- Find a Symmetric matrix of order N that contain integers from 0 to N-1 and main diagonal should contain only 0's
- Find integers that divides maximum number of elements of the array

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.