摘要:
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; const int N = 10010, M = 110; int f[M]; int n, m; int w[N]; int pre[N]; bool 阅读全文
摘要:
这题读懂题目之后就发现它很呆 #include <bits/stdc++.h> using namespace std; const int N = 100010, M = 110; vector<int> g[N]; int main() { ios::sync_with_stdio(false) 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; const int N = 10010, M = 110; int main() { int n, m; cin >> n >> m; vector<vector<int>> v(n, vector<int> 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; const int N = 10010; vector<int> g[N]; bool st[N]; int cnt = 0; vector<int> res; vector<int> temp; int d 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; const int N = 110; stack<char> stk[N]; int main() { int n, m, S; cin >> n >> m >> S; for (int i = 1; i < 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; const int N = 210; int w[N][N]; int main() { int n, m; cin >> n >> m; memset(w, -1, sizeof w); while (m- 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; int cal(int a, int b, char c) { int t; if (c == '/' && b == 0) t = -1; else if (c == '+') t = a + b; els 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; const int N = 1010; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k; cin >> n >> m >> 阅读全文