Cod sursa(job #1142097)
Utilizator | Data | 13 martie 2014 15:15:05 | |
---|---|---|---|
Problema | Radix Sort | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int a,b,c,v[10000001],n,i;
int main()
{
f>>n>>a>>b>>c;
v[1]=b;
for(i=2;i<=n;i++)
v[i]=(a*v[i-1]+b)%c;
sort(v+1,v+n+1);
for(i=1;i<=n;i+=10)
g<<v[i]<<" ";
return 0;
}