Cod sursa(job #1335990)
Utilizator | Data | 6 februarie 2015 11:50:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
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 n,a,b,i;
int euclid(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else b=b-a;
}
return a;
}
int main()
{
fin>>n;
for(i=1;i<=n;++i)
{
fin>>a>>b;
fout<<euclid(a,b)<<'\n';
}
return 0;
}