Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
2.1.2 Sum of all the elements in a one dimensional array A using reduction.
#include <stdio.h> #include <stdlib.h> #include <omp.h> int main(void) { long i,n = 120000000,sum = 0; long *arr = (int *)malloc(n * sizeof(long)); for(i = 0;i< n;i++) { arr[i] = rand(); } #pragma omp parallel for reduction(+:sum) for(i = 0;i < n;i++) { sum += arr[i]; } printf("Sum = %ld",sum); return 0; }
run
|
edit
|
history
|
help
0
Max3
THIS one uwu
método de ordenamiento insertion sort
Divisibility :- #simple-math #ad-hoc-1 #basics
Conflito entre 4 threads
blue saver go my marshal green
Lab6 v1.2 Sin,cos,tan,cot
20171127_ARRAY_ValorMayor
1.1 Hello World!
150108_RecursivoPrimo