8 条题解

  • 3
    @ 2022-4-4 15:53:03
    #include <stdio.h>
    #include <iostream>
    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;j++)
    			cout << (char)(j + 'A' - 1);
    
    		for(int j = i-1 ; j>=1;j--)
    			cout << (char)(j + 'A' - 1);
    		cout << endl;
    	}
    	return 0;
    }
    
    • 1
      @ 2025-12-13 19:14:05
      #include <iostream>
      using namespace std;
      short n;
      int main()
      {
      	cin >> n;
      	char a[26] = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
      	short mid = 2,sig = (n - 1) / 2;
      	for (int i = 1;i <= n - 1;i++)
      		cout << ' ';
      	cout << 'A' << ' ' << endl;
      	sig = n - 2;
      	for (int i = 1;i < n;i++)
      	{
      		for (int j = 1;j <= sig;j++)
      			cout << ' ';
      		for (int j = 0;j < mid / 2;j++)
      			cout << a[j];
      		for (int j = mid / 2;j >= 0;j--)
      			cout << a[j];
      		cout << ' ' << endl;
      		mid += 2;
      		sig--;
      	}
      	return 0;
      }
      • 1
        @ 2025-9-15 16:35:13
        #include <stdio.h>
        int n;
        int main()
        {
        	scanf("%d\n", &n);
        	for(int i = 1; i <= n; i ++)
        	{
        		for(int j = 1; j <= n - i; j ++)
        			putchar(' ');
        		for(int j = 0; j < i; j ++)
        			putchar('A' + j);
        		for(int j = i - 2; j >= 0; j --)
        			putchar('A' + j);
        		putchar('\n');
        	}
        	return 0;
        }
        
        • 1
          @ 2023-7-9 11:15:00

          #include<stdio.h> #include using namespace std; int n; int main(){ cin>>n; for(int i=1;i<=n;i++) { //空格 for(int j=1;j<=n-i;j++) { cout<<" "; } //升序 for(char j='A';j<='A'+i-1;j++) { cout<<j; } //降序 for(char j='A'+i-2;j>='A';j--) { cout<<j; } cout<<endl; }

          return 0;
          

          }

          • 1
            @ 2022-12-11 18:14: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;j++) cout<<(char)(j+'A'-1);

            for(int j=i-1;j>=1;j--)
            		cout<<(char)(j+'A'-1);
            	cout<<endl;
            }
            return 0;
            

            }

            • -1
              @ 2025-5-22 18:27:16

              #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 <= i; j++) cout << char(j + 'A' - 1);

              	for(int j = i - 1; j >= 1; j--)
              		cout << char(j + 'A' - 1);
              	cout << endl;
              }
              return 0;
              

              }

              • -1
                @ 2024-11-29 19:59:27
                #include<bits/stdc++.h>
                using namespace std;
                int n,c=65;
                int main()
                {
                	cin>>n;
                	for(int i=1;i<=n;i++){
                	for(int j=1;j<=n-i;j++)cout<<" ";
                	for(int j=1;j<=i;j++)cout<<(char)c++;
                	c-=2;
                	for(int j=1;j<=i-1;j++)cout<<(char)c--;
                	c = 65;
                	cout<<endl;
                	}
                	return 0;
                }
                
                • -1
                  @ 2023-9-1 15:01:00
                  #include <iostream>
                  #include <bits/stdc++.h>
                  using namespace std;
                  const int N=1e7+10;
                  const int INF=0x3f3f3f3f;
                  int n,t=1;
                  char s='A';
                  int main()
                  {
                  	cin>>n;
                  	for(int i=1;i<=n;i++)
                  	{
                  		for(int j=n-i;j>=1;j--)
                  		{
                  			cout<<" ";
                  		}
                  		int mid=(i*2-1)/2+1;
                  		for(int j=1;j<=i*2-1;j++)
                  		{
                  			if(j<mid)
                  			{
                  				cout<<s;
                  				s+=1;
                  			}
                  			else if(j==mid)
                  			{
                  				cout<<s;
                  			}
                  			else
                  			{
                  				s-=1;
                  				cout<<s;
                  			}
                  		}
                  		s='A';
                  		cout<<endl; 
                  	} 
                  	return 0;
                  }
                  
                  
                  • 1

                  信息

                  ID
                  958
                  时间
                  1000ms
                  内存
                  128MiB
                  难度
                  3
                  标签
                  递交数
                  403
                  已通过
                  217
                  上传者