Pagini recente » Cod sursa (job #1943681) | Cod sursa (job #2349211) | Cod sursa (job #3126160) | Cod sursa (job #493481) | Cod sursa (job #2644023)
#include <fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int v[10000005],n,cnt[10],aux[10000001];
void sorteaza(int MOD)
{
int i;
for(i=1; i<=n; i++)
cnt[v[i]/MOD%10]++;
for(i=1; i<10; i++)
cnt[i]+=cnt[i-1];
for(i=n; i>=1; i--)
aux[cnt[v[i]/MOD%10]--]=v[i];
for(i=1; i<=n; i++)
v[i]=aux[i];
}
void radixsort()
{
for(int put=1; put<=(int)1e9; put*=10)
{
sorteaza(put);
for(int i=0; i<10; i++)
cnt[i]=0;
}
}
int main()
{
int a,b,c,nr,i,cnt=0;
in>>n>>a>>b>>c;
v[1]=b;
for(i=2; i<=n; i++)
v[i]=(1LL*a*v[i-1]+b)%c;
radixsort();
for(i=1; i<=n; i+=10)
out<<v[i]<<" ";
return 0;
}