|
|
@ -5,7 +5,7 @@ |
|
|
|
using namespace olc; |
|
|
|
using namespace olc; |
|
|
|
|
|
|
|
|
|
|
|
struct Data{ |
|
|
|
struct Data{ |
|
|
|
int value; //Number.
|
|
|
|
long value; //Number.
|
|
|
|
int position; //Current position in the list.
|
|
|
|
int position; //Current position in the list.
|
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
@ -19,52 +19,72 @@ int main() |
|
|
|
std::getline(file,line); |
|
|
|
std::getline(file,line); |
|
|
|
//std::cout<<line<<std::endl;
|
|
|
|
//std::cout<<line<<std::endl;
|
|
|
|
if (line.length()>0){ |
|
|
|
if (line.length()>0){ |
|
|
|
Data*data=new Data{std::atoi(line.c_str()),(int)originalSet.size()}; |
|
|
|
Data*data=new Data{std::atoi(line.c_str())*811589153l,(int)originalSet.size()}; |
|
|
|
originalSet.push_back(data); |
|
|
|
originalSet.push_back(data); |
|
|
|
newSet.push_back(data); |
|
|
|
newSet.push_back(data); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
for (int i=0;i<originalSet.size();i++){ |
|
|
|
std::cout<<std::endl; |
|
|
|
Data*val=originalSet[i]; |
|
|
|
for (int i=0;i<newSet.size();i++){ |
|
|
|
int pos=val->position; |
|
|
|
if (i!=0){ |
|
|
|
Data*temp=newSet[pos]; |
|
|
|
std::cout<<","; |
|
|
|
int shift=val->value; |
|
|
|
|
|
|
|
while (shift!=0){ |
|
|
|
|
|
|
|
if (shift>0){ |
|
|
|
|
|
|
|
//Move it to the right of the list.
|
|
|
|
|
|
|
|
int newPos=(pos+1)%newSet.size(); |
|
|
|
|
|
|
|
/*std::cout<<" Swap "<<newSet[pos]->value<<" ["<<newSet[pos]->position<<"]";
|
|
|
|
|
|
|
|
std::cout<<" with "<<newSet[newPos]->value<<" ["<<newSet[newPos]->position<<"]"<<std::endl;*/ |
|
|
|
|
|
|
|
newSet[pos]=newSet[newPos]; |
|
|
|
|
|
|
|
newSet[newPos]=temp; |
|
|
|
|
|
|
|
newSet[newPos]->position=newPos; |
|
|
|
|
|
|
|
newSet[pos]->position=pos; |
|
|
|
|
|
|
|
shift--; |
|
|
|
|
|
|
|
pos=newPos; |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
//Move it to the left of the list.
|
|
|
|
|
|
|
|
int newPos=pos-1; |
|
|
|
|
|
|
|
if (newPos<0){ |
|
|
|
|
|
|
|
newPos=newSet.size()-1; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
/*std::cout<<" Swap "<<newSet[pos]->value<<" ["<<newSet[pos]->position<<"]";
|
|
|
|
std::cout<<newSet[i]->value<<" ["<<newSet[i]->position<<"]"; |
|
|
|
std::cout<<" with "<<newSet[newPos]->value<<" ["<<newSet[newPos]->position<<"]";*/ |
|
|
|
|
|
|
|
newSet[pos]=newSet[newPos]; |
|
|
|
|
|
|
|
newSet[newPos]=temp; |
|
|
|
|
|
|
|
newSet[newPos]->position=newPos; |
|
|
|
|
|
|
|
newSet[pos]->position=pos; |
|
|
|
|
|
|
|
shift++; |
|
|
|
|
|
|
|
pos=newPos; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
std::cout<<std::endl; |
|
|
|
|
|
|
|
for (int j=0;j<10;j++){ |
|
|
|
|
|
|
|
for (int i=0;i<originalSet.size();i++){ |
|
|
|
|
|
|
|
Data*val=originalSet[i]; |
|
|
|
|
|
|
|
int pos=val->position; |
|
|
|
|
|
|
|
Data*temp=newSet[pos]; |
|
|
|
|
|
|
|
long shift=(val->value)%(long)(originalSet.size()-1l); |
|
|
|
|
|
|
|
std::cout<<"Shift value is "<<shift<<std::endl; |
|
|
|
|
|
|
|
while (shift!=0){ |
|
|
|
|
|
|
|
if (shift>0){ |
|
|
|
|
|
|
|
//Move it to the right of the list.
|
|
|
|
|
|
|
|
int newPos=(pos+1)%newSet.size(); |
|
|
|
|
|
|
|
/*std::cout<<" Swap "<<newSet[pos]->value<<" ["<<newSet[pos]->position<<"]";
|
|
|
|
|
|
|
|
std::cout<<" with "<<newSet[newPos]->value<<" ["<<newSet[newPos]->position<<"]"<<std::endl;*/ |
|
|
|
|
|
|
|
newSet[pos]=newSet[newPos]; |
|
|
|
|
|
|
|
newSet[newPos]=temp; |
|
|
|
|
|
|
|
newSet[newPos]->position=newPos; |
|
|
|
|
|
|
|
newSet[pos]->position=pos; |
|
|
|
|
|
|
|
shift--; |
|
|
|
|
|
|
|
pos=newPos; |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
//Move it to the left of the list.
|
|
|
|
|
|
|
|
int newPos=pos-1; |
|
|
|
|
|
|
|
if (newPos<0){ |
|
|
|
|
|
|
|
newPos=newSet.size()-1; |
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*std::cout<<" Swap "<<newSet[pos]->value<<" ["<<newSet[pos]->position<<"]";
|
|
|
|
|
|
|
|
std::cout<<" with "<<newSet[newPos]->value<<" ["<<newSet[newPos]->position<<"]";*/ |
|
|
|
|
|
|
|
newSet[pos]=newSet[newPos]; |
|
|
|
|
|
|
|
newSet[newPos]=temp; |
|
|
|
|
|
|
|
newSet[newPos]->position=newPos; |
|
|
|
|
|
|
|
newSet[pos]->position=pos; |
|
|
|
|
|
|
|
shift++; |
|
|
|
|
|
|
|
pos=newPos; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
/*std::cout<<std::endl;
|
|
|
|
|
|
|
|
for (int i=0;i<newSet.size();i++){ |
|
|
|
|
|
|
|
if (i!=0){ |
|
|
|
|
|
|
|
std::cout<<","; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
std::cout<<newSet[i]->value<<" ["<<newSet[i]->position<<"]"; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
std::cout<<std::endl;*/ |
|
|
|
} |
|
|
|
} |
|
|
|
/*std::cout<<std::endl;
|
|
|
|
std::cout<<std::endl; |
|
|
|
|
|
|
|
std::cout<<"Round "<<j+1<<std::endl; |
|
|
|
for (int i=0;i<newSet.size();i++){ |
|
|
|
for (int i=0;i<newSet.size();i++){ |
|
|
|
if (i!=0){ |
|
|
|
if (i!=0){ |
|
|
|
std::cout<<","; |
|
|
|
std::cout<<","; |
|
|
|
} |
|
|
|
} |
|
|
|
std::cout<<newSet[i]->value<<" ["<<newSet[i]->position<<"]"; |
|
|
|
std::cout<<newSet[i]->value<<" ["<<newSet[i]->position<<"]"; |
|
|
|
} |
|
|
|
} |
|
|
|
std::cout<<std::endl;*/ |
|
|
|
std::cout<<std::endl; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
Data*zeroVal; |
|
|
|
Data*zeroVal; |
|
|
@ -84,7 +104,7 @@ int main() |
|
|
|
std::cout<<"2000: "<<newSet[offset2]->value<<std::endl; |
|
|
|
std::cout<<"2000: "<<newSet[offset2]->value<<std::endl; |
|
|
|
std::cout<<"3000: "<<newSet[offset3]->value<<std::endl; |
|
|
|
std::cout<<"3000: "<<newSet[offset3]->value<<std::endl; |
|
|
|
|
|
|
|
|
|
|
|
int sum=newSet[offset]->value+newSet[offset2]->value+newSet[offset3]->value; |
|
|
|
long sum=newSet[offset]->value+newSet[offset2]->value+newSet[offset3]->value; |
|
|
|
std::cout<<"Sum: "<<sum<<std::endl; |
|
|
|
std::cout<<"Sum: "<<sum<<std::endl; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|