pascals.java

一些Java的小的应用程序

//======================杨辉三角 阶乘===============
import java.io.*;
public class Pascals{
public static void main(String args[]){
try{BufferedReader input=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the column " +
		"that you want to get.");
String s=input.readLine();
int n=Integer.parseInt(s);
final int line=8;
for(int i=0;i<n;i++)
{
for(int k=0;k<n-i;k++)System.out.print("\t");
for(int j=0;j<=i;j++)System.out.print("\t"+c(i,j)+"\t");
System.out.println();
}
	System.out.println();
for(int k=1;k<=n;k++)
{System.out.print(p(k,k)+"\t");
if(k%line==0)System.out.println();
}
System.out.println();
for(int i=0;i<n;i++)
{
for(int k=0;k<n-i;k++)System.out.print("\t");
for(int j=0;j<=i;j++)System.out.print("\t"+p(i,j)+"\t");
System.out.println();
}
System.out.println("NICE WORK!");
}catch(Exception e){}}
public static long c(int  n,int k){
if(k==0|k>=n) return 1;
else return c(n-1,k)+c(n-1,k-1);}
//=================排列数=====================
	public static long p(int n,int k){
	long p=1;
	for(int i=0;i<k;i++)p*=n--;
	return p;
//	while(n>1)p*n--;
//	return p;}
}}