A Blog

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxn 50struct D{ int a, b;} f[maxn * maxn];int n, m, tot;int front[maxn], rear[maxn];bool operator <(const D &a, const D &b){ 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 50005int n;int f[maxn];int main(){ //freopen("t.txt", "r", stdin); scanf("%d", &n); for (int i = 0; i < n; i++) scanf(&qu 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 105char st1[maxn], st2[maxn];int getans(char *st1, char *st2){ int len1 = strlen(st1); int len2 = strlen(st2); for (int i = 0; i < len1; i++) { bool ok = t 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 105int n, d;bool vis[maxn];int main(){ //freopen("t.txt", "r", stdin); while (scanf("%d%d", &n, &d), n | d) { memset(vis 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 10000int k, m;bool sel[maxn];void input(){ scanf("%d", &m); memset(sel, 0, sizeof(sel)); for (int i = 0; i < k; i++) { int a; scanf("%d& 阅读全文