Cod sursa(job #958219)
Utilizator | Data | 7 iunie 2013 11:30:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int cmmdc(int a, int b) {
while (a != b) {
if (a > b)
a -= b;
else
b -= a;
}
return a;
}
void Citire()
{
int i,x,y;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x>>y;
fout<<cmmdc(x,y)<<'\n';
}
}
int main()
{
Citire();
return 0;
}