@suriya

Binary to Decimal Conversion

Mar 22, 2023 · 1 min read · import java.util.Scanner; class Main { public static void bintoDec() { System.out.println("enter a number to convert binary to decimal "); Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int ans=0; int p=1; ...

gcd for n numbers using euclid as logic

Mar 22, 2023 · 1 min read · import java.util.Scanner; class Main { public static int gcd(int A,int B) { int a =A; int b=B; int a_,b_; while(a!=0) { a_=b%a; b_=a; a=a_; b=b_; ...

Lcm Using Gcd(euclid)(optimal Method)

Mar 20, 2023 · 1 min read · class Main { public static void lcm(int A ,int B) { int a =A; int b=B; int gcd=1; int lcm; int product=a*b; while(a!=0) { int a_=b%a; int b_=a; a=a_; ...

Lcm General Method(least Common Multiple)

Mar 20, 2023 · 1 min read · class Main { public static void main (String args[]){ int N=11; int smallnum=22; int Max=Math.max(N,smallnum);//MAX NUM SINCE WE CAN REDUCE NUMBER OF STEPS,,IF WE TAKE MINIMUM THE NUMBERS BETWEEN MIN AND MAX CANT BE MULTIPLE OF BOTH ,...

Gcd Improvized Method(euclid Division Method/long Division Method)

Mar 19, 2023 · 1 min read · note:coded using while and for loops check both programs. [Success] Your code was executed successfully Actually, in the general method it takes too much time since we check until the minimum of the both numbers and find the maximum/greatest common d...