摘要：
A. The Doors 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int N; int Zero = 0, One = 0; int a[maxn], b[maxn], suma[max 阅读全文
摘要：
https://leetcode.com/problems/find-the-town-judge/ In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is se 阅读全文