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