fina(riad)

#include <stdio.h>

int main()
{
    int v,a,b,k=1,sumR,sumC;
    int i, j;
    int count=0;
    printf("number of vertex \n");
    scanf("%d",&v);
    int m[v][v];
    for(int i=0;i<=v;i++)
    {
        for(int j=0;j<=v;j++)
        {
            m[i][j]=0;
        }
    }
    while(1)
    {
    printf("edge : %d \n",k );
    scanf("%d %d",&a,&b);
    if(a>v || b>v)
    {
        printf("please input valid input \n");

        printf("\n");
    }
    else if(a==0 && b==0)
    {
        break;
    }
    else
    {
        m[a][b]=1;
        m[b][a]=1;
        k++;
    }

    }
     for(int i=1;i<=v;i++)
    {
        for(int j=1;j<=v;j++)
        {
            printf("%d  ",m[i][j]);

        }
        printf("\n");
    }

/* out degree */
    for (i = 0; i < v; i++)
    {
        sumR = 0;
        for (j = 0; j < v; j++)
        {
            sumR += m[i][j];
        }
        printf("Out degree of  %d = %d\n", i + 1, sumR);
    }

    printf("\n");

      /* in degree*/
    for (i = 0; i < v; i++)
    {
        sumC = 0;
        for (j = 0; j < v; j++)
        {
            sumC += m[j][i];
        }
        count += sumC;
        printf("IN  degree of   %d = %d\n", i + 1, sumC);

    }
    printf("Total IN  degree = %d\n", count);

}