Cod sursa(job #744084)
Utilizator | Data | 7 mai 2012 13:05:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
int euclid(int a, int b)
{
if ( b == 0)
return a;
else
euclid(b, a % b);
}
int main(void)
{
std::ifstream ifs;
std::ofstream ofs;
ifs.open("euclid2.in");
ofs.open("euclid2.out");
int n, a, b;
ifs >> n;
for (int contor = 0; contor < n; contor++)
{
ifs >> a >> b;
ofs << euclid(a, b) << std::endl;
}
return 0;
}