# SCU 1009 Dollars

Description

## Output

Output will consist of a line for each of the amounts in the input, each line consisting of the amount of money (with two decimal places and right justified in a field of width 5), followed by the number of ways in which that amount may be made up, right justified in a field of width 12.

## Sample input

0.20
2.00
0.00

## Sample output

 0.20           4
2.00         293
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
double x;
int i,j,k,l,n,m,o,p,q;
while (~scanf("%lf",&x) && x)
{
x*=10;
if (x<1)
{
printf("%.2lf 1\n",x/10);
continue;
}
int t=0;
for (i=0;i<=x/500;i++)
for (j=0;j<=(x-i*500)/200;j++)
for (k=0;k<=(x-i*500-j*200)/100;k++)
for (l=0;l<=(x-i*500-j*200-k*100)/50;l++)
for (n=0;n<=(x-i*500-j*200-k*100-l*50)/20;n++)
for (m=0;m<=(x-i*500-j*200-k*100-l*50-n*20)/10;m++)
for (o=0;o<=(x-i*500-j*200-k*100-l*50-n*20-m*10)/5;o++)
for (p=0;p<=(x-i*500-j*200-k*100-l*50-n*20-m*10-o*5)/2;p++)
{
int y=x-i*500-j*200-k*100-l*50-n*20-m*10-o*5-p*2;
t+=y+1;
}
printf("%5.2lf%12d\n",x/10,t);
}
return 0;
}

#### DOLLARS聊天室

2010年09月21日 433KB 下载

#### uva 147 - Dollars（动态规划--完全背包）

2013-08-16 17:32:38

#### UVA-147-Dollars

2013-06-28 00:43:08

#### scu（snoop control unit）

2014-05-05 16:07:09

#### SCU 4440: Rectangle（规律）

2017-05-02 22:42:48

#### SCU 4441 Necklace (2015四川省省赛F题)

2015-06-25 09:56:27

#### SCU 4437 Carries 想法题

2015-10-01 20:01:24

#### DICOM测试工具（SCU）

2016年05月28日 763KB 下载

#### DICOM C-SCU工具(模拟器)

2014年07月17日 959KB 下载

#### scu 4440 Rectangle

2016-08-18 19:05:40