Question 11 || Hacker Rank

1D Arrays in C || Hacker Rank

 

An exhibit is a holder object that holds a proper number of upsides of a solitary sort. To make an exhibit in C, we can do int arr[n];. Here, arr, is a variable cluster which holds up to whole numbers. The above cluster is a static exhibit that has memory dispensed at order time. A powerful exhibit can be made in C, utilizing the malloc capability and the memory is distributed on the pile at runtime. To make a number exhibit, of size , int *arr = (int*)malloc(n * sizeof(int)), where focuses to the base location of the cluster. At the point when you have gotten done with the exhibit, use free(arr) to deallocate the memory.

 

In this test, make a variety of size progressively, and read the qualities from stdin. Emphasize the cluster ascertaining the amount, everything being equal. Print the total and free the memory where the cluster is put away.

 

While the facts really confirm that you can aggregate the components as they are perused, without first putting away them to a cluster, however you won't get the experience working with an exhibit. Proficiency will be required later.

 

Input Configuration

The main line contains a number, .

The following line contains space-isolated numbers.

 

Imperatives

Yield Configuration

 Print the amount of the numbers in the exhibit.

 

Test Info 0

6

16 13 7 2 1 12

 

Test Result 0

51

 

Test Info 1

7

1 13 15 20 12 13 2

 

Test Result 1

76

#include <stdio.h>

#include <string.h>

#include <math.h>

#include <stdlib.h>

#include <stdio.h>

int main()

 {

    int n, sum = 0;

    scanf("%d", &n);

    for (int i = 0; i < n; i++) {

        int num;

        scanf("%d", &num);

        sum += num;

    }

    printf("%d", sum);

    return 0;

}

Output