zoukankan      html  css  js  c++  java
  • 看不下去的代码放这有机会用手机看。。。

    1.UVa 10010 Where's Waldorf? 
    from cnblogs's rollenholt
    #include<stdio.h>
    #include<string.h>
    #define maxn 57
    long test,m,n,k;
    char r[maxn][maxn];
    const long xd[]={-1,-1,0,1,1,1,0,-1},yd[]={0,1,1,1,0,-1,-1,-1};
    void search(const char *a,long&x,long &y)
    {
        longpos,xx,yy;
        for(longi=1;i<=m;i++)
        for(longj=1;j<=n;j++)
          if(r[i][j]==a[0])
          {
             for(longt=0;t<8;t++)
             {
                pos=0;xx=i;yy=j;
                while(a[pos]&&a[pos]==r[xx][yy])
                {xx+=xd[t];yy+=yd[t];pos++;}
                if(a[pos]==0)
                {x=i;y=j;return;}
             }
          }
    }
    int main()
    {
        scanf("%ld",&test);
        for(longcas=1;cas<=test;cas++)
        {
           longx,y;
           charword[maxn];
           if(cas>=2)printf("\n");
           memset(r,0,sizeof(r));
           scanf("%ld%ld",&m,&n);
           for(longi=1;i<=m;i++)
           {
              getchar();
              for(longj=1;j<=n;j++)
              {
                 scanf("%c",&r[i][j]);
                 if(r[i][j]>='a'&&r[i][j]<='z') r[i][j]+='A'-'a';
              }
           }
           scanf("%ld",&k);
           for(longi=1;i<=k;i++)
           {
              scanf("%s",word);
              longj=0;
              while(word[j])
              {
                 if(word[j]>='a'&&word[j]<='z') word[j]+='A'-'a';
                 j++;
              }
              search(word,x,y);
              printf("%ld %ld\n",x,y);
           }
        }
    return 0;
    }





  • 相关阅读:
    TOYS POJ
    口罩发放
    Qin Shi Huang's National Road System HDU
    次小生成树
    ACM Contest and Blackout UVA
    Strongly connected HDU
    tarjan
    Network HDU
    【洛谷 1351】联合权值
    【洛谷 3884】二叉树问题
  • 原文地址:https://www.cnblogs.com/java20130723/p/3212201.html
Copyright © 2011-2022 走看看