DHU 二维数组 蛇形方阵

思路及代码

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
 //input n int 0< <20
    int n;
    cin >> n;
//solution
// i from 0->n-1
// even i*n+1
//odd (i+1)*n
    for (int i = 0; i <= n-1; i++){
        int first;
        if (i%2 == 0){
            first = i * n + 1;
            for (int j = 0; j <= n-1; j++){
                cout << setw(4) << setfill(' ') << first;
                first++;
            }
        }else{
            first = (i + 1) * n;
            for (int j = 0; j <= n-1; j++){
                cout << setw(4) << setfill(' ') << first;
                first--;
            }
        }
        cout << endl;
    }
    return 0;
}

 参考：无

收获 ：无

菜菜，不是教程，做题和学习记录