Cod sursa(job #757417)
| Utilizator | Data | 11 iunie 2012 23:26:28 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int cmmdc(int x, int y)
{
while(y != 0){
if(y > x) swap(x, y);
int tmp = y;
y = x % y;
x = tmp;
}
return x;
}
int main(){
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int N, x, y;
in >> N;
for(int i = 0; i < N; ++i)
{
in >> x >> y;
out << cmmdc(x, y) << endl;
}
return 0;
}
