Pagini recente » Cod sursa (job #206240) | Cod sursa (job #1131986) | Diferente pentru utilizator/tryharderul intre reviziile 2 si 3 | Cod sursa (job #3241796) | Cod sursa (job #2138063)
#include<bits/stdc++.h>
int N,A,C,i,v['ॆ'];std::queue<int>b[256];main(){for(std::ifstream("radixsort.in")>>N>>A>>*v>>C;i^N;v[++i]=(1LL*v[i-1]*A+*v)%C);for(A=-5;++A;){for(i=C=0;i^N;b[v[i++]>>-A*8&255].push(v[i]));for(i=0;i^256;++i)for(;b[i].size();v[C++]=b[i].front(),b[i].pop());}std::ofstream o("radixsort.out");for(i=0;i^N;i+=10)o<<v[i]<<' ';}