Ok, I recalled wrong, it was unspecified
Ok, I recalled wrong, it was unspecified
Yeah. I once had to do stuff to code that had bit-fields like that and after a while, realised (by means of StackOverflow) that that part is UB and I had to go with bitwise operations instead.
I honestly thought the system had multiple terminals, allowing multiple users working at the same time (like a ye olde mainframe) and you were adding up the time.
I had been looking for how to add Expandable sections using HTML.
Couldn’t find it when I googled it.
Now, after almost a year of having given up, found it.
I watched too much of power rangers on TV as a child.
As a result, I don’t find the anime enjoyable.
Even though the premise was fun, I just couldn’t tolerate it enough to feel the fun.
Your silly joke was on Programmer Humour. You might find geeks and nerds here.
Overthinking is our ikigai.
Now get out of line and continue with further analysis of the ‘un’
Hey, @[email protected] is just looking for a “Username checks out” reply.
The thing is that ‘un’ is different from stuff like ‘not’, ‘non’ and the likes, because it is not just denying the referred word but saying that the effect of the referred word was reverted somehow.
You put the double ‘un’ but forgot the double ‘dead’.
Oh, I didn’t realise you were actually catching the thing mid statement.
Still:
Sure, having something Thermodynamically accurate instead of just acting like humans created heat out of nothing (or out of food that was unproduceable from some source that couldn’t give machine energy) would have made me more satisfied with the movie.
But would I have paid more for it?
Nice stuff.
I got sold on the :
EOF
does not consume less space than “5”
because, even though the space taken by the filesystem is the fault of the filesystem, one needs to consider the minimum information requirements of stating starts and ends of files, specially when stuff is split into multiple files.
I would have actually considered the file size information as part of the file size instead (for both the input and the output) because, for a binary file, which can include a string of bits which might match an EOF
, causing a falsely ended file, would be a problem. And as such, the contestant didn’t go checking for character == EOF
, but used the function that truly tells whether the end of file is reached, which would, then be using the file system’s file size information.
Since the input file was a 3145728 bytes and the output files would have been smaller than that, I would go with 22 bits to store the file size information. This would be in favour of the contestant as:
On the other hand, had the contestant decided to break the file between bits (instead at byte ends), instead of bytes (which, from the code, I think they didn’t) the file size information would require an additional 3 bits.
Now, using this logic, if I check the result:
From the result claimed by the contestant, there were 44 extra bytes (352 bits) remaining.
+ 22 bits for the input file size information - 22*219 bits for the output file size information because 219 files
so the contestant succeeds by 352 + 22 − (22 × 219) = −4444
bits.
In other words, fails by 4444 bits.
Now of course, the output file size information might be representable in a smaller number of bits, but to calculate that, I would require downloading the file (which I am not in the mood for.
And in that case, you would require additional information to tell the file size bits. So;
22
in the inputqalc
says, log(3145728 / 219, 2) = (ln(1048576) − ln(73)) / ln(2) ≈ 13.81017544
But even then, you have 352 + 5 + 22 − (5 + (14 × 219)) = −2692
for the best case scenario in which all output file sizes manage to be under 14 bits of file size informations.
More realistically, it would be something around 352 + 5 + 22 − ((5 + 14) × 219) = −3782
because you will the the 5 bits for every file, separately, with the 14
in this case, be a changing value for every file, giving a possibly smaller number.
If instead going with the naive 8 bit EOF
that the offerer desired, well, going with 2 consecutive characters instead of a single one, seems doable. As long as you are able to find enough of said 2 characters.
After going on a little google search, I seem to think that in a 3MiB file, there would be either 47 or 383 (depending upon which of my formulae was correct) possible occurrences of the same 2 character combination. Well, you’d need to find the correct combination.
But of course, that’s not exactly compression for a binary file, as I said before, as an EOF
is not good enough.
I was once about to file a bug report for the library, when I found out my stupidity.
So you mean there are laptop USB ports out there without current limiters?
I would want to check my PC’s ports, but I am not filthy rich, so I’ll just assume stuff is not current limited.
And that is why you don’t use JS on your backend.
Because you don’t want to be losing 5 BTC
The x86 CPU will be 2 additional layers
“But I want it to do something other than that!”
If those project managers could read, they would actually be able to use Jira.
I regret what I wrote.
I realised, just being able to read, doesn’t make sure they can actually use Jira
Make sure to convert 1/2
to February
They change it because they need more money. (talking about Excel here)
And soon you’ll see ads in the fn suggestions drop down
and ads in unused cells
and ads while the Solver is running (made in VisualBasic, running on top of WebAssembly, running on interpreted Python, using a Java Interpreter on your Web Browser to make sure you watch the ad for as long as possible)
And that’s why we need to make our own spreadsheet software.
A few minutes after posting this, I realised that it actually showed the entry that you selected in the above view.
So, it was a HTML browser widget and it was white because everything that shows HTML has a FFFFFFacepalm background by default.
I need to fix that background colour. Or I will end up keeping that thing hidden forever.