Cod sursa(job #1239778)
Utilizator | Data | 9 octombrie 2014 19:41:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
int gcd(int a,int b)
{if(!b) return a;
return gcd(b,a%b);
}
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,T;
int main()
{f>>T;
for(int i=1;i<=T;i++)
{f>>a>>b;
g<<gcd(a,b)<<'\n';
}
return 0;
}