Comments
0
On fsociety00 → Maximize LCM, 7 years ago
+5

Yeah. Maximum GCD is the maximum number which divides n. We can find that in O(sqrt(n)). So finally we have to maximize LCM for n/(maximum number which divides n) which is the smallest prime number which divides n. So that problem reduces to the problem which I mentioned in the blog.
On pllk → CEOI Contest Collection, 7 years ago
+13

Are editorials of these contests available?
On fsociety00 → SPOJ QTREE4, 7 years ago
0

Auto comment: topic has been updated by fsociety00 (previous revision, new revision, compare).
0

chemthan Could you please explain this in brief?
On Hernan → Far Manager as IDE, 8 years ago
0

How can we use snippets (like in sublime text) in far manager?
+1

.
0

Can anyone tell me how to solve Vasya and little Bear problem (3rd problem) ??