OJ Board

I am very much astonished why I get WA always. I also checked every input from other threads. Now I am posting only my main fn here.
Pls tell me what is wrong?My graham scan function is 100% OK and I got acc in other programs. It sorts in ccwise . So I print from backward.
After convex hull I insert ...

I can't realise how to calculate wasted area , which interbal points I have to consider and how. Pls explain me.

Thanks Martin for reply.
I have just got acc after 2 day's utmost efforts. I have changed my code from O(n*n) to O(n*log(n)) and acc in 1.07 secs.
What can I say for you all that , geometry is very interesting ,don't neglect this type of problems.
Here 3 points can be collinear. Graham scan is must ...

Hi, I don't understand what u say. You say that
200 500 600 900 is not an A sequence, as 200 + 900 = 500 + 600.
But from prob 'For this problem an A-sequence is a sequence of positive integers ai satisfying 1 ≤ a1 < a2 < a3 < ... and every ak of the sequence is not the sum of two or more distinct ...

My code gives nasty WA.... Help me pls.(Posting code is bad I know)
........................................................................................................

#include <stdio.h>
bool a[1020];
long p[1200];
void main(){
long cas=1,i,j,x,prev;
int flag;
while(scanf("%ld",&x)==1){
prev=0 ...

I am a new poster and all that I can say that my inexperience caused this problem. I shall try to avoid posting same topic in a new thread next time.

I have no way but to post my code. Anybody there to help , why I am getting WA after 8.898 secs , also pls help how to speed up? I used Graham Scan of CORMEN and read all the previous posts about this prob. My code is a bit long ,but understandable ...

Thanks Mr. Martin Macko. But is it the answer of my question? I read all the previous posts about it.

I used graham scan to solve the prob and code is correct as I got acc in other probs. But what makes me crazy is that calculation of wasted area.
While graham scanning ,wasted area =sum of (negetive area),i.e clockwise turn.
I am posting the code segment of convex hull function now .
hh saves hull ...

I found the problem very odd. I can't understand how to solve this. How can prime factorization help me here? I could not find the pattern.
It is not possible like prob. 106 to generate and check x,y,z tripple.
Funny thing is that Shahriar Manzoor has a very big heart ,and so always deals with very ...

Hey, what's the hell there?I can't find any tricky input ,and what I think is absolutely right. I read all the previous posts. But I am too fool realise what is my mistake. Pls help me. (I tried also with a newline after the last case .Don't tell me about this ...

Hey. I got WA but I used almost the same code for Articulation point and got acc.Anybody here or all sleeping? Help me please.
..........................................................................................................
#include <stdio.h>
struct a
{
int d,c,data,p,l,f;

}g[1005][1005 ...

Thanks Kallol for ur reply. I have now tried with that possibility also. But I got WA after 1.143 secs again.

I don't know why this type of normal topological sort gives me WA after .002 secs for 5 times. If the algo is right there is not even any necessity to check several inputs. But I tried all the inputs posted before but could not find out the bug.
Now plssssssssssssss check my code and help me ...

Hi .I read the previous posts and now very upset as I tried all inputs posted and got the right answer. Now would you please check my code and say what is wrong there ...