mlwhitecat-CSDN博客

原创 hdu1495

#include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; int s,n,m; bool book[101][101][101]...

2018-05-30 23:18:49 201

原创 poj3414

//不带路径回溯，后面会补上带路径回溯的代码 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> #include<cstdio> using name

2018-05-30 23:18:17 156

原创 poj3414

//不带路径回溯，后面会补上带路径回溯的代码 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> #include<cstdio> using name

2018-05-30 18:16:24 164

原创 fzu2150

#include<iostream> #include<cstring> #include<algorithm> #include<string> #include<cstdio> #include<queue> using namespace std; #define inf 0x3f3f3f ...

2018-05-30 16:13:47 263

转载 uva16224

#include <iostream> #include <stdio.h> #include <queue> #include <string.h> #define MAX 1010 using namespace std; char Map[MAX][MAX]; int Time[MAX][MAX]; bool vis[MAX][MAX]; ...

2018-05-25 11:23:03 143

原创 hdu1241

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; char M[101][101]; int ans=0...

2018-05-24 09:58:02 145

原创 hdu2612

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<cstdio&am

2018-05-24 09:38:16 245

原创 poj3278

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; int n,k; bool book[100001];...

2018-05-22 20:52:08 240

原创 poj2251

#include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> #include<queue> using namespace std; int l,r,c; char m[31][31][31]; bool...

2018-05-22 18:24:57 137

原创 poj1321

题目链接 #include<iostream> #include<cstring> #include<stdlib.h> #include<algorithm> #include<cmath> using namespace std; int n,k,ans; char m[9][9]; bool c[9]; //int dx[4]...

2018-05-22 17:06:12 405

原创 hdu2553

Hdu2553 #include&lt;iostream&gt; #include&lt;stdlib.h&gt; #include&lt;cstring&gt; #include&lt;math.h&gt; #include&lt;algorithm&gt; using namespace std; bool c[11],r[11],le[20]

2018-05-22 10:05:38 297

原创 POJ1979

题目链接 #include <iostream> #include<stdlib.h> #include<string.h> using namespace std; char m[21][21];//map bool book[21][21];//book int w,h; int sum;//answer int dx[4]={0,-1,0,1}; i...

2018-05-21 22:10:04 246

原创 POJ2013

题目链接字符串成对出现，故可以按照层数来区分是第几对。当为奇数时，n/2+1单独为一对需要特判 #include <iostream> using namespace std; int n; char name[16][28]; void work(int depth) { if((depth==n/2+1)) { if(n%2) ...

2018-05-21 20:52:22 269

原创 ubuntu 16.04 中部分软件无法联网的解决方法

solve : http://askubuntu.com/questions/339702/network-service-discovery-disabled-what-does-this-mean-for-me/339709#339709sudo gedit /etc/default/avahi-daemon添加下面配置AVAHI_DAEMON_DETECT_LOCAL=0

2017-04-26 21:58:51 1610