160729

来源:互联网 发布:u盘数据丢失 编辑:程序博客网 时间:2024/06/06 09:12
import java.util.Scanner;




public class date729 {
public static void re(){
System.out.println("密码3次输入错误,已冻结");
//return 0;
}






/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in=new Scanner(System.in);

/*System.out.println("MyShopping管理系统>购物结算");
System.out.println("*****************************************");
System.out.println("请选择购买的商品编号");
System.out.println("1.T恤\t2.网球鞋\t3.网球拍");
System.out.println("*****************************************");
char TF;
int c1=0,c2=0,c3=0,c=0;
do{
System.out.print("请输入商品编号:");
int n=in.nextInt();
System.out.println("请输入购买数量");
switch (n) {
case 1:
c=in.nextInt();
c1=c1+c;
System.out.println("T恤\t¥245\t");
break;
case 2:
c=in.nextInt();
c2=c2+c;
System.out.println("网球鞋\t¥570\t");
break;
case 3:
c=in.nextInt();
c2=c2+c;
System.out.println("网球拍\t不要钱\t");
break;


default:
break;
}
System.out.println("是否继续(Y/N)");
System.out.println("合计"+(c1*245+c2*570+c3*0));
TF=in.next().charAt(0);
}while(TF=='Y');
System.out.println("折扣:0.8");
System.out.println("应付金额:"+(c1*245+c2*570+c3*0));
System.out.println("实付金额:");
int pay=in.nextInt();
System.out.println("找零:"+(pay-(c1*245+c2*570+c3*0)));
*/
/*int i,j;
int n=in.nextInt();
for (i = 1; i <= n/2+1; i++) {
for (int k = 0; k < n - i-n/2; k++) {
System.out.print(" ");
}
for (j = 0; j < (2 * i - 1); j++) {
System.out.print("*");


}
System.out.println();

}
for (i = 1; i < n/2+1; i++) {
for (int k = 0; k <i; k++) {
System.out.print(" ");
}
for (j = 0; j < n-i*2; j++) {
System.out.print("*");


}
System.out.println();

}*/
/*int i, j, p = 0, q = 0;
int n = in.nextInt();
for (i = 1; i <= n / 2 + 1; i++) {
for (int k = 0; k < n - i - n / 2; k++) {
System.out.print(" ");
}
p = 0;
q = 0;
for (j = 0; j < (2 * i - 1); j++) {
char a = 'A';
if (j <= (2 * i - 1) / 2) {
System.out.print((char) (a + p));
p++;
} else {
System.out.print((char) (a + p - q * 2 - 2));
p++;
q++;
}


}
System.out.println();


}*/

int i,j,n;
int[][] arr = new int[100][100];
n=in.nextInt();

for(i=0;i<n;i++){
arr[i][0]=1;

}
for(i=1;i<n;i++){
for(j=1;j<=i;j++){
if(i==j){
arr[i][j]=1;
}else
arr[i][j]=arr[i-1][j-1]+arr[i-1][j];

}
}
for(i=0;i<n;i++){
for(j=0;j<=i;j++){
System.out.print(arr[i][j]+"\t");
}
System.out.println();

}





}


}
0 0
原创粉丝点击