Cod sursa(job #834118)
Utilizator | Data | 13 decembrie 2012 19:26:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
while (a!=b)
if (a>b)
a=a-b;
else
b=b-a;
return a;
}
int main()
{
int i,n,a,b;
f>>n;
for(i=1;i<=n;i++)
{f>>a>>b;
g<<euclid(a,b)<<endl;
}
f.close();
g.close();
return 0;
}