DAY 2 A. IQ test

Problem:
Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that is different in evenness.

Input
The first line contains integer n (3 ≤ n ≤ 100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.

Output
Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.

Examples
input
5
2 4 7 8 10
output
3

input
4
1 2 1 1
output
2

题目大致意思为：有一堆数，他们之间的会存在一个数与其他数的差值不同，求这个数的下标。并且题目保证了只会出现一个数字与其他数的差值不同。

深度翻译：找到这一堆数中唯一的奇数或者是偶数，输出它的下标。

直接上代码

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int n;
	cin >> n;
	vector<int> v;
	for (int i = 0; i < n; i++)
	{
		int a;
		cin >> a;
		v.push_back(a);
	}
	int book = 0;
	int book1 = 0;//记录唯一奇数或是偶数的下标
	int cnt = 0;
	int cnt1 = 0;//记录是唯一奇数还是唯一偶数
	for (int i = 0; i < v.size(); i++)
	{
		if (v[i] % 2 == 0)
		{
			cnt++;
			book = i + 1;
		}
		if (v[i] % 2 != 0)
		{
			cnt1++;
			book1 = i + 1;
		}
	}
	if (cnt == 1)
	{
		cout << book;
	}
	else if (cnt1 == 1)
	{
		cout << book1;
	}
	return 0;
}