fork(1) download
copy 
  1. #include <iostream>
  2. #include <omp.h>
  3.  
  4. using namespace std;
  5.  
  6. int main() {
  7.     const int size = 100;
  8.     int primes[size] = {
  9.         2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
  10.         31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
  11.         73, 79, 83, 89, 97, 101, 103, 107, 109, 113,
  12.         127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
  13.         179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
  14.         233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
  15.         283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
  16.         353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
  17.         419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
  18.         467, 479, 487, 491, 499, 503, 509, 521, 523, 541
  19.     };
  20.  
  21.     int sum = 0;
  22.  
  23.     #pragma omp parallel for reduction(+:sum)
  24.     for (int i = 0; i < size; ++i) {
  25.         sum += primes[i];
  26.     }
  27.  
  28.     cout << "The sum value of the first 100 prime numbers is: " << sum << endl;
  29.  
  30.     return 0;
  31. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
The sum value of the first 100 prime numbers is: 24133
https://ideone.com/jjFxpl
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!