day10.c

/*
--- Day 10: Adapter Array ---

Patched into the aircraft's data port, you discover weather forecasts of a massive tropical storm. Before you can figure out whether it will impact your vacation plans, however, your device suddenly turns off!

Its battery is dead.

You'll need to plug it in. There's only one problem: the charging outlet near your seat produces the wrong number of jolts. Always prepared, you make a list of all of the joltage adapters in your bag.

Each of your joltage adapters is rated for a specific output joltage (your puzzle input). Any given adapter can take an input 1, 2, or 3 jolts lower than its rating and still produce its rated output joltage.

In addition, your device has a built-in joltage adapter rated for 3 jolts higher than the highest-rated adapter in your bag. (If your adapter list were 3, 9, and 6, your device's built-in adapter would be rated for 12 jolts.)

Treat the charging outlet near your seat as having an effective joltage rating of 0.

Since you have some time to kill, you might as well test all of your adapters. Wouldn't want to get to your resort_array and realize you can't even charge your device!

If you use every adapter in your bag at once, what is the distribution of joltage differences between the charging outlet, the adapters, and your device?

For example, suppose that in your bag, you have adapters with the following joltage ratings:

16
10
15
5
1
11
7
19
6
12
4

With these adapters, your device's built-in joltage adapter would be rated for 19 + 3 = 22 jolts, 3 higher than the highest-rated adapter.

Because adapters can only connect to a source 1-3 jolts lower than its rating, in order to use every adapter, you'd need to choose them like this:

    The charging outlet has an effective rating of 0 jolts, so the only adapters that could connect to it directly would need to have a joltage rating of 1, 2, or 3 jolts. Of these, only one you have is an adapter rated 1 jolt (difference of 1).
    From your 1-jolt rated adapter, the only choice is your 4-jolt rated adapter (difference of 3).
    From the 4-jolt rated adapter, the adapters rated 5, 6, or 7 are valid choices. However, in order to not skip any adapters, you have to pick the adapter rated 5 jolts (difference of 1).
    Similarly, the next choices would need to be the adapter rated 6 and then the adapter rated 7 (with difference of 1 and 1).
    The only adapter that works with the 7-jolt rated adapter is the one rated 10 jolts (difference of 3).
    From 10, the choices are 11 or 12; choose 11 (difference of 1) and then 12 (difference of 1).
    After 12, only valid adapter has a rating of 15 (difference of 3), then 16 (difference of 1), then 19 (difference of 3).
    Finally, your device's built-in adapter is always 3 higher than the highest adapter, so its rating is 22 jolts (always a difference of 3).

In this example, when using every adapter, there are 7 differences of 1 jolt and 5 differences of 3 jolts.

Here is a larger example:

28
33
18
42
31
14
46
20
48
47
24
23
49
45
19
38
39
11
1
32
25
35
8
17
7
9
4
2
34
10
3

In this larger example, in a chain that uses all of the adapters, there are 22 differences of 1 jolt and 10 differences of 3 jolts.

Find a chain that uses all of your adapters to connect the charging outlet to your device's built-in adapter and count the joltage differences between the charging outlet, the adapters, and your device. What is the number of 1-jolt differences multiplied by the number of 3-jolt differences?

*/

#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>

#define TEST_1_COUNT   (11+2)
#define TEST_2_COUNT   (31+2) 
#define SAMPLE_COUNT  (95+2)
int test_1[TEST_1_COUNT] = {0, 16,10,15,5,1,11,7,19,6,12,4, 1073741824};
int test_2[TEST_2_COUNT] = {0, 28,33,18,42,31,14,46,20,48,47,24,23,49,45,19,38,39,11,1,32,25,35,8,17,7,9,4,2,34,10,3, 1073741824};
int sample[SAMPLE_COUNT] = {0, 86,149,4,75,87,132,12,115,62,61,153,78,138,43,88,108,59,152,109,63,42,60,7,104,49,156,35,2,52,72,125,94,46,136,26,16,76,117,116,150,20,13,141,131,127,67,3,40,54,82,36,100,41,56,146,157,89,23,8,55,111,135,144,77,124,18,53,92,126,101,69,27,145,11,151,31,19,34,17,130,118,28,107,137,68,93,85,66,97,110,37,114,79,121,1, 1073741824};
void sort_array(int *array, int num_elements)
{
	for (size_t i = 0; i < num_elements; i++) {
		for( size_t j = 0; j < num_elements - i - 1; j++) {
			if (array[j] > array[j+1]) {
				int temp = array[j] ;
				array[j]  =  array[ j+1];
				array[j+1] = temp;
			}
		}
	}
	array[num_elements - 1]  = array[num_elements - 2] + 3;
}

int difference(int *array, int num_elements, int *diff_1, int *diff_2, int *diff_3) 
{
	*diff_1 = 0;
	*diff_2 = 0;
	*diff_3 = 0; 
	
	sort_array(array, num_elements);

	for (size_t i = 0; i < num_elements -1; i++) {
		if ( (array[i+1] - array[i]) == 3) {
			(*diff_3)++;
		}
		else if ( (array[i+1] - array[i]) == 1) {
			(*diff_1)++;
		}
		else if ( (array[i+1] - array[i]) == 2) {
			(*diff_2)++;
		}
		else {
			printf("are you CRAZY\n");
		}
	}
/*	
		if ( (array[0] - 0) == 3) {
			(*diff_3)++;
		}
		else if ( (array[0] - 0) == 1) {
			(*diff_1)++;
		}
		else if ( (array[0] - 0 ) == 2) {
			(*diff_2)++;
		}
		else {
			printf("are you CRAZY\n");
		}
*/	
	printf("diff 1: %u diff 2: %u diff 3: %u\n", *diff_1,  *diff_2,  *diff_3);
	return (*diff_1) * (*diff_3); 
}

long int find_combination(int *array, int num_elements)
{
	sort_array(array, num_elements);
	long int num_child_braches[SAMPLE_COUNT]= {1};
	long int num_abs_child_braches[SAMPLE_COUNT] = {1};
	int new_factor = 1;
	int old_factor = 1;
	int factors[100] = {0};
	int num_factors = 0;
	int last_depth = 0;
	for (size_t i = 0; i < num_elements; i++) {
		num_child_braches[i] = 1;
		num_abs_child_braches[i] = 1;
	}
	long int childs = 0;
	for (size_t i = 0; i < num_elements -1; i++) {
		childs = 0;
		if ( ((i+1)<num_elements)&& ((array[i+1] - array[i]) <=3)) {
			childs++;
		}
		if ( ((i+2)<num_elements)&& ((array[i+2] - array[i]) <=3)) {
			childs++;
		}
		if ( ((i+3)<num_elements)&& ((array[i+3] - array[i]) <=3)) {
			childs++;
		}
		
		num_child_braches[i] = childs;
		if ( childs > 1) {
			printf("\n %u has %lu childs", array[i], childs);
		}
	}
	
	for (int i = num_elements -2; i >= 0; i--) {
		childs = 0;
		//if (num_child_braches[i] > 1) {
			for (int j = i+1; j <=(i+ num_child_braches[i]); j++) {
				if (j < num_elements) {
					childs += num_abs_child_braches[j];
				}
			}
		//}
		num_abs_child_braches[i] = childs; 
		printf("\n %u has %lu abs childs", array[i], childs);
	}

	return num_abs_child_braches[0];
}




int main(void) 
{
	int diff_1 = 0;
	int diff_2 = 0;
	int diff_3 = 0; 
	printf(" product %u \n",  difference(test_1,  TEST_1_COUNT,  &diff_1, &diff_2, &diff_3));
	printf(" product %u \n",  difference(test_2,  TEST_2_COUNT,  &diff_1, &diff_2, &diff_3));
	printf(" product %u \n",  difference(sample,  SAMPLE_COUNT,  &diff_1, &diff_2, &diff_3));
	
    printf(" \nCombi %lu \n",  find_combination(test_1,  TEST_1_COUNT));
	printf(" \nCombi %lu \n",  find_combination(test_2,  TEST_2_COUNT));
	printf(" \nCombi %lu \n",  find_combination(sample,  SAMPLE_COUNT));
}