Submission #2018595

---

Source Code Expand

#include <iostream>
#include <ctime>
#include <vector>
using namespace std;

int n, a[100009]; vector<int>F;

void shuffle(int p) {
	for (int i = p; i < n; i++) swap(a[i], a[i - p]);
}
bool isperm() {
	for (int i = 0; i < n; i++) { if (a[i] != i) return false; }
	return true;
}

int main() {
	srand((unsigned)time(NULL));
	cin >> n;
	for (int i = 0; i < n; i++)cin >> a[i];
	while (true) {
		if (isperm() == true)break;
		int I = rand() % (n - 1) + 1;
		F.push_back(I);
		shuffle(I);
	}
	cout << F.size() << endl;
	for (int i = 0; i < F.size(); i++)cout << F[i] << endl;
	return 0;
}

Submission Info

Judge Result