int div = 1;
    int ans = 1;
        if(l==b){
            return ans;
        }else {              
            for(int i= 1 ; i<=l;i++ ){
                 if((l%i==0) && (b%i==0)){
                     div = i;                     
                 }
            }
           ans = (l*b)/(div*div);
        }
         return ans;

python3

def divisor(n):
    div = []
    for i in range(1,n+1):
        if i == 1 or i == n:
            div.append(i)
        else:
            if n % i == 0:
                div.append(i)
    
    return div
    
def restaurant(l,b):
    # Write your code here
    divl = divisor(l)
    divb = divisor(b)
    common = []
    for i in divl:
        if i in divb:
            common.append(i)
            
    maximum = max(common)
    total = int((l/maximum)*(b/maximum))
    return total    
    
        

public static int restaurant(int l, int b) {
    // Write your code here
        int oriSize = l * b;
        int pS = gcd(l, b); // possibleBiggestSide
        
        return (l / pS) * (b / pS);

    }
    
    private static int gcd(int a, int b){
        
        if(a < b){
            int temp = a;
            a = b;
            b = temp;
        }
        if(b == 0) return a;
        return gcd(b, a % b);
        
    }

int restaurant(int l, int b) 
{
    int size = __gcd(l, b);
    
    return (l/size) * (b/size);
}