OJ Board

I having a problem of representing my tree. Please help!!
Let look at a graph

0----1---
| |----4----5
2----3---

1 connect to 4, 4 connect to 5
3 connect to 4, 4 connect to 5
If we represent this to a tree with 0 is the root then
0. 1 2
1. 4
2. 3
3. 4
4. 5
1 and 2 are the children of 0. 4 is ...

I look at all the sample output that all users have posted, and my code passed them all. However I still got wrong answer... help please....

#include<iostream>
using namespace std;
int main(){
class AdjListNode{
public:
AdjListNode *next;
int vert;
AdjListNode(int v, AdjListNode *ne){
vert ...

Never mind. I got AC

Sorry. I will look harder next time. Thanks a lot.

Can anyone tell me which problems used dynamics programming to solve? I know 111 is one of them. Any other sugesst? Thanks

I got run time error for this problem even though I got all the right answer. Help please
Here is my code:
using namespace std;
int longest[20];
int number[20];
int key[20];
int answer[20];
int subscript[20];
void FixOrder(int n, int x[]);
int LCS(int n);
void Clean(int n);

int main(){
int n,k,m ...

I got it accepted. Thanks

I got Wrong Answer too. I try all the input in this thread and I got the right output(I think).
Help please

# include<iostream>
using namespace std;
int Calculate(int length, int H);
int Factorial(int x);
void MarkZero(int number[], int &pos, int &count0, int length, int H, int solution);
int main ...

I'm very sorry but I have a severals questions about problems. First what is L, T, R,B? I know that they are left, top, right, bottom. But left, right... to what? The problem said that the town is in rectangular shape, and the top left corner is(1,1) and the bottom right corner is (W,H). So go back ...