Cod sursa(job #1418086)
Utilizator | Data | 11 aprilie 2015 21:33:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
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");
ofstream g("euclid2.out");
f>>T;
for(int i =1;i<=T;i++){
f>>a>>b;
g<<gcd(a,b);
}
f.close();
g.close();
return 0;
}