02-算1块，5块，10块，组成100块钱的不同方法

代码：

 

 

#include "stdio.h"

#include "conio.h"

main(){

       int i,j,k;

       int total=0;

       for(i=0;i<=100;i++)

       {

              for(j=0;j<=20;j++)

            {

                  for(k=0;k<=10;k++)

                  {

                          if(i+j*5+k*10==100)

                              {

                                     printf("%d,%d,%d",i,j,k);

                                     printf("\n");

                                     total++;

                             }

                  }

            }

        }

                                 printf("%d",total);

                                 getch();

 

}

 

 

总共的排列的方式的有121种。