Cod sursa(job #2035125)
Utilizator | Data | 8 octombrie 2017 22:34:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2");
ofstream g("euclid2");
int eclid(int a,int b)
{
if(b==0){
return a;
}
return eclid(b,a%b);
}
int main()
{
int T,A,B;
f>>T;
for(int i=1;i<=T;i=i+1){
f>>A>>B;
g<<eclid(A,B)<<"\n";
}
return 0;
}