Practice Real Company Assessment Patterns • Latest 2025–2026 Mock Tests

Programming Exercises

Write a program to find the GCD (Greatest Common Divisor) of two numbers using the Euclidean algorithm.

Medium

Problem Statement

Write a program to find the GCD (Greatest Common Divisor) of two numbers using the Euclidean algorithm.

Sample Input

int a = 56, b = 98;

Sample Output

GCD = 14

Limits

Time: 2s · Memory: 256 MB

Code Editor
00:00
#include <iostream> int main() { int a = 56, b = 98; // Logic to find GCD return 0; }
Log in or sign up to run or submit your code.Log inSign up
Input
int a = 56, b = 98;
Expected Output
GCD = 14