Search found 148 matches

by 10153EN
Sun Jun 30, 2002 4:08 pm
Forum: Other words
Topic: To Admins: Please kill the non-related threads!!
Replies: 2
Views: 1923

To Admins: Please kill the non-related threads!!

Dear admins,

Someone, of login ID: tenshi, is posting messages in different boards, which is not related to the OJ system and the Online contest, but just to promote something else.

Could you please kill those threads so as to give a more clean and tidy environment for us?
by 10153EN
Sun Jun 30, 2002 9:55 am
Forum: Volume 8 (800-899)
Topic: 825 - Walking on the Safe Side
Replies: 38
Views: 20712

Yes, you are right.

I just found my bug, initialization of variables~ Suit~ :wink: :wink:
by 10153EN
Sun Jun 30, 2002 8:51 am
Forum: Volume 8 (800-899)
Topic: 825 - Walking on the Safe Side
Replies: 38
Views: 20712

825 - Walking on the Safe Side

I have a question on this problem~

Does the *minimal path* in the problem description means (width+height-1) or an actual minimal path that reaches the goal from the starting position?

Thx
by 10153EN
Sun Jun 30, 2002 5:41 am
Forum: Other words
Topic: Graph problems
Replies: 5
Views: 1948

What I thought before is that DFS is a brute force method to find solutions, so it's a slow algo. For some problems like MST, shortest path, DFS most often gets time limit exceeds.

That's why I am afraid to try on cycle detection problems~

Thx for your advice, I will try by DFS.
by 10153EN
Sat Jun 29, 2002 8:51 pm
Forum: Volume 100 (10000-10099)
Topic: 10054 - The Necklace
Replies: 62
Views: 32001

10054 - The Necklace

I am poor at graph problems. In this problem I can check for whether a suitable necklace exists, i.e. Yes or No. But I find it difficult to print out the sequence of segments.

Could anyone share his or her experience~

THx
by 10153EN
Sat Jun 29, 2002 8:48 pm
Forum: Other words
Topic: Graph problems
Replies: 5
Views: 1948

Graph problems

I am solving problems, but I am poor at graph problems.

Could anymore share his or her experience on how to have an efficient algorithm to detect or check for presences of cycles on a graph?

I just know DFS, but I think it's a poor algo.

Thx.
by 10153EN
Sat Jun 29, 2002 6:42 pm
Forum: Volume 4 (400-499)
Topic: 488 - Triangle Wave
Replies: 270
Views: 32312

Did you note that the *tick mark* beside the problem number in the problems contents is blue in colour? It means the problem is of multiple input.

The format of multiple input question can be referred as http://acm.uva.es/problemset/minput.html, as Picard said.
by 10153EN
Sat Jun 29, 2002 6:17 pm
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 21772

I think nope.

I just declare the variables to be int and it's OK. :D
by 10153EN
Sat Jun 29, 2002 7:45 am
Forum: Volume 4 (400-499)
Topic: 476 - Points in Figures: Rectangles
Replies: 87
Views: 8179

I think it's the problem of buffer overflow, i.e. an array of not enough size. Try to declare the array of rectangle larger, e.g. 10000 and it will be accepted. P.S. Despite the number of rectange < 10 as in the problem description, I think it's rejudged, so the number of rectangle is larger. Hope c...
by 10153EN
Fri Jun 28, 2002 7:43 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 47424

I think there's a small mistake, you declare n to be char, which will have value overflow when n > 127.
by 10153EN
Fri Jun 28, 2002 7:10 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 52420

Despite your declaration of *unsigned long int*, your input using "%d" will read the value as *int*, So there will be value overflow when the input is 2^31 = 2147483648.
by 10153EN
Thu Jun 27, 2002 6:29 pm
Forum: Volume 103 (10300-10399)
Topic: 10302 - Summation of Polynomials
Replies: 29
Views: 15311

Clearly, there should be value overflow~
by 10153EN
Thu Jun 27, 2002 3:39 am
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 32905

I think you have not considered one of the constrains, as it stated:
the number of people on the two teams must not differ by more than 1
Try to take consideration into this constrain and it should be OK~ :D
by 10153EN
Wed Jun 26, 2002 9:19 pm
Forum: Volume 6 (600-699)
Topic: 602 - What Day Is It?
Replies: 56
Views: 22399

As I don't know if your dates are in MMDDYYYY or DDMMYYYY, I just treat as MMDDYYYY.

The following is the output:
January 1, 1 is a Saturday
March 1, 2100 is a Monday
March 1, 2101 is a Tuesday
March 1, 2400 is a Wednesday
March 1, 2401 is a Thursday
March 1, 2300 is a Thursday
Hope can help~ :)
by 10153EN
Wed Jun 26, 2002 9:09 pm
Forum: Volume 2 (200-299)
Topic: 297 - Quadtrees
Replies: 16
Views: 2386

I don't think the input file is corrupted. On the other hand, I think it's your size of array tree and tree2 is too small. Consider a quad-tree with all the neighbour-pixels with different colour. i.e. sth like bwbwbwbwbwbwbwbwbwb............bwbw wbwbwbwbwbwbwbwbwbw............wbwb ....... If the ab...

Go to advanced search