Services
Technology Web App Development Mobile App Development Windows App Development Database Development UI/UX Development Cloud Development SEO Digital Marketing Guest Posting Content Writing Artificial Intelligence Data Science ERP Development CRM Development CMS Development LMS Development Business Listing Blockchain Technology Startup Promotion AI Tools Integration
Products
Data Converter Cleaner TUC - Unit Converter Import Export Survey Manager Tweet Controller
Developer
Article Blog Forum Interview Beginner News Startup Quiz
Users
Career
Apply Job Internship
Pricing
Login Sign Up Get a Quote

forum

Home Forums Create a program to find the GCD (Greatest Common Divisor) of two numbers. – MindStick
Ask Question

1 Answers

Aryan Kumar
Aryan Kumar 15 Jun 2023
Report Abuse

Sure, here is a C# program to find the GCD of two numbers:

C#

using System;

public class GCD {

    public static void Main() {

        // Get two numbers from the user
        Console.WriteLine("Enter two numbers: ");
        int num1 = Convert.ToInt32(Console.ReadLine());
        int num2 = Convert.ToInt32(Console.ReadLine());

        // Find the GCD using Euclid's algorithm
        int gcd = 1;
        while (num2 != 0) {
            int temp = num1 % num2;
            num1 = num2;
            num2 = temp;
            gcd = num1;
        }

        // Print the GCD
        Console.WriteLine("The GCD of {0} and {1} is {2}", num1, num2, gcd);
    }
}

This program will first prompt the user to enter two numbers. It will then use Euclid's algorithm to find the GCD of the two numbers. Euclid's algorithm works by repeatedly finding the remainder of the division of one number by the other. The algorithm terminates when the remainder is 0, which means that the two numbers are relatively prime. The GCD is then equal to the last non-zero remainder.

The program will then print the GCD of the two numbers.

advertising
Markdown for AI

A clean, structured version of this page for AI assistants and LLMs.

Open .md