Currency amount US & EU (cents optional) Can use US-style 123,456.78 notation and European-style 123.456,78 notation. Optional thousands separators; optional two-digit fraction Match; JGsoft: ^[+-]?[0-9]{1,3}(?:[0-9]*(?:[.,][0-9]{2})?|(?:,[0-9]{3})*(?:\.[0-9]{2})?|(?:\.[0-9]{3})*(?:,[0-9]{2})?)$ Reference: here 2 solved Java Regular expression for money
If you are allowed to use external libraries (I assume some homework assignment) you should use the Combinatorics library (via NuGet). If not, do the combinatoric stuff yourself 😉 The idea: You need all possible (non repeating) combinations of cars and zones to find the combination(s) that gets the most jobs done. Using Variations from … Read more
It is hard (if not impossible) to label an heuristic as “best”. One idea I have in mind is evaluate the heuristic for the current state as the maximum value of all the tiles at this state. And then, that with the higher value is supposed to be better (“closer”) to the goal. And it … Read more
You are correct: !a giver you 0 and 0 == b is 0, So, c = ++b gives b = 4 and c = 4. The a is not changed. solved What is the output? C Programming [closed]
You need to choose a standard unit of measure. The question suggests meters, so use that (you can use float or double for this, depending on what precision you need). The problem is then simple, create some variables for the sum, smallest seen, and largest seen, the for each new input, convert to the standard … Read more
Problem: find (i,j), i<j, s.t. a[i] + a[j] = i + j I propose the following approach: Set b[i] = a[i] – i The problem becomes: find (i,j), i<j, s.t. b[i] + b[j] = 0 Complexity: O(n) Create objects c[i] = (b[i],i), a struct for example, in a std::vector (or std::array) Complexity: O(n) Sort the … Read more
Create a function that gets a product weight and returns a bag number – the one which has the least free space that’s still enough to fit. Put it in the bag. Repeat until done. $bags = array(60,80,20,10,80,100,90); $containers = array(1=>100,2=>100,3=>100,4=>100); // number -> free space $placement = array(); rsort($bags); // biggest first – usually … Read more