Cod sursa(job #516775)
Utilizator | Data | 26 decembrie 2010 13:44:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream.h>
using namespace std;
ifstream("euclid2.in");
ofstream("euclid2.out");
int cmmdc( int a, int b)
{ while (a!=b)
{r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{ int n,i,a,b;
f>>n;
for (i=1;i<=n;i++)
{ f>>a>>b;
cout<<cmmdc(a,b)<<'\n';
}