Cod sursa(job #1387425)
Utilizator | Data | 14 martie 2015 10:20:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int t, a, b;
int cmmdc(int a, int b){
while(a != b){
if(a > b)
a-=b;
if(b > a)
b -= a;
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> t;
for(int i=1; i<=t; i++){
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
return 0;
}