Cod sursa(job #474217)
Utilizator | Data | 2 august 2010 22:15:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int n,k,x,y,aux,s,t;
int modul(int a,int b)
{
while(a>=b)
a-=b;
return a;
}
int main()
{
ifstream f("euclid2.in",ios::in);
ofstream g("euclid2.out",ios::out);
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
while(modul(x,y)!=0)
{
aux=y;
y=modul(x,y);
x=aux;
}
g<<y<<endl;
}
}