A Blog

摘要： 简单题View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>usingnamespacestd;#definemaxn555charst[maxn][maxn];intdir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};intn,m;boolok(intx,inty){if(x<0||y<0||x>=n||y>=m)returnfalse;if(st[x][y]!=0)returnfalse;ret 阅读全文

摘要： 简单题printf("%x", d) 十六进制View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>usingnamespacestd;intr,x,y;intmain(){//freopen("t.txt","r",stdin);scanf("%x,%d,%d",&r,&x,&y);inta=1;if((a<<x)&r)r 阅读全文

摘要： trieView Code #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>usingnamespacestd;#definemaxl15#definemaxn10005structNode{Node*next[10];boolhave;boolend;}trie[maxn*maxl];intn;charst[maxl];intncount;boolins(Node*proot,char*st){if(proot->end)returnfalse;if( 阅读全文

摘要： dpView Code #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>usingnamespacestd;intf[6][50];intmain(){//freopen("t.txt","r",stdin);memset(f,0,sizeof(f));f[0][0]=1;for(inti=1;i<=5;i++)for(intj=0;j<=9*i;j++)for(intk=0;k<=9;k++){if( 阅读全文

摘要： bfsView Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxx 1005#define inc 502#define maxn maxx * maxxstruct Point{ int x, y;} q[maxx * maxx];int n, cx, cy;bool vis[maxx][maxx];bool map[maxx][maxx];int dist[maxx][maxx 阅读全文