A Very Big Sum | HackerRank

最新推荐文章于 2024-08-10 15:25:17 发布

polaris0x1

最新推荐文章于 2024-08-10 15:25:17 发布

阅读量133

点赞数

文章标签：算法 c语言开发语言

本文链接：https://blog.csdn.net/m0_74282485/article/details/128063071

版权

该博客主要介绍了一个编程挑战，要求计算包含极大整数的数组元素之和。在C语言中，由于32位整数范围限制，可能需要使用`long long`类型来存储和防止溢出。示例代码展示了一个读取数组并计算总和的方法，最后返回数组所有元素的和。

摘要由CSDN通过智能技术生成

5 more points to get your next star!
Rank: 1519153|Points: 95/100
Problem Solving
Problem
Submissions
Leaderboard
Discussions
Editorial
In this challenge, you are required to calculate and print the sum of the elements in an array, keeping in mind that some of those integers may be quite large.
Function Description
Complete the aVeryBigSum function in the editor below. It must return the sum of all array elements.
aVeryBigSum has the following parameter(s):
int ar[n]: an array of integers .
Return
long: the sum of all array elements
Input Format
The first line of the input consists of an integer .
The next line contains space-separated integers contained in the array.
Output Format
Return the integer sum of the elements in the array.
Constraints

Sample Input
5
1000000001 1000000002 1000000003 1000000004 1000000005
Output
5000000015
Note:
The range of the 32-bit integer is .
When we add several integer values, the resulting sum might exceed the above range. You might need to use long int C/C++/Java to store such sums.
呵呵😊

#include<stdio.h>
int main ()
{
    int n ;
    long long sum = 0 ;
    scanf ("%d",&n);
    long long ar[n] ;
    for ( int i = 0 ; i < n ; i ++ )
    {
        scanf ("%lld",&ar[i]);
    }
    for ( int j = 0 ; j < n ; j ++ )
    {
        sum += ar[j] ;
    }
    printf ("%lld\n",sum);
    return 0;
}