Cod sursa(job #1355278)
Utilizator | Data | 22 februarie 2015 16:01:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
std::ifstream f("euclid2.in");
std::ofstream g("euclid2.out");
int n;
long int x,y,aux;
f>>n;
while (--n>=0) {
f>>x>>y;
if (y>x) {
aux=y;
y=x;
x=aux;
}
while (y%x!=0) {
aux=y%x;
y=x;
x=aux;
}
g<<x<<endl;
}
f.close();
g.close();
return 0;
}