Pagini recente » Cod sursa (job #356379) | Cod sursa (job #2295455) | Cod sursa (job #275266) | Cod sursa (job #3175136) | Cod sursa (job #2983867)
//ALEXANDRU MICLEA
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <iostream>
#include <array>
#include <fstream>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <double, double> pdd;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<vector<ll> > vvll;
typedef vector<vector<pll> > vvpll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
const ll MOD = 1e9 + 7;
double eps = 1e-6;
#define forn(i,e) for(ll i = 1; i <= e; i++)
#define for0n(i,e) for(ll i = 0; i < (e); i++)
#define forsn(i,s,e) for(ll i = s; i <= e; i++)
#define rforn(i,s) for(ll i = s; i >= 1; i--)
#define rfor0n(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) fout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define llinf 2e18
#define iinf 1e9
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
using namespace std;
ifstream fin("algsort.in"); ofstream fout("algsort.out");
//ifstream fin("input.in"); ofstream fout("output.out");
//VARIABLES
int v[10005];
int n;
//FUNCTIONS
//MAIN
int main() {
fin >> n;
for (int i = 1; i <= n; i++){
fin >> v[i];
}
int ok = 1;
while(ok){
ok = 0;
for (int i = 1; i < n; i++){
int j = i + 1;
if (v[i] > v[j]){
ok = 1;
int aux = v[i];
v[i] = v[j];
v[j] = aux;
}
}
// for (int i = 1; i <= n; i++) cout << v[i] << ' ';
// cout << endl;
}
for (int i = 1; i <= n; i++) fout << v[i] << ' ';
return 0;
}