Cod sursa(job #1388155)
| Utilizator | Data | 15 martie 2015 11:24:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b){
if(!b)
return a;
else
return cmmdc(b, a%b);
}
int n, a, b;
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> n;
for(int i=1; i<=n; i++){
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
return 0;
}
