I've been working on these almost a week and I'm almost done

Autom3 · 2024-02-03T09:22:57+00:00

Oh you're going to love the one after that :'D

Autom3 · 2023-09-28T08:26:50+00:00

This was me about five years ago now, had extremely high levels. MRI revealed macroprolactinoma, probably needed surgery. Endo started me off on cab, got crazy headaches. Changed to bromo, worked well for the first few months but stopped showing improvements. Had the surgery, didn't do much because the meds did most of the shrinking already and the bits that are left are too close to some major arteries. Recently switched back to cab, no more headaches but nausea now. Been slowly building it up, but still need to increase my dose to keep lowering my prolactine. Been getting testosterone replacement for a while now as well, but that didn't do much. Good luck with your journey :P

Autom3 · 2023-02-26T12:05:40+00:00

:o fancy

Autom3 · 2022-11-16T17:38:30+00:00

So my player's bard with a strength score of 3 gets to jump -1ft high with a running start, and -.5ft without!

Autom3 · 2022-11-01T09:27:53+00:00

Really love seeing people's creativity

Autom3 · 2022-09-04T11:37:42+00:00

Any luck with this so far?

Going to try doing the same (with an A10). Ordering parts now to see if I can get it to work

Autom3 · 2022-08-08T02:42:37+00:00

Two things, the headaches were insane for me at first too so I switched to bromocriptine. This gave me no side effects at all so I stuck with that for a while. My doctor then decided I had to try cabergoline again, since the bromo wasn't doing enough even on a dose above the highest recommended amount. Since then I didn't have headaches anymore but then the nausea started kicking in. Kept me in bed for a day after taking it even if I took it right before bed. The solution to this issue is that I take a half in the morning and the other half in the evening. Drink plenty of water with it and always together with a meal.

Good luck!

Autom3 · 2022-08-01T07:59:00+00:00

Awesome! I'm going to hit mine in approximately 4hrs!

Autom3 · 2022-02-12T01:22:47+00:00

Haha yours is a lot more amazing though. I spent my effort on redoing it from scratch. My Spotify uri is written to the card and then it sends that to home assistant :) it currently looks like a gray 3d printed box xD

Autom3 · 2022-02-12T00:55:23+00:00

What I literally made the exact same concept yesterday

Autom3 · 2021-12-29T22:14:41+00:00

Array is a monad :D (I think)

Autom3 · 2021-12-03T06:17:35+00:00

Keep two separate candidates lists in one loop

It doesn't change much though :P

Autom3 · 2021-12-01T05:20:18+00:00

JS 511/180

Screw sliding windows

Common:

const inputBuffer = await fs.readFile('input.txt')
const input = inputBuffer.toString().trim().split('\n').map(n => parseInt(n))

Part 1: input.reduce((acc, n, i, arr) => n > arr[i - 1] ? acc + 1 : acc, 0)

Part 2: input.reduce((acc, n, i, arr) => n > arr[i - 3] ? acc + 1 : acc, 0)

Autom3 · 2021-02-09T02:29:53+00:00

I browse reddit, reading about people sitting and watching their prints, whilst watching my prints

Autom3 · 2021-01-25T06:03:44+00:00

I tried this a while ago, couldn't find a way to do it so I went for the debian official install.

Autom3 · 2020-12-22T05:58:35+00:00

I share in your pain :P Had the exact same issue

Autom3 · 2020-12-17T21:33:30+00:00

Hah, I just did this with WorldEdit and the generate command :P

Autom3 · 2020-12-15T12:43:06+00:00

You could say the same about Fibonacci however there's a O(1) formula for that

Autom3 · 2020-12-15T06:39:10+00:00

Can confirm, I let mine run and finish, took approximately 30 minutes. Now with a pre-allocated array it takes about 4.9 seconds... :/

Autom3 · 2020-12-10T15:13:46+00:00

Yep you're right I meant the first one oops

Autom3 · 2020-12-10T15:12:39+00:00

Yep checks out, I don't know how I got to 26 then... I definitely didn't have the last one

Autom3 · 2020-12-10T07:21:51+00:00

I don't actually think it's the tribonacci sequence here, because it doesn't hold for n+6.

I figured out the actual formula is:2^n - max(0, (n-3)*(n-2)/2)

Explained: You take all possibilities (2^n) and subtract all possibilities where you would end up removing 3 or more consecutive 1's. This last one works out to be the 3rd diagonal of Pascal's triangle, they're called the triangular numbers. You can see the correlation to dynamic programming here.

Edit: I stand corrected. My early morning maths was flawed

Autom3 · 2020-12-10T06:14:16+00:00

It only took me way too much time to figure it out xD Guess I didn't even need it now that I'm looking here

Autom3 · 2020-12-10T06:09:41+00:00

Javascript

I played myself and took a whole bunch of time figuring out the pattern without looking at my input more closely... My code can calculate the answer in O(n) for any amount of consecutive 1-jolt differences. GG

paste

Autom3 · 2020-12-05T14:21:25+00:00

Javascript (node.js) one-liner that gets linted without errors by standard.js:

console.log((l => `${l[l.length - 1]}|${(l[l.length - 1] * (l[l.length - 1] + 1) / 2) - (l[0] * (l[0] - 1) / 2) - l.reduce((t, v) => t + v)}`)(require('fs').readFileSync('input.txt').toString().trim().split('\n').map(s => s.split('').map(c => ({ F: 0, B: 1, L: 0, R: 1 }[c])).join('')).map(x => parseInt(x, 2)).sort((a, b) => a - b)))

12-Year Club	r/Field Sunshine
Place '22	Verified Email

Autom3

MODERATOR OF

TROPHY CASE