1 solutions

  • 0
    @ 2025-11-5 15:44:53

    C :

    #include <stdio.h>
    int main(){
    	int n;
    	int a[10][10];
    	int i,j,sum=0;
    	scanf("%d",&n);
    	for (i=0;i<n;i++)
    		for (j=0;j<n;j++)
    			scanf("%d",&a[i][j]);
        for (i=0;i<n;i++)
    		sum+=a[i][i];
    	printf("%d\n",sum);
    	return 0;
    }
    

    C++ :

    #include <stdio.h>
    int main() {
    	int dat[10][10];
    	int n, i, j, sum;
    	scanf("%d", &n);
    	for (i = 0;i < n;i++) {
    		for (j = 0;j < n;j++) {
    			scanf("%d", &dat[i][j]);
    		}
    	}
    	sum = 0;
    	for (i = 0;i < n;i++)
    		sum += dat[i][i];
    	printf("%d\n", sum);
    	return 0;
    }
    
    

    Pascal :

    const Num=20;
    var
      a:array[1..Num,1..Num] of longint;
      i,j,n,sum:longint;
      
    begin
      readln(n);
      for i:=1 to n do
        for j:=1 to n do
          read(a[i,j]);
      sum:=0;
      for i:=1 to n do inc(sum,a[i,i]);
      writeln(sum);
    end.
    
    

    Java :

    import java.util.Scanner;
    
    public class Main {
    	public static void main (String[] args) {
    		Scanner in=new Scanner(System.in);
    		int n=in.nextInt();
    	    int [][]a=new int[n][n];
    	    int sum=0;
    	    for(int i=0;i<n;i++)
    	    	for(int j=0;j<n;j++)
    	    		a[i][j]=in.nextInt();
    	    for(int k=0;k<n;k++)
    	    	sum +=a[k][k];
    	    System.out.println (sum);
    	}
    }
    
    • 1

    Information

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