C :

#include<stdio.h>
#include<stdlib.h>
int cmp(void const *a, void const *b)
{
    return *(int *)b - *(int *)a;
}
int main()
{
  int i,a[15];
  while(scanf("%d",&a[0])!=EOF){
    for(i=1;i<10;i++) scanf("%d",&a[i]);
    qsort(a,10,sizeof(a[0]),cmp);
    printf("max=%d\n",a[0]);
  }
    return 0;
}

C++ :

#include <stdio.h>

int MaxValue(int arr[], int n){
	int maxValue = 0x80000000;
	for(int i=0; i<n; i++){
		if(arr[i] > maxValue){
			maxValue = arr[i];
		}
	}

	return maxValue;
}

int MaxValueWithIndex(int arr[], int n, int &maxIndex){
	maxIndex = 0;
	for(int i=1; i<n; i++){
		if(arr[i] > arr[maxIndex]){
			maxIndex = i;
		}
	}

	return maxIndex;
}

int main(){
	int arr[11];
	while(scanf("%d", &arr[0]) != EOF){
		for(int i=1; i<10; i++){
			scanf("%d", &arr[i]);
		}
		printf("max=%d\n", MaxValue(arr, 10));
	}

	return 0;
}

Pascal :

var i:longint; n,max:real;
begin
  while not eof do
     begin
       max:=-1000000000000000000;
       for i:=1 to 10 do
         begin
           read(n);
           if n>max then max:=n;
         end;
       readln;
       writeln('max=',max:0:0);
     end;
end.

Java :

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin = new Scanner(System.in);
		int[] arr = new int[10];
		int i;
		while(cin.hasNext())
		{
			Arrays.fill(arr, 0);
			for(i=0;i<arr.length;i++)
			{
				arr[i]=cin.nextInt();
			}
			Arrays.sort(arr);
			System.out.println("max="+arr[9]);
		}
	}

}

Python :

while True:
    print "max=%d" % max([int(i) for i in (raw_input().split())])