EE2 Resolução - 2015 - 3 - Com novo pragma

// ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
// ♥
// ♥
// ♥                   @author ovictoraurelio
// ♥                   @github http://github.com/ovictoraurelio
// ♥                   @website http://victoraurelio.com
// ♥
// ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
#define N 10

int main(){
    double vetor[N];
    int i;

    #pragma omp parallel
    {
        #pragma omp single
        {
            printf("\nThreads nos calculos de fibonnaci: ");
            vetor[0] = 0;
            vetor[1] = 1;
            for(i=2; i<N; i++){
                vetor[i] = vetor[i-1] + vetor[i-2];
                printf("|%d|", omp_get_thread_num());
            }
        }
        /** Código para calcular sequencia de Fibonnaci */
        printf("\nThreads nos calculos de potencia: ");
        #pragma omp for
            for (i=0; i<N; i++){
                printf("|%d|", omp_get_thread_num());
                vetor[i] = pow(vetor[i],i);
            }
    }

    printf("\nVetor eh igual: \n");
    for(i=0; i<N; i++){
        printf("%.2f\n", vetor[i]);
    }
    printf("\n");
    return 0;
}