Pagini recente » Cod sursa (job #1024155) | Cod sursa (job #2858309) | Cod sursa (job #894532) | Cod sursa (job #957836) | Cod sursa (job #1476381)
#include <cstdio>
#include <vector>
#include <cmath>
#define baza 2
using namespace std;
vector<int>q[baza];
int n,a,b,c;
int v[10000006];
void radix()
{
int lg=(int)log2(baza);
int ram=32/lg;
int pt10=1;
for(int i=1;i<=lg;i++) pt10*=10;
for(int put=0;put<ram;put++)
{
for(int i=1;i<=n;i++)
{
if(v[i]&(1<<put)) q[1].push_back(v[i]);
else q[0].push_back(v[i]);
}
int pos=0;
for(int j=0;j<baza;j++)
{
int s=q[j].size();
// for(int i=0;i<s;i++) printf("%d ",q[j][i]);
for(int i=0;i<s;i++) v[++pos]=q[j][i];
for(int i=0;i<s;i++) q[j].pop_back();
// printf(" | ");
}
// printf("\n");
}
}
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]=(a*v[i-1]+b)%c;
}
radix();
for(int i=1;i<=n;i+=10) printf("%d ",v[i]);
printf("\n");
}