OJ Board

note that you digits persist in the input string and you shouldn't replace them whict space.

Use binary search to find the maximum number of pages and then check whether it is possible to find a configuration or not.

the total time as much as would be 500*log(500*10000000) at most

Hello.
the player can put his piece on each end. is this right?
i got wrong for this problem several times
can you give me some test cases plz

Hello dear friend. this is my PE code output for the above input.

RANK TEAM PRO/SOLVED TIME
1 5 3 203
2 3 2 300
2 7 2 300
4 6 1 20
5 17 1 120
6 2 1 121
7 1 1 131
8 8 1 154
9 9 1 163
10 10 1 164
11 11 1 165
12 22 1 300
13 4
13 12
13 13
13 14
13 15
13 16
13 18
13 19
13 ...

here is my C++ code #include <iostream>
#include <string>

using namespace std;

struct rect{
int x, y;
}piece[2][15];
int n, p[2][15], turn, h, t;

void chugh(int a, int &lval, int val)
{
p[turn][a]=0;
lval=val;
turn=1-turn;
}
void dechugh(int a, int &lval, int val)
{
turn=1-turn;
lval=val ...

Hello dear friends.
I get WA in this problem. I have solved it with bt.
can Ne1 give me some test data?