Search found 24 matches
- Mon Dec 08, 2003 12:58 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10307 - Killing Aliens in Borg Maze
- Replies: 54
- Views: 19300
This is due to poor java support of the UVA judge. java.util.Arrays and java.util.Comparator are not supported by the judge. Pretty much anything not available in Java 1.2 isn't supported, and a good portion of 1.2 isn't supported as well. Really I create my own quicksort and get Accepted. Thank You
- Wed Dec 03, 2003 3:21 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10307 - Killing Aliens in Borg Maze
- Replies: 54
- Views: 19300
Compile error in 10307 Killing alliens in borg's maze!!!!!!
I have a big problem with judge compile error because I don't know what's wrong. If anybody knows what is the problem. pls Reply. Thx. [java] /* @JUDGE_ID: 9072?? 10307 JAVA */ import java.util.Comparator; import java.util.Arrays; class Point implements Comparator { public Point(int r, int c) { this...
- Fri May 02, 2003 10:35 am
- Forum: Algorithms
- Topic: Dynamic programming
- Replies: 3
- Views: 3016
I make some program, but it is ot an optimal strategy
my program is this: [cpp] int M[102]; int m, n; int main() { scanf("%i%i", &n, &m); for (int p=0; p<=n; p++) { T[p] = -1; M[0] = 0; if (p <=m) { M[p] = p; continue; } for (int i=1; i<=m; i++) { if (m + M[p-m] > M[p]) M[p] = m + M[p-m]; } } } [/cpp] If somebody can me give a hint to...
- Wed Apr 30, 2003 7:01 pm
- Forum: Algorithms
- Topic: Dynamic programming
- Replies: 3
- Views: 3016
Is my assumption correct?
If I know how many cookies eat the first player when game starts with X cookies for some X = 0,1,2,...,x and I must count how many cookies will 1st player can eat if he starts and game starts with X+1 cookies, may I progress like this I will try to get all M = 1,2,...,m and i will get max of the sec...
- Tue Mar 25, 2003 2:07 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10307 - Killing Aliens in Borg Maze
- Replies: 54
- Views: 19300
10307 Killing Aliens in Borg Maze
I have curently wrong answer and on the test data I get the correct output. May somebody give some INPUT/OUTPUT or look at the code what's wrong on it. Thanks in advance ahanys. [cpp] /* @JUDGE_ID: 9072XC 10307 C++ */ #include <stdio.h> #include <stdlib.h> const int MAX=100; char p[MAX+1][MAX+1]; in...
- Thu Mar 20, 2003 1:42 pm
- Forum: Algorithms
- Topic: Dynamic programming
- Replies: 3
- Views: 3016
Dynamic programming
Look at this address: http://cepc.mimuw.edu.pl/pages/problems.html there are problems which was in Central European Programming Contest. Especially at problem H Voracious steve. This problem may be solved by usage dynamic programming. But I don't understand the IDEA of this. If anybody may explain i...
- Fri Feb 14, 2003 12:35 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10404 - Bachet's Game
- Replies: 10
- Views: 4926
10404
Please give me some idea to help me solve this problem.
Thanks
Thanks
- Fri May 17, 2002 11:41 am
- Forum: Volume 100 (10000-10099)
- Topic: 10005 - Packing polygons
- Replies: 49
- Views: 16598
10005 - Packing polygons
What's wrong on my solution. I tested all pairs of points and if maximum distance of 2 points is greater then 2*R then I print no else yes. WHAT'S WRONG?
- Mon May 06, 2002 11:31 am
- Forum: Volume 102 (10200-10299)
- Topic: 10256 - The Great Divide
- Replies: 21
- Views: 8003
TESTING
YOU must test if every point of first convex hull is in second an if any point of second convex hull is in the first. If any THEN PRINT NO!
- Mon Apr 29, 2002 11:46 am
- Forum: Volume 102 (10200-10299)
- Topic: 10256 - The Great Divide
- Replies: 21
- Views: 8003
Solution to this problem!!!!
You find the 2 convex hulls, each for one set of houses and determine whether the each point of one convex hull is inside of another and on the contrary. If there is any point that print NO else print YES. 

- Tue Mar 26, 2002 11:42 am
- Forum: Volume 100 (10000-10099)
- Topic: 10066 - The Twin Towers
- Replies: 35
- Views: 14152
- Tue Mar 26, 2002 11:40 am
- Forum: Volume 100 (10000-10099)
- Topic: 10027 - Language Cardinality
- Replies: 16
- Views: 4448
- Tue Mar 19, 2002 4:30 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10027 - Language Cardinality
- Replies: 16
- Views: 4448
- Tue Mar 19, 2002 12:32 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10027 - Language Cardinality
- Replies: 16
- Views: 4448
10027 - Language Cardinality
I repetely testing if there is any other derivation of any frase. /* @JUDGE_ID: 9072XC 10027 C++ */ #include <stdio.h> #include <string.h> char r[1001][2][11]; char s[1050][10000]; int main() { char l[10000]; char *u; int i = 0; int poc = 1; gets(l); u = strtok(l, """); sprintf(s[0],&...
- Tue Mar 12, 2002 12:07 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10252 - Common Permutation
- Replies: 150
- Views: 56313
10252
It is easy to solve it: Is my solution correct? input: aab baa output: aab or input: aab baa output: ab Do you know in which may be error? Thanks /* @JUDGE_ID: 9072XC 10252 C++ */ #include <string.h> #include <stdio.h> int main() { char a[10000],b[10000]; int prvkya[30]; int prvkyb[30]; int i=0; whi...