Cod sursa(job #1740772)
| Utilizator | Data | 12 august 2016 12:08:16 | |
|---|---|---|---|
| Problema | Radix Sort | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("radixsort.in");
ofstream t ("radixsort.out");
int32_t n,v[10000000],bucket[256][500000];
void generatenum(int a,int b,int c)
{
v[0]=b;
for (int i=1; i<n; ++i)
v[i]=(a*v[i-1]+b)%c;
}
int main()
{int a,b,c;
f>>n>>a>>b>>c;
generatenum(a,b,c);
bucket[255][499999]=2;
v[9999999]=13;
return 0;
}
