OJ Board

Hi! I've tried all your i/o you write in this post and i get the same results as you, and i still get WA. :(
Can anybody post more sample inputs or tell me which are the difficult inputs? Thank you a lot and sorry about my english!!
Do you tried Jan's last post?

As an aside, I think this problem ...

He treated a vertex in D as a pair (a,b) where a and b are its edges. But why if there's some directed edge from (a,b) to (c,d) in D guarantees that b=c is in D???
Thanks!!!

The correct intepretation is: vertex in E is a pair (a,b), where a,b are vertex in D. If there exists vertices (a,b) and ...

I put in some of test cases to your program and found out some problem in your code:

(1) in some of the input your programs gives multiple line of output. for example, with this input taken from sample input:
8 1 7 3 6 2 8 9 7 5
7 4 7 8 7 6 0 0
your program outputs
Case 1 is not a tree.
Case 1 ...

But in the first polygon, point 1, point 2 and the center don't form a triangle with 90 degrees(you can see that in the picture.)

I think they form a 90 degree, got AC is because the judge haven't such test cases.

I change my code with reject and accept 90 degrees both get AC
You are correct ...

Well, no one here for winning?

it seems like h001122 had won for 17 days....

Why isn't it me?

thanks a lot!!!!
but...in the algorithm of nixtr....
shouldn't be "for(j=MAX-1;j>=0;j--) " instead of "for(j=MAX-1;j>=1;j--) "

and

"if(bigarr[arr[j]]>1)
some of the array elements add to this number "

instead of

"if(bigarr[arr[j]]!=1)
some of the array elements add to this number "...because if ...

[quote="Bj

i can only think about using strtok+sscanf/atoi/atod.

any better suggestions?

I'm back now
so it's me that's winning :D:lol:8)

And is Towhid makes a new record of winning? (about 12 Days)
(I may have just seen a more-than-12-day record)

(edit: miscalculation of time....@_@)

its idea is:
when you can make some number j from arr[0]~arr[i-1], you can make the number j+arr from arr[0]~arr by add the number arr into the number chosen above to make j.
So we use an array to record if we can make some particular number, using sets of number arr[0]; arr[0]~arr[1]; arr[0]~arr[2 ...

Recent days I introduced this site to some of my friend. After they had registered(and received an ID <45000), they told me that after submittion they received an "Access Denied" reply. I've read the article How to understand the Online Judge answers , it says:

Access Denied (AD): Your Internet ...

The old Judge status system (which is still running now at here) will say why it's crashed (its signal) when received a Runtime Error (like SIGSEGV or SIGFPE).
Can the new status system add in this feature?

You can check those cases:

18
F
C
R
FF
CC
RR
RF
FR
FCR
RCF
CFF
FCF
FFC
CRR
RCR
RRC
FRFR
RFRF

And the corresponding output:

Case #1:
| \
+---

Case #2:
| _
+---

Case #3:
| /
+---

Case #4:
| \
| \
+----

Case #5:
| __
+----

Case #6:
| /
| /
+----

Case #7:
| /\
+----

Case #8 ...

scanf("%d", &cas); t = getchar(); t = getchar();

I didn't look through your recursive body, but this might be the problem of your code. A newline in Un*x is represented only by a character '\n', but in Windows, it's represented by '\r' '\n'. Thus when your program runs under Un*x, the first ...

Maniac's output is
Code:

UZJWU 13
YVTJTOOO 20

This is what should be output. Since the first polygon has point 1 point 2 and center form a triangle with 90deg, so segment(point 1, point 2) should be rejected as baseline. The same for the second polygon.

It's correct to reject those baselines ...