Cod sursa(job #1093067)

Utilizator raulstoinStoin Raul raulstoin Data 27 ianuarie 2014 18:40:52
Problema Radix Sort Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<fstream>
#include<queue>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int n,a,b,c,p2[3]={(1<<8),(1<<16),(1<<24)};
queue<int> radix[2][256];
const int sz=15000000;
char output[sz+2],*out=output;

void print(int x,bool sw)
{
	if(!x)
	{
		if(sw)
			*out++='0';
		return;
	}
	print(x/10,sw);
	*out++='0'+x%10;
}

int main()
{
	fin>>n>>a>>b>>c;
	int ant=b,l=0;
	for(int i=1;i<=n;i++)
	{
		radix[0][ant&255].push(ant);
		ant=(1LL*a*ant+b)%c;
	}
	 
	for(int i=0;i<3;i++,l=1-l)
		for(int k=0,val;k<256;k++)
			for(;!radix[l][k].empty();radix[l][k].pop())
			{
				val=radix[l][k].front();
				radix[1-l][ (val>>p2[i])&255 ].push(val);
			}
	 
	for(int k=0,i=1;k<256;k++)
		for(;!radix[l][k].empty();radix[l][k].pop(),i++)
			if(i%10==1)
			{
				print(radix[l][k].front(),radix[l][k].front()==0);
				*out++=' ';
			}
	fout<<output;
	
	return 0;
}