A Blog

摘要： 模拟View Code #include <iostream>using namespace std;const int maxn=32;int byte[maxn];void init(){ int i; for (i=1;i<=31;i++) cin>>byte[i];}int num(int add){ int x=0,temp=1; while (add) { x+=add%10*temp; add/=10; temp*=2; } r... 阅读全文

摘要： 模拟View Code #include <iostream>#include <string>using namespace std;const int maxn=59;char st[1000];int vertex[maxn][maxn],mark[maxn],marknum,vertexnum[maxn],stl[maxn*3],stlnum;void init(){ memset(vertex,0,sizeof(vertex)); memset(mark,0,sizeof(mark)); memset(vertexnum,0,size... 阅读全文

摘要： 同1338View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 6000#define inf 0x3f3f3f3flong long f[maxn];int pos[4], fac[4];char* make(int a, char *st){ if (a % 10 == 1 && a % 100 != 11) strcpy(st, "st&qu 阅读全文

摘要： 模拟View Code #include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>using namespace std;#define maxn 30struct Matrix{ int x, y;} matrix[maxn];int n, ans;bool error;void input(){ scanf("%d", &n); getchar(); for (int i = 0; i < n; i++) { char ch 阅读全文

摘要： BFSView Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <queue>using namespace std;#define maxn 10struct Point{ int x, y;}s, t;int dir[8][2] = {{1, 2}, {1, -2}, {-1, 2}, {-1, -2}, {2, 1}, {-2, 1}, {2, -1}, {-2, -1}};bool in_bound(Po 阅读全文