C++博客-Naeioi-随笔分类-题解http://www.cppblog.com/Naeioi/category/15384.html量子の風zh-cnMon, 15 Nov 2010 13:52:33 GMTMon, 15 Nov 2010 13:52:33 GMT60UVa 10115http://www.cppblog.com/Naeioi/archive/2010/11/12/133463.htmlNaeioi ZhuNaeioi ZhuFri, 12 Nov 2010 13:46:00 GMThttp://www.cppblog.com/Naeioi/archive/2010/11/12/133463.htmlhttp://www.cppblog.com/Naeioi/comments/133463.htmlhttp://www.cppblog.com/Naeioi/archive/2010/11/12/133463.html#Feedback0http://www.cppblog.com/Naeioi/comments/commentRss/133463.htmlhttp://www.cppblog.com/Naeioi/services/trackbacks/133463.html原题在这里.小心指针!!!
#include <cstdio> 
#include <string.h>
using namespace std;


const int maxn=15,maxl=300;


char key[2][maxn][maxl],str[maxl];


int l[maxn],N;




bool match(char *s,char *k)


{


    while (*k)


    {


        if (*s!=*k)


            return false;


        ++s;


        ++k;


    }


    return true;


}




void replace(int cur,int i)


{


    char tmp[maxl]= {0};


    memcpy(tmp,str,cur);


    strcat(tmp,key[1][i]);


    strcat(tmp,str+cur+l[i]);


    memcpy(str,tmp,sizeof(str));


}




int main()


{


#ifndef ONLINE_JUDGE


    freopen("10115.in","r",stdin);


    freopen("10115.out","w",stdout);


#endif




    while (scanf("%d",&N)&&N!=0)


    {


        memset(str,0,sizeof(str));


        getchar();


        for (int i=0; i<N; i++)


        {


            gets(key[0][i]);


            gets(key[1][i]);


            l[i]=strlen(key[0][i]);


        }


        gets(str);


        for (int i=0; i<N; i++)


            for (int j=0; str[j+l[i]-1]; j++)


                if (match(str+j,key[0][i]))


                {


                    replace(j,i);


                    j=0;


                }


        puts(str);


    }




    fclose(stdin);


    fclose(stdout);


    return 0;


}


Naeioi Zhu 2010-11-12 21:46 发表评论
]]>UVa 644http://www.cppblog.com/Naeioi/archive/2010/11/12/133459.htmlNaeioi ZhuNaeioi ZhuFri, 12 Nov 2010 12:32:00 GMThttp://www.cppblog.com/Naeioi/archive/2010/11/12/133459.htmlhttp://www.cppblog.com/Naeioi/comments/133459.htmlhttp://www.cppblog.com/Naeioi/archive/2010/11/12/133459.html#Feedback0http://www.cppblog.com/Naeioi/comments/commentRss/133459.htmlhttp://www.cppblog.com/Naeioi/services/trackbacks/133459.html#include <cstdio>

#include <string.h>


using namespace std;




const int maxn=20;


char a[maxn][maxn],tmp[maxn];


int tot=-1,count=0;




int main()


{


#ifndef ONLINE_JUDGE


    freopen("644.in","r",stdin);


    freopen("644.out","w",stdout);


#endif






    while (scanf("%s",a[++tot])==1)


    {


        if (a[tot][0]!='9')continue;


        bool is=true;


        --tot;


        for (int i=0; i<=tot&&is; i++)


            for (int j=0; j<=tot&&is; j++)


                if (i!=j&&strlen(a[j])>=strlen(a[i]))


                {


                    sprintf(tmp,"%.*s",strlen(a[i]),a[j]);


                    if (strcmp(tmp,a[i])==0)


                        is=false;


                }


        printf("Set %d is ",++count);


        if (is)


            printf("immediately decodable\n");


        else printf("not immediately decodable\n");


        tot=-1;


    }




    fclose(stdin);


    fclose(stdout);


    return 0;


}




Naeioi Zhu 2010-11-12 20:32 发表评论
]]>UVa 10815http://www.cppblog.com/Naeioi/archive/2010/11/12/133452.htmlNaeioi ZhuNaeioi ZhuFri, 12 Nov 2010 11:13:00 GMThttp://www.cppblog.com/Naeioi/archive/2010/11/12/133452.htmlhttp://www.cppblog.com/Naeioi/comments/133452.htmlhttp://www.cppblog.com/Naeioi/archive/2010/11/12/133452.html#Feedback0http://www.cppblog.com/Naeioi/comments/commentRss/133452.htmlhttp://www.cppblog.com/Naeioi/services/trackbacks/133452.html原题在这里。代码写的比较乱


#include <cstdio>

#include <string.h>


#include <ctype.h>


#include <stdlib.h>


using namespace std;




const int maxn=5005,maxl=205;


int tot=0;


char word[maxn][maxl],now[maxl];




bool find(void)


{


    for (int i=0; i<tot; i++)


        if (!strcmp(now,word[i]))


            return true;


    return false;


}




int cmp(const void *a,const void *b)


{


    return strcmp((char*)a,(char*)b);


}




int main()


{


#ifndef ONLINE_JUDGE


    freopen("10815.in","r",stdin);


    freopen("10815.out","w",stdout);


#endif




    for (;;)


    {


        do


        {


            *now=getchar();


        }


        while (!isalpha(*now)&&*now!=EOF);


        now[1]=0;


        if (scanf("%[qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM]",now+1)==EOF)


            break;


        for (int i=0; now[i]; i++)


            now[i]=tolower(now[i]);


        if (!find())


            memcpy(word[tot++],now,sizeof(now));


    }




    qsort(word,tot,sizeof(word[0]),cmp);




    for (int i=0; i<tot; i++)


        printf("%s\n",word[i]);




    fclose(stdin);


    fclose(stdout);


    return 0;


}




Naeioi Zhu 2010-11-12 19:13 发表评论
]]>Uva 409http://www.cppblog.com/Naeioi/archive/2010/11/11/133346.htmlNaeioi ZhuNaeioi ZhuThu, 11 Nov 2010 11:19:00 GMThttp://www.cppblog.com/Naeioi/archive/2010/11/11/133346.htmlhttp://www.cppblog.com/Naeioi/comments/133346.htmlhttp://www.cppblog.com/Naeioi/archive/2010/11/11/133346.html#Feedback0http://www.cppblog.com/Naeioi/comments/commentRss/133346.htmlhttp://www.cppblog.com/Naeioi/services/trackbacks/133346.html原题在这里。字符串匹配，写起来稍稍有些繁琐

 1 #include <cstdio>
 2 #include <string.h>
 3 #include <ctype.h>
 4 #include <vector>
 5 using namespace std;
 6 
 7 const int maxk=100,maxl=100;
 8 char key[maxk][maxl],str[maxl],str2[maxl],ans[maxk][maxl];
 9 int K,E,n=0,Max,l;
10 
11 bool find(int x,int y)
12 {
13     for(int i=0;i<K;i++){
14         int j;
15         for(j=0;x+j<=y&&key[i][j];j++)
16             if(str[x+j]!=key[i][j])
17                 break;
18         if(x+j>y&&!key[i][j])
19             return true;
20     }
21     return false;
22 }
23 
24 int main()
25 {
26     #ifndef ONLINE_JUDGE
27     freopen("409.in","r",stdin);
28     freopen("409.out","w",stdout);
29     #endif
30 
31     while(scanf("%d%d",&K,&E)==2){
32         l=Max=0;
33         printf("Excuse Set #%d\\n",++n);
34         getchar();
35 
36         for(int i=0;i<K;i++)
37             gets(key[i]);
38         for(int i=0;i<E;i++){
39             scanf("%[^\\r\\n]",str);
40             memcpy(str2,str,sizeof(str));
41             getchar();
42             int a=0,b,count=0;
43             while(str[a]){
44                 while(!isalpha(str[a])&&str[a])++a;
45                 b=a;
46                 while(isalpha(str[b])){str[b]=tolower(str[b]);++b;}
47                 if(find(a,b-1))count++;
48                 a=b;
49             }
50             if(count>Max){
51                 Max=count;
52                 memset(ans,0,sizeof(ans));
53                 l=1;
54                 memcpy(ans[l-1],str2,sizeof(str));
55             }
56             else if(count==Max)
57                     memcpy(ans[l++],str2,sizeof(str));
58         }
59         for(int i=0;i<l;i++)
60             printf("%s\\n",ans[i]);
61         printf("\\n");
62     }
63 
64     fclose(stdin);
65     fclose(stdout);
66     return 0;
67 }
68 


Naeioi Zhu 2010-11-11 19:19 发表评论
]]>UVa 537http://www.cppblog.com/Naeioi/archive/2010/11/10/133228.htmlNaeioi ZhuNaeioi ZhuWed, 10 Nov 2010 11:08:00 GMThttp://www.cppblog.com/Naeioi/archive/2010/11/10/133228.htmlhttp://www.cppblog.com/Naeioi/comments/133228.htmlhttp://www.cppblog.com/Naeioi/archive/2010/11/10/133228.html#Feedback0http://www.cppblog.com/Naeioi/comments/commentRss/133228.htmlhttp://www.cppblog.com/Naeioi/services/trackbacks/133228.html 1 #include <cstdio>
 2 using namespace std;
 3 
 4 int N;
 5 double a[260];
 6 
 7 int main()
 8 {
 9     #ifndef ONLINE_JUDGE
10     freopen("537.in","r",stdin);
11     freopen("537.out","w",stdout);
12     #endif
13 
14     scanf("%d",&N);
15     getchar();
16 
17     for(int i=1;i<=N;i++){
18         a['U']=a['I']=a['P']=0.0;
19         for(int j=0;j<=1;j++){
20             char last=getchar(),now;
21             while((now=getchar())!='=')last=now;
22             scanf("%lf%c",&a[last],&now);
23             switch(now){
24                 case 'm':
25                     a[last]/=1000.0;
26                     break;
27                 case 'k':
28                     a[last]*=1000.0;
29                     break;
30                 case 'M':
31                     a[last]*=1000000.0;
32                     break;
33             }
34         }
35         
36         printf("Problem #%d\\n",i);
37         
38         if(a['U']&&a['I'])
39            printf("P=%.2lfW",a['U']*a['I']);
40         else if(a['U']&&a['P'])
41                 printf("I=%.2lfA",a['P']/a['U']);
42         else if(a['I']&&a['P'])
43                 printf("U=%.2lfV",a['P']/a['I']);
44         printf("\\n\\n");
45     }
46     
47     fclose(stdin);
48     fclose(stdout);
49     return 0;
50 }
51 

Naeioi Zhu 2010-11-10 19:08 发表评论
]]>UVa 10010http://www.cppblog.com/Naeioi/archive/2010/11/07/132866.htmlNaeioi ZhuNaeioi ZhuSun, 07 Nov 2010 08:36:00 GMThttp://www.cppblog.com/Naeioi/archive/2010/11/07/132866.htmlhttp://www.cppblog.com/Naeioi/comments/132866.htmlhttp://www.cppblog.com/Naeioi/archive/2010/11/07/132866.html#Feedback0http://www.cppblog.com/Naeioi/comments/commentRss/132866.htmlhttp://www.cppblog.com/Naeioi/services/trackbacks/132866.html  在一个n*m的字符矩阵中寻找给定的字符串，字符串可以是上下、下上、左右、右左等8个方向。输出每个字符串第一个字符首次出现的位置。
要注意的是换行问题，对一个少一个都判作WA
 1 #include <cstdio>
 2 #include <string.h>
 3 #include <ctype.h>
 4 using namespace std;
 5 
 6 const int maxn=60,dx[]= {1,1,1,0,-1,-1,-1,0},dy[]= {-1,0,1,1,1,0,-1,-1};
 7 char G[maxn][maxn];
 8 int N,M,K;
 9 
10 int main()
11 {
12 #ifndef ONLINE_JUDGE
13     freopen("10010.in","r",stdin);
14     freopen("10010.out","w",stdout);
15 #endif
16 
17     int C,t=0;
18     scanf("%d",&C);
19 
20     while(C--) {
21         if(t!=0)printf("\\n");
22         ++t;
23 
24         scanf("%d%d",&N,&M);
25         for(int i=1; i<=N; i++)
26             for(int j=1; j<=M; j++) {
27                 char tmp;
28                 do {
29                     tmp=getchar();
30                 }
31                 while(!isalpha(tmp));
32                 G[i][j]=tolower(tmp);
33             }
34 
35         scanf("%d",&K);
36         getchar();
37         while(K--) {
38             char str[maxn];
39             gets(str);
40             int len=strlen(str);
41 
42             for(int i=0; i<len; i++)
43                 str[i]=tolower(str[i]);
44 
45             bool ok=false;
46             for(int i=1; i<=N&&!ok; i++)
47                 for(int j=1; j<=M&&!ok; j++)
48                     for(int k=0; k<8&&!ok; k++) {
49                         int x=i,y=j,count=0;
50                         while(x>=1&&y>=1&&x<=N&&y<=M&&count<len&&str[count]==G[x][y]) {
51                             ++count;
52                             x+=dx[k];
53                             y+=dy[k];
54                         }
55                         if(count==len) {
56                             ok=true;
57                             printf("%d %d\\n",i,j);
58                         }
59                     }
60         }
61         //printf("\\n");
62     }
63 
64     fclose(stdin);
65     fclose(stdout);
66     return 0;
67 }
68 


Naeioi Zhu 2010-11-07 16:36 发表评论
]]>