OJ Board

Hi Everyone,

Below is my code for this problem. It uses simple Breadth first search. Moreover, for each node, it tries to color it both white and black(assuming adjacent node is not black). I have no idea why my output in not right. I will be grateful if someone could take a look and tell what is ...

Below is my code. No idea why get wa. pls help :


#include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;
int n, g, sum = 0;
int p[105],w[105];
int dp[1004][35];// num of object and weight left

int knapsack(int resourcel, int item){
//if(resourcel < 0) return (1<<31);
if(item ...

Removed