Closed johnklee closed 1 year ago
I think Leecode question 2894. Divisible and Non-divisible Sums Difference is a good example to show case of FPU. So I will to include this question in our demo cases doc docs/demo_fpu.ipynb.
docs/demo_fpu.ipynb
PR=https://github.com/johnklee/fpu/pull/55
I think Leecode question 2894. Divisible and Non-divisible Sums Difference is a good example to show case of FPU. So I will to include this question in our demo cases doc
docs/demo_fpu.ipynb
.