C :

#include<stdio.h>
int main(){
	int m,n,i,j;
	scanf ("%d%d",&m,&n);
	int a[m][n];
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){
			scanf("%d",&a[i][j]);	
		}
	} 
	int max = a[0][0],min = a[0][0];
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){ 
			if(a[i][j]>max){
				max = a[i][j];
			}
			if(a[i][j]<min){
				min = a[i][j];
			}
		}
	}
	printf("%d",max-min);
	return 0; 
}

C++ :

#include <bits/stdc++.h>
using namespace std;
int c = 0;
void num(int n){
	if(n == 1){
	}else{
		if(n % 2 == 0){
			num(n / 2);c++;
		}else{
			num(n * 3 + 1);c++;
		}
	}
	
}

int main(){
	int n;
	cin>>n;
	num(n);
	cout<<c<<endl;
	
}

Java :

import java.util.Scanner;
public class Main
{
	public static void main(String args[]){
		Scanner sc=new Scanner(System.in);
		int m=sc.nextInt();
		int n=sc.nextInt();
		int[][] a=new int[m][n];
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				a[i][j]=sc.nextInt();
			}
		}
		int max=a[0][0],min=a[0][0];
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				if(a[i][j]>max){
					max=a[i][j];
				}
				if(a[i][j]<min){
					min=a[i][j];
				}
			}
		}
		System.out.println(max-min);
	}
}

Python :

s = input().split()
m = int(s[0])
n = int(s[1])
# 定义一个空的二维列表,i是外层行数,j是内层列数
a = [[None for j in range(n)] for i in range(m)]
# 定义mx最大数,初始值定义最小
mx = 0
# 定义mi最小数,初始值定义最大
mi = 99999
for i in range(m):
    t = input().split()
    for j in range(n):
        a[i][j] = int(t[j])
        # 打擂
        mx = max(mx, a[i][j])
        mi = min(mi, a[i][j])
        # 输出最大数-最小数
print(mx - mi)