Cod sursa(job #1372693)
Utilizator | Data | 4 martie 2015 15:02:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int euclid(int x , int y)
{
int z;
while(y)
{
z=x%y;
x=y;
y=z;
}
return x;
}
int main()
{
int n,x,y,i;
fin>>n;
for(i=1 ; i<=n ; ++i)
{
fin>>x>>y;
fout<<euclid(x,y)<<'\n';
}
return 0;
}