Cod sursa(job #2640468)
Utilizator | Data | 6 august 2020 16:03:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a,int b)
{
while(a!=b)//12 != 42 30
{
if(a>b)
{
a=a-b;
}
else
b=b-a;
}
return a;
}
int main()
{ int x,y,n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x>>y;
cout<<cmmdc(x,y);
}
return 0;
}