path: root / Sem. 08 / task2.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

#include <iostream>
using namespace std;

const int SIZE = 30;
int countOccurrences(int arr[SIZE], int n, int el)
{
	int count = 0;
	for (int i = 0; i < n; i++)
	{
		if (arr[i] == el)
			count++;
	}
	return count;
}

int getLonlyNumber(int arr[SIZE], int n)
{
	for (int i = 0; i < n; i++)
	{
		if (countOccurrences(arr, n, arr[i]) == 1)
			return arr[i];
	}
	return -1;

}

int getLonlyNumberBetter(int arr[SIZE], int n)
{
	int res = 0;
	for (int i = 0; i < n; i++)
		res ^= arr[i];
	return res;
}

int main()
{
	int arr[SIZE];
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> arr[i];
	cout << getLonlyNumberBetter(arr, n);
}