NEUQ-预备队
CV是第一生产力
fwxljwawawawawa
QQ:1320305093
展开
-
NEUQ-2021CF模拟训练-1
A - Strange Partition#include <iostream>#define int long longusing namespace std;const int N = 1e5 + 5;int a[N];void solve (){ int n, x; scanf ("%lld %lld", &n, &x); int sum1 = 0, sum2 = 0; for (int i = 0; i < n; i ++) { sc原创 2021-04-26 17:17:48 · 191 阅读 · 0 评论 -
NEUQ-2021自主学习训练-2
A - Almost Rectangle#include <iostream>using namespace std;char a[405][405];int x[5], y[5];int pi, pj;int main (){ int T; cin >> T; while (T --) { int n; cin >> n; pi = 0; pj = 0; for (int i = 0; i < n; i ++) {原创 2021-04-22 16:02:59 · 224 阅读 · 0 评论 -
NEUQ-2021自主学习训练-1
A - Prison Break#include <iostream>using namespace std;int main (){ int t; cin >> t; while (t --) { int a, b; cin >> a >> b; cout << a * b << endl; } return 0;}B - Restore Modulo#include <iostrea原创 2021-04-14 14:53:37 · 274 阅读 · 2 评论 -
NEUQ-2021寒假训练-字符串
A - Page Numbers#include <iostream>#include <vector>#include <set>using namespace std;int x;set <int> t;vector <int> a;int start, last; int main(){ while (scanf ("%d", &x)) { t.insert (x); if (getchar() =原创 2021-03-04 15:25:35 · 179 阅读 · 1 评论 -
NEUQ-2021寒假训练-搜索
A - Prime Ring Problem #include <iostream>#include <cstring>using namespace std;const int maxn = 20 + 5;int a[maxn], vis[maxn];int n, cas;void init ();bool p (int x);void dfs (int u);int main(){ while (~scanf ("%d", &n)) {原创 2021-03-02 00:39:38 · 138 阅读 · 0 评论 -
NEUQ-2021寒假训练-并查集
A - The Suspects#include <iostream>using namespace std;const int N = 30000 + 5;int p[N];int find (int x);void merge (int x, int y);int n, m;int ans;int i;int k, head;int x;int t1, t2;int main(){ while (~scanf("%d %d", &n, &a原创 2021-02-28 20:54:32 · 122 阅读 · 0 评论 -
NEUQ-2021寒假训练-基础dp
A - Super Jumping! Jumping! Jumping! #include <iostream>#define int long longusing namespace std;const int maxn = 1000 + 5;int a[maxn], dp[maxn];signed main(){ int n; while (~scanf("%lld", &n), n) { for (int i = 0; i < n; i ++)原创 2021-02-26 16:41:16 · 141 阅读 · 0 评论 -
NEUQ-2021寒假训练-二分和尺取法
A - Kefa and Company #include<bits/stdc++.h>#define int long longusing namespace std;struct node { int mon; int fri;};bool cmp(node x, node y) { return x.mon < y.mon;}const int maxn = 1e5 + 5;node a[maxn];int b[maxn];int sum[max原创 2021-02-24 18:17:02 · 148 阅读 · 0 评论 -
NEUQ-2021寒假训练-前缀和与差分
A - Balanced Substring #include<bits/stdc++.h>using namespace std;const int maxn = 100000 + 5;char t[maxn];int a[maxn], sum[maxn], idx[3 * maxn];int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; i原创 2021-02-23 01:57:11 · 164 阅读 · 0 评论