//hdoj2020
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int a[100000];
bool cmp(int i, int j) {
return abs(i)>abs(j);
}
int main() {
int n;
while(scanf("%d", &n)!=EOF && n) {
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a,a+n,cmp); //用冒泡也是一样的
for(int i = 0; i < n; i++) {
printf(i?" %d":"%d", a[i]);
}
printf("\n");
}
return 0;
}
//hdoj2021
#include<stdio.h>
int b[6] = {100, 50, 10, 5, 2, 1};
int main() {
int n;
while(scanf("%d", &n)!=EOF && n) {
int sum = 0;
int temp;
for(int i = 0; i < n; i++) {
scanf("%d", &temp);
for(int j = 0; j < 6; j++) {
sum += temp/b[j];
temp %= b[j];
}
}
printf("%d\n", sum);
}
return 0;
}
/*
#include<stdio.h>
int b[6] = {100, 50, 10, 5, 2, 1};
int main() {
int n;
while(scanf("%d", &n)!=EOF && n) {
int sum = 0;
int temp;
for(int i = 0; i < n; i++) {
scanf("%d", &temp);
sum += temp/100;
temp %= 100;
sum += temp/50;
temp %= 50;
sum += temp/10;
temp %= 10;
sum += temp/5;
temp %= 5;
sum += temp/2;
temp %= 2;
sum += temp/1;
}
printf("%d\n", sum);
}
return 0;
}
*/
//hdoj2022
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
int m, n, X, Y;
while(scanf("%d%d", &m, &n)!= EOF) {
int t = 0, _max = 0, max_t;
for(int i = 0; i < m; i++)
for(int j= 0; j < n; j++) {
scanf("%d", &t);
int x = abs(t); //如果是负的 而且这个负值的绝对值大于int 就会溢出 导致x为负值
if(x > _max) {
X = i;
Y = j;
max_t = t;
_max = x;
}
}
printf("%d %d %d\n", X+1, Y+1, max_t);
}
return 0;
}
//hdoj2023
#include<stdio.h>
double score[55][7];
int main() {
int n, m;
while(scanf("%d%d", &n, &m)!=EOF) {
for(int i = 1; i <= n; i++) { //行
int sum = 0;
for(int j = 1; j <= m; j++) { //列
scanf("%lf", &score[i][j]);
sum += score[i][j];
}
score[i][0] = sum*1.0/m; //每个学生的平均成绩
}
for(int i = 1; i <= m; i++) {//列
int sum = 0;
for(int j = 1; j <= n; j++) { //行
sum += score[j][i];
}
score[0][i] = sum*1.0/n;//每门课的平均成绩
}
int ans = 0;
for(int i = 1; i <= n; i++) { //行
bool flag = true;
for(int j = 1; j <= m; j++) {
if(score[i][j] < score[0][j]) { //列
flag = false; break;
}
}
if(flag) ans++;
}
for(int i = 1; i <= n; i++) {
printf(i!=1?" %.2lf":"%.2lf", score[i][0]);
}
printf("\n");
for(int i = 1; i <= m; i++) {
printf(i!=1?" %.2lf":"%.2lf", score[0][i]);
}
printf("\n");
printf("%d\n\n", ans);
}
return 0;
}