Cod sursa(job #273551)
Utilizator | Data | 8 martie 2009 18:54:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream cin("euclid.in");
ofstream cout("euclid.out");
int divp(int a,int b)
{
int t;
while(b!=0)
{
t = b;
b = a % b;
a = t;
}
return a;
};
int main()
{
int a,b,n,i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a;
cin>>b;
cout<<divp(a,b)<<"\n";
}
return 0;
}