Write a recursive Python function to find the Greatest Common Divisor of two integers using Euclidean algorithm.
Two integers a and b separated by space.
Print the GCD value.
1 <= a, b <= 1000
48 18
6
gcd(a, b) = gcd(b, a % b) with base case b = 0 returning a.
def gcd(a, b):
# Write your code here
pass
a, b = map(int, input().split())
print(gcd(a, b))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