OJ Board

Hi there,

could anybody tell me what could be wrong with this solution:


#define R 3390.0
#define versine(x) (1-cos(x))
#define haversine(x) ( (1 - cos(x))/2 )
#define RND(x) ( int(floor(x+0.5)) )

struct point
{
string name;
double lat;
double lon;
};

point points[100];
int numpoints;

long ...

Hello Cho,

How can you compute the hash values of all X*Y patterns in the large text in a constant time? Or at least in an O(n*m)?

Thanks.