Added Codes for Project Euler Solutions

Author: sauravjaiswalsj

Codechef/beg/BigIntegerFactorial.class

@@ -0,0 +1,18 @@
+import java.math.BigInteger;
+import java.io.*;
+public class BigIntegerFactorial{
+	public static void main(String[] args)throws IOException{
+		final BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+		int t=Integer.parseInt(br.readLine());
+		for(int i=0;i<t;i++){
+			System.out.println(factorial(Integer.parseInt(br.readLine())));
+		}
+	}
+	private static BigInteger factorial(int n){
+		BigInteger result = BigInteger.ONE;
+		for(int i=2;i<=n;i++){
+			result=result.multiply(BigInteger.valueOf(i));
+		}
+		return result;
+	}
+}

Codechef/beg/BigIntegerFactorial.java

@@ -0,0 +1,66 @@
+import java.util.Scanner;
+public class IncreasingDecreasingSequence{
+	public static void main(String[] args){
+		Scanner cin=new Scanner(System.in);
+		int n=cin.nextInt();
+		if(n==0){
+			System.out.println(false);
+			return;
+		}
+		int[] array=new int[n];
+		for(int i=0;i<n;i++){
+			array[i]=cin.nextInt();
+		}
+		if(checkSortedInc(array)==true || (checkSortedDec(array)==true || checkSortedDecInc(array))){
+			System.out.println("true");
+		}else{
+			System.out.println("false");
+		}
+	}
+	public static boolean checkSortedInc(int[] array){
+		for(int i=1;i<array.length;i++){
+			if(array[i-1]>array[i]){
+				return false;
+			}
+		}
+		return true;
+	}
+	public static boolean checkSortedDec(int[] array){
+                for(int i=0;i<array.length-1;i++){
+                        if(array[i]<array[i+1]){
+                                return false;
+                        }
+                }
+                return true;
+        }
+	//3 2 1 2 3
+	public static boolean checkSortedDecInc(int[] array){
+                int j=0;
+		boolean check=false;
+		for(int i=0;i<array.length-1;i++){
+                        if(array[i]<array[i+1]){
+                                check=true;
+                        }
+			else{
+				j=i;
+				check=false;
+				break;
+				
+			}
+		}
+		//System.out.println(j);
+		for(;j<array.length-1;j++){
+			if(array[j+1]>array[j]){
+				check=true;
+			}else{
+				check=false;
+			}
+		}
+		if(check==true){
+               		return true;
+		}else{
+			return false;
+		}
+        }
+
+}

Codechef/beg/SmallFact.java

@@ -0,0 +1,24 @@
+// sum=sum*(nrow-cst)/cst
+import java.util.Scanner;
+public class PascalTriangle{
+        public static void main(String[] args){
+                Scanner cin=new Scanner(System.in);
+                int n=cin.nextInt();
+                int nrow=1;
+                int nst=1;
+                int nsp=n-1;
+		while(nrow<=n){
+			int sum=1;
+			int cst=1;
+			while(cst<=nst){
+				System.out.print(sum+"\t");
+				sum=sum*(nrow-cst)/cst;
+				cst++;
+			}
+			//prep
+			System.out.println();
+			nst++;
+			++nrow;
+		}
+	}
+}

cdblocks/challenge1/.PythgorasTriplet.java.swp

@@ -25,8 +25,11 @@ public static void main(String[] args){
 				System.out.print("\t");
 				++csp;
 			}
-			if(nrow==n){--val;}
 			int csd=1;
+			if(nrow==n){
+				csd=2;
+				--val;
+			}
 			while(csd<=nst){
 				System.out.print(val+"\t");
 				++csd;