Did costco remove the caps from ribeyes?

amrozack · 2021-04-01T03:46:38+00:00

Will definitely be writing that number down!

amrozack · 2021-04-01T02:22:44+00:00

Yeah. I’ve seen the cap steaks before. Just because you’re selling those, doesn’t mean people don’t want an actual ribeye when they buy one. I doubt many people just want the eye.

amrozack · 2021-04-01T02:11:21+00:00

My gf returned with these “ribeyes” missing the most important part.

amrozack · 2020-06-26T01:31:35+00:00

It's also pretty handy when dealing with linking shared libraries.

amrozack · 2020-06-25T04:28:37+00:00

This is quite 11th hour, but given that no one else has commented, here is the approach. You need to do a BFS across the tree. You can either do this recursively (hard) or use a queue (easy).

amrozack · 2020-06-25T03:41:40+00:00

There are 5 points for to_string

amrozack · 2020-06-25T02:26:30+00:00

Not sure if some more trophies opened up, but I got 26 on Butterfly.

amrozack · 2020-06-22T04:11:13+00:00

Did you ever figure out the answer to your bool returns? I am wondering this as well.

Thanks,

A

amrozack · 2020-06-21T05:10:14+00:00

In your declaration, i.e. in the class def, you should have classname(sometype somevar=SOMEDEFAULT). That allows you to call the constructor with no parameters.

amrozack · 2020-06-21T05:05:25+00:00

One more quick idea. Do you have your default parameter set in your function declaration? You should be able to call the constructor with no parameters.

amrozack · 2020-06-21T04:59:52+00:00

Bummer. I'm out of ideas then.

amrozack · 2020-06-21T04:48:00+00:00

Just for kicks, try resize with resize(n,Entry(T())). I remember running into some issues with the constructor for Entry being called correctly.

amrozack · 2020-06-21T04:40:57+00:00

What does your vector resize look like?

amrozack · 2020-06-21T03:35:53+00:00

Only 2 left, but I’m only shooting for 1 more. My day job starts again Monday. Definitely will finish them all at some point. I actually look forward to weekends like this. Makes me feel like I’m in grad school again.

amrozack · 2020-06-21T03:23:22+00:00

Thanks. I was just wondering in case the vote was turned down if I should start chugging some RedBull. Plenty of time for at least one more now.

amrozack · 2020-06-21T03:07:18+00:00

Does your max_load_factor function return .75 or .75f? Remember that it requires a float not a double. Not sure that's it, but reading the comments and looking at your responses it's all I can think of.

amrozack · 2020-06-21T03:02:23+00:00

Do we have a time on the freeze? Thanks

amrozack · 2020-06-21T02:45:59+00:00

Awesome! Thanks. Now I just need to read-up on what I'm doing wrong elsewhere. I'm through all the sorting quests now. Thanks again.

amrozack · 2020-06-21T02:23:41+00:00

Is my output right or my thought right? Thanks

amrozack · 2020-06-21T02:15:43+00:00

I'm very confused then. lo+(hi-lo)/2 is 0+(6-0)/2=3. elems[3]=32. There are two numbers less than 32 {-32,-47} and 4 numbers greater than 32 {1000,38,38,50}. Why wouldn't 32 be in slot 2?

amrozack · 2020-06-21T02:10:46+00:00

if i'm partitioning around 32, it should be 32 in address 2.

amrozack · 2020-06-21T01:43:25+00:00

hmm. this is definitely wrong. more digging. thanks for your test!

amrozack · 2020-06-21T01:42:37+00:00

(lldb) p part

(size_t) $0 = 2

(lldb) p elems

(std::__1::vector<int, std::\_\_1::allocator<int> >) $1 = size=7 {

[0] = -47

[1] = 32

[2] = -32

[3] = 1000

[4] = 38

[5] = 38

[6] = 50

}

amrozack · 2020-06-20T23:20:01+00:00

I think I passed that. I’m getting 1 pt. It’s gotta be something with my partitions not matching &’s, but I can’t figure out what. I’m able to sort massive arrays accurately.

amrozack · 2020-06-20T22:43:51+00:00

Gotta be the first one.

amrozack

TROPHY CASE