added maths codes

Author: sauravjaiswalsj

codes/java/practice/BigInteger/Lesson/1q

@@ -0,0 +1,14 @@
+import java.util.Scanner;
+import java.math.BigInteger;
+public class gcdBigInteger{
+	public static void main(String[] args)/*throws IOException*/{
+		/*final BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+		BigInteger a=new BigInteger(br.readLine());
+		BigInteger b=new BigInteger(br.readLine());
+		*/
+		final Scanner cin=new Scanner(System.in);
+		BigInteger a=cin.nextBigInteger();
+		BigInteger b=cin.nextBigInteger();
+		System.out.println(a.gcd(b));
+	}
+}

codes/java/practice/BigInteger/Lesson/gcdBigInteger.class

@@ -0,0 +1,14 @@
+import java.util.Scanner;
+import java.math.BigInteger;
+public class gcdBigInteger{
+	public static void main(String[] args)/*throws IOException*/{
+		/*final BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+		BigInteger a=new BigInteger(br.readLine());
+		BigInteger b=new BigInteger(br.readLine());
+		*/
+		final Scanner cin=new Scanner(System.in);
+		BigInteger a=cin.nextBigInteger();
+		BigInteger b=cin.nextBigInteger();
+		System.out.println(a.gcd(b));
+	}
+}

codes/java/practice/BigInteger/Lesson/gcdBigInteger.java

@@ -0,0 +1,26 @@
+//a*b=lcm*gcd
+import java.util.Scanner;
+import java.math.*;
+public class GcdLcm{
+	public static void main(String[] args){
+		final Scanner cin = new Scanner(System.in);
+		int testCase=cin.nextInt();
+		for(int i=0;i<testCase;i++){
+			long a=cin.nextLong();
+			long b=cin.nextLong();
+			long gcd=findGcd(Math.max(a,b),Math.min(a,b));
+			long lcm=getLcm(gcd,a,b);
+			System.out.println(lcm+" "+gcd);
+		}
+	}
+	private static long findGcd(long a,long b){
+		if(b==0){
+			return a;
+		}
+		return findGcd(b,a%b);
+	}
+	private static long getLcm(long gcd,long a,long b){
+		return ((a*b)/gcd);
+	}
+}
+	

practice/maths/GcdLcm.class

@@ -0,0 +1,30 @@
+import java.io.*;
+import java.math.*;
+public class factorialTrailingZero{
+	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(trailingZeroes(Integer.parseInt(br.readLine())));
+		}
+	}
+	private static int factorial(int n){
+		BigInteger fact=BigInteger.ONE;
+		for(int i=2;i<=n;i++){
+			fact=fact.multiply(BigInteger.valueOf(i));
+		}
+		int count=0;
+		while(fact.mod(BigInteger.TEN)==BigInteger.ZERO){
+			++count;
+			fact=fact.divide(BigInteger.TEN);
+		}
+		return count;
+	}
+	public static int trailingZeroes(int A) {
+        int count=0;
+        for(int i=5;(A/i)>0;i=i*5){
+            count+=A/i;
+        }
+        return count;
+    }
+}