Cod sursa(job #1416029)
Utilizator | Data | 7 aprilie 2015 09:01:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int CMMDC(int a, int b){
int c;
while(a>0){
c=a;
a=b%a;
b=c;
}
return b;
}
int main()
{
int a,b,T;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in >> T;
for(int i=1;i<=T;i++){
in >> a >> b;
out << CMMDC(a,b) << '\n';
}
}