## Search found 67 matches

Fri Sep 18, 2009 8:56 pm
Forum: Volume 116 (11600-11699)
Topic: 11668 - How Many Teams
Replies: 7
Views: 1581

### Re: 11668

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...
Wed Sep 16, 2009 8:44 am
Forum: Volume 116 (11600-11699)
Topic: 11668 - How Many Teams
Replies: 7
Views: 1581

### Re: 11668

Thanks got AC
Tue Sep 15, 2009 10:43 pm
Forum: Volume 116 (11600-11699)
Topic: 11668 - How Many Teams
Replies: 7
Views: 1581

### 11668 - How Many Teams

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

http://uva.onlinejudge.org/index.php?op ... oblem=2715
Sun Jan 25, 2009 9:50 pm
Forum: Algorithms
Topic: Post Offices
Replies: 4
Views: 1657

### Re: Post Offices

thanks a lot
Sun Jan 25, 2009 7:47 am
Forum: Algorithms
Topic: Post Offices
Replies: 4
Views: 1657

### Re: Post Offices

yes. oh how i am gonna decide where to place next post office if i know the result of dp[j-1].
Sat Jan 24, 2009 6:41 pm
Forum: Algorithms
Topic: Post Offices
Replies: 4
Views: 1657

### Post Offices

can anybody please explain solution of this problem
http://acmicpc-live-archive.uva.es/nuev ... php?p=4273
Tue Apr 01, 2008 7:12 pm
Forum: ACM ICPC Archive Board
Topic: Problem 3277 : Workshops
Replies: 7
Views: 7002

### Re: Problem 3277 : Workshops

edit: can two workshop share the same room at the same time if the room has sufficient capacity
Sun Mar 23, 2008 8:26 pm
Forum: Volume 114 (11400-11499)
Topic: 11432 - Busy Programmer
Replies: 12
Views: 5092
edited my outputs: me and mf replied almost at same time.
Sat Oct 06, 2007 8:31 pm
Forum: Volume 113 (11300-11399)
Topic: 11307 - Alternative Arborescence
Replies: 22
Views: 11484
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.
Tue Oct 02, 2007 9:06 pm
Forum: Volume 112 (11200-11299)
Topic: 11297 - Census
Replies: 24
Views: 15671
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
Mon Oct 01, 2007 10:02 pm
Forum: Volume 112 (11200-11299)
Topic: 11297 - Census
Replies: 24
Views: 15671
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?
Sat Aug 04, 2007 5:08 pm
Forum: Volume 112 (11200-11299)
Topic: 11254 - Consecutive Integers
Replies: 24
Views: 12207
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
Thu Jul 26, 2007 7:45 am
Forum: Algorithms
Topic: Backtracking with heuristic
Replies: 2
Views: 1920
Thanks a lot.
Thu Jul 26, 2007 7:13 am
Forum: Algorithms
Topic: Backtracking with heuristic
Replies: 2
Views: 1920

### Backtracking with heuristic

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.
Sun Jul 15, 2007 10:11 am
Forum: Volume 112 (11200-11299)
Topic: 11239 - Open Source
Replies: 21
Views: 8430
I think use of STL will simplify things