- For the second point you could try converting (a copy of) the number to a character array & test each digit individually.
- s < 1e19
- use modulus
Good luck, concentrate on doing one point at a time, not worrying about the limitations, then optimise.
long time no C; //seige
You miss 100% of the people you don't C;
Code:if (language != LANG_C && language != LANG_CPP) drown(language);
Wow, that homework is so easy, and you have a whole second to do it in...
So like, do you not understand the problem? Or are you having a problem with your code?
Basically its asking you to return some number OUTPUT (aka S) of which INPUT (aka N) is a factor, and S has to contain only the decimal digits 7 2 and 0.
I see two obvious ways to attack this problem. Either test successive multiples of n until you find one with the right digits, or recursively generate all acceptable combinations of the allowed digits until you find one with a zero remainder.
Either way, you'd need a 64-bit data type to do it since the problem description allows up to 20 digits.
Well, that's just off the top of my head anyway.
The best way to solve it is to try. Don't try and pretend, after being reminded of the homework policy, that it isn't homework. So many people do this that we get enough practice to see right through it every time.
Last edited by iMalc; 02-21-2009 at 06:04 PM.
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
