#include <stddef.h>
#include <limits.h>

void gen1(long * restrict a, size_t n, long v)
{
    size_t i;
    for (i=0; i<n; i++)
        a[i]=v;
}

void gen2(long * restrict a, size_t n, long v)
{
    size_t i;
    for (i=0; i<n; i++) {
        a[i]=v;
        v+=3;
    }
}

void gen3(long * restrict a, size_t n, long v, long inc)
{
    size_t i;
    for (i=0; i<n; i++) {
        a[i]=v;
        v+=inc;
    }
}

void par1(long *a, long *b, long * restrict c, size_t n)
{
    size_t i;
    for (i=0; i<n; i++)
        c[i] = a[i]+b[i];
}

void par2(long *a, long *b, long * restrict c, size_t n)
{
    size_t i;
    for (i=0; i<n; i++)
        c[i] = a[i]*b[i];
}


void parcond1(long *a, long *b, long * restrict c, size_t n)
{
    size_t i;
    for (i=0; i<n; i++)
        if (a[i]<b[i])
            c[i] = a[i]+b[i];
}

long red1(long *a, size_t n)
{
    size_t i;
    long r=0;
    for (i=0; i<n; i++)
        r+=a[i];
    return r;
}

/* not vectorizable */
long redarray1(long *a, long * restrict b, size_t n)
{
    size_t i;
    long r=0;
    for (i=0; i<n; i++) {
        r+=a[i];
        b[i] = r;
    }
    return r;
}

void stencil(long *a, long * restrict b, size_t n)
{
    size_t i;
    for (i=1; i<n-1; i++)
        b[i] = a[i-1]+a[i]+a[i+1];
}

long redcond1(long *a, size_t n)
{
    size_t i;
    long r=LONG_MAX;
    for (i=0; i<n; i++)
        if (a[i]<r)
            r = a[i];
    return r;
}

/* not vectorized by gcc-14 or clang-19 */
size_t redcond2(long *a, size_t n)
{
    size_t i;
    long r=LONG_MAX;
    size_t ri=0;
    for (i=0; i<n; i++)
        if (a[i]<r) {
            r = a[i];
            ri = i;
        }
    return ri;
}

long redcond3(long *a, size_t n)
{
    size_t i;
    long r=0;
    for (i=1; i<n; i++)
        if (a[i]>a[i-1])
            r += a[i];
    return r;
}

long comb2(long *a, long *b, long * restrict c, long * restrict d, long * restrict e, size_t n, long v, long inc)
{
    size_t i;
    long r1=0;
    long r2=LONG_MAX;
    for (i=1; i<n-1; i++) {
        c[i]=v; v+=inc; /* operation must be associative */
    }
    for (i=1; i<n-1; i++)
        d[i] = a[i]+b[i];
    for (i=1; i<n-1; i++)
        r1 += a[i]; /* operation must be associative */
    for (i=1; i<n-1; i++)
        if (a[i]<r2) r2 = a[i]; /* internally min */
    for (i=1; i<n-1; i++)
        e[i] = a[i-1]+a[i]+a[i+1];
    return r1*r2;
}

long comb(long *a, long *b, long * restrict c, long * restrict d, long * restrict e, size_t n, long r0, long inc)
{
    size_t i;
    long r1=0;
    long r2=LONG_MAX;
    for (i=1; i<n-1; i++) {
        c[i]=r0; r0+=inc; /* operation must be associative */
        d[i] = a[i]+b[i];
        if (a[i]>a[i-1]) r1 += a[i]; /* operation must be associative */
        if (a[i]<r2) r2 = a[i]; /* internally min */
        if (d[i]>c[i]) e[i] = a[i-1]+a[i]+a[i+1];
    }
    return r1*r2;
}