洛谷 P1603 斯诺登的密码 题解

很有意思的一道题,考点是字符串处理,自己没做出来…按照题解上使用了打表和贪心算法的思路解出来了
基本思路是:先把每个给出的英文单词以及所对应的数字分别存入到数组中,然后一个一个把单词读进啦,每读一个就判断是否在数组中(这里字符串的对比必须要使用strcmp函数,千万不要使用==,否则会很惨…),如果在,将对应的数字存入到一个数组中去,将所有的单词都读完之后,对这个保存数字的数组进行排序,让最小的数字跑到前面去(贪心),这样得到的数字一定是最小的
贴上代码

#include 
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
char dic[30][20] = {"zero","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen", "twenty","a","both","another","first","second","third"};
int di[30] = {0,1,4,9,16,25,36,49,64,81,00,21,44,69,96,25,56,89,24,61,0,1,4,1,1,4,9};
int a[30];
int top,flag=0;
char s[50];
int main(int argc, char** argv) {
	//输入6个单词,所以循环6次 
	for(int i=1;i<=6;i++){
		scanf("%s",&s);//%s遇到空格就会自动终止
		for(int j=0;j<=26;j++){
		//注意:这里对比字符串时一定要使用strcmp函数,当字符串相等时,这个函数返回0
			if(!strcmp(s,dic[j])){
				//将数字存入到a数组中去 
				a[top++] = di[j];
				break;
			}
		} 
	}
	//这里是贪心,每次把最小的数字放到前面,这样得到的数字一定是最小的 
	sort(a,a+top);
	
	for(int i=0;i