异常处理、递归和单体程序设计方法2

/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package l_onehundredandninetyfive_nine;

/**
*
* @author Administrator
*/
public class L_OneHundredAndNinetyFive_nine {

/**
* @param args the command line arguments
*/
public static void sq_AllProtects(int n)
{
for(int i=0;i<=n;i++)
for(int j=0;j<=n/2;j++)
for(int k=0;k<=n/5;k++)
if(i+2*j+5*k==n)
{  System.out.print(n+"可以由"+i+"个1元 "+j+"个2元 "
+k+"个5元组成");
System.out.println();
}
}
public static void main(String[] args) {
// TODO code application logic here
sq_AllProtects(100);
}
}