Cod sursa(job #587597)
| Utilizator |  Mihai Moldovan buclucashu |
Data | 5 mai 2011 11:54:00 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
int divizor(int a, int b)
{
if (!b) return a;
return divizor(b, a % b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t,a,b;
f>>t;
while(t)
{
f>>a;
f>>b;
g<<divizor(a,b)<<endl;
t--;
}
f.close();
g.close();
return 0;
}