Pagini recente » Cod sursa (job #446549) | Cod sursa (job #1789932) | Cod sursa (job #192950) | Monitorul de evaluare | Cod sursa (job #1190667)
#include<fstream>
#include<vector>
using namespace std;
struct nod
{
int val,aux;
};
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
const int Nmax=10000005;
int n,A,B,C,nr;
nod a[Nmax];
vector<nod>v[10];
inline void REZ()
{
int i,cifra,len,j,l;
while (nr<n)
{
for (i=0;i<=9;i++) v[i].clear();
for (i=1;i<=n;i++)
{
if (!a[i].aux) nr++;
cifra=a[i].aux%10;
a[i].aux/=10;
v[cifra].push_back(a[i]);
}
j=1;
for (i=0;i<=9;i++)
{
len=v[i].size();
l=0;
while (l<len)
{
a[j]=v[i][l];
l++;j++;
}
}
}
}
int main()
{
int i;
fin>>n>>A>>B>>C;
a[1].val=a[1].aux=B;
for (i=1;i<=n;i++) a[i].val=a[i].aux=(A*a[i-1].val+B)%C;
REZ();
for (i=1;i<=n;i+=10) fout<<a[i].val<<" ";
fout<<"\n";
return 0;
}