Cod sursa(job #285005)
Utilizator | Data | 22 martie 2009 11:14:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream.h>
void main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,i,k,p,a,b;
f>>n;
for (i=1;i<=n;i++)
{
f>>k>>p;
a=k;
b=p;
cout<<a<<b;
while (a!=b)
{
if (a>b) a-=b;
else b-=a;
}
g<<a<<endl;
}
f.close();
g.close();
}