Pagini recente » Cod sursa (job #2933436) | Cod sursa (job #2174785) | Cod sursa (job #657705) | Cod sursa (job #1852263) | Cod sursa (job #1111534)
#include <fstream>
#include <vector>
#include <list>
int main(){
std::ifstream fin("radixsort.in");
std::ofstream fout("radixsort.out");
unsigned N,A,B,C;
fin>>N>>A>>B>>C;
std::vector<unsigned> num(N);
std::vector<std::list<unsigned> > v(256);
num[0]=B;
for(unsigned i=1;i<N;++i){
num[i]=(A*num[i-1]+B)%C;
}
unsigned c=0xFF;
for(unsigned i=0;i<4;++i){
for(unsigned k=0;k<N;++k)
v[ (num[k]&c)>>(8*i) ].push_back(num[k]);
unsigned k=0;
for(unsigned i=0;i<256;++i){
for(auto it=v[i].begin();it!=v[i].end();++it)
num[k++]=*it;
}
c<<=8;
v=std::vector<std::list<unsigned> >(256);
}
for(unsigned i=0;i<N;i+=10) fout<<num[i]<<' ';
fout<<'\n';
}