Pagini recente » Cod sursa (job #2005788) | Cod sursa (job #633775) | Cod sursa (job #1792089) | Cod sursa (job #1344083) | Cod sursa (job #1867733)
#include <cstdio>
#include <vector>
#define NMAX 10000000
using namespace std;
vector <int> a;
vector <int> sol[NMAX];
vector <int> :: iterator it;
int i,j,l,x,b,c,n,y,m;
int ncifre(int k)
{
int nr;
while(k!=0)
{
nr++;
k/=10;
}
return nr;
}
int main()
{
freopen("radixsort.in","r",stdin);
freopen("radixsort.out","w",stdout);
scanf("%d %d %d %d",&n,&x,&b,&c);
for(i=1 ; i<=n ; i++)
{
if(i==1)
l=b,a.push_back(l);
else l=(x*a[i-1]+b)%c;a.push_back(l);
y=max(y,l);
}
m=ncifre(y);
x=1;
for(i=1; i<=m; i++)
{
x=x*10;
for(it=a.begin();it!=a.end();++it)
{
if((*it)==((*it)%x))
{
sol[0].push_back(*it);
}
else
{
sol[(*it%x)/(x/10)].push_back(*it);
}
}
a.clear();
for(j=0;j<=9;j++)
{
for(it=sol[j].begin();it!=a.end();++it)
{
a.push_back(*it);
}
sol[j].clear();
}
}
for(auto it:a)
{
printf("%d",*it);
}
return 0;
}