Search found 110 matches

by wyvmak
Sun Jun 16, 2002 4:23 pm
Forum: Volume 102 (10200-10299)
Topic: 10229 - Modular Fibonacci
Replies: 53
Views: 17213

at a rough scan on your code, what i think is, there seems not a need to use long double, you can make it to int, or long long. then, your program may be better, at least need not worry about floating point error. though i cannot tell you whether it will get AC
by wyvmak
Sun Jun 16, 2002 4:18 pm
Forum: Volume 1 (100-199)
Topic: 164 - String Computer
Replies: 120
Views: 11468

I guess that's really your bug, coz that statement "A bug in the Online Judge has caused the problems 104, 120 and 164 to be incorrectly judged in some cases. " has been here for years. Try more test cases with your program like:

abcxdefxghix abcyydefyyghiyy
by wyvmak
Sun Jun 16, 2002 4:16 pm
Forum: Volume 7 (700-799)
Topic: 785 - Grid Colouring
Replies: 27
Views: 13719

i think yes, and you've to check that only one type of mark will be "painted", ie. a zone with 'A' and 'B' will not be filled
by wyvmak
Sun Jun 16, 2002 4:14 pm
Forum: Volume 1 (100-199)
Topic: 114 - Simulation Wizardry
Replies: 80
Views: 7742

i cannot totally understand your code, but two things suspicious:

1. if(bL > 1) {
why not if(bL>=1)

2. why .cost = cost + 1

but maybe more important thing is,
minus bL first,
if bL<=0, then no score can be gained
by wyvmak
Sun Jun 16, 2002 4:08 pm
Forum: Volume 2 (200-299)
Topic: 277 - Cabinets
Replies: 4
Views: 2259

The test cases are weird,
i think the "first record" is the first one encounted in the group, even if it's rejected. and, the "first record" will only matter when the name is empty, i found that the name will be differed from the first record, but just use whatever name when there's one provided.
by wyvmak
Sun Jun 16, 2002 4:04 pm
Forum: Volume 6 (600-699)
Topic: 681 - Convex Hull Finding
Replies: 60
Views: 20678

i think the test cases are all with n>=3, don't worry about n<3
maybe check your data output format, as you have to output smallest Y first?
by wyvmak
Sun Jun 16, 2002 4:01 pm
Forum: Volume 100 (10000-10099)
Topic: 10005 - Packing polygons
Replies: 49
Views: 15367

maybe just "check every triplet of points" is not enough? consider a quadrilateral, with two sides of length sqrt(2)*R+0.1, and two sides of length R/sqrt(3). i guess this quad cannot be packed, but your checking triplet of points will say the contrary
by wyvmak
Thu Jun 13, 2002 5:23 pm
Forum: Volume 2 (200-299)
Topic: 208 - Firetruck
Replies: 48
Views: 15273

ans to 10153EN:
1. if the nearest corner is #1, only 1 route, ie. "1"
2. i output "1 routes". but i get P.E. and seems all justified with width 4 cannot get me AC.
by wyvmak
Thu Jun 13, 2002 8:26 am
Forum: Volume 5 (500-599)
Topic: 502 - DEL command
Replies: 21
Views: 9214

well, i'm not sure if very huge full search. but i applied the following idea: try to get the answer from the input, rather than trying the answer to match the input. ie. get a pattern from the deleted files, i get the 'tightest' possible rule, then i apply this rule to the files to be kept, if it w...
by wyvmak
Tue Jun 11, 2002 8:18 am
Forum: General
Topic: Shall I do the problem serial
Replies: 4
Views: 2445

To share with you my experience, 1. when i was new to this site, i thought i could do it serial wise. i could only do it around 104 (coz my programming skill IS, still, poor). i often encounter the frustration of non-accepted problems, so I would try another problem first, until I got some ways to s...
by wyvmak
Fri Jun 07, 2002 3:11 pm
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 4535

i just randomly input two to my program:

input:
0.1 0.4 0.6
0.1 0.5 0.5

output:
134
132
by wyvmak
Mon May 20, 2002 8:35 am
Forum: Volume 6 (600-699)
Topic: 681 - Convex Hull Finding
Replies: 60
Views: 20678

seems the output has some requirements, maybe you re-check your output format? i don't think your c.h. will have problem.
by wyvmak
Sat May 04, 2002 7:54 am
Forum: Volume 101 (10100-10199)
Topic: 10100 - Longest Match
Replies: 95
Views: 21014

10100 Longest Match

would anyone tell me is this correct?

input:
The document provides late-breaking information
The breaking.
.,
,.
The34 4 document provides late-breaking information
The34 4

output:
1. Length of longest match: 1
2. Length of longest match: 0
3. Length of longest match: 2
by wyvmak
Mon Apr 29, 2002 6:38 pm
Forum: Volume 102 (10200-10299)
Topic: 10256 - The Great Divide
Replies: 21
Views: 7315

i seriously doubt that, coz if just find 2 convex hulls and check if any point in another convex hull, even the second sample input won't output NO. so you mean the sample output is wrong? or there's more trick?
by wyvmak
Mon Apr 29, 2002 4:15 am
Forum: Volume 100 (10000-10099)
Topic: 10002 - Center of Masses
Replies: 59
Views: 26518

For my personal experience, I got headache on this problem for quite a long period of time too, until I realized that the input points are not necessarily integers, ie. input points can be floating point numbers. I hope that would help, if you haven't realized this yet.

Go to advanced search