摘要： #include#includechar a[35][100],b[100],c[100];int n;double grid[35][35];int exc(char str[100]){ for (int i=0;igrid[i][j]) grid[i][j]=m; } for (i=0;i1) return 1; return 0;}int main(){ int i=1,j,m; double rate; while(scanf("%d",&n)!=EOF) { ... 阅读全文

摘要： #includeint n,ans = 0,map[21][21],set[21];void dfs(int x, int sum){ int i,m; if(x>n) { if(sum > ans) ans = sum; return; } m = 0; set[x] = 1; for(i = 1; i <= x; i ++) if(set[i] == 2) m += map[i][x]; dfs(x + 1, sum + m); m = 0; s... 阅读全文

摘要： #include#include int map[10][10],row[10][10],col[10][10],grid[10][10];int DFS(int x,int y){if(x==9)return 1;if(map[x][y]){if(y==8)return DFS(x+1,0);elsereturn DFS(x,y+1);}else{int k=x/3*3+y/3,flag=0;for(int i=1;i<=9;i++)if(!row[x][i] && !col[y][i] && !grid[k][i]){map[x][y]=i;row[x 阅读全文