C :

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

C++ :

#include <bits/stdc++.h>
using namespace std;

int a[210][210];

int main() {
	int n,m,x1,y1,x2,y2,ma = INT_MIN,mi = INT_MAX;
	cin>>n>>m;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			cin>>a[i][j];
			if(a[i][j] > ma){
				ma = a[i][j];
				x1 = i;
				y1 = j;
			}
			
			if(a[i][j] < mi){
				mi = a[i][j];
				x2 = i;
				y2 = j;
			}
		}
	}
	
	swap(a[x1][y1],a[x2][y2]);
	
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			cout<<a[i][j]<<" "; 
		}
		cout<<endl;
	}
	
	return 0;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
        int num2 = scanner.nextInt();
        int[][] a = new int[num1][num2];
//        int[][] b = new int[num1][num2];
        for (int i = 0; i < num1; i++) {
            for(int j = 0;j < num2;j++)
            a[i][j] = scanner.nextInt();
        }
        int max = a[0][0];
        int min = a[0][0];
        int x1 = 0,y1 = 0,x2 = 0,y2 = 0,temp;
        for (int i = 0; i < num1; i++) {
            for(int j = 0;j < num2;j++){
                if(max < a[i][j]){max = a[i][j];x1 = i;y1 = j;}
                else if(min > a[i][j]){min = a[i][j];x2 = i;y2 = j;}
            }
        }
        temp = a[x1][y1];
        a[x1][y1] = a[x2][y2];
        a[x2][y2] = temp;
        for (int i = 0; i < num1; i++) {
            for(int j = 0;j < num2;j++){
                System.out.print(a[i][j] + " ");
            }
            System.out.println("");
        }






    }public static void paiXu(int[] a,int length){
        int temp;
        for(int i = 0;i < length - 1;i++){
            for(int k = 0;k < length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXud(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] < a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXux(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX2(int[][] a){
        int max = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(max < a[i][j])max = a[i][j];
            }
        }
        return max;
    }public static int MIN2(int[][] a){
        int min = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(min > a[i][j])min = a[i][j];
            }
        }
        return min;
    }
    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
    public static int sum(int a){
        int x,s = 0;
        while(a != 0){
            x = a % 10;
            s = s + x;
            a /= 10;
        }
        return s;
    }
    public static boolean isPrime(int a){
        if(a <= 1)return false;
        else
        for(int i = 2;i <= Math.sqrt(a);i++){
            if(a % i == 0)return false;
        }return true;
    }

    public static long qiuYu(long i){
        long a;
        a = i % 10;
        return a;
    }
    public static int daoXu(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s * 10 + m;
            x /= 10;
        }
        return s;
    }

    public static int jiaWei(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s + m;
            x /= 10;
        }
        return s;
    }

    public static int fun(int x){
        if(x == 1 || x == 2)return 1;
        else return fun(x - 1) + fun(x - 2);
    }
}

Python :

sr=input().split()
n=int(sr[0])
m=int(sr[1])
a=[[10 for i in range(m)] for j in range(n)]
for i in range(n):
    sr=input().split()
    for j in range(m):
        a[i][j]=int(sr[j])
da=a[0][0]
dax=0
day=0
xiao=a[0][0]
xx=0
xy=0
for i in range(n):
    for j in range(m):
        if(a[i][j]>da):
            da=a[i][j]
            dax=i
            day=j
        if(a[i][j]<xiao):
            xiao=a[i][j]
            xx=i
            xy=j
t=a[dax][day]
a[dax][day]=a[xx][xy]
a[xx][xy]=t
for i in range(n):
    for j in range(m):
        print(a[i][j],end=" ")
    print()