hi i found this qstn frum career cup pls help to solve this. Given an integer n, compute 2 integers x, y satisfying: n<=x*y<=n+2; |x-y| is minimal. Thanks & Regards Amrit
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/YF1blviMR8kJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
