唐福林 博客雨

2007年5月27号

百度之星编程比赛 第四题 inurl 高级查询

#include
#include
#define maxn 9999
#define maxstrlen 258

int m,n;
char site[maxn][maxstrlen], inurl[maxn][maxstrlen];
char str1[maxstrlen], str2[maxstrlen];
char *pos;

int main()
{
int i,j,k;

memset(site,’\0′,sizeof(site));
memset(inurl,’\0′,sizeof(inurl));
scanf(“%d”, &n);
for(i=0; i {
scanf("%s %s",str1, str2);
strcpy(site[i], (str1+5)); // filter site:
strcpy(inurl[i], (str2+6)); // filter inurl:
//printf("\n site[%d]:%s inurl[%d]:%s \n", i,site[i],i,inurl[i]);
}
scanf("%d", &m);
for(j=0; j {
scanf("%s", str1);
strcpy(str2, (str1+7)); // filter http://
pos = strchr(str2, '/');
strcpy(str1, pos);
*pos = '\0'; // str1 is now inurl and str2 is only site
//printf("site: %s inurl: %s \n", str2, str1);

k = 0;
for(i=0; i {
if(strcmp(str2, site[i]) == 0)
{
// printf("site %s write!\n", str2);
pos = strstr(str1, inurl[i]);
//printf("strstr(%s, %s) func return: %s\n", inurl[i], str1, pos);
if(pos != NULL)
{
k = 1; // found!
break;
}
else{
//printf("pos is %s\n", pos);
}
}
}
if (k == 0) printf("0\n");
else printf("1\n");
}
}