OJ Board

i have been stuck with this problem past 4 days . I know DP will be used.
i will get max in c+1 categories using all possible combinations of c categories .
But how do i incorporate bonus point analysis. somebody please help me out with the algo of the problem.
i am stuck now.......

10142 - Australian Voting - WA & AC Together!! Postby N|N0 on Wed Jan 26, 2005 2:08 am My program ACs here, but WAs at http://www.programming-challenges.com #include <stdio.h> #include <ctype.h> #include <string.h> #define MAX_KAND 20 char imena[MAX_KAND][100]; int glasovi[1000][MAX_KAND]; int ...

@empo Read this http://online-judge.uva.es/board/viewtopic.php?t=4820 Is gets safe?? I don`t know. But one possible reason you are getting a wrong answer is that output must be as follows A\n\n B\n\n C\n\n and not A\n B\n C\n as you have done But even fixing this up and not using gets with the follo...

Before reading the posts I was trying this problem considering it multiple input one. But after reading http://online-judge.uva.es/board/viewtopic.php?t=4820 I changed my solution.However , I am always getting Runtime Error. This is the code I am using #include<stdio.h> #include<ctype.h> int main() ...