找钱算法递归调用

#include<stdio.h>
#define N 4      
#define N1 1                    
#define N2 5                   
#define N3 25                  
#define MAX 1000 
//#define money 27  

   struct A
   {  int value;
      int coin;
   };
   struct A T[N]={{0,0},{N1,4},{N2,3},{N3,6}};
   int m[4]={0};
   //static i=0;
 void back1( int t,int i)
 {
 if(t==0)
 {  
 for(int n=1;n<=3;n++)
 printf("%d\n",m[n]);
 //printf("-----");
// return;

 }
    else  

{    

 for(int j=1;j<=T[i].coin;j++)