HW BEGGINER HELP !

**==**== **==**==


Write an application that prompts for and reads a double value representing a monetary amount.Then determine the fewest number of each bill and coin needed to represent that amount.Then determine the fewest number of each bill and coin needed to represent that amount,starting with the highest (assume that a ten dollar bill is the maximum size need).For example , if tbhe value entered is 47.63 (forty-seven dollars and sixty-three cents).then the program should print the equivalent amount as :

4 ten dollar bills
1 five dollar bills
2 one dollar bills
2 quarters
1 dime
0 nickles
3 pennies



Thank you,would really appreciate your SMART help.......

What did you try? Where are you stuck? We are not a homework service, but we will try and help if you actually show an effort.

yes , i know i understand

but it was my first day college

and the processor said that solves says gets a 5 % bonus

i only know the basics


public static void main (String args[]) {

System.out.println("Hello Java Programmers");

\\ THIS IS ALL I KNOW
\\YOUR HELP WOULD BE A BLESS FOR US

Break the problem down...how would you do this by hand? Write it out on paper...that's your logic/algorithm. Then convert that to code.
Suggested reading: http://www.javaprogrammingforums.com...e-posting.html