OJ Board

why would not this work?
color a vertex black.
and go down the tree coloring the vertices till all are colored according to the coloring scheme.
count the number of black vertex and number of white ones,maximum of which should be the answer.

Can anyone please tell me whats wrong in this code because iam always getting a wrong answer.

#include<iostream>
#include<vector>
#include<string>

using namespace std;
void func( vector < vector<char> > &arr,int i,int j,int num);
int main()
{
int num;
int xcase=0;
while(cin>>num)
{
xcase ...

dear all
I have been troubled for the past few weeks solving this problem and have applied all tricks that have been given in the forum.
Yet I have been unable to get an AC.
My code is as follows

#include<iostream>
#include<stack>
#include<cstdio>
using namespace std;

int main()
{

int n;
cin>>n ...

Can we take the input 1 at a time i.e. one case as a time ???( if thats possible we just consider to input the first line ie. the number of friends and then move accordingly.)

from what codes that have been written here that is what the case seems to me...

Awaiting your reply in anticipation ...

hi all
well iam new to acm.

here is the code.
(the implementation of my code is ltl different than others).

#include<iostream>

using namespace std;

int main()
{

unsigned long array[9];
int index[3];//store the indices
int block1,posblock1;//stores information about the block. these are the ...

hi all
well iam new to uva.
i have read the forum rules and waited for a day to post this in some old thread reagrding the above but my implementation of the problem is different.

here is the code

#include<iostream>

using namespace std;

int main()
{

unsigned long array[9];
int index[3];//store ...