katarzynaadamczyk/Some_Egyptian_fractions

Given a rational number n, n >= 0, with denominator strictly positive, decompose this number as a sum of rationals with numerators equal to one and without repetitions.

Language: C++ - Size: 309 KB - Last synced at: about 2 years ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0