Pagini recente » Cod sursa (job #1253804) | Cod sursa (job #1937330) | Cod sursa (job #3170432) | Cod sursa (job #1451637) | Cod sursa (job #1712531)
#include <iostream>
#include <fstream>
#include <map>
#include <vector>
#include <iterator>
#include <algorithm>
#include <tuple>
using namespace std;
long long power(long long N, long long P){
if(P == 0)
return 1;
long long X = power(N, P/2)%1999999973;
if(P%2==1)
return (1LL*X*X*N)%1999999973;
else
return (1LL*X*X)%1999999973;
}
int main(){
int n;
ifstream in("algsort.in");
ofstream out("algsort.out");
in >> n;
vector<int> v(n);
for(auto &x:v)
in >> x;
sort(v.begin(), v.end());
for(auto &x:v)
out<<x<<' ';
return 0;
}