OJ Board

Hello :-)

Can anybody write me game trace for sample input or check my trace?
I'm getting:
1 43

For other inputs it's even worst :-(

Game trace:
> (player, #number after previous round, table + new card)
> p=2 #c1=26 #c2=26 H2
> p=1 #c1=26 #c2=25 H2 D2
> p=2 #c1=25 #c2=25 H2 D2 S7
> p=1 #c1=25 ...

Can anybody say me what is the hack or write another input and output?
Thank for any help

Can anybody send me additional input and output for problem 152?

Thank you

thank You

Why this is wrong?


#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
const int INFL = 0x7fffffff / 2 - 1; // infinity
typedef pair<int, int> path;
typedef struct
{
int v; // neighboring vertex
int weight; // edge ...

I check the test from other thread but it doesn't help.
I need more tests.
Can anybody help me?

Thank you in anticipation