C++数组——习题2

752. 数组的右方区域

https://www.acwing.com/problem/content/754/

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
    char a;
    cin>>a;
    double c,s;
    int t=0;
    for(int i=0;i<12;i++)
    for(int j=0;j<12;j++)
    {
     cin>>c;
     if(i<j&&i+j>11)
     s+=c,t++;
    }
    if(a=='S')
    printf("%.1lf",s);
    else printf("%.1lf",s/t);
    return 0;
}

 754. 平方矩阵 II

https://www.acwing.com/problem/content/756/

#include <iostream>

using namespace std;

int main()
{
    int n;
    while(cin >> n && n){
        for(int i = 1 ; i <= n; i ++){
            for(int j = i; j > 0; j--){
                cout << j << " ";
            }
            for (int k = 2,j = 1; j <= n - i; j++, k ++ ){
                cout << k << " ";
            }
            cout << endl;
        }
        cout << endl;
    }
    
    return 0;
}

755. 平方矩阵 III

https://www.acwing.com/problem/content/757/

#include <iostream>
#include <cmath>

using namespace std;

typedef long long ll;
int main()
{
    int n;
    while(cin >> n && n){
        for (int i = 0; i < n; i ++ ){
            for (int j = 0; j < n; j ++ ){
                cout << ll(pow(2,i+j)) << " ";
            }
            cout << endl;
        }
        cout << endl;
    }
    
    return 0;
}

 756. 蛇形矩阵

https://www.acwing.com/problem/content/758/

#include <iostream>

using namespace std;
const int N = 111;
int st[N][N];

int main()
{
    int n,m;
    cin >> n >> m;
    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
    int x = 0,y = 0,d = 1;
    for(int i = 1; i <= n * m; i++){
        st[x][y] = i;
        int a = x + dx[d],b = y + dy[d];
        if(a < 0 || a >= n || b < 0 || b >= m || st[a][b]){
            d = (d + 1) % 4;
            a = x + dx[d], b = y + dy[d];
        }
        x = a, y = b;
    }
    for (int i = 0; i < n; i ++ ){
        for (int j = 0; j < m; j ++ ){
            cout << st[i][j] <<" ";
        }
        cout << endl;
    }
    
    return 0;
}