求助，测试全是0

玄关``` #include<bits/stdc++.h> using namespace std; int a,b; int bzw; int ans=0; int n; struct node{ int x,y; }z; int wzx[2]={0,1}; int wzy[2]={1,0}; int gzd[100][100]; int main() { memset(gzd,0,sizeof(gzd)); cin>>a>>b; cin>>n; for(int i=1;i<=n;i++){ int nx,ny; cin>>nx>>ny; gzd[nx][ny]=1; } queue q; z.x=1; z.y=1; q.push(z); while(!q.empty()){ node dlt=q.front(); q.pop(); for(int i=0;i<2;i++){ int newx=dlt.x+wzx[i]; int newy=dlt.y+wzy[i]; z.x=newx; z.y=newy; if(newx<1 || newy<1 || newx>n || newy>n || gzd[newx][newy]==1){ continue; } if(newx==a && newy==b){ ans++; continue; } q.push(z); } } cout<<ans; return 0; }