Cod sursa(job #2327327)
Utilizator | Daniel Mirel wweradu | Data | 24 ianuarie 2019 17:05:57 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a,int b){
if(a==b) return a;
if(a>b) return cmmdc(a-b,b);
if(b>a) return cmmdc(a,b-a);
return 1;
}
fstream f("D:\euclid2.in",ios::in);
fstream g("D:\euclid2.out",ios::out);
int main()
{
int t;
int i=0;
f>>t;
int a,b;
while(i!=t){
f>>a>>b;
g<<cmmdc(a,b);
g<<endl;
i++;}
return 0;
}