提交记录 #35

#include<stdio.h>
void findCombinations(int price[],int tm,int tn){
    for(int i=1;i<=tn;i++){
        for(int j=i;j<=tn-i;j++){
            for(int k=j;k<=tn-i-j;k++){
                for(int l=k;l<=tn-i-j-k;l++){
                     int m=tn-i-j-k-l;
                     if (m>=1&&i*price[0]+j*price[1]+k*price[2]+l*price[3]+m*price[4]==tm){
                         printf("%d,%d,%d,%d,%d\n",i,j,k,l,m);
                    }
                }
            }
        }
    }
} 
int main(){
    int prices[5];
    int tm,tc;
    for (int i=0;i<5;i++){
        scanf("%d",&prices[i]);}
        scanf("%d %d",&tm,&tc);
        findCombinations(prices, tm,tc);
        
    return 0;
}