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.
C++
No issues in this repository yet.
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.
C++
No issues in this repository yet.