Cod sursa(job #1025044)
| Utilizator | Data | 9 noiembrie 2013 14:18:19 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a , int b){
int m, cm=0;
if( a < b ) {
m = a;
}else{
m = b ;
}
for ( int i=1 ;i <= m ; i++){
if ( (a % i == 0 ) && ( b % i == 0 ) ) {
cm = i ;
}
}
return cm;
}
int main(void)
{
int a , b, c ;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> c ;
for(int i=1;i<=c;i++){
f >> a; f>> b;
g << cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}
