Cod sursa(job #228082)
| Utilizator | Data | 6 decembrie 2008 13:28:27 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
using namespace std;
int cmmdc();
int T, a, b;
int main()
{
ifstream fin("euclid2.in");
fin >> T;
int i;
ofstream fout("euclid2.out");
for(i = 0; i < T; i++)
{
fin >> a >> b;
fout << cmmdc()<<'\n';
}
fin.close();
fout.close();
return 0;
}
int cmmdc()
{
int rest;
while ( b )
{
rest = a % b;
a = b;
b = rest;
}
return a;
}
