Cod sursa(job #249552)
Utilizator | Temian Vlad monk | Data | 28 ianuarie 2009 19:10:42 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int x,y,n,cmmdc;
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
while(n)
{
fin>>x>>y;
cmmdc=euclid(x,y);
fout<<cmmdc<<"\n";
n--;
}
system ("pause");
return 0;
}