Pagini recente » Cod sursa (job #31885) | Cod sursa (job #2586124) | Cod sursa (job #1207676) | Cod sursa (job #985771) | Cod sursa (job #1191076)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
const int Nmax=10000005;
int n,A,B,C,nr,puteri[20],maxim;
int a[Nmax];
vector<int>v[10];
inline int Cifra(int x,int y)
{
while (y)
{
x/=10;
y--;
}
return x%10;
}
inline void REZ()
{
int i,len,j,l,grad=-1;
while (grad<=nr)
{
grad++;
for (i=0;i<=10;i++) v[i].clear();
for (i=1;i<=n;i++)
v[Cifra(a[i],grad)].push_back(a[i]);
j=1;
for (i=0;i<=9;i++)
{
len=v[i].size();
l=0;
while (l<len)
{
a[j]=v[i][l];
l++;j++;
}
}
}
}
int main()
{
int i;
fin>>n>>A>>B>>C;
a[1]=B;
for (i=1;i<=n;i++) {a[i]=(A*a[i-1]+B)%C;maxim=max(maxim,a[i]);}
while (maxim) {nr++;maxim/=10;}
puteri[0]=1;
for (i=1;i<=15;i++) puteri[i]=puteri[i-1]*10;
REZ();
for (i=1;i<=n;i+=10) fout<<a[i]<<" ";
fout<<"\n";
return 0;
}