

I’ve definitely caught myself writing cumTotal += value;
in my code before.
I’ve definitely caught myself writing cumTotal += value;
in my code before.
Back in August '22, I weighed about 270 lbs @ 6’0 (122.5 kg, 183 cm). I realized this was dangerously unhealthy so I asked my doctor if there was any drug options for helping me change habits. As my insurance didn’t cover weight loss, the doc opted for Phentermine. It drastically cut my food cravings and with exercise I’ve been losing weight steadily since. Down to 215 lbs now and the physical benefits are great: no more constant GIRD, can bend over without discomfort, etc.
It is funny though, just finally barely breaking the obese barrier (30 bmi) and people say “and you still want to lose more weight??” My goal is 180.
Edit: As an aside, how fucked is it that insurance companies don’t cover weight loss; wouldn’t covering it reduce their costs over time?
Starsector is amazing, even though buying it on the website made me wonder if the storefront was made in the 90s.
projects/[rust|cpp|python|..]/proj-name
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!
It is - without the quiet zone, it makes detecting the locator pattern really difficult, especially in one’s looking for the 1:1:3:1:1 ratio.
For any not in the loop: https://en.wikipedia.org/wiki/Grigori_Perelman
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.
Coincidentally, I do work on embedded devices, but as mentioned by ferret, most embedded stuff nowadays is (I think?) an Arm variant. Most all of the device code I write is C++ though; no need to get into assembly land unless clang screws something up, but that hasn’t happened yet thankfully. That said, in the future, this may change as we optimize certain imaging algorithms further.
Proficient: Rust, C++, Python, x86-64 ASM, SSE1 SIMD, C#, C, Javascript / Node.JS
Can get by: Java / JNI, Kotlin, Bash
Been a while: Perl, Haskell, Prolog, Labview, Lisp
An absolute classic that I watch every single time. Kamelåså!
I don’t have the source with me, but I recall a paper about listening to various languages under different signal/ noise thresholds. If I recall correctly, languages like German that have multiple declensions were about to better able to parse noisy samples because of the redundant information. Sorry for not having the source off hand though.
I’d argue lexicographically it would be 0000 and 0001 for the first two sets of 4 digits. If you’re looking for combinations w/o replacement, it would be 0123 and 0124.