SPOJ: GCD2

Problem Link http://www.spoj.com/problems/GCD2/ Problem Description In this problem, we need to find greatest common divisor(GCD) of two numbers. If there are two numbers, say A and B, then the constraints are : 1. 0<=A<=40000(can be stored in integer) 2. A<=B<=10^250 (can not be stored in integer) Concepts Used Recursion and Maths Code #include <bits/stdc++.h> using […]

Continue reading