Tasks Details
easy
1.
EquiLeader
Find the index S such that the leaders of the sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N - 1] are the same.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given.
The leader of this array is the value that occurs in more than half of the elements of A.
An equi leader is an index S such that 0 ≤ S < N − 1 and two sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N − 1] have leaders of the same value.
For example, given array A such that:
A[0] = 4 A[1] = 3 A[2] = 4 A[3] = 4 A[4] = 4 A[5] = 2we can find two equi leaders:
- 0, because sequences: (4) and (3, 4, 4, 4, 2) have the same leader, whose value is 4.
- 2, because sequences: (4, 3, 4) and (4, 4, 2) have the same leader, whose value is 4.
The goal is to count the number of equi leaders.
Write a function:
int solution(vector<int> &A);
that, given a non-empty array A consisting of N integers, returns the number of equi leaders.
For example, given:
A[0] = 4 A[1] = 3 A[2] = 4 A[3] = 4 A[4] = 4 A[5] = 2the function should return 2, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−1,000,000,000..1,000,000,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C++
Time spent on task 37 minutes
Notes
not defined yet
Code: 06:20:16 UTC,
java,
autosave
Code: 06:20:17 UTC,
java,
autosave
Code: 06:20:27 UTC,
cpp,
autosave
Code: 06:24:08 UTC,
cpp,
autosave
Code: 06:29:19 UTC,
cpp,
autosave
Code: 06:29:32 UTC,
cpp,
autosave
Code: 06:30:02 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0;
for(int i=0;i<A.size();i++)
{
}
}
Code: 06:30:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0;
for(int i=0;i<A.size();i++)
{
}
}
Code: 06:30:51 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0;
for(int i=0;i<A.size();i++)
{
if(element == 0)
{
element = A[0];
}
}
}
Code: 06:31:01 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0;
for(int i=0;i<A.size();i++)
{
if(element == 0)
{
element = A[0];
}
}
}
Code: 06:31:14 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(element == 0)
{
element = A[0];
cnt
}
}
}
Code: 06:31:40 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(element == 0)
{
element = A[0];
cnt++;
}
else
{
if(A[i]!=element)
{
}
}
}
}
Code: 06:32:10 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(element == 0)
{
element = A[0];
cnt++;
}
else
{
if(A[i]!=element)
{
i++;
}
}
}
}
Code: 06:32:41 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(element == 0)
{
element = A[0];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
}
}
}
Code: 06:33:27 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[0];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
}
}
}
Code: 06:33:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
}
}
}
Code: 06:33:50 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
}
Code: 06:34:01 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
}
Code: 06:34:11 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
}
Code: 06:34:57 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if
}
Code: 06:35:07 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
}
}
Code: 06:35:24 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
element =
}
}
Code: 06:35:55 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
}
}
Code: 06:36:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
}
for(int i=0;i<A.size();i++)
{
if
}
}
Code: 06:36:35 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
}
for(int i=0;i<A.size();i++)
{
if(candidate)
}
}
Code: 06:36:48 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
}
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
}
}
}
Code: 06:36:59 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
}
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
}
}
}
Code: 06:37:19 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
}
}
}
Code: 06:37:34 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if()
}
}
Code: 06:37:56 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
}
}
}
Code: 06:38:18 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
}
}
}
Code: 06:38:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound)
}
Code: 06:38:59 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
}
Code: 06:39:23 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
}
Code: 06:39:43 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
for(int i=0;i<A.size();i++)
{
}
}
Code: 06:40:32 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
i
for(int i=0;i<A.size();i++)
{
}
}
Code: 06:40:45 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int non leade
for(int i=0;i<A.size();i++)
{
}
}
Code: 06:40:57 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercnt=A.size();
for(int i=0;i<A.size();i++)
{
}
}
Code: 06:41:27 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercnt=A.size();
for(int i=0;i<A.size();i++)
{
if(A[])
}
}
Code: 06:41:40 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercnt=A.size();
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
}
}
}
Code: 06:42:10 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercnt=A.size();
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if
}
}
}
Code: 06:42:24 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercnt=A.size();
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if(leadercnt>nonleadercnt)
}
}
}
Code: 06:42:34 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercnt=A.size()-leadercnt;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if(leadercnt>nonleadercnt)
}
}
}
Code: 06:44:06 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntl=A.size()-leadercnt;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if(leadercnt>nonleadercnt)
}
}
}
Code: 06:44:25 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if(leadercnt>nonleadercnt)
}
}
}
Code: 06:44:48 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if(leadercnt>nonleadercnt)
}
}
}
Code: 06:45:16 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if(leadercnt>nonleadercnt)
}
}
}
Code: 06:45:26 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
}
}
}
Code: 06:45:36 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
if()
}
}
}
Code: 06:45:48 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
}
}
}
Code: 06:46:00 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
le
}
}
}
Code: 06:46:19 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
}
}
}
Code: 06:46:35 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
}
}
}
Code: 06:46:47 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if()
}
}
Code: 06:46:57 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if(le)
}
}
Code: 06:47:27 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > no)
}
}
Code: 06:47:40 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
}
Code: 06:47:49 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:10:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<A.size();i++)
~^~~~~~~~~
func.cpp:31:9: error: 'candidate' was not declared in this scope
candidate=element;
^~~~~~~~~
func.cpp:35:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<A.size();i++)
~^~~~~~~~~
func.cpp:37:12: error: 'candidate' was not declared in this scope
if(candidate==A[i])
^~~~~~~~~
func.cpp:40:9: error: expected ';' before '}' token
}
^
func.cpp:41:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(cnt>A.size()/2)
~~~^~~~~~~~~~~
func.cpp:55:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<A.size();i++)
~^~~~~~~~~
Code: 06:48:11 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(int i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:48:22 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(int i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(int i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:48:28 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:40:9: error: expected ';' before '}' token
}
^
func.cpp:41:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(cnt>A.size()/2)
~~~^~~~~~~~~~~
Code: 06:48:40 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 2
Code: 06:49:28 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:49:48 UTC,
cpp,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 2
Code: 06:50:30 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>A.size()/2)
{
leaderfound=1;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:50:48 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>A.size()/2)
{
leaderfound=1;
leader =
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:50:49 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 2
Code: 06:51:16 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 2
Code: 06:51:45 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:51:47 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 2
Code: 06:52:15 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and lea")
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:52:40 UTC,
cpp,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 0 expected 2
stdout:
Found leader 4 and leadercnt 2
Code: 06:53:31 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:53:48 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
break;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:54:03 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:54:33 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt =
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:54:35 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
stdout:
Found leader 4 and leadercnt 4
Code: 06:54:57 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:55:12 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
stdout:
Found leader 4 and leadercnt 4
expand all
User tests
1.
0.001 s
OK
function result: 4
function result: 4
stdout:
Found leader 1 and leadercnt 5
User test case 1:
[1, 1, 1, 1, 1]
Code: 06:55:31 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:55:46 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
stdout:
Found leader 4 and leadercnt 4
expand all
User tests
1.
0.001 s
OK
function result: 2
function result: 2
stdout:
Found leader 1 and leadercnt 4
User test case 1:
[1, 1, 1, 1, 2]
Code: 06:56:01 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
//printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Code: 06:56:28 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
//printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
//printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
User test case 1:
[1, 1, 1, 1, 2]
Code: 06:56:43 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
//printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
//printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis
User test case 1:
[1, 1, 1, 1, 2]
Code: 06:56:48 UTC,
cpp,
final,
score:
100
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int leader,leadercnt=0,element=0,cnt=0,leaderfound=0,seq=0,candidate=0;
for(uint i=0;i<A.size();i++)
{
if(cnt == 0)
{
element = A[i];
cnt++;
}
else
{
if(A[i]!=element)
{
cnt--;
}
else
{
cnt++;
}
}
}
if(cnt>0)
{
candidate=element;
leadercnt=cnt;
}
cnt=0;
for(uint i=0;i<A.size();i++)
{
if(candidate==A[i])
{
cnt++;
}
}
if(cnt>(int)A.size()/2)
{
leaderfound=1;
leader = candidate;
leadercnt = cnt;
}
if(leaderfound == 0)
{
//printf("Return 0 no leader found\n");
return 0;
}
int nonleadercntr=A.size()-leadercnt;
int nonleadercntl=0;
int leadercntr=leadercnt;
int leadercntl=0;
//printf("Found leader %d and leadercnt %d\n",leader,leadercnt);
for(uint i=0;i<A.size();i++)
{
if(A[i]==leader)
{
leadercntl++;
leadercntr--;
}
else
{
nonleadercntl++;
nonleadercntr--;
}
if((leadercntl > nonleadercntl) && (leadercntr > nonleadercntr))
{
seq++;
}
}
return seq;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
OK