2.03.2018 lab 02 tehnici

//problema 1
#include <stdio.h>
#include <stdlib.h>



int umplere_vector (int *p, int n, FILE *fp)
{
    int x, i = 0;

    while (!feof(fp))
    {
        if (fscanf(fp, "%d", &x) != 1)
            break;

        if (prim(x))
            {
                *(p+i) = x;
                i++;
            }
    }

    for (x = i; x<n; x++)
        *(p+x) = 0;

    return i;
}

int prim(int i)
{
    long int j;
    int state = 1;
    for(j=2;j<i;j++)
    {
        if((i%j)==0){state=0;break;}
    }
    return state;
} // 0 - nu e prim, 1 - e prim

int main()
{
    FILE *fp;
    fp = fopen("date.in","r");

    int n, *p, i=0, x;

    printf("n = ");
    scanf("%d",&n);

    p = (int*) malloc(n * sizeof(int));

    umplere_vector(p,n,fp);

    for (i=0; i<n; i++)
        printf("v[%d] = %d\n",i,p[i]);

    free(p);
    fclose(fp);

    return 0;
}

//problema 2
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define min(a,b) \
   ({ __typeof__ (a) _a = (a); \
       __typeof__ (b) _b = (b); \
     _a < _b ? _a : _b; })

int **matrice(int n)
{
    int **m,i,j;
    m = malloc(n*sizeof(int*));

    for (i=0; i<n; i++)
        {
            m[i] = malloc(n*sizeof(int));
            for (j=0; j<n; j++)
                m[i][j] = min(i,j);
        }

   return m;
}

int main()
{
    int **a,i,j;
    a = matrice(4);

    for (i=0; i<4; i++)
        {
            for (j=0; j<4; j++)
                printf("%d ",a[i][j]);

            printf("\n");
        }

    return 0;
}

//problema 4
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdarg.h>

float medie(int n, ...)
{
    va_list lp;

    int i;
    float s = 0;

    va_start(lp,n);

    for (i=0; i<n; i++)
            s = s + va_arg(lp,int);

    s = s / n;

    va_end(lp);

    return s;
}

int main()
{
    float m;
    m = medie(2,5,8);

    printf("%.2f", m);

    return 0;
}