Pagini recente » Cod sursa (job #2043993) | Cod sursa (job #2592327) | Cod sursa (job #2622129) | Cod sursa (job #3126159) | Cod sursa (job #1020752)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("algsort.in");
ofstream fo("algsort.out");
struct valori {
int nr,c;};
valori m[500000][9],x[500000][9];
int n,a,k;
bool ok;
void init() {
for (int i=1;i<=n;i++)
for (int j=0;j<=9;j++) {
x[i][j].nr=0;
x[i][j].c=0;
}
}
int main()
{
fi>>n;
for (int i=1;i<=n;i++) {
int j=1;
fi>>a;
while (m[j][a % 10].nr!=0)
j++;
m[j][a % 10].nr=a;
m[j][a % 10].c=a;
}
while (ok==0) {
ok=1;
init();
for (int j=0;j<=9;j++) {
int i=1;
while (m[i][j].nr!=0) {
if (m[i][j].c % 10>0)
ok=0;
k=1;
while (x[k][m[i][j].c % 10].nr==0)
k++;
x[k][m[i][j].c % 10].nr=m[i][j].nr;
x[k][m[i][j].c % 10].c=m[i][j].c/10;
i++;
}
}
for (int i=1;i<=n;i++)
for (int j=0;j<=9;j++)
m[i][j]=x[i][j];
}
for (int i=1;i<=n;i++)
fo<<m[i][0].nr<<' ';
return 0;
}