Cod sursa(job #1598147)
Utilizator | Data | 12 februarie 2016 17:28:25 | |
---|---|---|---|
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.in");
ofstream g("euclid2.out");
int cmmdc(long long a, long long b)
{
if(!b) return a;
else return cmmdc(b,a%b);
}
int main()
{
int n;
long long a,b;
f>>n;
for(int i = 1; i<=n; i++)
{
f>>a>>b;
g<<cmmdc(a,b);
}
return 0;
}