Cod sursa(job #2346744)
| Utilizator | Data | 18 februarie 2019 03:57:27 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main()
{
int x,y,n;
f>>n;
for (unsigned int i=1; i<=n; i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
f.close();
g.close();
return 0;
}
