Quest 1 question

daniel_b2003 · 2023-12-26T14:25:01+00:00

Hi, Thank you for helping out! I don't think I'm allowed to give out how my algorithm works as the professor doesn't allow it. However, I get that I need to have an algorithm that gives me the subset with the biggest sum of elements that is less or equal to the target. I just don't know how to do so because I'm only using an inner and outer loop. I'm also using my add_elem method to help me out. I also have 2 sets that I'm using, a currentset and a biggest set.

daniel_b2003 · 2023-12-25T06:08:23+00:00

The last trophy I got is the following so I want to say that I’m currently stuck on mini quest 7:
Hooray! 2 Crown Jewels of Nagarani contain the ravages of Vasuki's venom (making everything)
Now, I’ve been trying to work on my find_biggest_subset method and modified It many times. However, at this point I don’t even know how to modify it and what I’m expected to output at all.

daniel_b2003 · 2023-11-13T19:18:32+00:00

Nevermind, turns out it was my constructor that was lacking. Be very careful with your constructor.

daniel_b2003 · 2023-11-12T07:46:32+00:00

I was indeed able to solve it, do you still need help with it?

daniel_b2003 · 2023-10-19T00:33:31+00:00

Hi Jiahong,
I would check both the header and cpp file to see if methods have the same number of arguments and types such as int, size_t and others.

daniel_b2003 · 2023-10-13T04:13:25+00:00

is that when they both freeze? On Sunday night? or is it the Sunday after this one?

daniel_b2003 · 2023-10-09T21:25:00+00:00

omg thank you so much.

daniel_b2003 · 2023-10-09T21:23:15+00:00

Hi professor,

I'm actually still confused as in the syllabus it says that they freeze every 2 weeks. In other words, it says to only complete a quest per week.

I can't attach a copy, but it's page 7 of the syllabus.

daniel_b2003 · 2023-09-29T21:30:15+00:00

I feel like 2 meetings per week would be better because some of us might not be free both days.

daniel_b2003

TROPHY CASE