## Search found 23 matches

Fri Mar 24, 2006 1:55 pm
Forum: Other words
Topic: Problem numbers?
Replies: 2
Views: 1831
Thanks :) I am not sure if the Click-o-mania problem was for 1-D or 2-D, but this seems to be the right problem. I suppose the problem in 2-D will be really so hard that you can't expect to find such a problem in UVA, unless the limits allow for an exponential-time algorithm. Does anybody know a sim...
Thu Mar 23, 2006 1:25 pm
Forum: Other words
Topic: Problem numbers?
Replies: 2
Views: 1831

### Problem numbers?

I have seen two problems more than a year ago, but I cannot remember their numbers, so I can't reach them again :-) One problem is about getting an optimal solution for a game like Click-o-mania. The other problem is about bombs that are thrown to demolish circular areas and the total destroyed area...
Mon Jul 25, 2005 11:45 am
Forum: Other words
Topic: Eligibility Rules for 2005 Regionals
Replies: 4
Views: 1262
This rule actually favors graduate students I do not see how the rule actually favors graduate students. Graduating in 3 years is a very special case. People normally graduate in 4 and 5 years (which means that some undergraduate students in 5-year will be excluded as well). Moreover, are you sure ...
Sat Jul 23, 2005 8:03 pm
Forum: Other words
Topic: Eligibility Rules for 2005 Regionals
Replies: 4
Views: 1262

### Eligibility Rules for 2005 Regionals

There is something I don't get about the ICPC regional eligibility rules. Do they mean that they will exclude all graduate students from participation this year?

I hope not.
Mon Apr 11, 2005 7:24 am
Forum: Volume 10 (1000-1099)
Topic: 1047 - Zones
Replies: 17
Views: 5746

### Problem J - World Finals 2005

Anybody knows a solution for problem J in the last ICPC World Finals that is more efficient than O(n^2 * 2^n)? Namely, checking all possible subsets?

Also, does anybody know how much vectors are less efficient than arrays, in case I only use .size() and operator[]?

Thanks
Tue May 11, 2004 3:56 pm
Forum: Off topic (General chit-chat)
Topic: Organizing the information in a project
Replies: 0
Views: 1414

### Organizing the information in a project

Hello everybody :-) We are making our graduation project, and while we are researching, information comes in piles and piles and we can hardly organize it to make some sense from it and to know what we need to do next. The problem is that the project is quite big and thus has a lot of information th...
Tue Apr 27, 2004 12:48 pm
Forum: Algorithms
Topic: Sorting by angle?
Replies: 5
Views: 1367
There is a solution that I just thought about. Why do not you take an arbitrary point of them, and divide the points into two halves one above and one below the line connecting the point taken and the center point. Now you can order the two parts independently (and they will have no circular relatio...
Mon Apr 26, 2004 10:37 pm
Forum: Algorithms
Topic: Sorting by angle?
Replies: 5
Views: 1367
Can we ignore using arccos( dotproduct )? It is not dot product that you should use, but cross product. If you make a cross product of the two vectors coming out of the center point to the two points you are comparing, the sign of the product will do the job, and the value of the product is an inte...
Sat Oct 18, 2003 8:24 pm
Forum: Other words
Replies: 3
Views: 893

I was trying to revive my team's account, but we forgot the password and the two trailing letters. I tried using the password retrieval utility and as it said, I entered the account number, and it said that I am searching for too many users !! I tried sending an email to passwords@acm.uva.es to repo...
Tue Aug 19, 2003 8:16 pm
Forum: Volume 100 (10000-10099)
Topic: 10055 - Hashmat the Brave Warrior
Replies: 166
Views: 46663

### I had the same problem before

I had this same problem before. The problem would happen with int as well as with long long int. I think the reason is that in the standard C++ definition, abs is included in the <stdlib.h> or in <cstdlib>, but in MSVC++, they include it under <math.h>. It seems to be only another incompatibility fr...
Fri Aug 15, 2003 2:06 pm
Forum: Algorithms
Topic: Careers in algorithms?
Replies: 11
Views: 4178

### Careers in algorithms?

I lately had a discussion with a colleague of mine on the ACM contest and how it is so exciting and challenging. After talking about it for a bit of time I told him "So why do not you join the contest?" He instantly replied, "Because it is not useful at all!" Well, ... :-? Then he clarified, "The kn...
Thu Aug 14, 2003 9:50 pm
Forum: Algorithms
Topic: Big numbers; Maybe easy, but not for me.
Replies: 9
Views: 3748

### What about multiplication and division

Addition and subtraction are quite easy, but what about multiplication, and, even worse, division. I have an algorithm for division that guarantees TLE for almost all problems :lol: , but I cannot see where I can improve it. There must be some standart fast methods for that. Overflows are even worse...
Sun Jul 27, 2003 7:09 pm
Forum: Volume 102 (10200-10299)
Topic: 10279 - Mine Sweeper
Replies: 102
Views: 28608

### 10279 Runtime Error! Help!

My program compiles and runs correctly on my test cases, but produces run-time error on the judge. I do not see why. Can anybody help? [cpp] #include <iostream.h> void main() { int n; int i, j; char minearray[12][12]; char inarray[12][12]; int calcarray[12][12]; for (i = 0; i <= 11; i++) for (j = 0;...
Wed Jun 18, 2003 6:53 pm
Forum: Volume 100 (10000-10099)
Topic: 10062 - Tell me the frequencies!
Replies: 235
Views: 37122
Thank you for the reply. I tried it and it works with me. It will work with you if you put the input that is after it, or if it is at the end of file, which should be good enough for the judge.
Thu Jun 12, 2003 10:32 am
Forum: Volume 100 (10000-10099)
Topic: 10062 - Tell me the frequencies!
Replies: 235
Views: 37122

### 10062 - Tell me the frequencies

I know the code is badly written, but I cannot find the input set that cracked it. It gives WA. I tried a lot of weird input, but could not get unexpected results. [cpp]#include <iostream.h> #include <string.h> void main() { char temp[2000]; int freq[129]; int i; bool firsttime = true; cin.getline(t...