---
title: "ravula surya (@suriya) | Hashnode"
description: "ravula surya (@suriya) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@suriya"
---

@suriya

# ravula surya

@suriya · Joined May 2021

### [Binary to Decimal Conversion](https://suryanarayanaravula15.com/binary-to-decimal-conversion?utm_source=hashnode&utm_medium=feed)

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; ...

1 min read · [suryanarayanaravula15.com](https://suryanarayanaravula15.com/binary-to-decimal-conversion?utm_source=hashnode&utm_medium=feed)

[Mar 22, 2023](https://hashnode.com/posts/binary-to-decimal-conversion/641b4863f8cca047098b44a2)

### [gcd for n numbers using euclid as logic](https://suryanarayanaravula15.com/gcd-for-n-numbers-using-euclid-as-logic?utm_source=hashnode&utm_medium=feed)

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\_; ...

1 min read · [suryanarayanaravula15.com](https://suryanarayanaravula15.com/gcd-for-n-numbers-using-euclid-as-logic?utm_source=hashnode&utm_medium=feed)

[Mar 22, 2023](https://hashnode.com/posts/gcd-for-n-numbers-using-euclid-as-logic/641b3bc484202c802ed4b835)

### [Lcm Using Gcd(euclid)(optimal Method)](https://suryanarayanaravula15.com/lcm-using-gcdeuclidoptimal-method?utm_source=hashnode&utm_medium=feed)

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\_; ...

1 min read · [suryanarayanaravula15.com](https://suryanarayanaravula15.com/lcm-using-gcdeuclidoptimal-method?utm_source=hashnode&utm_medium=feed)

[Mar 20, 2023](https://hashnode.com/posts/lcm-using-gcdeuclidoptimal-method/64188c51d4efabc1112e8354)

### [Lcm General Method(least Common Multiple)](https://suryanarayanaravula15.com/lcm-general-methodleast-common-multiple?utm_source=hashnode&utm_medium=feed)

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 ,...

1 min read · [suryanarayanaravula15.com](https://suryanarayanaravula15.com/lcm-general-methodleast-common-multiple?utm_source=hashnode&utm_medium=feed)

[Mar 20, 2023](https://hashnode.com/posts/lcm-general-methodleast-common-multiple/64188bc1d4efabc1112e834e)

### [Gcd Improvized Method(euclid Division Method/long Division Method)](https://suryanarayanaravula15.com/gcd-improvized-methodeuclid-division-methodlong-division-method?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [suryanarayanaravula15.com](https://suryanarayanaravula15.com/gcd-improvized-methodeuclid-division-methodlong-division-method?utm_source=hashnode&utm_medium=feed)

[Mar 19, 2023](https://hashnode.com/posts/gcd-improvized-methodeuclid-division-methodlong-division-method/6416d409d8b33280bc8f66f2)
