Cod sursa(job #244455)
Utilizator | Data | 15 ianuarie 2009 08:44:14 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
using namespace std;
long euclid(long a,long b)
{long x;
while(b!=0)
{x=b;
b=a%b;
a=x;}
return a;}
int main()
{long t,a,b;
f>>t;
for (int i=1;i<=t;i++)
{f>>a>>b;
g<<euclid(a,b)<<endl;}
f.close();g.close(); return 0;
}