![]() |
please suggest me logic of the problem:
Q:-find the all possible combination of digits ranging 1 to 9 whose sum is 10, no digit should be repeated in any combination.
e.g: 1234 127 136 145 19 235 28 37 46 |
Re: please suggest me logic of the problem:
Hi,
May this s not an optimised/generalise solution ..But it produces the output as expected The code snippet is as under: Code:
#include<stdio.h> |
Re: please suggest me logic of the problem:
Quote:
|
| All times are GMT +5.5. The time now is 18:30. |