青草国产精品久久久久久,久久影院午夜理论片无码 ,99国内精品久久久久久久

POJ1915 Knight Moves

Wed, 06 Feb 2013 12:18:00 GMT

题目链接�Q�http://poj.org/problem?id=1915
又是喜闻乐见的骑士遍历，听说双向�q�搜可以提升效率�Q�但是双向广搜不会啊二Ӏ��?br />

view code

��雨�?/a> 2013-02-06 20:18 发表评论

POJ3126 Prime Path

Sat, 02 Feb 2013 21:02:00 GMT

题目�q�接�Q�http://poj.org/problem?id=3126
枚�D每一位，看是不是素数�Q�我的判断方法是打表判断�Q�然后把�W�合条�g的新数加入到队列中以便下�ơ搜索，��单的�q�搜题，��是我捉急的犯了一个低�U�错误�?br />

view code
1 #include
2 #include
3 #include
4 #include
5 #include
6 #include
7 #include
8 using namespace std;
9 int map[10010], n, k, f, g, h, b, a[10010];
10 queue<int> Q;
11 void prime(){
12     memset(a, -1, sizeof(a));
13     a[0] = a[1] = 0;
14     for (int i = 2; i <= 100; i++)
15       for (int j = i * i; j <= 10000; j += i)
16         a[j] = 0;
17 }
18 int fun(int a, int b, int c, int d){
19     return a * 1000 + b * 100 + c * 10 + d;
20 }
21 void init(int n){
22     f = n % 10;
23     g = n / 10 % 10;
24     h = n / 100 % 10;
25     b = n / 1000;
26 }
27 void bfs(){
28     map[n] = 0;
29     Q.push(n);
30     while (!Q.empty()){
31         int x = Q.front();
32         init(x);
33         Q.pop();
34         for (int i = 1; i < 10; i += 2){
35             int xx = fun(b, h, g, i);
36             if (a[xx] == 0) continue;
37             if (map[xx] == -1 || map[x] + 1 < map[xx]){
38                 map[xx] = map[x] + 1;
39                 Q.push(xx);
40             }
41         }
42         for (int i = 0; i < 10; i += 1){
43             int xx = fun(b, h, i, f);
44             if (a[xx] == 0) continue;
45             if (map[xx] == -1 || map[x] + 1 < map[xx]){
46                 map[xx] = map[x] + 1;
47                 Q.push(xx);
48             }
49         }
50         for (int i = 0; i < 10; i += 1){
51             int xx = fun(b, i, g, f);
52             if (a[xx] == 0) continue;
53             if (map[xx] == -1 || map[x] + 1 < map[xx]){
54                 map[xx] = map[x] + 1;
55                 Q.push(xx);
56             }
57         }
58         for (int i = 1; i < 10; i += 1){
59             int xx = fun(i, h, g, f);
60             if (a[xx] == 0) continue;
61             if (map[xx] == -1 || map[x] + 1 < map[xx]){
62                 map[xx] = map[x] + 1;
63                 Q.push(xx);
64             }
65         }
66     }
67 }
68 int main(){
69     int t;
70     prime();
71     while (~scanf("%d", &t)){
72         while (t--){
73             scanf("%d%d", &n, &k);
74             memset(map, -1, sizeof(map));
75             bfs();
76             printf("%d\n", map[k]);
77         }
78     }
79     return 0;
80 }
81

��雨�?/a> 2013-02-03 05:02 发表评论

POJ2243 Knight Moves

Wed, 30 Jan 2013 08:18:00 GMT

题目链接�Q?a style="color: #6a3906; text-decoration: none; ">http://poj.org/problem?id=2243

骑士遍历�q�阶�?br />

view code

��雨�?/a> 2013-01-30 16:18 发表评论

POJ2251 Dungeon Master

Wed, 30 Jan 2013 07:19:00 GMT

题目链接�Q?a style="color: #6a3906; text-decoration: none; ">http://poj.org/problem?id=2251

我能说我一上来��p��题目描述吓到了，然后又被题意吓到了么�Q?/p>

其实它的本质是一道不折不扣的水题�Q�常规的三维�I�间�q�搜�Q�写着写着��出来了�Q�中间因��坐标问题�l�蒙圈了写了很多错误�Q�但是最后拐回来了，�I�间惌��力是个伤啊。�?br />

view code

��雨�?/a> 2013-01-30 15:19 发表评论

POJ3278 Catch That Cow

Mon, 21 Jan 2013 19:00:00 GMT

题目链接�Q?a style="color: #6a3906; text-decoration: initial;">http://poj.org/problem?id=3278

我会说这是我人生中第一道广搜题么？�Q?br />

view code

��雨�?/a> 2013-01-22 03:00 发表评论