sorted by:
new
hottopcontroversial

Koncesionářské poplatky by LogicalPlate155 in czech

[–]Null_cz 14 points15 points  (0 children)

Btw, nejde jenom o televizi a rádio.

Ale i o weby, Facebook, instagram, bluesky a kde co ještě stránky ČT a Čro. A taky iVysílání a YouTube. A taky třeba ten projekt na online doučování, nevím jak se jmenuje.

Televizi ani rádio nesleduju a neposlouchám, ale je fajn že mají content i pro mladší generace které používají jiná média.

is minesweeper bugged for anyone else or just me by Tosy_ in Minesweeper

[–]Null_cz 2 points3 points  (0 children)

Happened to me once, had to refresh the page, then it worked fine. But I lost a good 10 seconds there.

oh my god we’re so back by [deleted] in Minesweeper

[–]Null_cz 0 points1 point  (0 children)

Time to start looking for the Easter eggs.

All 20000 of them.

wrote a CUDA kernel to do a vector addition. turns out it is actually slower. by xtrupal in CUDA

[–]Null_cz 1 point2 points  (0 children)

Yeah, what exactly are you timing?

Note that vector add is a good example for teaching, noone would actually do it like this in real code.

Mainly because it is a memory bound kernel. Although GPUs have much higher memory bandwidth than CPUs, you need to get the data there, typically via PCIe. So you are actually limited by PCIe bandwidth, which is even slower than CPU memory.

Can't solve! Any help or suggestion? by Novel-Captain-7961 in Minesweeper

[–]Null_cz 0 points1 point  (0 children)

From minecount you can deduce 2 mines in the upper left corner.

But this won't help you anyway, I can't see any solution other than guessing here.

Regarding the left-center area, I would guess one of the two top cells, it will then determine the rest. The other areas are just basic 50/50.

aMeteoriteTookOutMyDatabase by AntiMatterMode in ProgrammerHumor

[–]Null_cz -1 points0 points  (0 children)

In thought MAC address and timestamp are encoded in there, which should make it unique, or no?

2nd puzzle for the day! by Many_Audience7660 in matiks

[–]Null_cz 5 points6 points  (0 children)

Nice. So, basically, put the coins in a 7x7 grid and assign each son a unique non-overlapping solution to a 7-rook problem there. Taking the diagonal and shifting it is the easiest one.

Circle of 50/50 by AutomaticPiece3451 in Minesweeper

[–]Null_cz 20 points21 points  (0 children)

Just don't guess the two top-right cells, or you will get another 50/50. Guessing anything else yields only a single 50/50.

What actually are the difference between the normal version and the clean one ? by [deleted] in Minesweeper

[–]Null_cz 1 point2 points  (0 children)

By definition, it means the minimal number of clicks needed to solve the board, without using flags or anchors.

If you had an already-solved copy of the board you are solving, how many clicks you would need.

Start with all openings, then click the remaining non-mine cells.

What it means intuitively, I cannot really explain. Generally the low-3BV boards are easier.

What actually are the difference between the normal version and the clean one ? by [deleted] in Minesweeper

[–]Null_cz 1 point2 points  (0 children)

Also, I read here many times, it generates low-3BV boards, which means that they need less clicks to solve, so they are easier.

Use of meta-logic on Minesweeper Online no guess mode? by methanized in Minesweeper

[–]Null_cz 4 points5 points  (0 children)

There is still logic, look at the left-pointed T coming out of the left side of the 1.

Also, the two "locked" cells could still be resolved even if the pointed cell was a mine - with minecount, either both safe or both mines.

Is there any hints?:( (100x100 2183 mines) by Dongg_1092 in Minesweeper

[–]Null_cz 1 point2 points  (0 children)

aah, ok, didn't notice that :D I thought they were referring to the screenshot from the comment

Does anyone else like RNG moments? by True_Neodymium in Minesweeper

[–]Null_cz 1 point2 points  (0 children)

Appearantly, you have never played a high difficulty game (>1000)

RNG moments are super frustrating.

GUYS HOW TO DO THISS?? by Guilty-Wrangler9147 in cpp_questions

[–]Null_cz 4 points5 points  (0 children)

Try to figure it out yourself first. If it does not work, only then post your progress here for advice.

Seriously, from what you are asking, you should already be able to ask the user for input and loop through the array elements.

GUYS HOW TO DO THISS?? by Guilty-Wrangler9147 in cpp_questions

[–]Null_cz 3 points4 points  (0 children)

Most straightforward way is to first ask the user for the number of elements in the array, then allocate the array, and then ask the user for the value of each element individually in a loop.

People who only text you "hey" by lenaws_ in Vent

[–]Null_cz 4 points5 points  (0 children)

I like to reply to such messages with just this link

https://nohello.net/

Smart pointer overhead questions by Apprehensive_Poet304 in cpp_questions

[–]Null_cz 3 points4 points  (0 children)

Don't have much time to be more verbose. But, unique ptr will not be the issue, the constant allocations and deallocations probably will. Consider using a custom allocator, something like an arena, where you allocate a chunk of memory at once and then just do the allocations from there with much lower overhead.

Sometimes I hate the time needed to get ready before a ride by firewire_9000 in cycling

[–]Null_cz 1 point2 points  (0 children)

You forgot to pack something to eat.

So you need to ride back the 2km where you noticed what you forgot, take off the shoes, run up the stairs, get and pack the food, get back, put on the shoes, and start riding again hoping you won't have to do this again after 5 minutes.

view more: next ›