搜索入门

最新推荐文章于 2017-08-14 00:03:54 发布

小哧

最新推荐文章于 2017-08-14 00:03:54 发布

阅读量577

点赞数 1

分类专栏： acm水题文章标签：搜索

本文链接：https://blog.csdn.net/JayWRZZ/article/details/60469750

版权

acm水题专栏收录该内容

19 篇文章 0 订阅

订阅专栏

搜索入门简单题:

(┬＿┬)

搜索入门简单题

[hdu 1239]

#include<cstdio>
#include<iostream>
//我。。。拿python打了个质数的表。。。。然后暴力。。。。
using namespace std;
int biao[1230] = {2 ,3 ,5 ,7 ,11 ,13 ,17 ,19 ,23 ,29 ,31 ,37 ,41 ,43 ,47 ,53 ,59 ,61 ,67 ,71 ,73 ,79 ,83 ,89 ,97 ,101 ,103 ,107 ,109 ,113 ,127 ,131 ,137 ,139 ,149 ,151 ,157 ,163 ,167 ,173 ,179 ,181 ,191 ,193 ,197 ,199 ,211 ,223 ,227 ,229 ,233 ,239 ,241 ,251 ,257 ,263 ,269 ,271 ,277 ,281 ,283 ,293 ,307 ,311 ,313 ,317 ,331 ,337 ,347 ,349 ,353 ,359 ,367 ,373 ,379 ,383 ,389 ,397 ,401 ,409 ,419 ,421 ,431 ,433 ,439 ,443 ,449 ,457 ,461 ,463 ,467 ,479 ,487 ,491 ,499 ,503 ,509 ,521 ,523 ,541 ,547 ,557 ,563 ,569 ,571 ,577 ,587 ,593 ,599 ,601 ,607 ,613 ,617 ,619 ,631 ,641 ,643 ,647 ,653 ,659 ,661 ,673 ,677 ,683 ,691 ,701 ,709 ,719 ,727 ,733 ,739 ,743 ,751 ,757 ,761 ,769 ,773 ,787 ,797 ,809 ,811 ,821 ,823 ,827 ,829 ,839 ,853 ,857 ,859 ,863 ,877 ,881 ,883 ,887 ,907 ,911 ,919 ,929 ,937 ,941 ,947 ,953 ,967 ,971 ,977 ,983 ,991 ,997 ,1009 ,1013 ,1019 ,1021 ,1031 ,1033 ,1039 ,1049 ,1051 ,1061 ,1063 ,1069 ,1087 ,1091 ,1093 ,1097 ,1103 ,1109 ,1117 ,1123 ,1129 ,1151 ,1153 ,1163 ,1171 ,1181 ,1187 ,1193 ,1201 ,1213 ,1217 ,1223 ,1229 ,1231 ,1237 ,1249 ,1259 ,1277 ,1279 ,1283 ,1289 ,1291 ,1297 ,1301 ,1303 ,1307 ,1319 ,1321 ,1327 ,1361 ,1367 ,1373 ,1381 ,1399 ,1409 ,1423 ,1427 ,1429 ,1433 ,1439 ,1447 ,1451 ,1453 ,1459 ,1471 ,1481 ,1483 ,1487 ,1489 ,1493 ,1499 ,1511 ,1523 ,1531 ,1543 ,1549 ,1553 ,1559 ,1567 ,1571 ,1579 ,1583 ,1597 ,1601 ,1607 ,1609 ,1613 ,1619 ,1621 ,1627 ,1637 ,1657 ,1663 ,1667 ,1669 ,1693 ,1697 ,1699 ,1709 ,1721 ,1723 ,1733 ,1741 ,1747 ,1753 ,1759 ,1777 ,1783 ,1787 ,1789 ,1801 ,1811 ,1823 ,1831 ,1847 ,1861 ,1867 ,1871 ,1873 ,1877 ,1879 ,1889 ,1901 ,1907 ,1913 ,1931 ,1933 ,1949 ,1951 ,1973 ,1979 ,1987 ,1993 ,1997 ,1999 ,2003 ,2011 ,2017 ,2027 ,2029 ,2039 ,2053 ,2063 ,2069 ,2081 ,2083 ,2087 ,2089 ,2099 ,2111 ,2113 ,2129 ,2131 ,2137 ,2141 ,2143 ,2153 ,2161 ,2179 ,2203 ,2207 ,2213 ,2221 ,2237 ,2239 ,2243 ,2251 ,2267 ,2269 ,2273 ,2281 ,2287 ,2293 ,2297 ,2309 ,2311 ,2333 ,2339 ,2341 ,2347 ,2351 ,2357 ,2371 ,2377 ,2381 ,2383 ,2389 ,2393 ,2399 ,2411 ,2417 ,2423 ,2437 ,2441 ,2447 ,2459 ,2467 ,2473 ,2477 ,2503 ,2521 ,2531 ,2539 ,2543 ,2549 ,2551 ,2557 ,2579 ,2591 ,2593 ,2609 ,2617 ,2621 ,2633 ,2647 ,2657 ,2659 ,2663 ,2671 ,2677 ,2683 ,2687 ,2689 ,2693 ,2699 ,2707 ,2711 ,2713 ,2719 ,2729 ,2731 ,2741 ,2749 ,2753 ,2767 ,2777 ,2789 ,2791 ,2797 ,2801 ,2803 ,2819 ,2833 ,2837 ,2843 ,2851 ,2857 ,2861 ,2879 ,2887 ,2897 ,2903 ,2909 ,2917 ,2927 ,2939 ,2953 ,2957 ,2963 ,2969 ,2971 ,2999 ,3001 ,3011 ,3019 ,3023 ,3037 ,3041 ,3049 ,3061 ,3067 ,3079 ,3083 ,3089 ,3109 ,3119 ,3121 ,3137 ,3163 ,3167 ,3169 ,3181 ,3187 ,3191 ,3203 ,3209 ,3217 ,3221 ,3229 ,3251 ,3253 ,3257 ,3259 ,3271 ,3299 ,3301 ,3307 ,3313 ,3319 ,3323 ,3329 ,3331 ,3343 ,3347 ,3359 ,3361 ,3371 ,3373 ,3389 ,3391 ,3407 ,3413 ,3433 ,3449 ,3457 ,3461 ,3463 ,3467 ,3469 ,3491 ,3499 ,3511 ,3517 ,3527 ,3529 ,3533 ,3539 ,3541 ,3547 ,3557 ,3559 ,3571 ,3581 ,3583 ,3593 ,3607 ,3613 ,3617 ,3623 ,3631 ,3637 ,3643 ,3659 ,3671 ,3673 ,3677 ,3691 ,3697 ,3701 ,3709 ,3719 ,3727 ,3733 ,3739 ,3761 ,3767 ,3769 ,3779 ,3793 ,3797 ,3803 ,3821 ,3823 ,3833 ,3847 ,3851 ,3853 ,3863 ,3877 ,3881 ,3889 ,3907 ,3911 ,3917 ,3919 ,3923 ,3929 ,3931 ,3943 ,3947 ,3967 ,3989 ,4001 ,4003 ,4007 ,4013 ,4019 ,4021 ,4027 ,4049 ,4051 ,4057 ,4073 ,4079 ,4091 ,4093 ,4099 ,4111 ,4127 ,4129 ,4133 ,4139 ,4153 ,4157 ,4159 ,4177 ,4201 ,4211 ,4217 ,4219 ,4229 ,4231 ,4241 ,4243 ,4253 ,4259 ,4261 ,4271 ,4273 ,4283 ,4289 ,4297 ,4327 ,4337 ,4339 ,4349 ,4357 ,4363 ,4373 ,4391 ,4397 ,4409 ,4421 ,4423 ,4441 ,4447 ,4451 ,4457 ,4463 ,4481 ,4483 ,4493 ,4507 ,4513 ,4517 ,4519 ,4523 ,4547 ,4549 ,4561 ,4567 ,4583 ,4591 ,4597 ,4603 ,4621 ,4637 ,4639 ,4643 ,4649 ,4651 ,4657 ,4663 ,4673 ,4679 ,4691 ,4703 ,4721 ,4723 ,4729 ,4733 ,4751 ,4759 ,4783 ,4787 ,4789 ,4793 ,4799 ,4801 ,4813 ,4817 ,4831 ,4861 ,4871 ,4877 ,4889 ,4903 ,4909 ,4919 ,4931 ,4933 ,4937 ,4943 ,4951 ,4957 ,4967 ,4969 ,4973 ,4987 ,4993 ,4999 ,5003 ,5009 ,5011 ,5021 ,5023 ,5039 ,5051 ,5059 ,5077 ,5081 ,5087 ,5099 ,5101 ,5107 ,5113 ,5119 ,5147 ,5153 ,5167 ,5171 ,5179 ,5189 ,5197 ,5209 ,5227 ,5231 ,5233 ,5237 ,5261 ,5273 ,5279 ,5281 ,5297 ,5303 ,5309 ,5323 ,5333 ,5347 ,5351 ,5381 ,5387 ,5393 ,5399 ,5407 ,5413 ,5417 ,5419 ,5431 ,5437 ,5441 ,5443 ,5449 ,5471 ,5477 ,5479 ,5483 ,5501 ,5503 ,5507 ,5519 ,5521 ,5527 ,5531 ,5557 ,5563 ,5569 ,5573 ,5581 ,5591 ,5623 ,5639 ,5641 ,5647 ,5651 ,5653 ,5657 ,5659 ,5669 ,5683 ,5689 ,5693 ,5701 ,5711 ,5717 ,5737 ,5741 ,5743 ,5749 ,5779 ,5783 ,5791 ,5801 ,5807 ,5813 ,5821 ,5827 ,5839 ,5843 ,5849 ,5851 ,5857 ,5861 ,5867 ,5869 ,5879 ,5881 ,5897 ,5903 ,5923 ,5927 ,5939 ,5953 ,5981 ,5987 ,6007 ,6011 ,6029 ,6037 ,6043 ,6047 ,6053 ,6067 ,6073 ,6079 ,6089 ,6091 ,6101 ,6113 ,6121 ,6131 ,6133 ,6143 ,6151 ,6163 ,6173 ,6197 ,6199 ,6203 ,6211 ,6217 ,6221 ,6229 ,6247 ,6257 ,6263 ,6269 ,6271 ,6277 ,6287 ,6299 ,6301 ,6311 ,6317 ,6323 ,6329 ,6337 ,6343 ,6353 ,6359 ,6361 ,6367 ,6373 ,6379 ,6389 ,6397 ,6421 ,6427 ,6449 ,6451 ,6469 ,6473 ,6481 ,6491 ,6521 ,6529 ,6547 ,6551 ,6553 ,6563 ,6569 ,6571 ,6577 ,6581 ,6599 ,6607 ,6619 ,6637 ,6653 ,6659 ,6661 ,6673 ,6679 ,6689 ,6691 ,6701 ,6703 ,6709 ,6719 ,6733 ,6737 ,6761 ,6763 ,6779 ,6781 ,6791 ,6793 ,6803 ,6823 ,6827 ,6829 ,6833 ,6841 ,6857 ,6863 ,6869 ,6871 ,6883 ,6899 ,6907 ,6911 ,6917 ,6947 ,6949 ,6959 ,6961 ,6967 ,6971 ,6977 ,6983 ,6991 ,6997 ,7001 ,7013 ,7019 ,7027 ,7039 ,7043 ,7057 ,7069 ,7079 ,7103 ,7109 ,7121 ,7127 ,7129 ,7151 ,7159 ,7177 ,7187 ,7193 ,7207 ,7211 ,7213 ,7219 ,7229 ,7237 ,7243 ,7247 ,7253 ,7283 ,7297 ,7307 ,7309 ,7321 ,7331 ,7333 ,7349 ,7351 ,7369 ,7393 ,7411 ,7417 ,7433 ,7451 ,7457 ,7459 ,7477 ,7481 ,7487 ,7489 ,7499 ,7507 ,7517 ,7523 ,7529 ,7537 ,7541 ,7547 ,7549 ,7559 ,7561 ,7573 ,7577 ,7583 ,7589 ,7591 ,7603 ,7607 ,7621 ,7639 ,7643 ,7649 ,7669 ,7673 ,7681 ,7687 ,7691 ,7699 ,7703 ,7717 ,7723 ,7727 ,7741 ,7753 ,7757 ,7759 ,7789 ,7793 ,7817 ,7823 ,7829 ,7841 ,7853 ,7867 ,7873 ,7877 ,7879 ,7883 ,7901 ,7907 ,7919 ,7927 ,7933 ,7937 ,7949 ,7951 ,7963 ,7993 ,8009 ,8011 ,8017 ,8039 ,8053 ,8059 ,8069 ,8081 ,8087 ,8089 ,8093 ,8101 ,8111 ,8117 ,8123 ,8147 ,8161 ,8167 ,8171 ,8179 ,8191 ,8209 ,8219 ,8221 ,8231 ,8233 ,8237 ,8243 ,8263 ,8269 ,8273 ,8287 ,8291 ,8293 ,8297 ,8311 ,8317 ,8329 ,8353 ,8363 ,8369 ,8377 ,8387 ,8389 ,8419 ,8423 ,8429 ,8431 ,8443 ,8447 ,8461 ,8467 ,8501 ,8513 ,8521 ,8527 ,8537 ,8539 ,8543 ,8563 ,8573 ,8581 ,8597 ,8599 ,8609 ,8623 ,8627 ,8629 ,8641 ,8647 ,8663 ,8669 ,8677 ,8681 ,8689 ,8693 ,8699 ,8707 ,8713 ,8719 ,8731 ,8737 ,8741 ,8747 ,8753 ,8761 ,8779 ,8783 ,8803 ,8807 ,8819 ,8821 ,8831 ,8837 ,8839 ,8849 ,8861 ,8863 ,8867 ,8887 ,8893 ,8923 ,8929 ,8933 ,8941 ,8951 ,8963 ,8969 ,8971 ,8999 ,9001 ,9007 ,9011 ,9013 ,9029 ,9041 ,9043 ,9049 ,9059 ,9067 ,9091 ,9103 ,9109 ,9127 ,9133 ,9137 ,9151 ,9157 ,9161 ,9173 ,9181 ,9187 ,9199 ,9203 ,9209 ,9221 ,9227 ,9239 ,9241 ,9257 ,9277 ,9281 ,9283 ,9293 ,9311 ,9319 ,9323 ,9337 ,9341 ,9343 ,9349 ,9371 ,9377 ,9391 ,9397 ,9403 ,9413 ,9419 ,9421 ,9431 ,9433 ,9437 ,9439 ,9461 ,9463 ,9467 ,9473 ,9479 ,9491 ,9497 ,9511 ,9521 ,9533 ,9539 ,9547 ,9551 ,9587 ,9601 ,9613 ,9619 ,9623 ,9629 ,9631 ,9643 ,9649 ,9661 ,9677 ,9679 ,9689 ,9697 ,9719 ,9721 ,9733 ,9739 ,9743 ,9749 ,9767 ,9769 ,9781 ,9787 ,9791 ,9803 ,9811 ,9817 ,9829 ,9833 ,9839 ,9851 ,9857 ,9859 ,9871 ,9883 ,9887 ,9901 ,9907 ,9923 ,9929 ,9931 ,9941 ,9949 ,9967 ,9973};
int main(){
    int m,a,b;
    double chu1,chu2;
    int height,width;
    while(~scanf("%d%d%d",&m,&a,&b) && (m || a || b)){
        height = 0;
        width = 0;
        double chu1 = (double)a/b;
        int area = 0;
        int i,j;
        for(i = 0; i < 1229; i++)
        for(j = i; j <1229; j++){
            if(biao[i]*biao[j] <= m ){
                if((double)biao[i]/biao[j] >= chu1){
                    if(biao[i]*biao[j] > area){
                        width = i;
                        height = j;
                        area = biao[i]*biao[j];
                    }
                }
                else continue;
            }
            else break;
        }
        printf("%d %d\n",biao[width],biao[height]);
    }
    return 0;
}

[hdu 1010]

//dfs + 剪枝；mmp✿⊙﹏⊙
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>

using namespace std;
char tu[9][9];
bool vis[9][9];
bool OK;
int N,M,T;
void dfs(int, int, int);
int stx,sty,edx,edy;

int main(){
    while(~scanf("%d%d%d",&N,&M,&T) && (N || M || T)){
        int lens = 0;
        int nums = 0;
        memset(vis, 0, sizeof (vis));
        OK = 0;
        for (int i = 0; i < N; i++){
            scanf("%s",tu[i]);
            for (int j = 0; j < M; j++){
                if(tu[i][j] == 'S'){stx = i; sty = j;}
                else if(tu[i][j] == 'D'){edx = i; edy = j;}
                else if(tu[i][j] == 'X'){vis[i][j]=1;nums++;}
            }
        }
        if ((stx + sty)%2 != (edx + edy + T)%2);
        else if (M*N-nums <= T);
        else dfs(stx, sty, lens);
        if(OK) cout << "YES" << endl;
        else cout << "NO" << endl;
    }

    return 0;
}
void dfs(int x, int y, int lens){
    if (OK) return;
    if (x < 0 || x >= N || y < 0 || y >= M) return ;
    if (abs(edx+edy-x-y) > T) return;
    if (tu[x][y] == 'D'){
        if(lens == T)OK = 1;
        return;
    }
    if (vis[x][y]) return ;
    if (lens >= T) return;
    vis[x][y] = 1;
    dfs(x-1, y, lens+1);
    dfs(x+1, y, lens+1);
    dfs(x, y-1, lens+1);
    dfs(x, y+1, lens+1);
    vis[x][y] = 0;
}

[hdu 1015 Safecracker]

#include<cstdio>
#include<iostream>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstring>
#define res(a,b,c,d,e) a-b*b+c*c*c-d*d*d*d+e*e*e*e*e
using namespace std;
long flag[100],b[100],f[6];

bool cmp(int a,int b){
    return a>b;
}

bool dfs(int step, int len, long n){
    if(step == 5){
        if(res(f[0],f[1],f[2],f[3],f[4]) == n){
            //cout << f[0] << ":" << res(f[0],f[1],f[2],f[3],f[4]) << endl;
            return 1;
            }
        return 0;
    }
    for(int i = 0; i < len; i++){
        if(flag[i]) continue;
        flag[i] = 1;
        f[step] = b[i];
        if(dfs(step+1, len, n))
            return 1;
        flag[i] = 0;
    }
    return 0;
}

void init(){
    memset(flag, 0, sizeof flag);
    memset(b, 0, sizeof b);
    memset(f, 0, sizeof f);
}

int main(){
    string a;
    long target;
    while(cin >> target >> a &&(target || a[0] != 'E' || a[1] != 'N')){
        init();
        for(int i = 0; i < a.length(); i++)
        b[i] = a[i] - 'A' + 1;
        sort(b, b+a.length(), cmp);
        //cout << b[a.length() - 1];
        if(dfs(0, a.length(), target)){
            for(int i = 0; i < 5; i ++)
                cout <<(char)(f[i] + 'A' -1);
        }
        else cout << "no solution";
        cout << endl;
    }
}

[hdu 1016 Prime Ring Problem]

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int flag[30],b[30],ans[30];

bool prime(int n){
    for(int i = 2; i < sqrt(n)+1; i++)
        if (n%i == 0){return 0;}
    return 1;
}

bool primeArray(int n){
    for(int i = 0; i < n; i++)
        if(!prime(ans[i%n] + ans[(i+1)%n]))
            return 0;
    return 1;
}

void dfs(int n, int step){
    //if(n%2 == 1)return ;
    if(step == n)
        if(primeArray(n)){
            for(int i = 0; i < n-1; i ++)
                cout << ans[i] << " ";
            cout << ans[n-1] <<endl;
        }
    for(int i = 1; i <= n; i++){
        if(flag[b[i]]) continue;
        if(!prime(b[i] + ans[step - 1]))
           continue;
        flag[b[i]] = 1;
        ans[step] = b[i];
        dfs(n, step+1);
        flag[i] = 0;
    }
}
void init(){
    memset(flag, 0, sizeof flag);
    memset(ans, 0, sizeof ans);
    for(int i = 0; i < 30; i ++)
        b[i] = i;
    ans[0] = 1;
    flag[1] = 1;
}
using namespace std;

int main(){
    int T = 0,n;
    while(cin >> n){
        printf("Case %d:\n",++T);
        init();
        dfs(n,1);
        cout << endl;
    }
    return 0;
}

[POj 2488A - A Knight’s Journey]

//简单搜索
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int n,m;
int visit[30][30];
int xx[30];
int yy[30];
int act[8][2]={{-2,-1},{-2,1},{2,-1},{2,1},{1,2},{1,-2},{-1,-2},{-1,2}};
int flag;

bool go(int x, int y){
    if( x>0 && y > 0 && x <= n && y <= m)
        return 1;
    return 0;

}
void dfs(int x, int y, int num){
    xx[num] = x;
    yy[num] = y;
    if(num == n*m){flag = 1;return;}
    for(int i = 0; i < 8; i++){
        int xxx = x + act[i][0];
        int yyy = y + act[i][1];
        if(!visit[xxx][yyy] && go(xxx, yyy)){
            visit[xxx][yyy] = 1;
            dfs(xxx, yyy, num+1);
            visit[xxx][yyy] = 0;
        }
    }
}

void init(){
    memset(visit, 0, sizeof(visit));
    memset(xx, 0, sizeof(xx));
    memset(yy, 0, sizeof(yy));
    flag = 0;
    visit[1][1] = 1;
}

void print(){
    for(int i = 1; i <= n*m; i++)
        cout <<(char)( xx[i] + 'A' - 1) << yy[i];
    cout << endl;
}

int main(){
    int T;
    cin >> T;
    int time = 1;
    while(T--){
        init();
        cin>> m >> n;//注意
        dfs(1,1,1);
        printf("Scenario #%d:\n",time++);
        if(flag) print();
        else printf("impossible\n");
        if(T) cout << endl;
    }
    return 0;
}

[POJ 3126 H - Prime Path]

//打表后bfs.....
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
int biao[]={1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973};
bool prime[11000]={0};
using namespace std;
int endn,startn;
bool vis[11000];

struct node{
    int value;
    int num;
};

int bfs(int a){
    if(a == endn)return 0;
    memset(vis, 0, sizeof(vis));
    queue<node> Q;
    vis[a] = 1;
    Q.push((node){a,0});

    while(!Q.empty()){
        node e = Q.front(); Q.pop();
        for(int i = 1; i <= 1000; i *= 10)for(int j = 0; j < 10; j++){
            if(i == 1000 && j == 0) continue;
            int t = e.value/i/10*i*10 + i * j + e.value%i  ;//只改变一位数
            if (t == endn) return e.num+1;
            if (prime[t]){
                if(!vis[t])Q.push((node){t, e.num + 1});
                vis[t] = 1;
            }
        }
    }
    return -1;
}

int main(){
    for(int i = 0; biao[i]; i++)
        prime[biao[i]] = 1;
    int T;
    cin >> T;
    while(T--){
        cin >> startn >> endn;
        int ans = bfs(startn);
        if(ans+1) cout << ans << endl;
        else cout << "Impossible" << endl;
    }
    return 0;
}

[hdu1035]

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>

using namespace std;

struct Node{
    char val;
    int pos;
    bool visit;
};

int n,m,p;
int final_step,medium;
Node mapo[20][20];
void dfs(int row, int col, int pos){
    if(mapo[row][col].visit == 1){
        medium = final_step - mapo[row][col].pos + 1;
        return;
    }
    if(row < 0 || col < 0 || row > n-1 || col > m-1)
        return;

    mapo[row][col].pos = pos;
    mapo[row][col].visit = 1;
    final_step = mapo[row][col].pos;

    if(mapo[row][col].val == 'N')
        dfs(row-1, col, pos+1);
    if(mapo[row][col].val == 'S')
        dfs(row+1, col, pos+1);
    if(mapo[row][col].val == 'W')
        dfs(row, col-1, pos+1);
    if(mapo[row][col].val == 'E')
        dfs(row, col+1, pos+1);
}
void init(){
    memset(mapo, 0, sizeof mapo);
    final_step = 0;
    medium = 0;
}
int main(){
    while(cin >> n >> m &&(n || m)){
        cin >> p;
        init();
        for(int i = 0 ; i < n; i++)for(int j = 0; j < m; j++){
            cin >> mapo[i][j].val;
        }
        mapo[0][p-1].pos = 0;
        dfs(0, p-1,1);
        if(medium)printf("%d step(s) before a loop of %d step(s)\n",final_step-medium, medium);
        else printf("%d step(s) to exit\n",final_step);
    }
    return 0;
}

[hdu 1045]

#include<cstdio>
#include<iostream>

using namespace std;

char n[5][5];
int maxn,T;

bool build(int row, int col){
    for(int i = row - 1; i >=0 ; i--){
        if(n[i][col] == 'X')break;
        if(n[i][col] == 'O')return false;
    }
    for(int i = col - 1; i >= 0; i--){
        if(n[row][i] == 'X')break;
        if(n[row][i] == 'O')return false;
    }
    return 1;
}

void dfs(int ge, int num){
    int row,col;
    if(ge == T*T){
        if(num > maxn) maxn = num;
        return;
    }
    row = ge/T;
    col = ge%T;
    if(n[row][col] == '.' && build(row, col)){
        n[row][col] = 'O';
        dfs(ge+1, num+1);
        n[row][col] = '.';
    }
    dfs(ge+1, num);
}

void init(){
    maxn = 0;
}

int main(){
    while(cin >> T && T){
        init();
        for(int i = 0; i < T; i++)
            cin >> n[i];
        dfs(0,0);
        cout << maxn << endl;
    }
    return 0;
}

[hdu 1172]

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int num[200],pos[200],rig[200];
int biao1[10];
int biao2[10];
int N,flag;
int endans;
void init(){
    memset(num, 0, sizeof num);
    memset(pos, 0, sizeof pos);
    memset(rig, 0, sizeof rig);
    flag = 0;
    endans = 0;
}

bool check(int ans, int n, int p, int r){
    memset(biao1, 0, sizeof biao1);
    memset(biao2, 0, sizeof biao2);
    int po =0 , ri = 0;
    if(ans/1000 == n / 1000)    ri++;
    if(ans/100%10 == n/100%10)  ri++;
    if(ans/10%10 == n/10%10)    ri++;
    if(ans%10 == n%10)          ri++;
    biao1[ans%10]++;
    biao1[ans/10%10]++;
    biao1[ans/100%10]++;
    biao1[ans/1000]++;
    biao2[n%10]++;
    biao2[n/10%10]++;
    biao2[n/100%10]++;
    biao2[n/1000]++;
    for(int i = 0; i < 10; i++){
        po += min(biao1[i], biao2[i]);
    }
    if(po == p && ri ==r)return 1;
    else return 0;
}

bool checkAll(int ans){
    for(int i = 0; i < N; i++){
        if(!check(ans, num[i], pos[i], rig[i]))return 0;
    }
    return 1;
}

int main(){
    while(cin >> N && N){
        init();
        for(int i = 0;i < N; i++)
            cin >> num[i] >> pos[i] >> rig[i];
        for(int i = 1000; i < 10000; i++){
            if(checkAll(i)){
                endans = i;
                flag++;
                if(flag > 1)break;
            }
        }
        if(flag == 1) cout << endans << endl;
        else cout << "Not sure" << endl;
    }
    return 0;
}

[hdu 1241]水题练速度

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int pock;
char mp[150][150];
int row, col;
void init(){
    memset(mp, 0 , sizeof mp);
    pock = 0;

}

void dfs(int i, int j){
    if(i < 0 || j < 0 || i >= row || j >= col)
        return ;
    if(mp[i][j] != '@')return ;
    mp[i][j] = 'O';
    dfs(i-1,j-1);
    dfs(i-1,j);
    dfs(i-1,j+1);
    dfs(i,j-1);
    dfs(i,j+1);
    dfs(i+1,j-1);
    dfs(i+1,j+1);
    dfs(i+1,j);
}

int main(){
    while(cin >> row >> col &&(row || col)){
        init();
        for(int i = 0 ;i < row; i++){
            cin >> mp[i];
        }
        for(int i = 0; i < row; i++)for(int j = 0; j < col; j++)
        if(mp[i][j] == '@'){dfs(i,j);pock++;}
        cout << pock << endl;
    }
    return 0;
}

[第一道dfs+dp hdu1078]

//到达每一个地方并记录到达此地最大的奶酪值
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#define CLR(a,b) memset(a, b, sizeof a)
using namespace std;

int row,k;
int mp[150][150];
int dp[150][150];
int dir[4][2] = {{-1,0},{1,0},{0,-1},{0,1}};
void init(){
    CLR(mp,0);
    CLR(dp,-1);
}

int dfs(int n, int m){
    if(dp[n][m] + 1)
        return dp[n][m];
    int x,y,maxn=0;
    for(int i = 1; i <= k; i++){
        for(int j = 0; j < 4; j++){
            x = n + i*dir[j][0];
            y = m + i*dir[j][1];
            if((x >= 0 && y >= 0 && x < row && y < row)
               &&(mp[x][y] > mp[n][m]))
                maxn = max(maxn, dfs(x,y));
        }
    }
    return dp[n][m] = mp[n][m] + maxn;
}

int main(){
    while(cin >> row >> k && (row+1||k+1 )){
        init();
        for(int i = 0; i < row; i++)for(int j = 0; j < row; j++)
            cin >> mp[i][j];
        cout << dfs(0,0) << endl;
    }
    return 0;
}

小哧

关注

1
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
搜索入门

搜索入门简单题:(┬＿┬)搜索入门简单题hdu 1239hdu 1010hdu 1015 Safecrackerhdu 1016 Prime Ring ProblemPOj 2488A - A Knights JourneyPOJ 3126 H - Prime Pathhdu1035hdu 1045hdu 1172hdu 1241水题练速度第一道dfsdp hdu1078
复制链接

扫一扫

专栏目录