Cod sursa(job #528833)
Utilizator | Data | 3 februarie 2011 15:50:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
long euclid (long a,long b)
{
if (b==0) return a;
return (b,a%b);
}
int main ()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
long a,b,x;
f>>x;
for (int i=0; i<x; i++)
{
f>>a>>b;
g<<euclid(a,b)<<'\n';
}
g.close();
return 0;
}