Cod sursa(job #703873)
Utilizator | Data | 2 martie 2012 15:05:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int euclid(int a,int b)
{
int r;
while (b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int a,b,n,i;
ifstream f("euclid.in");
ofstream g("euclid.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>a>>b;
g<<euclid(a,b)<<"\n";
}
return 0;
}