Cod sursa(job #1369647)
Utilizator | Data | 3 martie 2015 10:23:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int N;
int a,b;
int gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main()
{
fi>>N;
for(int i=1;i<=N;i++)
{
fi>>a>>b;
fo<<gcd(a,b)<<'\n';
}
fi.close();
fo.close();
return 0;
}