#include <bits/stdc++.h>
using namespace std;
void isMajorityElement(int N, int input_array[]){
    int majority_index=0,count=1;
    for(int i=1;i<N;i++)  {
        if(input_array[majority_index]==input_array[i])
            count++;
        else
            count--;
        if(count==0){
            majority_index=i;
            count=1;
        }
    }
    count=0;
    for(int i=0;i<N;i++) {
        if(input_array[majority_index]==input_array[i])
        count++;
    }
    if(count>N/2)
        cout<<"MAJORITY ELEMENT: "<< input_array[majority_index]<< endl;
    else
        cout<<"THERE IS NO MAJORITY ELEMENT"<<endl;
    }
    int main(){
        int input_array[]={2, 2, 3, 2, 4, 2, 5};
        int N=sizeof(input_array)/sizeof(input_array[0]);
        isMajorityElement(N, input_array);
    	return 0;
    }

                  
                  

                    
def majorityElement(input_array,N):
    majority_element=input_array[0]
    count = 1
    for i in range(1,N):
        if input_array[i]==majority_element:
            count+=1
        else:
            count-=1
        if count==0:
            count=1
            majority_element=input_array[i]
    count = 0
    for i in input_array:
        if i==majority_element:
            count+=1
    if count>N//2:
        print("MAJORITY ELEMENT: ",majority_element)
    else:
        print("THERE IS NO MAJORITY ELEMENT")
if __name__=="__main__":
    input_array=[2, 2, 3, 2, 4, 2, 5]
    N=7
    majorityElement(input_array,N)
                    
                  
                  

                    
#include<iostream>
#include<climits>
using namespace std;
int maxSubArraySum(int a[], int size)
{
    int max_so_far = INT_MIN, max_ending_here = 0;
    for (int i = 0; i < size; i++)
    {
        max_ending_here = max_ending_here + a[i];
        if (max_so_far < max_ending_here)
            max_so_far = max_ending_here;
        if (max_ending_here < 0)
            max_ending_here = 0;
    }
    return max_so_far;
}

int main()
{
    int a[] = {-2, -3, 4, -1, -2, 1, 5, -3};
    int n = sizeof(a)/sizeof(a[0]);
    int max_sum = maxSubArraySum(a, n);
    cout << "Maximum contiguous sum is " << max_sum;
    return 0;
}

                  
                  

                    
from sys import maxint
def maxSubArraySum(a,size):

    max_so_far = -maxint - 1
    max_ending_here = 0

    for i in range(0, size):
        max_ending_here = max_ending_here + a[i]
        if (max_so_far < max_ending_here):
            max_so_far = max_ending_here

        if max_ending_here < 0:
            max_ending_here = 0
    return max_so_far
a = [-13, -3, -25, -20, -3, -16, -23, -12, -5, -22, -15, -4, -7]
print "Maximum contiguous sum is", maxSubArraySum(a,len(a))
                    
                  
                  

                    
#include<iostream>
using namespace std;
void isprime(int n){
  int prime[n+1]={0};
  for(int i=2;i<=n;i++){
    if(prime[i]==0){
      for(int j=i*i;j<=n;j+=i){
        prime[j]=1;
      }
    }
  }
  for(int i= 2;i<=n;i++){
    if(prime[i]==0){
      cout<<i<<" ";
    }
  }cout<<endl;
}

int main(){
  int n;
  cin>>n;
  isprime(n);
}

                  
                  

                    
def SieveOfEratosthenes(n):
	prime = [True for i in range(n+1)]
	p = 2
	while (p * p <= n):
		if (prime[p] == True):
			for i in range(p * p, n+1, p):
				prime[i] = False
		p += 1

	for p in range(2, n+1):
		if prime[p]:
			print p,

if __name__ == '__main__':
	n = 30
	print "Following are the prime numbers smaller",
	print "than or equal to", n
	SieveOfEratosthenes(n)