Cod sursa(job #1207309)
Utilizator | Data | 12 iulie 2014 19:02:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,a,b;
int gcd(int a, int b){
if(!b)return a;
return gcd(b,a%b);
}
int main()
{ ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(;n;n--){
f>>a>>b;
g<<gcd(a,b)<<endl;
}
f.close();
g.close();
}