OJ Board

I think just make two heaps, one to min and the other one to max, when you make a push, push it to both heaps, and when you do a min_pop, pop the first data from min and remove from max, the same applies to max_pop

Someone can give me a hint, i have no idea on how to solve it?

Yeah, but how can i solve it?

Someone has an implementation of it, or can anyone explain me the algorithm to solve that problem. Thanks in advance.

The O(n^2) algorithm, as i have heard, comes in Donald Knuth by Art of Computer Programming. Here it's an implementation, maybe itsn't the better, because without recursion it will be faster. Greetings :). [cpp] #include<iostream.h> #define INF 2147483647 #define MaxN 10 long m[MaxN+1][MaxN+1]; int ...

O (n^2 (2^n) ) with DP, although is NP as u can see by the number of operations

I saw the problem, it's very interesting, i think there's a solution if: Let Xi the length of the i triangle you can cut from it. Let Yi the number of triangles of side Xi. Let L the length of the side of the hex. 6*L^2 = Sum ( Yi * Xi^2 ) Of course, imposing some conditions like: Yi = k Yi+1 Where ...

Well, I think that DP is a very(VERY) general approach, which must meet the following conditions: (Let A and B two distinct events) * A and B must be independent events (that is, changes on A doesn't affect changes on B) * There's exist some precedence or order between A and B And the most important...

The best that i know is
O (sqrt(N) / log (sqrt(N)))
[which is divide with all the primes betwen 1 and sqrt(N)]
I know there'r exist exact methods to find primes of a composite number when it's a product of two distinct primes, such a Pollard Algorithm and they are very fast, but i don't know more

Tell how many 2x2 matrix there are with the condition above or
Tell how many AxB matrix there are such that doesn't contain a 2x2 matrix with the condition above?

I know it can speed up the problem by using a table with primes, but can be another way?

Get the first 500 fibonacci numbers(think f(500) will be more than 200 digits) and then use binary search to find your number

can i know the following without doing full search????

If the given initial configuration is not solvable you just need to print the line &#8220;This puzzle is not solvable.&#8221;

Thanks

There's more than answer, they don't have a special program for multiple answer on that problem

Think my program is correct even though i always get WA. There are some details in redaction but i contemplate. Is there something i must do??