找零钱.txt

来自「里面包含vc的经典算法,如动态规划,分治,回溯,贪心算法等」· 文本 代码 · 共 24 行

#include <iostream.h>

void zhaoqian(int m[],int n, int num[] )
{       

    for(int i = 0 ; i < 4 ; i ++)
    {
        num[i] = n/m[i];
        n = n%m[i];
    }
}


int main()
{
	int m[4] = {25,10,5,1};
    int n = 99 ;
    int num[4] ;
    zhaoqian(m , n ,num);
    cout << "找钱方案：" << endl ;
    for(int i = 0 ; i < 4 ; i ++)
        cout << num[i] << "枚" << m[i] << "面值" << endl ;
    return 1;
}