Cod sursa(job #2192903)
Utilizator | Data | 7 aprilie 2018 17:20:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n,a,b;
int cmmdc(int a,int b)
{
int r=0;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main ()
{
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<'\n';
}
return 0;
}