Cod sursa(job #2054128)
Utilizator | Data | 1 noiembrie 2017 18:46:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a,int b){
if(b==0) return a;
else return cmmdc(b,a%b);
}
int main(){
int n,a,b,c;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in>>n;
for(int i=0;i<n;i++){
in>>a;
in>>b;
c=cmmdc(a,b);
out<<c<<"\n";
}
in.close();
out.close();
return 0;
}