For this Question: Given 2 non-negative integers m and n, find gcd(m, n)
GCD of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n. Both m and n fit in a 32 bit signed integer.

 NOTE: DO NOT USE LIBRARY FUNCTIONSInput contains two space separated integers, m and n

Constraints:-
1 < = m, n < = 10^18Output the single integer denoting the gcd of the above integers.Sample Input:
6 9

Sample Output:
3

Sample Input:-
5 6

Sample Output:-
1, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sp = br.readLine().trim().split(" ");
		long m = Long.parseLong(sp[0]);
		long n = Long.parseLong(sp[1]);
		System.out.println(GCDAns(m,n));
	}

	private static long GCDAns(long m,long n){
		if(m==0)return n;
		if(n==0)return m;



		return GCDAns(n%m,m);















	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?