Go: package main

import (
        "fmt"
        "sort"
)


func main() {
        var s []int
        var n int
        for i := 0; i < 5; i++ {
                fmt.Scanf("%d", &n)
                s = append(s, n)
        }
        sort.Ints(s)
        for i:= 1; i <= len(s); i++ {
                fmt.Printf("%d", s[len(s)-i])
                if i < len(s) {
                        fmt.Printf(" ")
                }
        }
        fmt.Printf("\n")
}

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

int main()
{
	 string input;
 while(cin && getline(cin, input)){
  int a, b, c, d, e;
  istringstream is(input);
  is>>a>>b>>c>>d>>e;
  vector<int> buf;
  buf.push_back(a);
  buf.push_back(b);
  buf.push_back(c);
  buf.push_back(d);
  buf.push_back(e);
  sort(buf.begin(),buf.end());
  reverse(buf.begin(),buf.end());
  for(int i=0; i<buf.size(); i++){
   if(i!=0) cout<<" ";
   cout<<buf[i];
  }
  cout<<endl;
 }
}

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

typedef long long ll;

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

C++: #include<cstdio>
#include<set>
using namespace std;
int main(){
  multiset<int,greater<int> > m;
  for(int i=0;i<5;i++){
    int n; scanf("%d",&n);
    m.insert(n);
  }
  int count=0;
  for(int const& a:m)
    printf(++count==5?"%d\n":"%d ",a);
}

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

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

  for( int i = 0 ; i < 5 ; i++ ) cin >> num[i];

  stable_sort( num , num+5 );

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

  cout << endl;

  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

using namespace std;

int num[5];

int main()
{
	
	while(!cin.eof())
	{
		for( int i=0;i<5;i++)
		{
			cin >> num[i];
		}

		sort(num, num+5, greater<int>());

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

	return 0;
}

C++: #define scanf_s scanf
//#define gets_s gets
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 81
#define _MAX 100
#define ABC 26
int main(void)
{
	int a[5],b;
	for (int i = 0; i < 5;++i){
		scanf_s("%d", &a[i]);
	}
	for (int i = 0; i < 5; ++i) {
		for (int j = 4; j > i; --j) {
			if (a[j] > a[j - 1]) {
				b = a[j - 1]; a[j - 1] = a[j]; a[j] = b;
			}
		}
	}
	for (int i = 0; i < 5; ++i) {
		if (i != 0)printf(" ");
		printf("%d", a[i]);
	}
	printf("\n");
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
  int a, b, c, d, e;
  vector<int> v;
  scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
  v.push_back(a);
  v.push_back(b);
  v.push_back(c);
  v.push_back(d);
  v.push_back(e);
  sort(v.begin(), v.end(), greater<int>());
  for (int i = 0; i < v.size(); ++i) {
    cout << v[i];
    if (i < v.size() - 1) {
      cout << " ";
    }
  }
  cout << endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int a[5]={0};
  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;
}

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

int main() {
	// your code goes here
	long long int a[5];
	for(int i=0;i<5;i++) cin >> a[i];
	for(int i=4;i>=0;i--) cout << a[i] << " ";
	cout << endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
  int a[5];
  for(int i=0;i<5;i++){
    cin >> a[i];
  }
  sort( a , a + 5 , greater<int>() );
  for(int i=0;i<5;i++){
    if(i==4)cout << a[i] << endl;
    else cout << a[i] << ' ';
  }
}

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 <algorithm>
#include <iostream>
using namespace std;

int main() {
     int nums[5];
     cin >> nums[0] >> nums[1] >> nums[2] >> nums[3] >> nums[4];
     sort(nums, nums+5, greater<int>());
     cout <<  nums[0] << " " <<nums[1] << " " << nums[2] << " " << nums[3] << " " << nums[4] << endl;
     return 0;
}

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

using namespace std;
int main(void)
{
	int a[5];
	for(int i = 0;i<5;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a,a+5);
	reverse(a,a+5);
		for(int i = 0;i < 5;i++)
		{
			printf("%d",a[i]);
			if(i <= 4) printf(" ");
		}



	return 0;
}

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

int main(){
	int n[4];
	for(int i = 0; i < 5; ++i)
		cin >> n[i]; 
	sort(n, n + 5, greater<int>());
	for(int i = 0; i < 5; ++i){
		if(i == 4)
			cout << n[i] << endl;
		else
			cout << n[i] << " ";
	}
	return 0;
}

C++: #include<stdio.h>

int d,s;

int main(){
	while(scanf("%d",&d)!=EOF){
		s=0;
		for(int i=d;i<600;i+=d){
			s+=i*i*d;
		}
		printf("%d\n",s);
	}


	return 0;
}

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

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

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

using namespace std;

int main()
{
	multiset<int ,greater<int> > num;
	int n;
	
	for(;cin >> n;)
	{
		num.clear();
		num.insert(n);
		for(int i=0;i<4;i++)
		{
			cin >> n;
			num.insert(n);
		}
		
		multiset<int,greater<int> >::iterator it = num.begin();
		
		for(;it!=num.end();)
		{
			it++;
			if(it!=num.end())
			{
				it--;
				cout << *it << " " ;
			}
			else
			{
				it--;
				cout << *it << endl;
			}
			
			it++;
		}
	}
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
    vector<int> vc;
    int x;
    for(int i=0;i<5;i++){
        cin >> x;
        vc.push_back(x);
    }
    sort(vc.rbegin(),vc.rend());
    for(int i=0;i<vc.size();i++){
        if(i)   cout << " " << vc[i];
        else    cout << vc[i];
    }
    cout << endl;
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
int main(){for(int a[5];~scanf("%d%d%d%d%d",a,a+1,a+2,a+3,a+4);printf("%d %d %d %d %d\n",a[4],a[3],a[2],a[1],a[0]))std::sort(a,a+5);}

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

using namespace std;

int main() {

	int i, j;
	deque <int> n;

	for(i=0; i<5; i++) {
		cin >> j;
		n.push_back(j);
	}

	sort(n.begin(), n.end());

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

	cout << endl;

	return 0;

}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <set>

using namespace std;

int main()
{
	set<int, greater<int> > n;
	set<int>::iterator ite;
	int a;

	for(int i=0; i<5; i++){
		cin >> a;
		n.insert(a);
	}
	int i=0;
	for(ite=n.begin(); i<5; ite++, i++){
		if(i==4){ cout << *ite << endl;}
		else{cout << *ite << " ";}
	}

	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, greater<int>());

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

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

int main(){

	int num[5];

	for (int i = 0; i < 5; i++)std::cin >> num[i];

	std::sort(num, num + 5, std::greater<int>());

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

	return 0;
}