data-structures-and-algorithms/Perfect_number_in_subarray.cpp at main · Open-code-source/data-structures-and-algorithms · GitHub

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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
#include<cmath>
using namespace  std;


bool isNumberPerfect(int n){
	int sum=1;

	for (int i = 2; i <sqrt(n); i++)
	{

		if(n%i==0){
			if(i==n/i){
				sum+=i;
			}else{
				sum+=i+n/i;
			}
		}

	}
	if(sum==n && n!=1){
		return true;
	}

	return false;


}

int maxSum(int arr[],int n,int k){

	if(n<k){
		cout<<"invalid value";
		return -1;
	}

	int res=0;

	for (int i = 0; i < k; i++)
	{
		res+=arr[i];
	}

	int sum=res;
	for (int i = k; i < n; i++)
	{
		sum+=arr[i]-arr[i-k];
		res=max(res,sum);
	}
	return res;
}
int maxNumberPerfects(int arr[],int n,int k){


	for (int i = 0; i <n; i++)
	{
		if(isNumberPerfect(arr[i])){
			arr[i]=1;
		}
		else{
			arr[i]=0;
		}
	}

	return maxSum(arr,n,k);
}

int main(){

	int arr[]={28,2,3,6,496,99,8128,24};

	int k=4;

	int n=8;

	cout<<maxNumberPerfects(arr,n,k)<<endl;


	return 0;
}