Cod sursa(job #743431)
Utilizator | Data | 4 mai 2012 12:37:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b){
while(a != b)
if(a>b)
a-=b;
else
b-=a;
return a;
}
int main(){
int n, a, b;
ifstream fpi("euclid2.in");
ofstream fpo("euclid2.out");
fpi>>n;
while(n>0){
fpi>>a>>b;
fpo<<cmmdc(a, b)<<"\n";
n--;
}
fpi.close();
fpo.close();
return 0;
}