GCD Function

Easy Functions
Solve in Playground →

Problem Statement

Write a C program with a function `int getGCD(int a, int b)` that computes and returns the Greatest Common Divisor.

Input Format

Two space-separated integers A and B.

Output Format

Print the GCD value.

Constraints

1 <= A, B <= 100000

Sample Input

24 36

Sample Output

12

Explanation

GCD of 24 and 36 is 12.

Starter Code

#include <stdio.h>

// Define getGCD here

int main() {
    int a, b;
    if (scanf("%d %d", &a, &b) == 2) {
        // Print result
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used