Cod sursa(job #1250043)
| Utilizator | Data | 27 octombrie 2014 19:32:26 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long x,y;
long CMMDC(long a, long b)
{
long t;
while (b != 0)
{t = b;
b = a % b;
a = t;}
return a;
}
int main()
{ while (f>>x>>y)
g << CMMDC(x,y) << endl;
return 0;
}
