摘要：#include <iostream>using namespace std;struct point{ int x; int y;}P[705];int n,sum,tol;int main(){ int i,j,k; while(cin>>n,n) { tol=0; for(i=0;i<n;i++) cin>>P[i].x>>P[i].y; for(i=0;i<n;i++) { for(j=i+1;j<n;j+... 阅读全文

摘要：#include <iostream>#include <string.h>using namespace std;char grid[25][25];int vis[25][25];int n,m,x,y,tol;void DFS(int a,int b){ vis[a][b]=1; if(b+1<=m)//右面 { if(b+1==m) { tol++; } else { if(gri... 阅读全文