Cod sursa(job #2419521)
| Utilizator | Data | 8 mai 2019 19:16:38 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid.out");
int a,b,n;
int euclid(int a,int b)
{
if(b==0) return a;
return euclid(b,a%b);
}
int main()
{
f>>n;
for(int i=1;i<=n;++i)
{
f>>a>>b;
g<<euclid(a,b)<<'\n';
}
f.close();
g.close();
return 0;
}
