Greedy algorithm for Egyptian fractions: Difference between revisions

Content added Content deleted

Inline

@@ Line 488: / Line 488: @@
     os << i;
     std::string s = os.str();
-    if (s.length() > max_digits) {
+    if (s.length() > max_digits)
-        s = s.replace(max_digits / 2, s.length() - max_digits, "...");
+        s.replace(max_digits / 2, s.length() - max_digits, "...");
-    }
     return s;
 }