回答編集履歴
3
微修正
answer
CHANGED
|
@@ -59,7 +59,7 @@
|
|
|
59
59
|
for ( col = 0; col < n; ++col ) {
|
|
60
60
|
if ( row == 0 || min_of_max > max[row] ) {
|
|
61
61
|
min_of_max = max[col];
|
|
62
|
-
min_index =
|
|
62
|
+
min_index = col;
|
|
63
63
|
}
|
|
64
64
|
}
|
|
65
65
|
free(max);
|
2
修正
answer
CHANGED
|
@@ -51,14 +51,14 @@
|
|
|
51
51
|
for ( row = 0; row < n; ++row ) {
|
|
52
52
|
for ( col = 0; col < n; ++col ) {
|
|
53
53
|
scanf("%lf", &value);
|
|
54
|
-
if (
|
|
54
|
+
if ( row == 0 || max[col] < value ) {
|
|
55
55
|
max[col] = value;
|
|
56
56
|
}
|
|
57
57
|
}
|
|
58
58
|
}
|
|
59
|
-
for (
|
|
59
|
+
for ( col = 0; col < n; ++col ) {
|
|
60
60
|
if ( row == 0 || min_of_max > max[row] ) {
|
|
61
|
-
min_of_max = max[
|
|
61
|
+
min_of_max = max[col];
|
|
62
62
|
min_index = row;
|
|
63
63
|
}
|
|
64
64
|
}
|
1
追記
answer
CHANGED
|
@@ -31,4 +31,39 @@
|
|
|
31
31
|
```
|
|
32
32
|
./a.out < center.txt
|
|
33
33
|
2 4.000
|
|
34
|
+
```
|
|
35
|
+
|
|
36
|
+
[追記] 行/列を入れ替えたやつ:
|
|
37
|
+
```C
|
|
38
|
+
#include <stdio.h>
|
|
39
|
+
#include <stdlib.h>
|
|
40
|
+
|
|
41
|
+
int main() {
|
|
42
|
+
int n;
|
|
43
|
+
scanf("%d", &n);
|
|
44
|
+
int row, col;
|
|
45
|
+
double* max;
|
|
46
|
+
double min_of_max;
|
|
47
|
+
int min_index;
|
|
48
|
+
double value;
|
|
49
|
+
|
|
50
|
+
max = (double*)malloc(sizeof(double)*n);
|
|
51
|
+
for ( row = 0; row < n; ++row ) {
|
|
52
|
+
for ( col = 0; col < n; ++col ) {
|
|
53
|
+
scanf("%lf", &value);
|
|
54
|
+
if ( col == 0 || max[col] < value ) {
|
|
55
|
+
max[col] = value;
|
|
56
|
+
}
|
|
57
|
+
}
|
|
58
|
+
}
|
|
59
|
+
for ( row = 0; row < n; ++row ) {
|
|
60
|
+
if ( row == 0 || min_of_max > max[row] ) {
|
|
61
|
+
min_of_max = max[row];
|
|
62
|
+
min_index = row;
|
|
63
|
+
}
|
|
64
|
+
}
|
|
65
|
+
free(max);
|
|
66
|
+
printf("%d %.3f\n", min_index+1, min_of_max);
|
|
67
|
+
return 0;
|
|
68
|
+
}
|
|
34
69
|
```
|