to parse a number using modulus and division
would you do this
for example ( number = 12345 )
the digits are integers so the decimals get truncatedCode:digit1 = ( number % 10 ) /1; /*5*/ digit2 = ( number % 100 ) / 10; /*4*/ digit3 = ( number % 1000 ) / 100; /*3*/ digit4 = ( number % 10000 ) / 1000; /*2*/ digit5 = ( number % 100000 ) / 10000; /*1*/
is there way another to parse the number using modulus and division