Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := 5
	array := make([]int, n)
	for i := 0; i < n; i++ {
		array[i] = nextInt()
	}
	sort.Slice(array, func(i, j int) bool { return array[i] > array[j] })
	arrayStr := fmt.Sprint(array)
	l := len(arrayStr)
	fmt.Println(arrayStr[1:(l - 1)])
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> a(5);
  for(int i=0; i<5; i++) cin >>a[i];
  sort(a.begin(), a.end());
  cout <<a[4]<<" "<<a[3]<<" "<<a[2]<<" "<<a[1]<<" "<<a[0]<<endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
//#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//

vector<int> v;

int main() {
	for (int i = 0; i < 5; i++) {
		int a; cin >> a;
		v.push_back(a);
	}
	sort(v.rbegin(), v.rend());
	for (int i = 0; i < 5; i++) {
		cout << v[i];
		if (i != 4)cout << " ";
	}
	cout << endl;
}

C++: #include <stdio.h>
main(){
  int cur,a[5],i,max,tmp;
  while( scanf("%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4]) !=EOF){
  for(cur=0;cur<5;cur++){
    max=cur;
    for(i=cur;i<5;i++){
      if(a[i]>a[max]){
	max=i;
      }
    }
    tmp=a[cur];
    a[cur]=a[max];
    a[max]=tmp;
  }
    printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
  }
return 0; 
}

C++: #include<cstring>
#include<cstdio>
#include<iostream>
#define SORT(a,n) for(int i=0;i<n-1;i++)for(int j=i+1,t;j<n;j++)if(a[i]<a[j]){t=a[i];a[i]=a[j];a[j]=t;}

 
using namespace std;

int main(){
	int a[5];
	cin >> a[0] >> a[1]>> a[2]>> a[3]>> a[4];

	SORT(a,5);

	cout << a[0] << " " << a[1] << " " << a[2] << " " << a[3] << " " << a[4] << endl;

	return 0;
}

C++: #include <stdio.h>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int a[5];

int main() {
    rep (i, 5) scanf("%d", a+i);
    sort(a, a+5);
    reverse(a, a+5);
    rep (i, 5) printf("%d%c", a[i], "\n "[i<4]);
    return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int main()
{
	int n;
	scanf("%d", n);
	int Fraction = 1;
	for(int i = 0; i < n; i++){
		Fraction *= n-i;
	}
	printf("%d\n", Fraction);
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for (int i=0; i < (n); i++)
#define all(c) (c).begin(), (c).end()

int main() {
  vector<int> v(5);

  rep(i,5) cin >> v[i];
  sort(all(v), greater<int>());
  rep(i, 4) cout << v[i] << " ";
  cout << v[4] << endl;

  return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int a[5];
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
    sort(a,a+5);
    cout<<a[4]<<" "<<a[3]<<" "<<a[2]<<" "<<a[1]<<" "<<a[0]<<endl;         
    return 0;
}

C++: #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>

using namespace std;






int main()
{
	int a[5];
	int b[5];
	for (int i = 0; i < 5; i++) {
		cin >> a[i];
	}
	sort(a, a+5);
	for (int i = 0; i < 5; i++) {
		b[i] = a[4 - i];
	}
	for (int i = 0; i < 4; i++) {
		cout << b[i] << " ";
	}
	cout << b[4] << endl;
}

C++: #include <iostream>

using namespace std;
int main(void){
    // Here your code !
int a[5];

for(int i=0;i<5;i++){
cin>>a[i];
}

sort(a,a+5);

for(int i=4;i>0;i--){
cout<<a[i]<<" ";
}
cout<<a[0];
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,P> pip;
typedef long long ll;
const int inf=(1<<31)-1;
const double pi=acos(-1);

int n;
vi num(5);

int main(){
	for(int i=0;i<5;i++) cin>>num[i];
	for(int i=0;i<5;i++) num[i]*=-1;
	sort(num.begin(),num.end());
	for(int i=0;i<4;i++) cout<<num[i]*-1<<' ';
	cout<<num[4]*-1<<endl;
}

C++: #include<iostream>

int main(){
	int a[5],i,n,j;
	
	for(i=0;i<5;i++){
	std::cin>>a[i];
	}
	for(i=0;i<5;i++){
		for(j=i+1;j<5;j++){
			if(a[i]<a[j]){
				n=a[i];
				a[i]=a[j];
				a[j]=n;
				}
			}
		}
	for(i=0;i<5;i++){
	std::cout<<a[i]<<" ";
	}	
	
	std::cout<<std::endl;
	
	return 0;
	
	}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> num;
  int n;
  for(int i=0; i<5; i++){
    cin >> n;
    num.push_back(n);
  }

  sort(num.begin(), num.end(), greater<int>());

  for(int i=0; i<5; i++){
    if(i == 0)
      cout << num[i];
    else
      cout << " " << num[i];
  }
  cout << endl;
}

C++: #include <stdio.h>

int main(void)
{
int a[5];

for (int i = 0; i < 5; i++){
scanf("%d", &a[i]);
}

for (int i = 0; i < 5; i++){
for (int j = i + 1; j < 5; j++){
if (a[i] < a[j]){
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
}
}

printf("%d", a[0]);
for (int i = 1; i < 5; i++){
printf(" %d", a[i]);
}
puts("");

return (0);
}

C++: #include<stdio.h>
int main()
{
    int a,b,c,d,e,tem,i,j,arr[5];
    while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)==5)
    {

        arr[0]=a;
        arr[1]=b;
        arr[2]=c;
        arr[3]=d;
        arr[4]=e;
        for(i=0; i<5; i++)
        {
            for(j=0; j<5-1; j++)
            {
                if(arr[j]<arr[j+1])
                {
                    tem=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=tem;
                }
            }
        }
        for(i=0; i<5; i++)
        printf("%d %d %d %d %d",arr[i]);
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
int a[5];
for( int s = 0; s < 5; s++){
cin >> a[s]
}
sort( a, a + 5, greater<int>());
for(int i = 0; i < 5; i++){
 cout << a[i];
}
return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int main(){
	int a[5];

	for(int i=0; i<5; i++){
	cin >> a[i];
	}

	sort(a, a+5);

	for(int m=4; 0<=m; m--){
		cout  << a[m] << " ";
	}
	cout << endl;
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;

using namespace std;
int main(){

    vector<int> v(5);
    for(int i=0;i<5;i++){
        int x;
        cin>>x;
        v[i]=x;
    }
    sort(v.rbegin(),v.rend());
    rep(i,5){
        if(i!=0){cout<<" ";}
            cout<<v[i];
        
        
    }
    cout<<endl;
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;



int main()
{
	vector<int> v;
	for (int i = 0; i < 5; i++){
		int n;
		cin >> n;
		v.push_back(n);
	}
	sort(v.begin(), v.end());
	for (int i = 4; i > 0; i--){
		cout << v[i]<<" ";
	}
	cout << v[0] << endl;
	return 0;
}