Counting odd numbers of an integer

> I think I know the logic to break the integer down

> (7numbers lets say) but the way I've got going seems

> a bit long winded, I think there's got to be an easier

> way but don't know it. thanks.

You don't have to break the integer down. Just check if the whole integer is odd because then you know the rightmost digit must be odd and you increment a counter. To get rid of the just checked rightmost digit divide the integer with 10. You now repeat the above in a loop until the integer is 0 and thus contains no more digits. Then the counter will contain the number of odd digits.

UlrikaJ at 2007-7-6 20:35:27 >