Cod sursa(job #953430)
Utilizator | Data | 26 mai 2013 01:57:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int euclid(int a,int b)
{if (!b) return a;
return euclid(b, a % b);
}
int main()
{int a,b;
f>>n;
while(n--){f>>a>>b;g<<euclid(a,b)<<'\n';}
f.close();
g.close();
return 0;
}