Pagini recente » Cod sursa (job #3283209) | Cod sursa (job #3289531) | Cod sursa (job #1837833) | Cod sursa (job #3264846) | Cod sursa (job #3291552)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int n, a, b, c, nrcif;
vector<int> v, aux;
void radsort()
{
for(int i = 1, p = 1; i <= nrcif; i ++, p *= 10)
{
aux.clear();
for(int i = 0; i < 10; i ++)
for(auto x : v)
{
int c = (x / p) % 10;
if(c == i)
aux.push_back(x);
}
v = aux;
}
}
int main()
{
f >> n >> a >> b >> c;
v.push_back(b);
for(int i = 1; i < n; i ++)
{
int x = (a * v.back() + b) % c;
v.push_back(x);
int nr = 0;
while(x)
x /= 10, nr ++;
nrcif = max(nrcif, nr);
}
radsort();
for(int i = 0; i < n; i += 10)
g << v[i] << " ";
return 0;
}