OJ Board

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

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...

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...

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...

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...

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...

Please give me some idea to help me solve this problem.
Thanks

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!

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.

I get accepted. But i don't kow in what an error was. Thanks

Your last qustion my program solve correctly.

Please test my program on your input.

<font size=-1>[ This Message was edited by: ahanys on 2002-03-26 10:40 ]</font>

If number of words exceeds 1000 I print Too many. or somethink like this. See problem description.

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],&...

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...