Cod sursa(job #424639)
Utilizator | Data | 24 martie 2010 23:58:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#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(){
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
f>>n;
for(int i=0;i<n;i++){
f>>a>>b;
if(a>b)g<<cmmdc(a,b)<<endl;
if(b>a)g<<cmmdc(b,a)<<endl;}
f.close();g.close();
}