Search found 154 matches
- Mon Sep 03, 2007 9:59 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11269 - Setting Problems
- Replies: 26
- Views: 11522
- Sat Sep 01, 2007 8:03 pm
- Forum: Bugs and suggestions
- Topic: 11265 - The Sultan's Problem
- Replies: 0
- Views: 2032
11265 - The Sultan's Problem
This very important line was missing from the problem statement (also the sample output doesn't depict this last moment change as well) - "print 3 digits after decimal point in output." Sorry for the inconvenience. We'll try to rejudge the contest submissions with a special corrector progr...
- Wed Oct 25, 2006 9:34 pm
- Forum: Off topic (General chit-chat)
- Topic: National Taiwan University=>PG the Evil
- Replies: 3
- Views: 3578
- Sat Sep 30, 2006 11:16 am
- Forum: Other words
- Topic: 2007 world finals IN JAPAN?
- Replies: 20
- Views: 11050
Final will be on Tokyo.
http://icpc.baylor.edu/icpc/finals/default.htm
Btw, have a look at the schedule -
http://icpc.baylor.edu/icpc/finals/Schedule.htm
Won't there be any java challenge / parallel challenge this year? Nothing is mentioned in the schedule.
http://icpc.baylor.edu/icpc/finals/default.htm
Btw, have a look at the schedule -
http://icpc.baylor.edu/icpc/finals/Schedule.htm
Won't there be any java challenge / parallel challenge this year? Nothing is mentioned in the schedule.

- Thu Sep 14, 2006 7:59 pm
- Forum: Volume 6 (600-699)
- Topic: 676 - Horse Step Maze
- Replies: 21
- Views: 12137
- Tue Sep 05, 2006 3:59 am
- Forum: Volume 110 (11000-11099)
- Topic: 11082 - Matrix Decompressing
- Replies: 28
- Views: 12891
- Sun Sep 03, 2006 4:17 am
- Forum: Volume 110 (11000-11099)
- Topic: 11082 - Matrix Decompressing
- Replies: 28
- Views: 12891
- Sat Sep 02, 2006 7:29 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11082 - Matrix Decompressing
- Replies: 28
- Views: 12891
- Sat Sep 02, 2006 9:41 am
- Forum: Volume 6 (600-699)
- Topic: 676 - Horse Step Maze
- Replies: 21
- Views: 12137
- Tue Jul 18, 2006 6:48 am
- Forum: Algorithms
- Topic: Answering ancestor queries in O(1): O(n) preprocessing
- Replies: 2
- Views: 1721
- Tue Jul 18, 2006 6:08 am
- Forum: Algorithms
- Topic: Answering ancestor queries in O(1): O(n) preprocessing
- Replies: 2
- Views: 1721
Answering ancestor queries in O(1): O(n) preprocessing
As a reference, an ancestor query for a tree can be defined as below - ancestor(u,v) = 1, if v is an ancestor of u; -1, if u is an ancestor of v; 0, otherwise; Now, can anyone tell me that if there's a way to answer ancestor queries in O(1) time. Available pre-processing time for an n-node tree is m...
- Mon Jan 16, 2006 2:21 pm
- Forum: Volume 3 (300-399)
- Topic: 336 - A Node Too Far
- Replies: 121
- Views: 43658
Code: Select all
Case 1: 0 nodes not reachable from node 1 with TTL = 0.
- Mon Jan 16, 2006 2:11 pm
- Forum: Other words
- Topic: New ranklist format for each problem
- Replies: 31
- Views: 10391
- Fri Jan 13, 2006 10:42 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10815 - Andy's First Dictionary
- Replies: 116
- Views: 34060
- Fri Jan 13, 2006 10:33 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10508 - Word Morphing
- Replies: 35
- Views: 12803
Umm, I think I'd better show you several patterns of compare_function to use with qsort() library function. Then you yourself will be able to pick what you actually need. 1. Just beginning from the scratch, suppose you want to sort int a[10]; in ascending order. Your compare function will be like th...