Pagini recente » Cod sursa (job #1903919) | Cod sursa (job #2766349) | Cod sursa (job #342107) | Cod sursa (job #2756119) | Cod sursa (job #1191060)
#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];
int a[Nmax];
vector<int>v[10];
inline void REZ()
{
int i,cifra,len,j,l,pas=-1;
while (nr<=11)
{
nr++;pas++;
for (i=0;i<=9;i++) v[i].clear();
for (i=1;i<=n;i++)
{
cifra=(a[i]/puteri[pas])%10;
v[cifra].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;
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;
}