Cod sursa(job #2451783)
| Utilizator |  MitracheG gabriel_212 |
Data | 28 august 2019 10:45:11 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | 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()
{
int t,a,b;
ifstream f("euclid.in");
ofstream g("euclid.out");
f>>t;
for(int i=t;i>=1;i--){
f>>a>>b;
g<<cmmdc(a,b)<<"\n";
}
f.close();
g.close();
return 0;
}
