Search found 21 matches
- Thu May 18, 2006 8:11 pm
- Forum: Volume 1 (100-199)
- Topic: 106 - Fermat vs. Pythagoras
- Replies: 138
- Views: 12821
most problems in UVA will show Time Limit Exceeded if they run for more than 10 seconds, so maybe you are misunderstanding the meaning of your result, it means that your program ran during 10.1 seconds, and as it didn't finish you got Time Limit Exceeded, the exact time your program solved the probl...
i have tried this problem and i always get WA. Basically i am using a STL multiset and an iterator to the current element, whenever i a process a GET command i just print the content of the iterator and increment the iterator, and whenever i insert an element less than the element currently pointed ...
- Mon Apr 24, 2006 11:10 pm
- Forum: Algorithms
- Topic: Computing the partition function.
- Replies: 11
- Views: 1944
Does anyone knows an eficient way to calculate the partition function p(n), namely the number of ways you can sum positive integers that add up to n?
- Sat Mar 18, 2006 8:32 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11012 - Cosmic Cabbages
- Replies: 29
- Views: 9015
Hi, any ideas how to solve this problem?, during contest i used the next algo: i determine the points who are "extreme", with extreme i want to mean the points with the minimum and maximum X,Y,Z coordinates, intituitively i thought that the two points with maximum distance are in this set, but i got...