It's not absolutey necessary, but you could use the modulus command (in other languages its the operator %).
the modulus finds the remainder when you divide two numbers. so...
100 mod 25 = 0
because 25 fits into 100 evenly, and there is no remainder
101 mod 25 = 1
because 25 fits into 100 evenly, and then there is 1 left over.
124 mod 25 = 24
because 25 fits into 100 evenly, and then there are 24 left over.
125 mod 25 = 0
because 25 fits into 125 evenly!
So...
cents=1023
Heres some code
input "Dollars: ",dollars$
cents#=val(dollars$)*100.0
cents=int(cents#)
total_dollars=int(cents*1.0/100.0)
cents=cents mod 100
total_quarters=int(cents/25.0)
cents=cents mod 25
total_dimes=int(cents/10.0)
cents=cents mod 10
total_nickels=int(cents/5.0)
cents=cents mod 5
total_pennies=cents
print str$(total_dollars)+" Dollars, "
print str$(total_quarters)+" quarters, "
print str$(total_dimes)+" dimes, "
print str$(total_nickels)+" nickels, "
print str$(total_pennies)+" pennies."
wait 10000