Cod sursa(job #1170419)
| Utilizator | Data | 13 aprilie 2014 15:54:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int n,a,b;
int cmmdc(int x,int y)
{
int r;
r=x%y;
while(r!=0)
{
x=y;
y=r;
r=x%y;
}
return y;
}
int main()
{
int i;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(i=1;i<=n;++i)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<"\n";
}
fin.close();
fout.close();
return 0;
}
