## Search found 13 matches

Wed Dec 27, 2006 8:43 pm
Forum: Volume 104 (10400-10499)
Topic: 10412 - Big Big Trees
Replies: 15
Views: 8937

### WA

I have two questions for this problem:

1. Can I jump from/to a leaves of length 0 (zero)?

2. When jumping along a straight line, can this line touch the end of another leave or not?

Example:
1
2 7 5
1 3
4 3 3 2 1

is the output
6
or
4
?
Tue Oct 14, 2003 10:27 pm
Forum: Volume 105 (10500-10599)
Topic: 10574 - Counting Rectangles
Replies: 23
Views: 9284

### 10574 - Counting Rectangles

Hi.

Can someone give me any hint how to solve this problem without receiving TIME LIMIT EXCEEDED?

I tried to sort the points (C++ QUICK SORT), first by X and then by Y coordinate, and after that run 4 for loops with breaking conditions.
Is this slow?
Mon Aug 18, 2003 3:20 pm
Forum: Volume 6 (600-699)
Topic: 698 - Index
Replies: 21
Views: 8393
little joey wrote: One advise: Don't assume anything that's not explicitly written in the problem description. What do you mean by this? 1) In the INDEX list, if there is a character that is not ALPHA_NUM what should I do with it? ex:--- INDEX LIST --- //foR* ab*c<> ?a?b? What are the Indexes in thi...
Thu Aug 14, 2003 10:56 pm
Forum: Volume 1 (100-199)
Topic: 182 - Bonus Bonds
Replies: 10
Views: 1811

### I don't understan the problem

I have the same problem.
I don't understand nothing, too.
Anyone can explain what shoul I do!!!
Sat Aug 09, 2003 7:08 pm
Forum: Volume 7 (700-799)
Topic: 776 - Monkeys in a Regular Forest
Replies: 51
Views: 18647
I have 3 questions about this problem: 1) xenon said that we shoul think about BIG FORESTS! How big it can be? I use char forest[2500][2500]. Is this enough? Beyond this I receive MEMORY LIMIT. 2) What about THE LAST FOREST? How INPUT ends? is it EOF, and should I print "%" after the LAST FOREST? 3)...
Fri Aug 08, 2003 8:28 am
Forum: Volume 7 (700-799)
Topic: 785 - Grid Colouring
Replies: 27
Views: 13733
1) You DON'T have to check for markers that are not in a closed zone.
2) You DON'T have to check if there are diferent markers in one zone.
At least I DIDN'T and got ACC.
Thu Aug 07, 2003 11:48 am
Forum: Volume 3 (300-399)
Topic: 373 - Romulan Spelling
Replies: 10
Views: 3269
To Little John: I think that your algorithm is ok. I don't think that there are HIGH and LOW PRIORITIES. Maybe you have CASE SENSITIVE ERROR (when replacing "G" and "P"). Here is my algorithm (ACC). --------------------------------- "XPGX" -> "XGPX" "EGPX" or "XGPUK" or "EGPUK" -> "EPGX" or "XPGUK" ...
Fri Aug 01, 2003 12:20 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 25252
I had a lot of troubles with this problem. (especially with PASCAL). Finally got ACCEPTED assuming INPUT as follows: INPUT: ------------------------------ 4 (blank) F AB CF (blank or eof) C AB (blank or eof) G (blank or eof) Z AB BC XY (blank or eof) ------------------------- OUTPUT ----------------...
Tue Jul 29, 2003 11:34 pm
Forum: Volume 2 (200-299)
Topic: 230 - Borrowers
Replies: 10
Views: 7212
I don't understand completely this problem.
I have two questions:

1)
Should I SORT books at the begining, or to leave them as they are in the INPUT?

2)
And after that, does it mean that each book has its OWN POSITION on the shelves, and it need to be returned on that position?
Tue Jul 29, 2003 8:36 am
Forum: Volume 2 (200-299)
Topic: 209 - Triangular Vertices
Replies: 51
Views: 7069
There are two types of triangles: -- \/ /\ -- Three types of parallelograms: --- / / --- --- \ \ --- /\ / \ \ / \/ One type of hexagon: --- / \ \ / --- It seems that there are no inputs of type : -- / / \ \ -- because I got ACC WITH AND WITHOUT checking for this figure to be a hexagon.
Fri Jul 25, 2003 9:23 am
Forum: Volume 8 (800-899)
Topic: 815 - Flooded!
Replies: 20
Views: 10059
Here is the output for this case:

INPUT:
2 2
1 0
0 1
200

OUTPUT:
Region 1
Water level is 1.00 meters.
50.00 percent of the region is under water.
Thu Jul 24, 2003 5:45 pm
Forum: Volume 8 (800-899)
Topic: 837 - Light and Transparencies
Replies: 25
Views: 14202
I think that you should not join parts with equal transparency.
That means:

INPUT:
1

1
1.0 2.0 5.0 2.0 1.0

OUPTUT:
3
-inf 1.000 1.000
1.000 5.000 1.000
5.000 +inf 1.000

I got Accepted without joining these neighbouring parts with equel transparecys.

Another thing:
I DID NOT CONCIDER NEGATIVE Y.
Tue Jul 22, 2003 2:23 pm
Forum: Volume 103 (10300-10399)
Topic: 10338 - Mischievous Children
Replies: 56
Views: 20445

### WA

I can't get ACCEPTED on this easy problem.
My formula is: n!/(k1!*k2!*...*km!).
Any special case?
What is output if there is a blank line (word with length 0)?
[/cpp]