Cod sursa(job #2430867)
Utilizator | Mircea Maierean mirceamaierean41 | Data | 16 iunie 2019 23:39:05 |
---|---|---|---|
Problema | Radix Sort | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <set>
using namespace std;
multiset<unsigned long long> radix;
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
int main()
{
unsigned long long n,a,b,c,y;
cin>>n>>a>>b>>c;
y=b;
radix.insert(y);
for(int i=2; i<=n; ++i)
{
radix.insert(y);
y=(a*y+b)%c;
}
multiset<unsigned long long>::iterator it;
int cnt=0;
for(it=radix.begin(); it!=radix.end(); ++it)
{
++cnt;
if(cnt%10==1) cout<<*it<<" ";
}
return 0;
}