Cod sursa(job #2276835)
| Utilizator | Data | 5 noiembrie 2018 15:09:41 | |
|---|---|---|---|
| Problema | Radix Sort | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#define MAX 10000010
using namespace std;
typedef long long ll;
ll n,a,b,c,aa,nrn;
int ap[MAX];
int main()
{
ifstream f ("radixsort.in");
ofstream g ("radixsort.out");
f>>n>>a>>b>>c;
aa=b; ap[aa]++;
for(int i=2;i<=n;i++) aa=(a*aa+b)%c,ap[aa]++;
for(int i=0;i<c;i++)
while(ap[i]){
nrn++;
if(nrn%10==1)
g<<i<<" ";
ap[i]--;
}
f.close ();
g.close ();
return 0;
}
