Pagini recente » Cod sursa (job #1032576) | Cod sursa (job #3159447) | Cod sursa (job #2354081) | Cod sursa (job #2059848) | Cod sursa (job #1139166)
#include <fstream>
#include <vector>
using namespace std;
vector <int> h[10];
int i,y=1,n,j,a[500001];
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for (i=1;i<=n;i++)f>>a[i];
while (y<=(1<<30)+(1<<29))
{
for (i=0;i<=9;i++) h[i].clear();
for (i=1;i<=n;i++)
h[(a[i]/y%10)%666013].push_back(a[i]);
y*=10;n=0;
for (i=0;i<=9;i++)
for(j=0; j<h[i].size();j++)
a[++n]= h[i][j];
}
for (i=1;i<=n;i++) g<<a[i]<<" ";
g<<'\n';
f.close();
g.close();
return 0;
}