Pagini recente » Cod sursa (job #1411267) | Cod sursa (job #2453296) | Cod sursa (job #423899) | Cod sursa (job #2178124) | Cod sursa (job #2215696)
#include <fstream>
using namespace std;
ifstream fin("hacker.in");
ofstream fout("hacker.out");
const int N=10000000;
const int MOD=(1<<10);
int n;
int a,b,c;
int v[N+5],aux[N+5];
int ap[MOD+5];
int main()
{
fin>>n>>a>>b>>c;
v[1]=b;
for(int i=2;i<=n;i++)
v[i]=((long long)v[i-1]*a+b)%c;
int p=1;
while(1)
{
for(int i=0;i<MOD;i++)
ap[i]=0;
bool gasit=0;
for(int i=1;i<=n;i++)
{
int val=v[i]/p;
if(val)
gasit=1;
ap[val%MOD]++;
}
if(gasit==0)
break;
for(int i=1;i<MOD;i++)
ap[i]+=ap[i-1];
for(int i=n;i>=1;i--)
aux[ap[v[i]/p%MOD]]=v[i],ap[v[i]/p%MOD]--;
for(int i=1;i<=n;i++)
v[i]=aux[i];
p*=MOD;
}
for(int i=1;i<=n;i+=10)
fout<<v[i]<<" ";
fout<<"\n";
return 0;
}