Cod sursa(job #944445)
Utilizator | Data | 28 aprilie 2013 16:24:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b){
if(b==0) return a;
else return cmmdc(b,a%b);
}
int main()
{
int n,aux1,aux2;
f>>n;
for(int i=1;i<=n;i++){
f>>aux1>>aux2;
g<<cmmdc(aux1,aux2)<<endl;
}
}