1 solutions

  • 0
    @ 2025-11-5 15:50:23

    C :

    #include<stdio.h>
    #define N 4      
    void Init(int  n[N][N]);
    int Other_sum(int n[N][N]);
    int main ()
    {
    	int a[N][N];
    	int i ;
    	int j;
    	for (i =0; i < N; i++)
    	{
    		for (j =0; j < N; j++ )
    		{
    			scanf("%d",&a[i][j]);
    		}
    	}	
    	Init(a);
    	for (i =0; i < N; i++)
    	{
    		for (j =0; j < N; j++ )
    		{
    			printf("%d ",a[i][j]);
    		}
    		printf("\n");
    	}
    	printf("%d",Other_sum(a));
    	return 0;
    } 
    void Init(int  n[N][N])
    { 
    	int i;
    	for (i =0; i <N; i++)
    	{
    		n[i][i] = 1;
    		n[i][N-i-1]=1;
    	}
    	
    }
    
    int Other_sum(int n[N][N])
    {
    	int sum=0;
    	int i;
    	int j;
    	for (i =0; i < N; i++)
    	{
    		for (j =0; j < N; j++ )
    		{
    			sum+=n[i][j];
    		}
    	}	
    	sum = sum -2*N;
    	if(N%2)
    		sum +=1;
    	return sum;
    }
    
    

    C++ :

    #include<stdio.h>
    #define N 4      
    void Init(int  n[N][N]);
    int Other_sum(int n[N][N]);
    int main ()
    {
    	int a[N][N];
    	int i ;
    	int j;
    	for (i =0; i < N; i++)
    	{
    		for (j =0; j < N; j++ )
    		{
    			scanf("%d",&a[i][j]);
    		}
    	}	
    	Init(a);
    	for (i =0; i < N; i++)
    	{
    		for (j =0; j < N; j++ )
    		{
    			printf("%d ",a[i][j]);
    		}
    		printf("\n");
    	}
    	printf("%d",Other_sum(a));
    	return 0;
    } 
    void Init(int  n[N][N])
    { 
    	int i;
    	for (i =0; i <N; i++)
    	{
    		n[i][i] = 1;
    		n[i][N-i-1]=1;
    	}
    	
    }
    
    int Other_sum(int n[N][N])
    {
    	int sum=0;
    	int i;
    	int j;
    	for (i =0; i < N; i++)
    	{
    		for (j =0; j < N; j++ )
    		{
    			sum+=n[i][j];
    		}
    	}	
    	sum = sum -2*N;
    	if(N%2)
    		sum +=1;
    	return sum;
    }
    
    
    • 1

    Information

    ID
    17234
    Time
    1000ms
    Memory
    2MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By