conversation_id int64 1 206k | help_channel stringlengths 6 7 | __rowid__ stringlengths 32 32 | author_id int64 62,061,868B 1,071,443,446B | author_name stringlengths 2 32 | timestamp stringlengths 19 19 | content stringlengths 0 3.97k | reference.messageId stringclasses 3
values | reference.channelId stringclasses 3
values | reference.guildId stringclasses 1
value | url stringlengths 0 591 | fileName stringlengths 0 513 | student int64 0 1 | helper int64 0 1 | references.id float64 62,061,868B 1,071,056,124B ⌀ | references.name stringlengths 2 32 ⌀ | references.discriminator stringlengths 4 4 ⌀ | references.nickname stringlengths 1 32 ⌀ | references.isBot bool 2
classes |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:03:25 | There's one more | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:03:58 | $(\frac{1}{a^b}) = (\frac{1}{a})^b$ | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 510,789,298,321,096,700 | TeXit | 04/13/2022 16:04:01 | **Umbraleviathan** | 349354952961032192.png | 0 | 1 | null | null | null | null | null | ||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 305,000,141,432,291,300 | PoTeTo | 04/13/2022 16:04:52 | opera_DK1uDLVhDR.png | 1 | 0 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 305,000,141,432,291,300 | PoTeTo | 04/13/2022 16:05:00 | can we look at this one as well please? | 1 | 0 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:10:31 | I gotta go | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:10:33 | But like | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:10:37 | Maybe someone ale can | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:10:41 | But it's gonna be the same thing | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 305,000,141,432,291,300 | PoTeTo | 04/13/2022 16:10:44 | @Umbraleviathan just whats it diffent if its x+1 and x-1 | 1 | 0 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:10:51 | Uh | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:11:03 | x-1 will make it a^x • a^-1 | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:11:08 | And use negative exponent laws | 0 | 1 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 305,000,141,432,291,300 | PoTeTo | 04/13/2022 16:11:13 | aight | 1 | 0 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 305,000,141,432,291,300 | PoTeTo | 04/13/2022 16:11:16 | thank you | 1 | 0 | null | null | null | null | null | |||||
1,854 | help-10 | e1933a2fd0de4f5f9731024cdcde0d6b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 16:11:19 | Np | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 16:34:44 | 1 | 0 | null | null | null | null | null | ||||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:04:30 | @Helpers | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:19:25 | What formula is that? | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:19:47 | its artihmetic progression | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:20:06 | Standard formula is k(k+1)(2k+2)/6 | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:20:37 | huh , we use Sn = n/2(a1 + an) | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:20:48 | nevermind i just skip that one | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:21:06 | Is your series on that form? | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:21:12 | yea | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:21:17 | No it is not | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:21:22 | it is | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:21:27 | No it is not | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:21:31 | yes it is | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:21:35 | Which you clearly also see | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:21:39 | Because you get a wrong answer | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:21:42 | NO IT IS NOT | 0 | 1 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:21:49 | hmm | 1 | 0 | 349,354,952,961,032,200 | Umbraleviathan | 3607 | Umbraleviathan | false | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:22:01 | i hate maths | 1 | 0 | null | null | null | null | null | |||||
1,855 | help-10 | a2444d3e14984899a2dd8e0b3a662fdd | 263,808,451,510,140,960 | Kaprinko | 04/13/2022 17:22:03 | .close | 1 | 0 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 265,853,506,664,136,700 | ScapeProf | 04/13/2022 17:22:45 | When I ask is in on this form maybe recheck what arithemetic progression even is before saying “yes” multiple times | 1 | 0 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:40:34 | I am able to do (a) and the first part of (b). However I am unsure on how to approach the second bit of (b) and the entire of (c). | IMG_6819.jpg | 0 | 1 | null | null | null | null | null | ||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:44:07 | Ah I see | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:44:10 | Okay so | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:44:16 | Use your limit chain rules | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:44:45 | C(1 - exp( [lim] -at)) | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:44:49 | Im too lazy to use latex | 0 | 1 | 263,808,451,510,140,960 | Kaprinko | 8673 | Kaprinko | false | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:44:49 | I may have not learnt that yet | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 261,933,205,387,477,000 | riemann | 04/13/2022 17:45:04 | you haven't learned limits but you're doing differential equations? | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:45:14 | Nope, this was just given | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:45:20 | They usually don't teach limit chain rules | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:45:40 | Which is dumb, they should | 0 | 1 | 263,808,451,510,140,960 | Kaprinko | 8673 | Kaprinko | false | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:45:49 | Or whatever it's called | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:45:55 | Oh, i’ll look that up right now | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 261,933,205,387,477,000 | riemann | 04/13/2022 17:46:01 | https://www.youtube.com/watch?v=_MbyTm9H48c | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:46:28 | Thank you | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:46:35 | Basically you wanna take the limit of the actual t | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:46:44 | And then take that value | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 349,354,952,961,032,200 | Umbraleviathan | 04/13/2022 17:46:54 | And use it as part of the function | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:49:22 | Ohh | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:49:24 | Ok 👍 | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 884,904,554,037,141,600 | dk.dkn | 04/13/2022 17:52:54 | Idk if he's from here, but in the UK standard curriculum is that significantly more is taught about differential equations before anything more than a basic understanding of the concept of a limit is taught | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:54:32 | Yep from UK, the concept of limit wasn’t really taught much | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:54:54 | Probably with differentiation but it was more of just memorising than explaining | 0 | 1 | 263,808,451,510,140,960 | Kaprinko | 8673 | Kaprinko | false | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 17:55:47 | The limit video still confused me but i’ll just try to solve it | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 884,904,554,037,141,600 | dk.dkn | 04/13/2022 17:58:07 | Yeah there's much more to limits and solving them than differentiation from first principles | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 884,904,554,037,141,600 | dk.dkn | 04/13/2022 17:58:49 | There's some limit stuff in FP1 | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 18:06:08 | I think i’m okay doing the rest of the question so thank you | 0 | 1 | null | null | null | null | null | |||||
1,856 | help-10 | 5de6e3ab360641ce8b61bfc1fc8d919b | 944,989,707,996,131,300 | hypnos | 04/13/2022 18:06:15 | .close | 0 | 1 | null | null | null | null | null | |||||
1,857 | help-10 | 49031129f17742caaa4d1ab80363b2ad | 613,891,196,233,842,700 | xlz | 11/12/2021 19:34:14 | .reopen | 1 | 0 | null | null | null | null | null | |||||
1,857 | help-10 | 49031129f17742caaa4d1ab80363b2ad | 613,891,196,233,842,700 | xlz | 11/12/2021 19:34:16 | @Helpers | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:17:43 | I need help with some combinatorial optimization.
The problem I am trying to solve is this: Say I have an item that I want to craft, which requires a certain amount of 6 elements in order to craft, those elements being Wind, Water, Life, Fire, Void, and Death. In order to craft this, I must combine parts which each hav... | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:32:39 | @Helpers | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:33:36 | > Say I have an item that I want to craft, which requires a certain amount of 6 elements in order to craft, those elements being Wind, Water, Life, Fire, Void, and Death. In order to craft this, I must combine parts which each have their own elemental values. What is the minimum amount of parts needed to craft an item ... | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:34:53 | There aren’t any rules, you can have as many of the same item as needed, and there are no forbidden combinations | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:36:38 | if you have 1 wind, can that turn into 6 elements? 1 of each element | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:38:14 | Every item you would be combining is guaranteed to have some integer amount of the 6 elements. So one might have 5 wind, 3 water, 0 life, -6 fire, 3 void, and 2 death | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:38:39 | And say, for example, you have an item that you want to craft that requires 50 wind, 25 water, 0 life, 15 fire, 70 void, and 30 death | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:39:09 | In my real data set, I have 69 possible items to be combined, each with their own elemental values | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:42:05 | just pick an order for your 6 elements, say alphabetical, and phrase your problem in terms of vectors of length 6 | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:42:51 | you have `[d,f,l,v,wa,wi]` of stuff. what is your question regarding crafting | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:43:34 | $[d,f,l,v,wa,wi] \in \N^6$ | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 510,789,298,321,096,700 | TeXit | 04/13/2022 18:43:36 | **riemann** | 261933205387477002.png | 0 | 1 | null | null | null | null | null | ||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:48:04 | So, I want to figure out the combination using the least number of items | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:48:29 | so you want to minimize $d + f + l + v + wa + wi$ subject to some constraint. define that constraint | 0 | 1 | 261,933,205,387,477,000 | riemann | 2529 | riemann | false | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 510,789,298,321,096,700 | TeXit | 04/13/2022 18:48:32 | **riemann** | 261933205387477002.png | 0 | 1 | null | null | null | null | null | ||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:49:01 | Hmmm | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:49:27 | Well I would want the number of items used to be as close to 0 as possible, is that a valid constraint? | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 18:51:22 | > Say I have an item that I want to craft, which requires a certain amount of 6 elements in order to craft, those elements being Wind, Water, Life, Fire, Void, and Death. In order to craft this, I must combine parts which each have their own elemental values. What is the minimum amount of parts needed to craft an item... | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 18:54:44 | you have 69 types, with unlimited amount of each right? | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 18:55:37 | yeah, you said as many as needed ok | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 18:58:27 | I must add the values of an item's respective elemental values to a running total based on that element. If I combine a dinglehopper with wind = 6, water = -2, life = 3, fire = 7, void = 0, and death = 5, with a tinglestopper, with a wind = 2, water = -4, life = 0, fire = 2, void = 1, and death = 7, the total is wind =... | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 19:00:12 | Yea this is a dynamic programming problem | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 261,933,205,387,477,000 | riemann | 04/13/2022 19:00:28 | I'd look on leet code for something like this | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:08:27 | it's linear programming | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:08:52 | from wiki on simplex method | unknown.png | 0 | 1 | null | null | null | null | null | ||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:09:23 | it's exaclty like this, you minimize a+b+c+d... | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:09:52 | and you have conditions like -7a + 4b ... >= something | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:15:37 | (unless it can't handle negatives) | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 19:16:37 | So how would I state that the number of items should be as close to zero as possible? | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:18:30 | "minimize a+b+c+d+e" | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:18:44 | i found a problem, it's about reals | 0 | 1 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 19:19:36 | Could this be related? https://en.wikipedia.org/wiki/Integer_programming | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 212,786,578,513,199,100 | Kraio | 04/13/2022 19:21:52 | Also, what does Z represent? | 1 | 0 | null | null | null | null | null | |||||
1,858 | help-10 | 219354cc5b974ba59b353ed1c8af6179 | 141,791,176,540,946,430 | frownyfrog | 04/13/2022 19:25:42 | it's just the target | 0 | 1 | null | null | null | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.