Cod sursa(job #2151602)
Utilizator | Data | 4 martie 2018 17:47:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int cmmdc(int a, int b)
{
int r;
while(b!=0){
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int i, a, b;
f>>n;
for(i=1;i<=n;++i){
f>>a>>b;
g<<cmmdc(a, b);
}
return 0;
}