Cod sursa(job #1916291)
Utilizator | Data | 9 martie 2017 08:54:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a,b,n;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int n,int m)
{
int r;
while(m)
{
r=n%m;
n=m;
m=r;
}
return n;
}
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<"\n";
}
return 0;
}