We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. A Very Big Sum
  5. Discussions

A Very Big Sum

Sort by

recency

|

2011 Discussions

|

  • enavad07
     + 0 comments
    #include <stdio.h>

long a_very_big_sum(int count, long a[]);

long fill_vector(long a[], int count);

long a_very_big_sum(int count, long a[]) {
    
     long sum = 0;
     
    for (int i = 0; i < count; i++) {
        sum += a[i];
    }
    
    return sum;
}

long fill_vector(long a[], int count) {
    
    for (int i = 0; i < count; i++) {
        scanf("%ld", &a[i]);
    }
    
    return a_very_big_sum(count, a);
}


int main() {
    
    int count = 0;
    
    scanf("%d", &count);
    
    long a[count];
    
    
    long result = fill_vector(a,count);
    
    printf("%ld", result);
    
    return 0;
}

  • testwebak24
     + 0 comments
    public static long aVeryBigSum(List<Long> ar) {
        long k = 0;
        for(Long l : ar){
            k += l;
        }
        return k;
    }

  • cmorales2214
     + 0 comments

    return ar.Sum();

  • rajatsingh04
     + 0 comments

    include

    using namespace std;

    int main() { int n; int i; cin>>n; long int arr[n]; long int sum=0; for( i=0;i>arr[i];

    }
for(i=0;i<n;i++)
{
    sum=sum+arr[i];
}
cout<<sum;
return 0;

    }

  • samet_bilgi
     + 0 comments

    return ar.reduce(0, +)