1553（找零钱，数量最少）贪婪算法.txt

KMP字符串匹配的c实现

#include<iostream>
using namespace std;
int main(){
	int a[4]={25,10,5,1};
	int c,n;
	cin>>n;
	int tag=0;
	while(n--){
		tag++;
		int b[4]={0};
		cin>>c;
		for(int i=0;i<4;i++){
			b[i]=c/a[i];
			c%=a[i];
			if(!c)
				break;
		}
		cout<<tag<<' '<<b[0]<<" QUARTER(S), "<<b[1]<<" DIME(S), "<<b[2]<<" NICKEL(S), "<<b[3]<<" PENNY(S)"<<'\n';

	}
	return 0;
}