Cod sursa(job #1111359)
Utilizator | Data | 18 februarie 2014 20:20:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("desen2.in");
ofstream g("desen2.out");
int la,lu,a1,a2;
int main()
{f>>lu>>la;
a2=max(lu,la);
a1=min(lu,la);
while (a2%lu!=0 || a2%la!=0)
a2=a2+a1;
g<<a2<<'\n';
g<<(a2*a2)/(lu*la);
f.close();
g.close();
return 0;
}