7 solutions

  • 7
    @ 2024-8-16 10:36:55
    #include<bits/stdc++.h>
    using namespace std;
    int a[20][20];
    int main()
    {
    	int n;
    	cin>>n;
    
    	for(int i=0;i<=n-1;i++)
    	{
    		for (int j=0;j<=n-1;j++)
    		{	
    			int s=1;
    			for (int k=1;k<=i+j;k++)
    			{
    				s=s*2;
    			}	
    			a[i][j]=s;
    			cout<<a[i][j]<<" ";
    		}
    		cout<<endl;
    	}
    	return 0;
    }
    
    • 4
      @ 2024-7-23 15:43:10
      #include<bits/stdc++.h>
      using namespace std;
      const int N=15;
      int a[N][N];
      int main(){
           int n;
           cin>>n;
           for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                     int cnt=1;
                     for(int k=0;k<=i+j;k++){
                          if(k==0) cnt=1;
                          else cnt*=2;
                     }
                     cout<<cnt<<" ";
                }
                cout<<endl;
           }
           return 0;
      }
      
      • -3
        @ 2024-9-27 20:16:44
        #include<bits/stdc++.h>
        using namespace std;
        int a[20][20];
        int main()
        {
        	int n;
        	cin>>n;
        
        	for(int i=0;i<=n-1;i++)
        	{
        		for (int j=0;j<=n-1;j++)
        		{	
        			int s=1;
        			for (int k=1;k<=i+j;k++)
        			{
        				s=s*2;
        			}	
        			a[i][j]=s;
        			cout<<a[i][j]<<" ";
        		}
        		cout<<endl;
        	}
        	return 0;
        }
        
        
        • -3
          @ 2024-7-23 15:46:31
          #include <bits/stdc++.h>
          using namespace std;
          const int N=20;
          int a[N][N];
          int main()
          {
          	int n,v=1;
          	cin>>n; 
          	for(int i=0;i<n;i++)
          	{
          		for(int j=0;j<n;j++)
          		{
          			v=1;
          			for(int s=1;s<=i+j;s++)
          			{
          				v=v*2; 
          			}
          			a[i][j]=v;
          		}
          	}
          	for(int i=0;i<n;i++)
          	{
          		for(int j=0;j<n;j++)
          		{
          			cout<<a[i][j]<<" ";
          		}
          		cout<<endl;
          	}
          }
          
          • -4
            @ 2024-12-1 9:26:56
            #include<bits/stdc++.h>
            using namespace std;
            int a[20][20];
            int main(){
                int n;
                cin>>n;
                for(int i=0;i<n;i++){
                    for(int j=0;j<n;j++){
                        int s=1;
                        for(int k=1;k<=i+j;k++){
                            s*=2;
                        }
                        a[i][j]=s;
                        cout<<a[i][j]<<" ";
                    }
                    cout<<endl;
                }
                return 0;
            }
            • -4
              @ 2024-12-1 9:26:24
              #include<bits/stdc++.h>
              using namespace std;
              int a[20][20];
              int main(){
                  int n;
                  cin>>n;
                  for(int i=0;i<n;i++){
                      for(int j=0;j<n;j++){
                          int s=1;
                          for(int k=1;k<=i+j;k++){
                              s*=2;
                          }
                          a[i][j]=s;
                          cout<<a[i][j]<<" ";
                      }
                      cout<<endl;
                  }
                  return 0;
              }
              ```cpp
              • -4
                @ 2024-7-23 16:00:06
                #include<bits/stdc++.h>
                using namespace std;
                int main()
                {
                int n;
                cin>>n;
                for(int i=0;i<n;i++)
                {
                for(int j=0;j<n;j++)
                {
                int cnt=1;
                for(int k=1;k<=i+j;k++)
                {
                cnt=cnt*2;
                }
                cout<<cnt<<" ";
                }
                cout<<endl;
                }
                return 0;
                }
                
                • 1

                Information

                ID
                74
                Time
                1000ms
                Memory
                256MiB
                Difficulty
                1
                Tags
                (None)
                # Submissions
                79
                Accepted
                43
                Uploaded By