11the and 12 over

shivashanmugam · Jul 18, 2017 · 677de41 · 677de41
1 parent c16a609
commit 677de41
Show file tree

Hide file tree

Showing 2 changed files with 120 additions and 0 deletions.
diff --git a/project_euler/11_highest_product_in_20_20_array.c b/project_euler/11_highest_product_in_20_20_array.c
@@ -0,0 +1,95 @@
+#include<stdio.h>
+#define LIMIT 20
+
+int check_print(int result, int i, int j, char* operation);
+int product_left(int pos, int row);
+int product_right(int pos, int row);
+int product_down(int pos, int col);
+int product_up(int pos, int col);
+int product_left_diagonal(int row, int col);
+int product_right_diagonal(int row, int col);
+
+int array[20][20] = {  {8,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,8},
+                    {49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00},
+                    {81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65},
+                    {52,70,95,23,04,60,11,42,69,24,68,56,01,32,56,71,37,02,36,91},
+                    {22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80},
+                    {24,47,32,60,99,03,45,02,44,75,33,53,78,36,84,20,35,17,12,50},
+                    {32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70},
+                    {67,26,20,68,02,62,12,20,95,63,94,39,63,8,40,91,66,49,94,21},
+                    {24,55,58,05,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72},
+                    {21,36,23,9,75,00,76,44,20,45,35,14,00,61,33,97,34,31,33,95},
+                    {78,17,53,28,22,75,31,67,15,94,03,80,04,62,16,14,9,53,56,92},
+                    {16,39,05,42,96,35,31,47,55,58,88,24,00,17,54,24,36,29,85,57},
+                    {86,56,00,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58},
+                    {19,80,81,68,05,94,47,69,28,73,92,13,86,52,17,77,04,89,55,40},
+                    {04,52,8,83,97,35,99,16,07,97,57,32,16,26,26,79,33,27,98,66},
+                    {88,36,68,87,57,62,20,72,03,46,33,67,46,55,12,32,63,93,53,69},
+                    {04,42,16,73,38,25,39,11,24,94,72,18,8,46,29,32,40,62,76,36},
+                    {20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,04,36,16},
+                    {20,73,35,29,78,31,90,01,74,31,49,71,48,86,81,16,23,57,05,54},
+                    {01,70,54,71,83,51,54,69,16,92,33,48,61,43,52,01,89,19,67,48}};
+
+int max = 0;
+int main(){
+	int i, j;
+	for(i = 0;i < LIMIT;i++){
+		for(j = 0;j < LIMIT;j++){
+			check_print(product_left(j,i), i, j, "product_left");
+			check_print(product_right(j,i), i, j, "product_right");
+			check_print(product_down(i,j), i, j, "product_down");
+			check_print(product_up(i,j), i, j, "prouduct_up");
+			check_print(product_left_diagonal(i,j),i, j, "product_left_diag");	
+			check_print(product_right_diagonal(i,j), i, j, "product right_diag");
+
+
+		}
+	}
+	printf("the product of greatest is %d\n",max);
+	return 0;
+}
+
+int check_print(int result, int i, int j, char *operation){
+	if(result > max){
+		max = result;
+		printf("result is %d the position of i = %d, j = %d and operation is %s \n",result, i , j, operation);
+	}
+}
+
+int product_left(int pos, int row){
+	if(pos + 4 < LIMIT){
+		return array[row][pos] * array[row][pos+1] * array[row][pos+2] * array[row][pos+3];
+	}
+}
+
+int product_right(int pos, int row){
+	if(pos  >  2){
+		return array[row][pos] * array[row][pos-1] * array[row][pos-2] * array[row][pos-3];
+	}
+}
+
+int product_down(int pos, int col){
+	if(pos + 4 < LIMIT){
+		return array[pos][col] * array[pos+1][col] * array[pos+2][col] * array[pos+3][col];
+	}
+}
+
+int product_up(int pos, int col){
+	if(pos  < 2){
+		return array[pos][col] * array[pos-1][col] * array[pos-2][col] * array[pos-3][col];
+	}
+}
+
+int product_left_diagonal(int row, int col){
+	if(row + 4 < LIMIT && col+4 < LIMIT){
+		return array[row][col] * array[row+1][col+1] * array[row+2][col+2] * array[row+3][col+3];
+	}
+}
+
+int product_right_diagonal(int row, int col){
+	if(row + 4 < LIMIT && col > 2){
+		return array[row][col] * array[row+1][col-1] * array[row+2][col-2] * array[row+3][col-3];
+	}
+}
+
+
diff --git a/project_euler/12_highest_divisible_triangle_number.c b/project_euler/12_highest_divisible_triangle_number.c
@@ -0,0 +1,25 @@
+#include<stdio.h>
+#define LIMIT 500
+int total_factors_of_a_num(long long int input);
+
+int main(){
+	int i, factors = 0;
+	long long int total = 0;
+	for(i = 1;factors < LIMIT;i++){
+		total = total + i;
+		factors = total_factors_of_a_num(total);
+	}
+	printf("the triangle number which exceed more than 500 factors is that %lld\n",total);
+	return 0;
+}
+
+int total_factors_of_a_num(long long int input){
+	int i, factors = 0;
+	for(i=1; input / i >= i;i++){
+		if(input % i == 0)factors++;
+	} 
+	if(factors % 2 == 0){
+		return factors * 2;
+	}
+	return (factors * 2) + 1;
+}