EADing_7的博客

#include #include using namespace std; int main(){ int i,j,begin,end,value,n,m,k; while(scanf("%d",&n)&&n!=0){ int map[105][105]={0},min; int v[55]={0},a[55]={0}; int val=0,num=1; scanf(

#include #include #include using namespace std; struct node{ int x,step; }; queue Q; int v[200500]; int k; void bfs(){ int x,step; while(!Q.empty()){ node tmp=Q.front(); Q.pop(); x=tmp

#include #include int prime[40]={0,1,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0},n;//素数打表，因为n最大是20，所以只要打到40 int visited[21],a[21]; void dfs(int num)//深搜 { int i;

#include #include #include using namespace std; int main(){ int n,k,i,num; char c; while(scanf("%d %d",&n,&k)!=EOF){ priority_queue, greater > q; for(i=0;i<k;i++){ cin>>c; cin>>num;

八皇后 #include #include using namespace std; int num=0,t=0; int m[100]; int n; void dfs(int N){ int i,j; if(N==n){ num++; } else{ for(i=0;i<n;i++){ //遍历每行寻找合适位置 int s=1; m[N]=i;

#include #include using namespace std; int main(){ int i,j,t,n,k=1,num; scanf("%d",&t); num=t; while(t--){ int max=-10000,sum=0,begin=0,end=0,pos=0; int a[100000]; scanf("%d",&n); for