Can a Wild Shaped Druid use weapons to attack?
Can a druid in Ape wildshape use weapons?
Puzzle: Find largest rectangle (maximal rectangle problem) What's the most efficient algorithm to find the rectangle with the largest area which will fit in the empty space?  Let's say the screen looks like this ('#' represents filled area):  .................... ..............###### ##.................. .................### .................### #####............... #####............... #####...............   A probable solution is:  .................... ..............###### ##...++++++++++++... .....++++++++++++### .....++++++++++++### #####++++++++++++... #####++++++++++++... #####++++++++++++...   Normally I'd enjoy figuring out a solution. Although this time I'd like to avoid wasting time fumbling around on my own since this has a practical use for a project I'm working on. Is there a well-known solution?  Shog9 wrote:     Is your input an array (as implied by the other responses), or a list of occlusions in the form of arbitrarily sized, positioned rectangles (as might be the case in a windowing system when dealing with window positions)?   Yes, I have a structure which keeps track of a set of windows placed on the screen. I also have a grid which keeps track of all the areas between each edge, whether they are empty or filled, and the pixel position of their left or top edge. I think there is some modified form which would take advantage of this property. Do you know of any? Converting points to raster in ArcGIS? If $r,s,t$ are prime numbers and $p,q$ positive integers s.t. $\text{lcm}(p,q)$ is $r^2s^4t^2$, then the number of ordered pairs $(p,q)$ is? If $r,s,t$ are prime numbers and $p,q$ are the positive integers such that LCM of $p,q$ is $r^2s^4t^2$, then the number of ordered pairs $(p,q)$ is?  My attempt to the solution:  Let $r^a s^b t^c$ be the LCM where $a=2,b=4,c=2$  Then the cases that arise are  I case   1) $p$ has $r^as^bt^c$ then there are a total of $(2+1)(4+1)(2+1)$ options  II case   1) $p$ has $r^as^b$ or $s^bt^c$,$r^at^c$ then there are total of $(2+1)(4+1)(2+1)(3)$ options.  The answers comes out to be $45*4$ but the answer is $45*5$. Which case am I missing? Why "?v=hash" is added to my URLs? I'm new to wordpress, I set up everything, but there's something that bothers me: on every single URL or link, there's a "?v=hash" appended everywhere (example.com/?v=d21feabed96b).  I tried to see inspect every plugin, I don't understand how this parameter is added.  It looks like it's added in js, because if I see the source, there's no trace of this hash, but I can see in firebug live source.  Plugins installed:   jetpack sumome wp-piwik wp super cache woocommerce   Theme: Storefront  I tried to disable everything, but still I get this hash, does anyone knows how and why it's added?  I'm also using cloudflare Is there a better alternative to ambiguous for a word with a wide range of meanings, difficult to find, because they become different in connection with person's opinion. Generic List - moving an item within the list So I have a generic list, and an oldIndex and a newIndex value.  I want to move the item at oldIndex, to newIndex...as simply as possible.  Any suggestions?  Note  The item should be end up between the items at (newIndex - 1) and newIndex before it was removed. Are there any reserved words in SQLite? In ZF, how would the structure of the cardinal numbers change by adopting this definition of cardinality? In ZFC, a good way of ordering sets by cardinality is by leveraging the notion of an injection. We define: $$X \lesssim Y \leftrightarrow \mbox{ there exists an injection } X \rightarrow Y.$$  Alternatively, we can leverage the notion of a partial surjection, by which I mean a partial function that hits every point of its codomain at least once.  $$Y \succsim X \leftrightarrow \mbox{ there exists a partial surjection } Y \rightarrow X.$$  Now in ZFC, these approaches are equivalent, in the sense that $$X \lesssim Y \iff Y \succsim X.$$  But if we just consider ZF (that is, we drop choice) then the equivalence breaks down. However, we've still got the forward implication, because the converse of an injection is always a partial surjection.  A specific question. Define that two sets are weakly equipotent iff $X \succsim Y$ and $Y \succsim X$. Question: does weak equipotence imply genuine equipotence? I'm guessing "no."  A general question: In broad terms, how would the structure of the cardinal numbers in ZF be altered by adopting $\succsim$ rather than $\lesssim$ as the fundamental order relation, and taking equality of cardinal numbers to correspond to weak equipotence of sets? I'm guessing this would hide a lot of the (usually very complicated) structure of the cardinal numbers in ZF.  Remark. The order symbols can be written \lesssim and \succsim. How should artwork be setup for T-shirt printing? What does it mean to colour separate the artwork for T-Shirt printing? It is normally suggested to use Pantone colours for T-Shirt printing. Is it the Pantone Coated or the Pantone Uncoated? The Uncoated one has more subtle colours and we can't choose brighter shades if the design requires that. What is more appropriate for printing? Can we use gradients in T-Shirt printing or is it suggested to stick to flat colours only?   The reason for asking if gradients were ok was to use it as an option for this design:    I was considering it an option, as it will be difficult to colour separate since the textures are clip masked inside the lion. How can I convert characters from Pathfinder to D&D 5e? I recently joined a 5e campaign group, but prior I was gearing up for a Pathfinder group. I found myself really enjoying creating characters and have made various under the Pathfinder rules. The Pathfinder group ended up falling through and I don't want these characters to go to waste, and was thinking I could use them in upcoming campaigns with my new 5e group. I have tried doing some research for the same races and classes. Some seem to have their own versions but others seem to lack one.  The character I am hoping to translate most would be my Sylph swashbuckler, but was also rather interested in the pathfinder "Bloodrager".  I've tried searching the this site but have only found questions asking about converting only races or enemies from D&amp;D 3.5 to 5e, campaigns from 3.5 to Pathfinder, and only 1 question on translating a Pathfinder class (Bloodrager, coincidentally) but nothing on how to go about it.   I of course am aware a 1:1 parallel is unlikely. I am mostly looking for what the general conversion method is, as well as things I should keep note of when trying to translate characters. Missing Microsoft.Data.Services.Client version 5.6 on Azure Websites Java - Method name collision in interface implementation Import error when opening empty notebook I've got the following two tables (in MySQL): Phone_book +----+------+--------------+ | id | name | phone_number | +----+------+--------------+ | 1  | John | 111111111111 | +----+------+--------------+ | 2  | Jane | 222222222222 | +----+------+--------------+  Call +----+------+--------------+ | id | date | phone_number | +----+------+--------------+ | 1  | 0945 | 111111111111 | +----+------+--------------+ | 2  | 0950 | 222222222222 | +----+------+--------------+ | 3  | 1045 | 333333333333 | +----+------+--------------+  How do I find out which calls were made by people whose phone_number is not in the Phone_book? The desired output would be: Call +----+------+--------------+ | id | date | phone_number | +----+------+--------------+ | 3  | 1045 | 333333333333 | +----+------+--------------+ syntax error in case 'remove' when decrementing Fastest way to try all passwords Suppose you have a computer with a password of length $k$ in an alphabet of $n$ letters.  You can write an arbitrarly long word and the computer will try all the subwords of $k$ consecutive letters. What is the smallest word that contains all combinations of $k$ letters as subword? (i.e. the fastest way to hack the computer :) )  The smallest word that contains $n^k$ subwords of size $k$ has length $k-1+n^k$ and based on some easy cases, we would like to prove that it is in fact possible to find a word of such length that contains all possible passwords. The problem can be translated into a problem in graph theory, by taking as vertices all words of length $k$.  We tried $k=2$, where you can prove the conjecture by induction. For $n=2$ and small $k$ it also works. How does Java Garbage Collection work with Circular References? build argument lists containing whitespace Why is disk usage greater than the size of all files on it? I have been stuck for several days on this old Analysis problem (I am doing some study on my own).  I have tried several things (which I'll indicate below), but I cannot seem to figure it out.  Here is how the problem is presented: Problem: &quot;Let $f$ be a continuous real-valued function on $[a,b]$.  Suppose there exists a constant $M \geq 0 $ such that $$|f(x)| \leq M \int_a^x |f(t)| dt$$ for all $x \in [a,b]$.  Show that $f(x)=0$ for all $x \in [a,b]$.&quot; My Thoughts: I have tried using the mean value theorem iteratively, but that seems to always lead me down a dead end road.  I deduced that $f(a)=0$.  If only $f$ were assumed to be differentiable, then maybe I could play with trying to get the derivative to be $0$, but unfortunately it's only continuous.  My other thought was to (somehow) use the condition to show that $\int_a^b |f(x)| dx = 0$.  I also played around a bit with contradiction, but to no avail.  Even if one of these hair-brained thoughts is correct, I am not really sure what to do next. If you have any ideas, suggestions, or solutions, I would really appreciate it if you are willing to share them.  Thank you for your time.