Cod sursa(job #2406266)
Utilizator | Mirt Leonard Leonard123 | Data | 15 aprilie 2019 16:32:45 |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
#define maxn 2150000000
int index[maxn/100], sir[10000005],n,a,b,c,k=1;
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
int main(){
cin>>n>>a>>b>>c;
sir[1]=b;
index[b]++;
for(int i=2; i<=n; i++){
sir[i] = (a * sir[i-1] + b) % c;
index[sir[i]]++;
}
for(int i=1; k<=n; i++)
if(index[i])
while(index[i]){
index[i]--;
if(k%10==1)
cout<<i<<' ';
k++;
}
}