OJ Board

little joey wrote:Thanks Per for the hint. It's brilliant. Continueing in that line of thought, I even found an O(N) algorithm, so I finaly solved this problem (in a quite reasonable time).

can u explain it in more detail, I can't see it ?

consider the symmetry effect
so there are only three status ( corner, mid-boundary and central)
input and output give two, the last is to be precalculated

can somebody tell me how to solve this problem by Greedy

can somebody give me the results for the following test cases

10

20 40 ...

though my programme give right answer to the these input
I still got WA, can somebody give more tests?

Although I finally got it AC I still dont know how did anyone find out that a 5x9 rectangle was possible. (please dont tell me you have tried all possibilities :). Anyone can help me out here?


you need not try to find out all possiblitys
if you use backtrack algorithm and run it in your brain ...

just a few minutes ago, I generate another testdata
and there are 1M testcases

I got another src which has been ACed
[cpp]
#include "stdio.h"
#include "math.h"

double area(double a, double b, double c, double d, double e, double f)
{
return fabs(a*f+c*b+e*d-c*f-e*b-a*d);
}

void main()
{
freopen ...

I got a programme of this prob. which has been ACed from other posts
and randomly generated 10000 testdata
then I got the output of the two programs(mine and that one)
there are only one difference between the two
but after I changed that program (change eps from 1e-9 to 1e-8 )
there are no ...