Pagini recente » Cod sursa (job #3254244) | Cod sursa (job #3256726) | Cod sursa (job #143499) | Cod sursa (job #1215297) | Cod sursa (job #3267572)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int NMax = 500000;
int X[NMax + 5]; int N;
vector <int> Bucket[10];
int main()
{
fin >> N;
for(int i = 1; i <= N; ++i)
fin >> X[i];
for(int p = 1; p <= 1e9; p = p *10)
{
for(int i = 1; i <= N; ++i)
Bucket[(X[i]/p)%10].push_back(X[i]);
int nr = 0;
for(int k = 0; k <= 9; ++k)
{
for(int i = 0; i < (int)Bucket[k].size(); ++i)
X[++nr] = Bucket[k][i];
Bucket[k].clear();
}
}
for(int i = 1; i <= N; ++i)
fout << X[i] << " ";
fout << "\n";
return 0;
}