OJ Board

let, a = number of departments which has 1 student, b = number of departments which has 2 students and c=number of departments which has 3 students. Now let dp[a] [c]=number of permutations we know 1*a+2*b+3*c=N and N%K==0 so we have to make N/K groups Suppose now we want to form a group, we can cho...

Thanks got AC

can anybody please give some test cases of the following problem:

http://uva.onlinejudge.org/index.php?op ... oblem=2715

thanks a lot

yes. oh how i am gonna decide where to place next post office if i know the result of dp[j-1].

can anybody please explain solution of this problem
http://acmicpc-live-archive.uva.es/nuev ... php?p=4273

edit: can two workshop share the same room at the same time if the room has sufficient capacity

edited my outputs: me and mf replied almost at same time.

how stupid i am. i tried dp with 3 colors. thank sclo now i got ACCEPTED using 20 colors.

but how could i proof that how many colors are needed.

can anybody give me some tricky test cases for this problem. I tried the problem with static binary tree.

At last I got AC in 0.950
using O(lgn^2)
this problem is nice one.


THANKS TO THE PROBLEM SETTER

in tht above test case the dimension of square is 10 * 10
but in the following query x2 = 495 and y2=493
q 1 1 495 493

so there can be test casese like this?

n can be expressed as summation of terms:

m + (m+1) + (m+2) + .... + (m+k) = n

which can be written as: A * B = 2*n

Thanks a lot.

Can anybody give some problems link on backtracking with heuristic. Actually I need some nice problem from which i can learn how to apply heuristic.

I will be gr8ful to u guys.

I think use of STL will simplify things