Cod sursa(job #539803)
Utilizator | Data | 23 februarie 2011 13:00:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
long diviz(long a,long b)
{
int r;
r=a%b;
while(r>0)
{
a=b;
b=r;
r=a%b;
}
return b;
}
void program()
{
ifstream f("euclid.in");
ofstream g("euclid.out");
int n,i;
long a,b;
i=1;
f>>n;
while(i<=n)
{
f>>a>>b;
g<<diviz(a,b)<<"\n";
i++;
}
}
int main()
{
program();
return 0;
}