Cod sursa(job #498986)
| Utilizator |  Curtusan Ciprian cdc_rapid |
Data | 8 noiembrie 2010 06:18:30 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
#include<fstream>
using namespace std;
long n , a, b,i,aux ;
int main()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
f>>n;
for(i=1;i<=n;i++)
{f>>a>>b;
if(a<b)
{
aux=a%b;
a=b;
b=aux;
}
while (a%b)
{aux=a%b;
a=b;
b=aux;
}
g<<b<<"\n";
}
f.close();
g.close();
return 0;
}
