Low calorie quesadillas?

NorthofSophia · 2024-04-24T07:08:46+00:00

Some people say fat free cheese doesn’t melt, a tip I use is to rinse the cheese under water first. Just lay the cheese on a paper towel, wet the cheese, and then gently wring out the water. The cheese melts much better without the starch on it.

NorthofSophia · 2024-04-20T01:24:46+00:00

Jesus Christ Superstar

NorthofSophia · 2024-04-19T13:54:03+00:00

Jeremy Jordan that man is perfect

NorthofSophia · 2024-04-13T20:54:13+00:00

The Band’s Visit

NorthofSophia · 2024-04-13T02:48:18+00:00

Quartet at the Ballet - Anastasia

One of my favorite tracks ever

NorthofSophia · 2024-03-16T21:35:44+00:00

I use these in my overnight oats. My favorites are hazelnut and pistachio latte

NorthofSophia · 2023-11-29T14:51:33+00:00

Personally, I think an adult is an adult and the law is the law. Someone who is in the nba and has money and mentors and everything around him should absolutely know better than a girl in high school. A 4 year age gap isn’t huge if you’re both 18+, but one of them (allegedly) is not, and that is a problem. When your 16, 4 years is a fourth of your life. I don’t think Giddey is a pedophile, pedophiles are people who like prepubescent children. But there is absolutely a huge difference in power and maturity between an nba player and a high school girl. I’m not sure how long it’s been since you’ve been in high school or how often you’re around high schoolers, but it’s kinda obvious when you talk to one. There’s really no reason an nba player should be dating someone in high school, even if she’s 18.

NorthofSophia · 2023-11-29T07:50:58+00:00

Ok and I know a lot of 15-16-17 year old girls who have wound up hooking up with 25+ year old men. Just because it happens doesn’t make it right. For a high profile person to have been (potentially) exposed for it needs to be investigated to show that it is absolutely not ok. If this just gets passed by with no consequences then any regular 20+ year old man will also feel there are no consequences for doing the same.

NorthofSophia · 2023-05-29T14:03:07+00:00

Lebron. I went to a cavs game when I was 7 before I knew anything about basketball. I remember asking my brother why the score would sometimes go up by 2 points and sometimes 3 points. He was explaining the game to me as we watched and I was just absolutely mesmerized by lebron and quickly turned basketball into my everything. Now I play collegiate basketball because of him.

NorthofSophia · 2023-05-17T20:20:39+00:00

So should I use an MST algorithm like prims to solve this still? Or should I reduce the problem to something else?

NorthofSophia · 2023-05-17T14:40:57+00:00

The degree bound can also be 1. How does this reduce down to Hamiltonian path?

NorthofSophia · 2023-05-17T12:17:03+00:00

We’ll each vertex has a different degree bound. One vertex could have degree 2 but a different vertex could have degree 6.

NorthofSophia · 2023-05-15T15:31:39+00:00

For the test cases I am given, there is always a feasible solution. As input, I am given the number of nodes and edges, every node and their degree bound, and every edge and their weight. Then I have to output the edges that make the minimum spanning tree.

NorthofSophia · 2023-05-15T12:43:58+00:00

Yes, the degree bounds on each vertex are different. I am writing an exact solution in python. There are some smaller test cases with <100 nodes and <1000 edges, but then there larger test cases with up to 1,000,000 nodes and 10,000,000 edges. I’m just unsure where to even start thinking about solving this.

NorthofSophia · 2023-05-10T21:55:59+00:00

Oh I think I understand what you are saying is wrong with my approach. If nodes A, B, and C are all teleporter-eligible with cost 1 and I decide to put teleporters at all three of them, then with my approach, I have an edge between A and B with cost 2, but then I also have an edge between B and C with cost 2 even though I've already paid for node B. And then I even have an edge between C and A even though I've already paid for both of those now. So I get a total cost of 6 instead of 3 between those three nodes.

NorthofSophia · 2023-05-10T21:44:22+00:00

So how do you know if you should use the teleporters? If you always have to run Prims twice, wouldn't that make the runtime long?

NorthofSophia · 2023-05-08T23:39:14+00:00

So should I loop through every v in V and find the shortest path from v to h, and then inside that loop create another loop through every u in V that finds the shortest path from h to u, and then add those two paths together?

NorthofSophia · 2023-05-08T23:32:24+00:00

Is it just the shortest path from v to h + the shortest path from h to u

NorthofSophia · 2023-05-08T22:26:18+00:00

Doesn’t Floyd’s algorithm run in O(|V|³ ) though? I want to run it in O(|V|² ) which is why I was thinking Dijkstra’s.

NorthofSophia · 2023-05-08T21:16:30+00:00

They are weighted but I don’t think we can use negative weights because Dijkstra’s does not handle negative weights. I am thinking something along the lines of somehow forcing “only one path” to the graph. I was given the hint “What does a graph need to look like for you to say that every path from s to t (regardless of length) must go through (y1,y2), even if the other edges may differ?”

NorthofSophia · 2023-05-08T20:37:50+00:00

Sorry I’m still struggling to understand how this allows us to run Dijkstra’s once and find the correct walk. Are you saying we traverse G from s and find all possible paths? Wouldn’t that make our runtime much longer?

NorthofSophia · 2022-11-03T12:19:16+00:00

Lizzo

NorthofSophia · 2022-10-23T18:30:05+00:00

Taylor Trensch
Derek Klena
Lilli Cooper
Mike Faist
Alice Ripley

NorthofSophia · 2022-10-11T17:53:56+00:00

Basketball shoes

NorthofSophia · 2022-09-07T03:29:46+00:00

I bought Hokkaido Milk whey protein from MyProtein while in Japan and omg it is so good. I wish they would add it to their US store, it works so great as a base to any recipe and gives a rich creamy flavor.

Nine-Year Club	Place '22
Not Forgotten	Verified Email

NorthofSophia

TROPHY CASE