201512-1(数位之和),201512-2(消除类游戏)

//201512-1
#include <iostream>
#include <cstdio>

using namespace std;

int main() {
    int sum = 0;
    int n;
    scanf("%d", &n);

    while (n) {
        sum += n % 10;
        n /= 10;
    }
    printf("%d\n", sum);
}

//201512-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);
    int res = n % 10;
    while (n /= 10) res += n % 10;
    printf("%d\n", res);
    return 0;
}

//201512-2
//从每一行遍历当前行的所有列
//如果j(列下标)==j+1,j==j+2
//那就将数组对应的数变为负数
//然后对每一列遍历当前列的所有行
//类似比较行下标
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m;
    scanf("%d%d", &n, &m);

    int arr[n][m];
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            scanf("%d", &arr[i][j]);

    //从行开始遍历
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m - 2; j++)
            if (abs(arr[i][j]) == abs(arr[i][j + 1]) && abs(arr[i][j + 1]) == abs(arr[i][j + 2]))
                arr[i][j] = arr[i][j] < 0 ? arr[i][j] : -arr[i][j], arr[i][j + 1] =
                        arr[i][j + 1] < 0 ? arr[i][j + 1] : -arr[i][j + 1], arr[i][j + 2] =
                        arr[i][j + 2] < 0 ? arr[i][j + 2] : -arr[i][j + 2];

    //从列开始遍历
    for (int i = 0; i < n - 2; i++)
        for (int j = 0; j < m; j++)
            if (abs(arr[i][j]) == abs(arr[i + 1][j]) && abs(arr[i + 1][j]) == abs(arr[i + 2][j]))
                arr[i][j] = arr[i][j] < 0 ? arr[i][j] : -arr[i][j], arr[i + 1][j] =
                        arr[i + 1][j] < 0 ? arr[i + 1][j] : -arr[i + 1][j], arr[i + 2][j] =
                        arr[i + 2][j] < 0 ? arr[i + 2][j] : -arr[i + 2][j];

    //打印数据
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (j != 0)
                printf(" ");
            printf("%d", arr[i][j] < 0 ? 0 : arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}

//201512-2
#include <bits/stdc++.h>

using namespace std;

int main() {

    int n, m;
    scanf("%d%d", &n, &m);
    vector<vector<int>> v(n, vector<int>(m)), dp(n, vector<int>(m));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            scanf("%d", &v[i][j]);

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            if (j + 1 < m && j + 2 < m)
                if (v[i][j] == v[i][j + 1] && v[i][j] == v[i][j + 2])
                    dp[i][j] = 1, dp[i][j + 1] = 1, dp[i][j + 2] = 1;

    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++)
            if (j + 1 < n && j + 2 < n)
                if (v[j][i] == v[j + 1][i] && v[j][i] == v[j + 2][i])
                    dp[j][i] = 1, dp[j + 1][i] = 1, dp[j + 2][i] = 1;

    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++)
            printf(dp[i][j] == 1 ? "0 " : "%d ", v[i][j]);
        printf("\n");
    }

    return 0;
}