Search found 34 matches

Sun Aug 19, 2007 6:28 pm
Forum: Volume 3 (300-399)
Topic: 339 - SameGame Simulation
Replies: 26
Views: 11357
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 ha...
Mon Apr 30, 2007 5:21 pm
Forum: Volume 111 (11100-11199)
Topic: 11175 - From D to E and Back
Replies: 18
Views: 8654
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 (c,d...
Sat Feb 25, 2006 12:40 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 22636
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 is a ...
Thu Jan 05, 2006 11:27 am
Forum: Volume 1 (100-199)
Topic: 132 - Bumpy Objects
Replies: 38
Views: 4004
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. They ...
Tue Nov 15, 2005 11:01 am
Forum: Off topic (General chit-chat)
Topic: I win !!
Replies: 361
Views: 121078
Well, no one here for winning?

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

Why isn't it me?
Sun Nov 06, 2005 4:09 am
Forum: Algorithms
Topic: help to solve a common problem
Replies: 7
Views: 1966
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 big...
Sun Nov 06, 2005 4:00 am
Forum: C++
Topic: Who has easier variant?
Replies: 4
Views: 2329
[quote="Bj
Fri Oct 28, 2005 7:20 pm
Forum: C++
Topic: Who has easier variant?
Replies: 4
Views: 2329
i can only think about using strtok+sscanf/atoi/atod.

any better suggestions?
Fri Oct 28, 2005 7:17 pm
Forum: Off topic (General chit-chat)
Topic: I win !!
Replies: 361
Views: 121078
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....@_@)
Fri Oct 28, 2005 6:38 pm
Forum: Algorithms
Topic: help to solve a common problem
Replies: 7
Views: 1966
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]...
Fri Oct 28, 2005 6:27 pm
Forum: Other words
Replies: 2
Views: 1748

Fri Oct 28, 2005 6:13 pm
Forum: Other words
Topic: Runtime Error
Replies: 2
Views: 1573
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?
Mon Sep 05, 2005 6:55 pm
Forum: Volume 108 (10800-10899)
Topic: 10800 - Not That Kind of Graph
Replies: 48
Views: 21290
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: | \/ +---- Case #9: | \_/ +-...
Sat Aug 20, 2005 3:45 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 43973

Re: help WAAAAAAA

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 getchar...
Tue Aug 16, 2005 11:59 am
Forum: Volume 1 (100-199)
Topic: 132 - Bumpy Objects
Replies: 38
Views: 4004
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 which ...