Cod sursa(job #1437042)
Utilizator | Data | 16 mai 2015 19:43:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(long a, long b){
if(b == 0)
return a;
else return gcd(b, a % b);
}
long a, b, n;
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<gcd(a,b);
}
return 0;
}