zhangzhaolin12的博客

#include<stdio.h> #include<string.h> struct node { int x, y; }ls[400]; int dx[] = {0,-1,0,1}, dy[] = {-1,0,1,0}; int bj[16][16], map[16][16]; int m, n, step, sum, xz, yz; void dfs(int ...

#include<stdio.h> #include<string.h> int dp[100005][15]; int Max(int x,int y) { return x>y?x:y; } int main() { int n,i,j,max,a,b; while(scanf("%d",&n)&&n) { memset(dp,...

#include <stdio.h> #include <stdlib.h> #include <string.h> int m[20][20];//矩阵 int max = 10000000; int a, b; void search(int i,int j,int sum); int main() //1304—取数字问题 { int i, ...