PasteBoard

技术帮助文档集合

http://help.cefhost.cn/archives/390.html

https://zh.singlelogin.re

https://alvincr.com/2021/01/google-fonts/

https://jingyan.baidu.com/article/ff42efa92333cec19e220207.html

https://blog.csdn.net/AlvinCasper/article/details/112461876

#include<bits/stdc++.h>
//P1191
using namespace std;
typedef long long ll;
const int N = 160;
int a[N][N];
int stat[N][N];
char s[200];
int n;
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> s + 1;
        for(int j = 1; j <= n; j++) {
            a[i][j] = s[j] == 'W' ? 0 : 1;
            // stat[i][j] = a[i][j] + a[i - 1][j - 1] - a[i - 1][j] - a[i][j - 1];
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(a[i][j] == 0) {//当前的是白色，作为左上角
                int stats = i;
                int tmpcnt;
                for(int k = i + 1; k <= n; k++) {
                    if(a[k][j] == 0) stats = k;
                }
                tmpcnt = stats;

            }
        }
    }
    return 0;
}

VCB-S https://vcb-s.com/

末日 https://share.acgnx.se/

dmhy镜像 https://dmhy.myheartsite.com/

https://zhuanlan.zhihu.com/p/106057556 知乎 on VSCode

pandas指南 https://blog.csdn.net/qq_42415326/article/details/89678833

12805576