Cod sursa(job #2512828)
| Utilizator | Data | 21 decembrie 2019 18:40:53 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int cmmdc(int a , int b){
while(a != b and a > 0 and b > 0)
{
if( a > b)
a %= b;
else
b %= a;
}
return max(a,b);
}
int main()
{
int a , b , n;
fi >> n;
for(int i = 0; i < n; i ++)
{
fi >> a >> b;
fo << cmmdc(a,b) << '\n';
}
fi.close();
fo.close();
return 0;
}
