9 solutions

  • 6
    @ 2024-2-22 16:06:18
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n-i;j++) //空格的数目
            {
                cout<<" ";
            }
            for(int j=1;j<i*2;j++)//*的数目
            {
                cout<<"*";
            }
            cout<<endl;
        }
        return 0;
    }
    
    
    • 2
      @ 2026-8-14 14:02:27
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
          int n;
      	cin>>n;
      	int m=2*n-1;
      	int x=n,y=n;
      	for(int i=1;i<=n;i++)
      	{
      		for(int j=1;j<=m;j++)
      		{
      			if(abs(x-i)+abs(y-j)<=n-1)
      			{
      				cout<<"*";
      			}
      			else
      			{
      				cout<<" ";
      			}
      		}
      		cout<<endl;
      	}
      	return 0; 
      }
      
      • 0
        @ 2025-5-19 19:11:44
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
            int n;
            cin>>n;
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=n-i;j++) 
                {
                    cout<<" ";
                }
                for(int j=1;j<i*2;j++)
                  
                {
                    cout<<"*";
                }
                cout<<endl;
            }
            return 0;
        }
        
        
        
        • -2
          @ 2026-2-2 16:12:32

          6

          • -3
            @ 2024-11-30 11:35:41
            #include<bits/stdc++.h>
            using namespace std;
            int main()
            {
                int n;
                cin>>n;
                for(int i=1;i<=n;i++)
                {
                    for(int j=1;j<=n-i;j++) 
                    {
                        cout<<" ";
                    }
                    for(int j=1;j<i*2;j++)
                    {
                        cout<<"*";
                    }
                    cout<<endl;
                }
                return 0;
            }
            
            • -4
              @ 2024-10-27 11:09:17
              using namespace std;
              int main()
              {
                  int n;
                  cin>>n;
                  for(int i=1;i<=n;i++)
                  {
                      for(int j=1;j<=n-i;j++) //空格的数目
                      {
                          cout<<" ";
                      }
                      for(int j=1;j<i*2;j++)//*的数目
                      {
                          cout<<"*";
                      }
                      cout<<endl;
                  }
                  return 0;
              }
              
              
              
              
              • -5
                @ 2025-2-14 10:05:48

                **~~#include using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=n-i;j++) //空格的数目 { cout<<" "; } for(int j=1;j<i2;j++)//的数目 { cout<<""; } cout<<endl; } return 0; } ~~*</strong>

                • -5
                  @ 2025-2-14 10:03:49

                  #include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=n-i;j++) //空格的数目 { cout<<" "; } for(int j=1;j<i*2;j++)//的数目 { cout<<""; } cout<<endl; } return 0; }

                  • -5
                    @ 2024-10-26 10:49:28
                    #include<bits/stdc++.h>
                    using namespace std;
                    int main()
                    {
                        int n;
                        cin>>n;
                        for(int i=1;i<=n;i++){
                            for(int j=1;j<=n-i;j++){
                                cout<<" ";
                            }
                            for(int j=1;j<i*2;j++){
                                cout<<"*";
                            }
                            cout<<endl;
                        }
                        return 0;
                    }
                    
                    • 1

                    Information

                    ID
                    68
                    Time
                    1000ms
                    Memory
                    256MiB
                    Difficulty
                    1
                    Tags
                    (None)
                    # Submissions
                    186
                    Accepted
                    88
                    Uploaded By