Cod sursa(job #330351)
| Utilizator | Data | 9 iulie 2009 17:54:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
long eu (long a, long b)
{
if (b==0)
{
return a;
}
else eu (b,a%b);
}
int main()
{
long a,b,n;
ofstream fout ("euclid2.out");
ifstream fin ("euclid2.in");
fin >> n;
for (int i=1; i<=n; i++)
{
fin >> a >> b;
fout << eu(a,b) <<endl;
}
fin.close();
fout.close();
return 0;
}
