洛谷P1603 斯诺登的密码经典解法

最新推荐文章于 2021-05-13 10:50:45 发布

「已注销」

最新推荐文章于 2021-05-13 10:50:45 发布

阅读量1.4k

点赞数 4

CC 4.0 BY-SA版权

分类专栏：程序设计代码共享

本文链接：https://blog.youkuaiyun.com/weixin_52075219/article/details/114240018

程序设计代码共享专栏收录该内容

183 篇文章

订阅专栏

本文介绍了一个C语言程序，该程序能够将输入的特定英文字符串转换为对应的数值，并对这些数值进行排序。主要处理的字符串包括表示数字一至二十的英文单词。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<stdio.h>
#include<string.h>
char a[6][20];
int b[6];
int main(void) {
	int i, j, temp;
	scanf("%s %s %s %s %s %s", a[0], a[1], a[2], a[3], a[4], a[5]);
	for (i = 0; i < 6; i++) 
		if (strcmp(a[i], "one")==0|| strcmp(a[i], "a")==0|| strcmp(a[i], "another")==0|| strcmp(a[i], "first") == 0)
			b[i]=1;
		else if (strcmp(a[i], "two") == 0)
			b[i] = 4;
		else if (strcmp(a[i], "three") == 0)
			b[i] = 9;
		else if (strcmp(a[i], "four") == 0)
			b[i] = 16;
		else if (strcmp(a[i], "five") == 0)
			b[i] = 25;
		else if (strcmp(a[i], "six") == 0)
			b[i] = 36;
		else if (strcmp(a[i], "seven") == 0)
			b[i] = 49;
		else if (strcmp(a[i], "eight") == 0)
			b[i] = 64;
		else if (strcmp(a[i], "nine") == 0)
			b[i] = 81;
		else if (strcmp(a[i], "ten") == 0)
			b[i] = 0;
		else if (strcmp(a[i], "eleven") == 0)
			b[i] = 21;
		else if (strcmp(a[i], "twelve") == 0)
			b[i] = 44;
		else if (strcmp(a[i], "thirteen") == 0)
			b[i] = 69;
		else if (strcmp(a[i], "fourteen") == 0)
			b[i] = 96;
		else if (strcmp(a[i], "fifteen") == 0)
			b[i] = 25;
		else if (strcmp(a[i], "sixteen") == 0)
			b[i] = 56;
		else if (strcmp(a[i], "seventeen") == 0)
			b[i] = 89;
		else if (strcmp(a[i], "eighteen") == 0)
			b[i] = 24;
		else if (strcmp(a[i], "nineteen") == 0)
			b[i] = 61;
		else if (strcmp(a[i], "twenty") == 0)
			b[i] = 0;
	for(i=0;i<6;i++)
		for(j=i+1;j<6;j++)
			if (b[i] > b[j]) {
				temp = b[i];
				b[i] = b[j];
				b[j] = temp;
		    }
	if (b[5] == 0)
		printf("0");
	else 
		for (i = 0,temp=0; i < 6; i++) 
			if (b[i] < 10 && b[i]>0)
				if (temp == 0) {
					temp = 1;
					printf("%d", b[i]);
				}
				else
					printf("0%d", b[i]);
			else if(b[i]!=0)
				printf("%d", b[i]);
	return(0);
}