Round #1011

Find the greatest common divisor of 84 and 126 using the Euclidean algorithm.

```csharp using System; public class Program { public static int Gcd(int a, int b) { while (b != 0) { int temp = b; b = a % b; a = temp; } return a; } public static void Main() { Console.WriteLine(Gcd(84, 126)); } } ```

```csharp using System; public class Program { public static int Gcd(int a, int b) { while (b != 0) { int temp = b; b = a % b; a = temp; } return a; } public static void Main() { int num1 = 84; int num2 = 126; int result = Gcd(num1, num2); Console.WriteLine("The greatest common divisor of " + num1 + " and " + num2 + " is " + result); } } ``` This C# program uses the Euclidean algorithm to find the greatest common divisor (GCD) of two numbers, 84 and 126. The GCD function takes two integers as input and returns their GCD. The algorithm works by repeatedly replacing 'a' and 'b' with 'b' and 'a mod b' until 'b' becomes zero. At that point, 'a' is the GCD of the original 'a' and 'b'. The result is then printed to the console.