import java.util.Scanner;
class Pascal
{
static int factorial(int n)
{
int sum = n;
for(int k=n-1;k>=1;k--)
sum*=k;
if(sum!=0)
return sum;
else
return 1;
}
public static void main(String...args)
{
int s,lines;
Scanner sc = new Scanner(System.in);
System.out.println("Enter no of lines:");
lines = sc.nextInt();
for(int i=0;i<lines;i++)
{
for(int j=lines;j>i;j--)
System.out.print(" ");
for(int k=0;k<=i;k++)
{
s = factorial(i)/(factorial(k)*factorial(i-k));
System.out.print(s+" ");
}
System.out.println();
}
}
}
class Pascal
{
static int factorial(int n)
{
int sum = n;
for(int k=n-1;k>=1;k--)
sum*=k;
if(sum!=0)
return sum;
else
return 1;
}
public static void main(String...args)
{
int s,lines;
Scanner sc = new Scanner(System.in);
System.out.println("Enter no of lines:");
lines = sc.nextInt();
for(int i=0;i<lines;i++)
{
for(int j=lines;j>i;j--)
System.out.print(" ");
for(int k=0;k<=i;k++)
{
s = factorial(i)/(factorial(k)*factorial(i-k));
System.out.print(s+" ");
}
System.out.println();
}
}
}
No comments:
Post a Comment