From d3c407973b09bf5eb61388c6af07dbf9419778d1 Mon Sep 17 00:00:00 2001 From: Angel Dimitriev Date: Thu, 10 Dec 2020 10:47:05 -0500 Subject: Update task2.cpp --- Sem. 08/task2.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'Sem. 08/task2.cpp') diff --git a/Sem. 08/task2.cpp b/Sem. 08/task2.cpp index 4c6d71f..ecc9d74 100644 --- a/Sem. 08/task2.cpp +++ b/Sem. 08/task2.cpp @@ -2,7 +2,7 @@ using namespace std; const int SIZE = 30; -int CountOccurrences(int arr[SIZE], int n, int el) +int countOccurrences(int arr[SIZE], int n, int el) { int count = 0; for (int i = 0; i < n; i++) @@ -13,18 +13,18 @@ int CountOccurrences(int arr[SIZE], int n, int el) return count; } -int GetLonlyNumber(int arr[SIZE], int n) +int getLonlyNumber(int arr[SIZE], int n) { for (int i = 0; i < n; i++) { - if (CountOccurrences(arr, n, arr[i]) == 1) + if (countOccurrences(arr, n, arr[i]) == 1) return arr[i]; } return -1; } -int GetLonlyNumberBetter(int arr[SIZE], int n) +int getLonlyNumberBetter(int arr[SIZE], int n) { int res = 0; for (int i = 0; i < n; i++) @@ -39,5 +39,5 @@ int main() cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; - cout << GetLonlyNumberBetter(arr, n); + cout << getLonlyNumberBetter(arr, n); } -- cgit v1.3.1-23-gd82d