There is a number in the C + + array that appears more than half the length of the array to find this number.

#include <iostream> #include <bitset>using the number of more than half occurrences in the namespace std;//array// Title: There is a number in the array that appears more than half the length of the array to find this number. Template<int _n>int grial (bitset<_n> &bt,int a[]) {int check[_n];for (int i=1;i<=_n;i++) {int count = 0 , if (!bt.test (A[i])) {Count++;bt.set (a[i]); Check[a[i]] = count;} else{check[a[i]]++; if (CHECK[A[I]]>=_N/2) return a[i];}}} int main () {bitset<27> Bt;int a[]={1,1,1,1,6,1,1,4,1,1,1,1,1,1,3,3,1,1,3,1,21,1,1,1,1,1};cout<<grial <27> (Bt,a) <<endl;//cout<<bt<<endl;return 0;}

There is a number in the C + + array that appears more than half the length of the array to find this number.