Pagini recente » Borderou de evaluare (job #1277861) | Borderou de evaluare (job #2817790) | Borderou de evaluare (job #1495162) | Borderou de evaluare (job #2427976) | Cod sursa (job #3175705)
#include <fstream>
#include <algorithm>
using namespace std;
int n,a,b,c,v[10000000];
ifstream fin ("radixsort.in");
ofstream fout ("radixsort.out");
int main()
{
fin >>n>>a>>b>>c;
v[1]=b;
for (int i=2;i<=n;i++)
{
v[i] = (a * v[i-1] + b) % c;
}
sort(v, v+n+1);
for (int i=1;i<=n;i+=10)
fout<<v[i]<<' ';
return 0;
}