Project Euler Forum

I was wondering if there is any known mistake in this problem.

My recursive code seems to work for cases described in the problem. For example it generates 1105 for all hamming numbers of type 5 not exceeding 10^8.

I am getting answer snip! which the site seems to be rejecting. I will check again if I have any missed any enumeration step.

Here is my C code

snip !

I nrajsaxena;

your code gives the good result for genHam(24, 400000000)+1), but the wrong one for genHam(24, 500000000)+1)...

But maybe your code is too close to a good solution to stay on the forum !

I am afraid I had to snip parts of the first post, which could totally spoil the problem for others...

Remember: this is not a forum to display solutions or near-solutions and spoilers !

My apologies. I should have checked the rules before posting. I was wondering if there was a mistake. I figured out what my mistake was.