zoukankan      html  css  js  c++  java
  • 蓝桥杯-基础练习-字母图形

    蓝桥杯-基础练习-字母图形

    动态分配空间实现,两个测试过不去,80分

    #include <iostream> 
    using namespace std;
    int main(){
        int n,m;
        cin >> n >> m;
        char **a = new char*[n];
        for(int i = 0; i < n; i++)
            a[i] = new char[m];
        for(int i = 0; i < n; i++){
            int k = 0;
            for(int j = i; j < m; j++){
                a[i][j] = 'A'+ k;
                k++;
            }
            k = 0;
            for(int j = i; j >=0;j--){
                a[i][j] = 'A'+k;
                k++;
            }
        }
        for(int i = 0; i < n; i++){
            for (int j = 0; j < m; j++){
                cout << a[i][j];
            }
            cout << endl;
            delete []a[i];
        }
        delete []a;
        return 0;
    }
    

    数组固定分配内存,测试全过。

    #include <iostream> 
    using namespace std;
    int main(){
        int n,m;
        cin >> n >> m;
        char a[26][26] = {0};
        for(int i = 0; i < n; i++){
            int k = 0;
            for(int j = i; j < m; j++){
                a[i][j] = 'A'+ k;
                k++;
            }
            k = 0;
            for(int j = i; j >=0;j--){
                a[i][j] = 'A'+k;
                k++;
            }
        }
        for(int i = 0; i < n; i++){
            for (int j = 0; j < m; j++){
                cout << a[i][j];
            }
            cout << endl;
        }
        return 0;
    }
    
  • 相关阅读:
    POJ 1321 棋盘问题 (DFS)
    POJ 2676 Suduku
    Codeforce Segment Occurrences——string中substr的应用
    POJ 2492
    HDU 3088
    POJ 2992
    STL的sort排序
    mongoimport csv文件
    远程计算机或设备将不接受连接,IE无法上网
    注册MongoDB服务
  • 原文地址:https://www.cnblogs.com/chmod/p/15489938.html
Copyright © 2011-2022 走看看