Cod sursa(job #986279)
Utilizator | Data | 18 august 2013 13:59:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T,a,b;
int gcd(int a,int b)
{
if(!b)return a;
else return gcd(b, a % b);
}
int main()
{
f>>T;
for(int i=1;i<=T;i++)
{
f>>a>>b;
g<<gcd(a,b)<<'\n';
}
f.close();g.close();
return 0;
}