Pagini recente » Cod sursa (job #2289178) | Cod sursa (job #2753983) | Cod sursa (job #2851418) | Cod sursa (job #789729) | Cod sursa (job #1647628)
#include <fstream>
#define NMAX 10000003
using namespace std;
int a[NMAX], n;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
void Sort(int p)
{ int v[10], b[NMAX], i, x;
for (i=0; i<10; ++i)
v[i]=0;
for (i=1; i<=n; ++i)
{ x=(a[i]/p)%10;
v[x]++;
}
for (i=1; i<10; ++i)
v[i]+=v[i-1];
for (i=n; i; --i)
{ x=(a[i]/p)%10;
b[v[x]--]=a[i];
}
for (i=1; i<=n; ++i)
a[i]=b[i];
}
void Radix(int maxi)
{ for (int p=1; p<=maxi; p=p*10)
Sort(p);
}
void Citire()
{ int v, b, c, i;
f>>n>>v>>b>>c;
a[1]=b;
for (i=2; i<=n; ++i)
a[i]=(v*a[i-1]+b)%c;
}
int main()
{ Citire();
int i, maxi=0;
f>>n;
for (i=1; i<=n; ++i)
maxi=max(maxi, a[i]);
Radix(maxi);
for (i=1; i<=n; i+=10)
g<<a[i]<<' ';
return 0;
}