OJ Board

Ok, I figured out the exact value of x (say a). But I am not sure how to compute the polynomial. One way I thought of was have a generic polynomial of degree n, say f(x) = x^n + x^n-1 + x^n-2 + .... + 1, then calculate the value f(a) and then adjust the const term. but that way i can't get f(a) = 0 ...

I am getting WA. it passes input posted before. can anyone help?

It would've been nice if the lower value of N was defined. I don't think there were case with N == 1 (haven't tested though, I just printed 0 for that case)

Got AC

The above results are correct. I got WA for different reason.

Can anyone confirm if my output is correct for the following input set 8 10 1 2 3 4 5 6 7 8 9 10 10 2 4 6 8 10 12 14 16 18 20 10 2 8 12 24 32 48 96 72 27 18 20 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 30 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 40 1 ...

I tried with random generated input and a brute force algo. Although I tried brute force algo with N <= 30, I get correct result from my WA algo as well.

And yes I do shift with 1LL << shiftVal

Getting WA as well.

Any critical test case?

I see several things that could led to an RE Make the collection word size 81 as you need to give space for the NULl character as well. char palindromeCollection[500][81] int isPalind(char str[]) { int len; char str1[81]; // Change this to 81 as well. len=strlen(str); int i,j; for (i=0,j=len-1; i<j;...

Whats wrong with my thinking - From first m we need to choose k , thats mCk for remaining m - k positions we can't use the first remaining m - k numbers.. So we fill those positions with from end n - m number. The way we can do that is ( n-m)P(m-k) Now we have remaining n-m positions and n-m numbers...

Try this input
Output should be Your code prints

Got Acc..

I had success with lower eps value (instead of 1e-9 instead of 1e-6).

I think binary search is not at all needed as the max volume can be at the terminal values only. Haven't tried that out yet though.

My code passes all the input posted in this thread, yet it manages to get WA.
Any help is appreciated.

+1 for captcha
or atleast delete the new posts that is obvious spams (no problem id, etc..)

Thanks

.... d = ((X[i]-X[j])*(X[i]-X[j]))+(Y[i]-Y[j])*(Y[i]-Y[j]); .... if(dist<=10000) printf("%.4f\n",sqrt(dist)); else printf("INFINITY\n"); So dist basically holds the squared distance. in your if condition shouldn't you be doing dist = sqrt(dist); if (dist <= 10000) printf("%.4f\n", dist); else print...

@amit
You should add the penalty only if the contestant solves the problem.
try this input my acc code returns your one returns