Cod sursa(job #1542464)
Utilizator | Data | 5 decembrie 2015 13:28:31 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n, a, b, c, x, y;
int v[10000000], nr[10000000];
int main()
{
in>>n>>a>>b>>c;
x=b;
int cn=n;
cn--;
while(cn)
{
y=(a*x+b)%c;
v[y]++;
x=y;
cn--;
}
int j=1;
for(int i=1;i<=n;i++)
while(v[i]!=0)
{
nr[j]=i;
//cout<<nr[j]<<' ';
v[i]--;
j++;
}
for(int i=1;i<j;i+=10)
out<<nr[i]<<' ';
return 0;
}