OJ Board

If you consider the problem ,which is about Root instead of Bishop,
maybe it is easy.
now ,you could rotate the board by 45 degrees , then youn could consider the Bishop like a Root.
Good lucK!!

my program is as follows , can u tell me where my bug is?
thanx again!
[cpp]
// @begin_of_source_code

#include <iostream.h>
#include <math.h>
#include <iomanip.h>
#include <fstream.h>
ifstream fin("10240.in");

int dis[10005];
int dim,dist,d;
double length;

void main()
{
dis[1] = 0;
dis[2 ...

I find the following regularity:
Dimension : 1 2 3 4 5 6 7 8 9 .......
Segment No : 1 2 4 5 9 10 16 17 25 .......
So I guess a formula, which make out the segment number,when the dimension is given.
But , I got W.A.
Is there any mistakes in my guess?
or there are some pitfalls that I didn't pay any ...

tom hates jerry ,, jimmy hates tom
jimmy
a hate
jimmy hates tom ,
jimmy hate
tom hates jerry , jimmy hates tom
hates
jimmy hates tom
hate hate hate

Could you point out the bugs or give me some test cases?
thank you!
the program is as follows:

[cpp]#include <iostream.h>
#include <fstream.h>
ifstream fin("10089.in");
int a[1001],b[1001],c[1001];
int A[1001],B[1001];
int t1[1001],t2[1001];
int n;
bool get()
{
int i;
for (i=1;i<=n;i++) {
A = a ...

bacause I `m afraid my program will get Time Exceed!