Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
LCM using recursion
//'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_111 import java.util.*; import java.lang.*; class Rextester { static int gcd(int a,int b){ if(a%b==0){ return b; } else return gcd(b,a%b); } public static void main(String args[]) { int a,b; a = 86; b = 6; if(b>a){ System.out.println((a*b)/gcd(b,a)); } else{ System.out.println((a*b)/gcd(a,b)); } } }
run
|
edit
|
history
|
help
0
A.K.JAVA_EXPERIENCE_1
Java Q4
JAVA sidebar pattern match
3.F
2
exp5
hextoepeen
jb14.0 lyambds
3.D
Fibonacci 2