Pagini recente » Cod sursa (job #2210237) | Cod sursa (job #625518) | Cod sursa (job #3355825) | Cod sursa (job #558143) | Cod sursa (job #3311039)
#include <fstream>
#include <vector>
#define nmax (int)(1e7+1)
using namespace std;
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
int n,v[nmax],a,b,c;
vector<int>bck[10];
int main()
{
cin>>n>>a>>b>>c;
v[1]=b;
for(int i=2;i<=n;i++)
v[i]=(1LL*a*v[i-1]+b)%c;
for(int i=1,p=1;i<=10;i++,p*=10){
for(int j=0;j<10;j++)
bck[j].clear();
for(int j=1;j<=n;j++)
bck[v[j]/p%10].push_back(v[j]);
int k=0;
for(int j=0;j<10;j++)
for(auto x:bck[j])
v[++k]=x;
}
for(int i=1;i<=n;i+=10)
cout<<v[i]<<" ";
return 0;
}