The current selected programming language is C. We emphasize the submission of a fully working code...

Transcribed Image Text:

The current selected programming language is C. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use printf() to debug your code. The printf() may not work in case of syntax/runtime error. The version of GCC being used is 5.5.0. There is a set of N jars. The jars contain differing numbers of chocolates. Some of the jars may be empty. Andrew may pick multiple jars but he may not pick any jar that is adjacent to a jar that he has already picked. Write an algorithm to calculate the maximum number of chocolates that Andrew may collect by picking jars. Input The first line of the input consists of an integer - choco_size, representing the number of jars of chocolates (N). The second line of the input consists of N space- separated integers- choco, representing the number of chocolates in each jar. Output Print an integer representing the maximum number of chocolates that Andrew may collect. Constraints 1 < choco_size <10³ -105 ≤ choco[i] ≤ 105; where i is representing the index of the jars of chocolate. Osi< choco_size Example Input: 6 5 30 99 60 5 10 Output: 114 Explanation Andrew picks from the 1st (5), 3rd (99), and 6th jars (10). Test Cases & Output 1 V/Header Files 2 #include<stdio.h> 3 #include<stdlib.h> 4 #include<string.h> 5 #include<stdbool.h> 6 7 /* only used in string related operations */ 8 typedef struct String string; struct String char *str; 9 10 - { 11 12 }; 13 14 char *input(FILE *fp, int size, int has_space) 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 51 52 - { 53 54 55 56 57 58 /* * 59 60 65 66 }; 73 74 75 76 77 78 ▾ 79 71 { 72 80 81 82 83 84 85 86 87 88 int actual size = 0; char *str = (char *)malloc(sizeof(char)* (size+actual_size)); char ch; if(has_space == 1) { 50 typedef struct array_single_int array_single_int; struct array_single_int while(EOF != (ch-fgetc (fp)) && ch != '\n') { str[actual size] = ch; actual size++; if(actual size >= size) str = realloc(str, sizeof (char)sactual_size); } else } Editor { } while (EOF != (ch-fgetc (fp)) && ch != '\n' && ch != ' ') { = } /* only used in string related operations */ 67 68 } 69 70 int main() */ 61 int maxNumOfChocolates (array_single_int choco) 62 - { 63 64 str[actual size] = ch; actual size++; if(actual size >= size) str = realloc(str,sizeof(char)*actual_size); { } actual size++; str realloc(str,sizeof(char)*actual_size); str[actual_size-1] = '\0'; return str; int *data; int size; int answer; // Write your code here return answer; array_single_int choco; //input for choco scanf("%d", &choco.size); choco.data = (int *)malloc (sizeof(int) * choco.size); for (int idx = 0; idx < choco.size; idx++) { scanf ("%d", &choco.data[idx]); } int result = maxNumOfChocolates (choco); printf("%d", result); return 0; The current selected programming language is C. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use printf() to debug your code. The printf() may not work in case of syntax/runtime error. The version of GCC being used is 5.5.0. There is a set of N jars. The jars contain differing numbers of chocolates. Some of the jars may be empty. Andrew may pick multiple jars but he may not pick any jar that is adjacent to a jar that he has already picked. Write an algorithm to calculate the maximum number of chocolates that Andrew may collect by picking jars. Input The first line of the input consists of an integer - choco_size, representing the number of jars of chocolates (N). The second line of the input consists of N space- separated integers- choco, representing the number of chocolates in each jar. Output Print an integer representing the maximum number of chocolates that Andrew may collect. Constraints 1 < choco_size <10³ -105 ≤ choco[i] ≤ 105; where i is representing the index of the jars of chocolate. Osi< choco_size Example Input: 6 5 30 99 60 5 10 Output: 114 Explanation Andrew picks from the 1st (5), 3rd (99), and 6th jars (10). Test Cases & Output 1 V/Header Files 2 #include<stdio.h> 3 #include<stdlib.h> 4 #include<string.h> 5 #include<stdbool.h> 6 7 /* only used in string related operations */ 8 typedef struct String string; struct String char *str; 9 10 - { 11 12 }; 13 14 char *input(FILE *fp, int size, int has_space) 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 51 52 - { 53 54 55 56 57 58 /* * 59 60 65 66 }; 73 74 75 76 77 78 ▾ 79 71 { 72 80 81 82 83 84 85 86 87 88 int actual size = 0; char *str = (char *)malloc(sizeof(char)* (size+actual_size)); char ch; if(has_space == 1) { 50 typedef struct array_single_int array_single_int; struct array_single_int while(EOF != (ch-fgetc (fp)) && ch != '\n') { str[actual_size] = ch; actual size++; if(actual size >= size) str = realloc(str, sizeof(char)sactual_size); } else } Editor } /* only used in string related operations */ { } while(EOF != (ch-fgetc (fp)) && ch != '\n' && ch != ' ') { str[actual_size] = ch; actual size++; if(actual size >= size) str = realloc(str,sizeof(char)*actual_size); = */ 61 int maxNumOfChocolates (array_single_int choco) 62 - { 63 64 67 68 } 69 70 int main() { } actual size++; str realloc(str, sizeof(char)*actual_size); str[actual_size-1] = '\0'; return str; int *data; int size; int answer; // Write your code here return answer; array_single_int choco; //input for choco scanf("%d", &choco.size); choco.data = (int *)malloc(sizeof(int) choco.size); for (int idx = 0; idx < choco.size; idx++) { scanf("%d", &choco.data[idx]); } int result = maxNumOfChocolates (choco); printf("%d", result); return 0; The current selected programming language is C. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use printf() to debug your code. The printf() may not work in case of syntax/runtime error. The version of GCC being used is 5.5.0. There is a set of N jars. The jars contain differing numbers of chocolates. Some of the jars may be empty. Andrew may pick multiple jars but he may not pick any jar that is adjacent to a jar that he has already picked. Write an algorithm to calculate the maximum number of chocolates that Andrew may collect by picking jars. Input The first line of the input consists of an integer - choco_size, representing the number of jars of chocolates (N). The second line of the input consists of N space- separated integers- choco, representing the number of chocolates in each jar. Output Print an integer representing the maximum number of chocolates that Andrew may collect. Constraints 1 < choco_size <10³ -105 ≤ choco[i] ≤ 105; where i is representing the index of the jars of chocolate. Osi< choco_size Example Input: 6 5 30 99 60 5 10 Output: 114 Explanation Andrew picks from the 1st (5), 3rd (99), and 6th jars (10). Test Cases & Output 1 V/Header Files 2 #include<stdio.h> 3 #include<stdlib.h> 4 #include<string.h> 5 #include<stdbool.h> 6 7 /* only used in string related operations */ 8 typedef struct String string; struct String char *str; 9 10 - { 11 12 }; 13 14 char *input(FILE *fp, int size, int has_space) 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 51 52 - { 53 54 55 56 57 58 /* * 59 60 65 66 }; 73 74 75 76 77 78 ▾ 79 71 { 72 80 81 82 83 84 85 86 87 88 int actual size = 0; char *str = (char *)malloc(sizeof(char)* (size+actual_size)); char ch; if(has_space == 1) { 50 typedef struct array_single_int array_single_int; struct array_single_int while(EOF != (ch-fgetc (fp)) && ch != '\n') { str[actual size] = ch; actual size++; if(actual size >= size) str = realloc(str, sizeof (char)sactual_size); } else } Editor { } while (EOF != (ch-fgetc (fp)) && ch != '\n' && ch != ' ') { = } /* only used in string related operations */ 67 68 } 69 70 int main() */ 61 int maxNumOfChocolates (array_single_int choco) 62 - { 63 64 str[actual size] = ch; actual size++; if(actual size >= size) str = realloc(str,sizeof(char)*actual_size); { } actual size++; str realloc(str,sizeof(char)*actual_size); str[actual_size-1] = '\0'; return str; int *data; int size; int answer; // Write your code here return answer; array_single_int choco; //input for choco scanf("%d", &choco.size); choco.data = (int *)malloc (sizeof(int) * choco.size); for (int idx = 0; idx < choco.size; idx++) { scanf ("%d", &choco.data[idx]); } int result = maxNumOfChocolates (choco); printf("%d", result); return 0; The current selected programming language is C. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use printf() to debug your code. The printf() may not work in case of syntax/runtime error. The version of GCC being used is 5.5.0. There is a set of N jars. The jars contain differing numbers of chocolates. Some of the jars may be empty. Andrew may pick multiple jars but he may not pick any jar that is adjacent to a jar that he has already picked. Write an algorithm to calculate the maximum number of chocolates that Andrew may collect by picking jars. Input The first line of the input consists of an integer - choco_size, representing the number of jars of chocolates (N). The second line of the input consists of N space- separated integers- choco, representing the number of chocolates in each jar. Output Print an integer representing the maximum number of chocolates that Andrew may collect. Constraints 1 < choco_size <10³ -105 ≤ choco[i] ≤ 105; where i is representing the index of the jars of chocolate. Osi< choco_size Example Input: 6 5 30 99 60 5 10 Output: 114 Explanation Andrew picks from the 1st (5), 3rd (99), and 6th jars (10). Test Cases & Output 1 V/Header Files 2 #include<stdio.h> 3 #include<stdlib.h> 4 #include<string.h> 5 #include<stdbool.h> 6 7 /* only used in string related operations */ 8 typedef struct String string; struct String char *str; 9 10 - { 11 12 }; 13 14 char *input(FILE *fp, int size, int has_space) 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 51 52 - { 53 54 55 56 57 58 /* * 59 60 65 66 }; 73 74 75 76 77 78 ▾ 79 71 { 72 80 81 82 83 84 85 86 87 88 int actual size = 0; char *str = (char *)malloc(sizeof(char)* (size+actual_size)); char ch; if(has_space == 1) { 50 typedef struct array_single_int array_single_int; struct array_single_int while(EOF != (ch-fgetc (fp)) && ch != '\n') { str[actual_size] = ch; actual size++; if(actual size >= size) str = realloc(str, sizeof(char)sactual_size); } else } Editor } /* only used in string related operations */ { } while(EOF != (ch-fgetc (fp)) && ch != '\n' && ch != ' ') { str[actual_size] = ch; actual size++; if(actual size >= size) str = realloc(str,sizeof(char)*actual_size); = */ 61 int maxNumOfChocolates (array_single_int choco) 62 - { 63 64 67 68 } 69 70 int main() { } actual size++; str realloc(str, sizeof(char)*actual_size); str[actual_size-1] = '\0'; return str; int *data; int size; int answer; // Write your code here return answer; array_single_int choco; //input for choco scanf("%d", &choco.size); choco.data = (int *)malloc(sizeof(int) choco.size); for (int idx = 0; idx < choco.size; idx++) { scanf("%d", &choco.data[idx]); } int result = maxNumOfChocolates (choco); printf("%d", result); return 0;

Answer rating: 100% (QA)

Here is an algorithm to calculate the maximum number of chocolates that Andrew may collect by pickin... View the full answer