L. GCD – Codeforces Problem Solution in C++

Disclaimer: Make sure you tried enough before checking the solution

Problem: https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/L

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int num1,num2,gcd; // 
	cin>>num1>>num2; // 12 8
	int min,max; // 8 12
	if(num1>=num2){
		max = num1;
		min = num2;
	} else {
		max = num2;
		min = num1;
	}
	for(int i=1;i<=max;i++){ // 1    12
		if(num1 % i == 0 && num2 % i ==0){
			gcd = i;
		}
	}
	cout<<gcd<<endl;
	
}

Assiut University Training – Newcomers solution