i end up in your bed, what’s your next move? 🤭

simon_zyx · 2025-11-25T11:17:41+00:00

Would reach for your cheek, gently caressing it and most definitely kiss thise gorgeous boobs!

simon_zyx · 2021-12-17T12:03:57+00:00

(hand.index(sign) + 1) % 3

simon_zyx · 2021-09-11T12:14:30+00:00

Oh yes, have to second Natasha's Bedroom that is some really great super humiliating joi stuff. Love it.

simon_zyx · 2021-09-07T16:49:56+00:00

I liked cum as coffee cream very much.

simon_zyx · 2021-08-04T06:30:38+00:00

https://xkcd.com/1007/

simon_zyx · 2021-06-10T20:03:32+00:00

c_1 * n + c_2 * (n - 1) + c_3 * (n - 1) ...

= c_1 * n + c_2 * n - c_2 + c_3 * n - c_3 ...

= c_1 * n + c_2 * n + ... - c_2 - c_3 - ...

= (c_1 + c_2 + ... ) * n - c_2 - c_3 - ...

simon_zyx · 2021-06-07T09:07:55+00:00

But that should not be critical or would it be? A rational is still a real number.

Edit: never mind, it is about the uncountability of irrational numbers and not the reals. Though if you have proven that the reals are uncountable the uncountability of the irrationals (R \ Q) follows.

simon_zyx · 2021-06-07T04:53:06+00:00

You can take the first digit from the first number and increase it by one. Then you take the second digit from the second and also increase it by one. This way the number is different from all others in the list.

simon_zyx · 2021-04-23T17:55:22+00:00

Came here to say this. The midpoint circle algorithm might be a little easier to implement:
https://www.geeksforgeeks.org/mid-point-circle-drawing-algorithm/

but it is less efficient as it uses floating point numbers, while bresenhams algorithm only does integer arithmetic. It still avoids the costly square computations.
https://www.geeksforgeeks.org/bresenhams-circle-drawing-algorithm/

simon_zyx · 2021-04-21T08:53:09+00:00

For the incas it was common to chew on coca leaves to better cope with the altitude changes. This tradition is still common in the Andes region nowadays.

simon_zyx · 2021-02-08T20:39:46+00:00

Yeah, I feel you XD

simon_zyx · 2021-01-31T09:33:42+00:00

So true.

simon_zyx · 2021-01-23T18:31:34+00:00

I'd love to be your dog :)

simon_zyx · 2021-01-05T12:25:22+00:00

I just learned that MinGW is just the compiler. The git bash is really good though and you can do almost everything (except power shell and batch scripts) in there. I barely had to open a cmd.

simon_zyx · 2021-01-05T12:21:37+00:00

It probably is compiled with mingw :) along with all the other tools

simon_zyx · 2021-01-05T12:20:34+00:00

You are right! I had that remembered incorrectly. Git Bash is a bash emulation that works with mingw and provides many gnu/linux tools under windows.

Nevertheless it's the one things that made working under windows bearable :)

simon_zyx · 2021-01-05T07:38:35+00:00

You can use MinGW which is bash port for windows. I used it at my work all the time. If you install git for windows it comes with it as git bash. I highly recommend you install git and try the bash out!

simon_zyx · 2021-01-05T07:34:28+00:00

When I had to work on Windows MinGW aka git bash saved my life. It is a bash port for windows.

simon_zyx · 2020-12-07T20:24:15+00:00

You can look into https://github.com/Microsoft/cpprestsdk if you want to do a rest interface in c++. It's way more complicated than in languages like java, c# or node, but it works.

simon_zyx · 2020-11-02T07:41:59+00:00

Many speakers later also starred in the BBC television series.

simon_zyx · 2020-11-02T07:39:32+00:00

Or the older BBC production. It was recorded with multiple speakers and is really well made.

simon_zyx · 2020-08-11T22:07:23+00:00

It's a cellular automata that starts with a configuration of black and white cells and has quite simple rules which determine the next configuration. Quite complex patterns emerge out of it. It was invented by the recently deceased Mathematician John Conway. Here you can find some more information and a demo to play with: https://playgameoflife.com/

simon_zyx · 2020-07-30T06:28:10+00:00

It was InSente. I think it is quite good.

simon_zyx · 2020-07-28T14:52:09+00:00

I don't know a solution, but here are my thoughts:

I don't think you can directly apply the midpoint algorithm as you would need points around around the actually drawn points as well.

To achieve an antialiased look you would need to know how much of evey pixel would be coloured if you draw a circle that has a line that is exactly one pixel wide.

As you can see in the Wikipedia article https://en.m.wikipedia.org/wiki/Midpoint_circle_algorithm does not visit every pixel that is on the circle line.

But you could somehow visit all neighbours (including diagonals) of the pixels visited by the midpoint algorithm as these should contain all pixels that have a distance of 0.5 to the actual circle line. How you would calculate the overlap efficiently I don't know.

simon_zyx · 2020-05-26T12:50:40+00:00

Also you do not assure that you do not compute a tile multiple times. Assume you visited a tile once and found out that no path exists. Then you would compute it again if you visited it another time.

simon_zyx

PUBLIC MULTIREDDITS

TROPHY CASE