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