Cod sursa(job #1971567)
| Utilizator | Data | 20 aprilie 2017 16:30:05 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int numar, primulNumar, aldoileaNumar;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> numar;
for (int i = 0; i < numar; i++)
{
f >> primulNumar >> aldoileaNumar;
while (aldoileaNumar)
{
int rest = primulNumar%aldoileaNumar;
primulNumar = aldoileaNumar;
aldoileaNumar = rest;
}
g << primulNumar;
}
f.close();
g.close();
return 0;
}