1 solutions

  • 0
    @ 2025-11-5 19:52:12

    C :

    int main(int argc, char* argv[])
    {
    int n,a[101][101],i,j;
    while(~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++)
    {for(j=0;j<n-1;j++)
    printf("%d ",a[j][i]);
    printf("%d\n",a[j][i]);
    }
    }
    	return 0;
    }
    
    

    C++ :

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

    Pascal :

    var
    n,i,j,b:integer;
    a:array[1..100,1..100]of integer;
    
     begin
      while not eof  do
       begin
       readln(n);
    
       if n=1 then  begin readln(b);writeln(b); end
       else
        begin
         for i:=1 to n do
          for j:=1 to n do
             read(a[i,j]);
            for i:=1 to n do
             begin
             for j:=1 to n-1 do
    
               write(a[j,i],' ');
    
               writeln(a[j+1,i]);
              end;
        end;
       end;
     end.
    
    
    
    
    

    Java :

    import java.util.Scanner;
    public class Main{
        public static void main(String[] args){
            Scanner in = new Scanner(System.in);
            while(in.hasNextInt()){
                int x = in.nextInt();
                int[][] a = new int[x][x];
                for(int i=0;i<x;i++){
                    for(int j=0;j<x;j++){
                        a[i][j] = in.nextInt();
                    }
                }
                for(int i=0;i<x;i++){
                    for(int j=0;j<x;j++){
                        if(j==x-1)
                        System.out.print(a[j][i]);
                        else
                        System.out.print(a[j][i]+" ");
                    }
                    System.out.println();
                }
            }
        }
    }
    
    • 1

    Information

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