Cod sursa(job #953426)
Utilizator | Data | 26 mai 2013 01:45:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
int euclid(int a,int b)
{if (!b) return a;
return euclid(b, a % b);
}
int main()
{int n,a,b;
while(n){f>>a>>b;g<<euclid(a,b)<<"/n";n--;}
f.close();g.close();
}