can any 1 give me a hint on how to approach this problem ?.
www.spoj.pl/problems/INUMBER
hav no idea how to even start ..
thank u
can any 1 give me a hint on how to approach this problem ?.
www.spoj.pl/problems/INUMBER
hav no idea how to even start ..
thank u
Break it up:For the given number n find the minimal positive integer divisable by n, with the sum of digits equal to n.
There's your starting point.For the given number n find the minimal positive integer divisable by n.
Do as I say, not as I do . . .
Experimentation is the essence of programming. Just remember to make a backup first.
"I'm a firm believer that <SomeGod> gave us two ears and one mouth for a reason - we are supposed to listen, twice as much as we talk." - LEAF
Questions posted by these guidelines are more likely to be answered.
Debian GNU/Linux user, with the awesome window manager, the git version control system, and the cmake buildsystem generator.
oh..hi..nice reply there... !!!!!! :-/
Was there a purpose to that response? Is it asking for elaboration?
I'm going to assume so.
I'm also going to assume that this is homework. Therefore, I'm not going to give you a solution to that problem, am I?
You asked for a starting point. I gave you a starting point. Do you need further clarification?
Start by solving the first section of the problem. "For the given number n find the minimal positive integer divisable by n."
If you need help with that, then ask for it. We don't do your work for you, we're here to help you on a specific problem that merits help.
Do as I say, not as I do . . .
Experimentation is the essence of programming. Just remember to make a backup first.
"I'm a firm believer that <SomeGod> gave us two ears and one mouth for a reason - we are supposed to listen, twice as much as we talk." - LEAF
Questions posted by these guidelines are more likely to be answered.
Debian GNU/Linux user, with the awesome window manager, the git version control system, and the cmake buildsystem generator.
