Rust program to find the GCD (Greatest Common Divisor)

Given two numbers, we have to find the GCD (Greatest Common Divisor) using Rust program.
Submitted by Nidhi, on September 29, 2021

Problem Solution:

Here, we will read two integer numbers from the user. Then we will find the Greatest Common Divisor and print the result.

Program/Source Code:

The source code to find the GCD (Greatest Common Divisor) is given below. The given program is compiled and executed successfully.

// Rust program to find the GCD 
// (Greatest Common Divisor)

use std::io;

fn main() 
    let mut n1:i32 = 0;
    let mut n2:i32 = 0;
    let mut rem:i32= 0;
    let mut x:i32  = 0;
    let mut y:i32  = 0;
    let mut input1 = String::new();
    let mut input2 = String::new();
    println!("Enter Number1: ");
    io::stdin().read_line(&mut input1).expect("Not a valid string");
    n1 = input1.trim().parse().expect("Not a valid number");

    println!("Enter Number2: ");
    io::stdin().read_line(&mut input2).expect("Not a valid string");
    n2 = input2.trim().parse().expect("Not a valid number");
    if (n1 > n2) 
        x = n1;
        y = n2;
        x = n2;
        y = n1;

    rem = x % y;

    while (rem != 0) {
        x = y;
        y = rem;
        rem = x % y;

    println!("Greatest Common Divisor is: {}", y);


RUN 1:
Enter Number1: 
Enter Number2: 
Greatest Common Divisor is: 5

RUN 2:
Enter Number1: 
Enter Number2: 
Greatest Common Divisor is: 3


Here, we read the value of n1, n2 from the user. Then we found the GCD (Greatest Common Divisor) of n1 and n2. After that, we printed the result.

Rust Basic Programs »

Related Programs

Comments and Discussions!

Load comments ↻

Copyright © 2024 All rights reserved.