Pagini recente » Rating Ionescu Robert Florin (robertfl) | Rating Stefan Durlanescu (qThunder) | Algoritmul lui Dinic | Cod sursa (job #2236852) | Cod sursa (job #2491618)
#include <stdio.h>
#include <stdlib.h>
FILE *f,*g;
int N,A,B,C;
void read() {
fscanf(f,"%d %d %d %d",&N,&A,&B,&C);
}
unsigned biti(int x,int n,int m){
return (x>>n)&~(~0<<m);
}
void RadixSort(int v[],int N) {
int t[4],T[N];
int i,k;
for(k=0;k<32/2;k++) {
for(i=0;i<4;i++)
t[i]=0;
for(i=0;i<N;i++)
t[biti(v[i],2*k,2)]++;
for(i=1;i<4;i++)
t[i]=t[i-1]+t[i];
for(i=N-1;i>=0;i--) {
T[t[biti(v[i],2*k,2)]-1]=v[i];
t[biti(v[i],2*k,2)]--;
}
for(i=0;i<N;i++)
v[i]=T[i];
}
}
int main()
{
f=fopen("radixsort.in","r");
if(!f) {
perror("Eorare");
exit(EXIT_FAILURE);
}
read();
int v[N];
v[0]=B;
for(int i=1;i<N;i++)
v[i]=(A*v[i-1]+B)%C;
g=fopen("radixsort.out","w");
if(!g) {
perror("Eorare");
exit(EXIT_FAILURE);
}
RadixSort(v,N);
for(int i=0;i<N;i=i+10)
fprintf(g,"%d ",v[i]);
return 0;
}