Cod sursa(job #2251059)
Utilizator | Data | 1 octombrie 2018 09:18:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int CMMDC(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n,a,b;
fin >> n;
for(int i=1;i<=n;++i)
{
fin >> a >> b;
fout << CMMDC(a,b) << endl;
}
return 0;
}