Cod sursa(job #1415469)
Utilizator | Data | 4 aprilie 2015 17:59:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
int t,a,b;
ifstream f ("euclid2.in");
f>>t;
ofstream g ("euclid2.out");
for(int i =1;i<=t;i++){
f>>a>>b;
g<<gcd(a,b)<<"\n";
}
g.close();
f.close();
return 0;
}