Excuses, Excuses! UVa409 字符串

花酱_

墨衍会员 · AI 创作全网分发码龄14年

关注

原创最新推荐文章于 2016-07-15 18:24:42 发布 488 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

Root :: Problem Set Volumes :: Volume IV

409 - Excuses, Excuses!

又来了一次编译错误，然后几次WA是因为分隔符不全，最后干脆把非字母全当成分隔符就AC了。 =.=

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <string.h>
using namespace std;
#define N 23
#define NLEN 73
char keywords[N][N],excuses[N][NLEN];
int sum[N];

bool bubble(int k){
	int i,j;
	char t[N];
	for (i=0;i<k-1;i++)
		for (j=0;j<k-i-1;j++)
			if (strcmp(keywords[j],keywords[j+1])>0){
				strcpy(t,keywords[j]);
				strcpy(keywords[j],keywords[j+1]);
				strcpy(keywords[j+1],t);
			}
	return true;
}

int find(char *s,int k){
	int mid,high=k-1,low=0;
	while (low<=high){
		mid=(low+high)/2;
		if (strcmp(keywords[mid],s)==0)
			return mid;
		else if (strcmp(keywords[mid],s)<0)
			low=mid+1;
		else high=mid-1;
	}
	return -1;
}

int cal(char *s,int k){
	int i,j,count=0;
	char t[NLEN];
	for (i=0;i<strlen(s);i++)
		if (isupper(s[i]))
			s[i]=tolower(s[i]);
	for(i=0,j=0;i<strlen(s);i++){
		if(!isalpha(s[i])){  
			t[j]='\0';  
			if (find(t,k)!=-1)
				count++;
			j=0;  
			continue;  
        }  
		t[j]=s[i];
		j++;  
    }
	return count;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("409in.txt","r",stdin);
#endif
	int k,e,i,max,ce=0;
	char t[NLEN];
	while (scanf("%d%d",&k,&e)!=EOF){
		ce++;
		for (i=0;i<k;i++)
			scanf("%s",keywords[i]);
		bubble(k);
		memset(sum,0,sizeof(sum));
		max=0;
		getchar();
		for (i=0;i<e;i++){
			fgets(excuses[i],NLEN-1,stdin);
			strcpy(t,excuses[i]);
			sum[i]=cal(t,k);
			if (sum[i]>max)
				max=sum[i];
		}
		printf("Excuse Set #%d\n",ce);
		for (i=0;i<k;i++)
			if (sum[i]==max)
				printf("%s",excuses[i]);
		putchar(10);
	}
	return 0;
}

收录于