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