OJ Board

(my 3rd sample output is: apple-juice wine vodka beer martini rum whiskey cachaca gin ). Wait... where have you lost tequila? :P Sorry, ive pasted you a wrong ouput, my actually output says: apple-juice wine vodka beer martini rum tequila whiskey cachaca gin. Is that a correct answer? Can u help me...

Hi all. I did a Topollogical Sort as follows and got WA: #include <stdio.h> #include <map> #include <string.h> using namespace std; char list[101][60]; int n,m; int mat[101][101]; int pos(char a[]){ int i; for(i=0;i<n;i++){ if(strcmp(a,list[i])==0) return i; } } int num[101]; int ts(char a[]){ int i...

Well, i've thought about that and modified, including the range [-3000,3000] on my bool array, but still WA I don't know what could it be... may be a tricky case that im not testing...

Hi. I've tried to use some kind of memoizaton, using a bool array for each square in the board ( usd ) to know all sums that can be reached to that square. I've tried all test cases but still WA... can u help me? #include <stdio.h> #include <string.h> int NO=-10000; const int P=500; const int N=1000...