Jump to content

Greedy algorithm for Egyptian fractions: Difference between revisions

m
Minor edit to C++ code
m (Minor edit to C++ code)
m (Minor edit to C++ code)
Line 488:
os << i;
std::string s = os.str();
if (s.length() > max_digits) {
s = s.replace(max_digits / 2, s.length() - max_digits, "...");
}
return s;
}
1,777

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.