## Search found 5 matches

Tue Jan 07, 2003 7:57 pm
Forum: Volume 1 (100-199)
Topic: 120 - Stacks of Flapjacks
Replies: 118
Views: 14500

### 120 - Stacks of Flapjacks

This is my source code...T.T please check code... [c] #include <stdio.h> #include <stdlib.h> #include <string.h> int i, j, position, length, stack[110], array[110]; char input_data[310]; void flip(int, int); void Quick_sort(int [], int, int); int Partition(int [], int, int); void SWAP(int *, int *);...
Tue Jan 07, 2003 7:50 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 25223

### ^^

Thanks.
but, Time Limit Exceeded...T.T
Mon Jan 06, 2003 4:37 am
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 25223

### [Problem 108] Maximum sum - Compile error...

My FreeBSD gcc or g++ compile no error. but Online judge compile error. [c] #include <stdio.h> int N, matrix[100][100], max_value; void nbyn_sum(int); int sum_matrix(int, int, int); int main() { int i, j; while (scanf("%d", &N) == 1) { max_value = 0; for (i = 0; i < N; i++) for (j = 0; j < N; j++) {...
Sun Jan 05, 2003 3:14 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 25223

### Problem 108 Why Time limit exceeded?

WhyWhyWhy??? [c] #include <stdio.h> int N, matrix[100][100], max_value; void nbyn_sum(int); int sum_matrix(int, int, int, int); int main() { int i, j; while (scanf("%d", &N) == 1) { max_value = 0; for (i = 0; i < N; i++) for (j = 0; j < N; j++) { scanf("%d", &matrix [j]); max_value += matrix [j]; } ...
Sun Jan 05, 2003 10:31 am
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 54570

### Problem 102... BCG 30 == BGC 30 ???

Hi everyone~~^^

Input data
1 2 3 4 5 6 7 8 9

BCG 30 : Answer.
BGC 30 : Wrong answer.

Why...?