Pagini recente » Cod sursa (job #3139094) | Cod sursa (job #2621733) | Viata de dupa olimpiade? (partea I) | Cod sursa (job #893751) | Cod sursa (job #1476387)
#include <cstdio>
#define baza 2
using namespace std;
int n,a,b,c,maxim;
int v[10000006],out[10000006];
void counting(int nr)
{
int ct[10];
for(int i=0;i<10;i++) ct[i]=0;
for(int i=1;i<=n;i++) ct[(v[i]/nr)%10]++;
for(int i=1;i<10;i++) ct[i]+=ct[i-1];
for(int i=n;i>=1;i--)
{
out[ct[(v[i]/nr)%10]]=v[i];
ct[(v[i]/nr)%10]--;
}
/// printf("\n");
for(int i=1;i<=n;i++) v[i]=out[i];
}
void radix()
{
for(int nr=1;maxim/nr>0;nr*=10)
{
counting(nr);
}
}
int main()
{
freopen ("radixsort.in","r",stdin);
freopen ("radixsort.out","w",stdout);
scanf("%d%d%d%d",&n,&a,&b,&c);
// for(int i=1;i<=n;i++) scanf("%d",&v[i]);
v[1]=b;
for(int i=2;i<=n;i++)
{
v[i]=(1LL*a*v[i-1]%c+b)%c;
if(maxim<v[i]) maxim=v[i];
///printf("%d ",v[i]);
}
/// printf("\n");
radix();
for(int i=1;i<=n;i+=10) printf("%d ",v[i]);
}