Freshman's Database

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






int main() {

	int n;
	cin >> n;

	vector<int>a;

	for(int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		a.push_back(temp);
	}

	vector<int>indeces;

	for(int i = 1; i <= n; i++) {
		indeces.push_back(i);
	}

	int cycles = 0;
	int i = 0;
	int j = 1;
	int first = 0;
	//for (int i=0; i<n;i++){
	//	cout << a[i] << " ";
	//}
	//for (int i=0; i<n;i++){
	//	cout << indeces[i] << " ";
	//}


	while(j < n) {

		first = indeces[j-1];
		while(a[i] == indeces[j]){

			i++;
			j++;
			//cout << "inner cycle. a[i] = " << a[i] << " indeces[j] = " << indeces[j] << " first: " << first << endl;
		}
		if(a[i] == first) {
			cycles++;
		}
		i++;
		j++;

	}

	cout << cycles << endl;

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER