Pagini recente » Diferente pentru fmi-no-stress-2012/solutii intre reviziile 6 si 15 | Istoria paginii fmi-no-stress-2012/solutii | Noname 3 | Monitorul de evaluare | Cod sursa (job #1163669)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int main()
{
unsigned int n,a,b,c,i,j,d,e;
vector<unsigned int> v;
vector< vector<unsigned int> > v1;
in>>n>>a>>b>>c;
v1.resize(c);
d=0;e=b;
for(i=0;i<n;i++)
{
v1.at(e).push_back(e);
d=e;
e=(1LL*d*a+b)%c;
}
for(i=0;i<v1.size();i++)
for(j=0;j<v1.at(i).size();j++)
v.push_back(v1.at(i).at(j));
for(i=0;i<v.size();i+=10) out<<v.at(i)<<" ";
}