slw1slw的专栏

<br />总感觉在“X”地方不对，应该用张地图mark来标记"x"点是否走过。。#include<iostream>//1242WAusing namespace std;#include<queue>int map[205][205];int n,m,si,sj,ei,ej,mint;int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};struct point{ int x,y; int t;};int check(in

<br />Description<br />求方程x1+x2+…...+xn = m满足xi>=1的解的个数。<br />Input<br />输入由多组数据组成。每组数据输入一行n和m（1<=n<=300,n<=m<=100000）。<br />Output<br />由于方程的解的个数会超过整数范围，因此输出的结果对10007求余。<br />Sample Input<br />3 52 2<br /> <br />Sample Output<br />61<br /> <br />Sou

<br />//yong mat[][] Momery Limit#define MAXN 10005#include<iostream>#include<vector>using namespace std;int n,m,x,y,ans;vector<int> V,v[MAXN],v1[MAXN];int toposort(){ V.clear(); int d[MAXN],i,j,k=0; int sum=0,cnt=-1;

<br />//yong mat[][] Momery Limit#define MAXN 10005#include<iostream>#include<vector>using namespace std;int n,m,x,y,ans;vector<int> V,v[MAXN],v1[MAXN];int toposort(){ V.clear(); int d[MAXN],i,j,k=0; int sum=0,cnt=-1;

<br />//yong mat[][] Momery Limit#define MAXN 10005#include<iostream>#include<vector>using namespace std;int n,m,x,y,ans;vector<int> V,v[MAXN],v1[MAXN];int toposort(){ V.clear(); int d[MAXN],i,j,k=0; int sum=0,cnt=-1;

<br />//yong mat[][] Momery Limit#define MAXN 10005#include<iostream>#include<vector>using namespace std;int n,m,x,y,ans;vector<int> V,v[MAXN],v1[MAXN];int toposort(){ V.clear(); int d[MAXN],i,j,k=0; int sum=0,cnt=-1;