Cod sursa(job #1420178)
| Utilizator | Data | 17 aprilie 2015 20:44:05 | |
|---|---|---|---|
| Problema | Radix Sort | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
#define nmax 10000000
using namespace std;
int v[nmax],n,a,b,c;
void readData() {
ifstream r("radixsort.in");
r>>n>>a>>b>>c;
v[0]=b;
for (int i=1;i<n;i++)
v[i]=(a * v[i-1] + b) % c;
r.close();
}
void writeData(int *v,int &n) {
ofstream w("radixsort.out");
for (int i=0;i<n;i+=10)
w<<v[i]<<" ";
w.close();
}
int main() {
readData();
sort(v,v+n);
writeData(v,n);
}
