From 257fea1004313a93edd346715914b819b4a1decd Mon Sep 17 00:00:00 2001
From: Tanya Chetna Vaish <63603952+TanyaChetnaVaish@users.noreply.github.com>
Date: Fri, 2 Oct 2020 15:03:55 +0530
Subject: [PATCH 1/2] Create PascalTriangle.java

---
 PascalTriangle.java | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 PascalTriangle.java

diff --git a/PascalTriangle.java b/PascalTriangle.java
new file mode 100644
index 0000000..c1cd228
--- /dev/null
+++ b/PascalTriangle.java
@@ -0,0 +1,42 @@
+
+import java.util.*;
+public class PascalTriangle {
+	
+		static int facto(int n) {
+			int factorial;
+
+			for(factorial = 1; n > 1; n--){
+				factorial *= n;
+			}
+			return factorial;
+		    }
+		    static int ncr(int n,int r) {
+			return facto(n) / ( facto(n-r) * facto(r) );
+		    }
+		    public static void main(String args[]){
+			int rows, i, j;
+
+			//getting number of rows from user
+			System.out.println("N:");
+			Scanner scanner = new Scanner(System.in);
+			rows = scanner.nextInt();
+			scanner.close();
+            if(rows>10) {
+            	System.out.println("Invalid number of rows(rows<=10)");
+            return;
+            }
+            else {
+			System.out.println("Pascal Triangle:");
+			for(i = 0; i < rows; i++) {
+				for(j = 0; j < rows-i; j++){
+					System.out.print(" ");
+				}
+				for(j = 0; j <= i; j++){
+					System.out.print(" "+ncr(i, j));
+				}
+				System.out.println();
+		 	}}
+		    }
+	
+
+}

From bfda571584d4bdff8c4abc376c893455099bf4b4 Mon Sep 17 00:00:00 2001
From: "Restyled.io" <commits@restyled.io>
Date: Fri, 2 Oct 2020 09:34:58 +0000
Subject: [PATCH 2/2] Restyled by clang-format

---
 PascalTriangle.java | 66 +++++++++++++++++++++------------------------
 1 file changed, 31 insertions(+), 35 deletions(-)

diff --git a/PascalTriangle.java b/PascalTriangle.java
index c1cd228..f2c18f4 100644
--- a/PascalTriangle.java
+++ b/PascalTriangle.java
@@ -1,42 +1,38 @@
 
 import java.util.*;
 public class PascalTriangle {
-	
-		static int facto(int n) {
-			int factorial;
 
-			for(factorial = 1; n > 1; n--){
-				factorial *= n;
-			}
-			return factorial;
-		    }
-		    static int ncr(int n,int r) {
-			return facto(n) / ( facto(n-r) * facto(r) );
-		    }
-		    public static void main(String args[]){
-			int rows, i, j;
+  static int facto(int n) {
+    int factorial;
 
-			//getting number of rows from user
-			System.out.println("N:");
-			Scanner scanner = new Scanner(System.in);
-			rows = scanner.nextInt();
-			scanner.close();
-            if(rows>10) {
-            	System.out.println("Invalid number of rows(rows<=10)");
-            return;
-            }
-            else {
-			System.out.println("Pascal Triangle:");
-			for(i = 0; i < rows; i++) {
-				for(j = 0; j < rows-i; j++){
-					System.out.print(" ");
-				}
-				for(j = 0; j <= i; j++){
-					System.out.print(" "+ncr(i, j));
-				}
-				System.out.println();
-		 	}}
-		    }
-	
+    for (factorial = 1; n > 1; n--) {
+      factorial *= n;
+    }
+    return factorial;
+  }
+  static int ncr(int n, int r) { return facto(n) / (facto(n - r) * facto(r)); }
+  public static void main(String args[]) {
+    int rows, i, j;
 
+    // getting number of rows from user
+    System.out.println("N:");
+    Scanner scanner = new Scanner(System.in);
+    rows = scanner.nextInt();
+    scanner.close();
+    if (rows > 10) {
+      System.out.println("Invalid number of rows(rows<=10)");
+      return;
+    } else {
+      System.out.println("Pascal Triangle:");
+      for (i = 0; i < rows; i++) {
+        for (j = 0; j < rows - i; j++) {
+          System.out.print(" ");
+        }
+        for (j = 0; j <= i; j++) {
+          System.out.print(" " + ncr(i, j));
+        }
+        System.out.println();
+      }
+    }
+  }
 }