Cod sursa(job #2489066)
Utilizator | Data | 7 noiembrie 2019 21:38:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int divz(int a,int b)
{
if(b==0)
return a;
return divz(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,i,c,d;
f>>n;
for(i=1;i<=n;i++)
{
f>>c>>d;
g<<divz(c,d)<<"\n";
}
return 0;
}