If you’d like exact rates, you can use belts of various speeds & smart splitters, eg.:

Need 300, so take a higher belt (eg one of the 455) and smart split off into a mk3 belt (270), and overflow the rest. You should now have a full mk3 270 belt and 185 remaining (overflowed). From that you can smart split into a mk1 (60), and split it in two (30, 30). Take one of those and merge it with the 270 from before and you’ve now got 300, with 125+30 remaining for more siphoning off. Basically, 300=270+60/2.

Similarly, you could do 2000=1200+780+60/3. The rest is left as an exercise to the reader.

I’m a little confused on the exact request here. Do you have those pictured lane rates now, and need to combine/ split them into the ratios above (2000, 300, e.t.c)?

projects/[rust|cpp|python|..]/proj-name

Your son has good instincts!

Exactly same. Gf & I got into it a few weeks ago and just caught up to current. We’re champing at the bit to see what happens next.

Jade #1!

video-sizes

I’m confused as to your meaning here. Current codecs are miles ahead of what we had in the past. Unless you mean typical resolution (eg. 4k, 8k, etc).

For the purposes of OPs problem (P v NP), it considers not particular solutions, but general algorithmic approaches. Thus, we consider things as either Hard (exponential time, by size of input), or Easy (only polynomial time, by size of input).

A number of important problems fall into this general class of Hard problems: Sudoku, Traveling Salesman, Bin Packing, etc. These all have initial setups where solving them takes exponential time.

On the other hand, as an example of an easy problem, consider sorting a list of numbers. It’s really easy to determine if a lost is sorted, and it’s always relatively fast/easy to sort the list, no matter what setup it had initially.