UVa OJ Board

Oh, how silly I am.
I understand the meaning.
But the OJ System is down.

Me, too. I agree that the OJ System is down.
I wish it would be repaired soon.

Then, in input 2, how can the student get 9?

Thanks a LOT!

I know the algorithm to solve the problem.
But I DO NOT KNOW how to input the data!
Help!!!

<font size=-1>[ This Message was edited by: idler on 2002-02-22 16:14 ]</font>

Step 1:
#include <stdlib.h>
#include <malloc.h>

Step 2:
int *array_name[...][...]

Step 3:
array_name = (int *)malloc(sizeof(array_name));

Without pre-calculate, how to solve this problem in 0.000 seconds?

This is my code (C, 0.010 seconds) #include <stdio.h> #include <memory.h> #include <stdlib.h> #include <malloc.h> #define MODULE_NUM 1000000L #define LTYPE unsigned int #define MAX_SIZE 193 #define MAX_N 500 typedef struct { unsigned char size; LTYPE l[MAX_SIZE]; } big; /* Global variables */ big *g...

Any better solutions? I use DFS to solve this problem, and my program ran for a pretty long time. Here is my program(C++). #ifndef ONLINE_JUDGE #define ONLINE_JUDGE #endif #include <iostream.h> #include <stdlib.h> #include <ctype.h> #ifndef ONLINE_JUDGE #include <stdio.h> #endif #define MAX_TREE_LEN...