• 0 Posts
  • 17 Comments
Joined 1 year ago
cake
Cake day: June 15th, 2023

help-circle

  • Sorry, this isn’t helpful. I migrated the hard way, hah. I just went to each page in OneNote and hit ctrl+a, copied that and pasted without formatting into TriliumNext, then fixed the formatting.

    It took some time, but was worth it to me. I figured it would be a good test to help me familiarize myself with TriliumNext a little.

    An easier path to help adoption would probably go a long way, but it also might eat up a lot of development time and routinely need work. I’m not sure how often the OneNote export formats change.

















  • I found this amusing enough to try it out. It does actually compile (I used g++ for this). However, the current implementation just goes into an infinite loop if you enter a number >= 2.

    I think the original author meant to do n -= 1 rn in the tweakin loop that is inside the bussin loop. That way, at some point n % i finna cap will be false, and i will bouta. Which then makes the expression i <= n in the bussin loop eventually false, so we stop bussin and yeet cap rn.

    However, that would mean that the intention of the program isn’t to output prime factors, because even with this fix it does not do so. The structure of mf chief() also doesn’t suggest that is the purpose as it is missing another tweakin and sussin like this example of calculating prime factors in C++.

    Example run:

    $ ./zpp.exe
    Enter a number larger than 1: 50
    2
    7
    8
    47