Cod sursa(job #698594)
Utilizator | Data | 29 februarie 2012 15:09:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,n,i;
int cmmdc(int x,int y)
{
while(x!=y)
{
if(x>y) x=x-y;
else y=y-x;
}
return x;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a;
f>>b;
g<<cmmdc(a,b)<<'\n';
}
f.close();
g.close();
return 0;
}