/*Problem 1 (70 points)

Write a function int product_div_4(int A[], int size) 
that returns the product of all numbers in the array that are divisible by 4. 
If there are no numbers divisible by 4 in the array, the function returns 0. 
Write main that generates 3 random arrays of size 10 each, 
finds and prints the product of numbers 
divisible by 4 in all arrays, and finds the array with the largest product.*/

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define SIZE 10

int product_div_4(int A[], int size);
void make_random_array(int A[], int size, int min, int max);
void print_array(int A[], int size);
int main(){
	srand(time(NULL));
	int A[SIZE], B[SIZE],C[SIZE], pr1, pr2, pr3;
	make_random_array(A, SIZE, -10, 20);
	make_random_array(B, SIZE, -10, 20);
	make_random_array(C, SIZE, -10, 20);
	printf("array A\n");
	print_array(A, SIZE);
	printf("array B\n");
	print_array(B, SIZE);
	printf("array  C\n");
	print_array(C, SIZE);
	pr1=product_div_4(A, SIZE);
	pr2=product_div_4(B,SIZE);
	pr3=product_div_4(C,SIZE);
	printf("products are %d %d %d\n", pr1, pr2, pr3);
	if(pr1>=pr2 && pr1>=pr3)
		printf("max pr is %d and array is %c\n",pr1, 'A');
	else if(pr2>=pr1 && pr2>=pr3)
		printf("max pr is %d and array is %c\n",pr2, 'B');
	else
		printf("max pr is %d and array is %c\n",pr3,'C');
	return 0;

	
}

int product_div_4(int A[], int size){
	int product=1, i, count=0;
	for(i=0;i<size;i++){
		if(A[i]%4==0){
			product*=A[i];
			count++;
		}
	}
	if(count==0)
		return 0;
	else
		return product;
}



void make_random_array(int A[], int size, int min, int max){
	
	int i;
	for(i=0;i<size;i++){
		A[i]=min+rand()%(max-min+1);
	}
}
void print_array(int A[], int size){
	int i;
        for(i=0;i<size;i++){
		printf("%d ",A[i]);
	}
	printf("\n");
}