Cod sursa(job #899479)
Utilizator | Data | 28 februarie 2013 14:42:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
int euclid (int a, int b)
{
if(b==0)
return a;
return euclid(b,a%b);
}
int main ()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a;
f>>b;
g<<euclid(a,b)<<"\n";
}
f.close();g.close();
return 0;
}