Cod sursa(job #206804)
Utilizator | Data | 9 septembrie 2008 18:52:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream.h>
#include<fstream.h>
unsigned long x,a,b,i,d,div,ok;
int main ()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>x;
for (i=0;i<x;i++)
{f>>a>>b;
d=2;div=1;
while (d<=a && d<=b)
{ok=1;
if (a%d==0 && b%d==0) {div*=d;a/=div;b/=div;ok=0;}
if (ok==1) d++;}
g<<div<<'\n';
}
return 0;
}