首页 > 其他分享 >北大ACM poj2141 Message Decowding

北大ACM poj2141 Message Decowding

时间:2023-08-21 17:05:33浏览次数:35  
标签:decryption key means ACM secret poj2141 they Message message


Message Decowding


Time Limit: 1000MS

 

Memory Limit: 65536K

Total Submissions: 10326

 

Accepted: 5672


Description


The cows are thrilled because they've just learned about encrypting messages. They think they will be able to use secret messages to plot meetings with cows on other farms.

Cows are not known for their intelligence. Their encryption method is nothing like DES or BlowFish or any of those really good secret coding methods. No, they are using a simple substitution cipher.

The cows have a decryption key and a secret message. Help them decode it. The key looks like this:

yrwhsoujgcxqbativndfezmlpk



Which means that an 'a' in the secret message really means 'y'; a 'b' in the secret message really means 'r'; a 'c' decrypts to 'w'; and so on. Blanks are not encrypted; they are simply kept in place.



Input text is in upper or lower case, both decrypt using the same decryption key, keeping the appropriate case, of course.



Input


* Line 1: 26 lower case characters representing the decryption key

* Line 2: As many as 80 characters that are the message to be decoded


Output


* Line 1: A single line that is the decoded message. It should have the same length as the second line of input.


Sample Input


eydbkmiqugjxlvtzpnwohracsf Kifq oua zarxa suar bti yaagrj fa xtfgrj


Sample Output


Jump the fence when you seeing me coming


 字符串转换题不多说了。

#include<stdio.h>
main()
{
	char a[128],b[100],c[100];
	int i;
	int j=0;
	//freopen("in.txt","r",stdin);
	for(i='a';i<='z';i++)
	{
		scanf("%c",&a[i]);
	}
	for(i='a';i<='z';i++)
	{
		a[i-32]=a[i]-32;//复制到大写字母的区域 
	}
	getchar();
	gets(b);//输入需要转换的字符串 
	while(b[j]!='\0')//如果需要转换的字符串没有到达末尾继续转换 
	{
		if(b[j]==' ')//如果是空格,不转换 
		{
			c[j++]=b[j];
			continue;
		}
		c[j]=a[b[j]];
		j++;
	}
	c[j]='\0';//加上结束符 
	puts(c);
}



标签:decryption,key,means,ACM,secret,poj2141,they,Message,message
From: https://blog.51cto.com/u_10101161/7177251

相关文章

  • 北大ACM poj2590
    /*找规律后发现增量是1,1,2,2,3,3,4,4,5,5......,可以发现它是个隔位曾1的自然序列步数:12345678910+1+1+2+2+3+3+4+4+5+501246912......
  • 北大ACM poj1636
    /*problem:poj1636如果s中的每个字母在t中都有则输出Yes(注意是Yes,不是YES)代码很简单,就不解释了*/#include<stdio.h>chars[100010],t[100010];intmain(){while(~scanf("%s%s",s,t)){inti=0,j;for(j=0......
  • ACM题目 英雄护美(递归)
    /*英雄护美英雄救美,可以理解;英雄护美,亦可理解。m(1<=m<=54)个英雄和美晚上行军,路过大峡谷,只能以纵队的方式前行。为确保美的绝对安全,纵队中每两个美之间必须至少有一个以上的英雄。如m为3时,有5种行军方式,分别为:美-英雄-美、美-英雄-英雄、英雄......
  • ACM题目:孔融分梨
    /*孔融分梨孔融让梨,人人称颂;孔融分梨,也不简单。孔融有M个同样的梨,要分给N个人。每个人手上有一个同样的盘子,孔融要将梨放入盘中,允许有的盘子空着不放,问共有多少种不同的分法?3,1,1和1,3,1和1,1,3是同一种分法。第一行是测试数据的数目t(0<......
  • ACM题目:英雄护美
    /*英雄护美英雄救美,可以理解;英雄护美,亦可理解。m(1<=m<=54)个英雄和美晚上行军,路过大峡谷,只能以纵队的方式前行。为确保美的绝对安全,纵队中每两个美之间必须至少有一个以上的英雄。如m为3时,有5种行军方式,分别为:美-英雄-美、美-英雄-英雄、英......
  • 北大ACM poj1562
    /*problem:poj1562*author:gubojun*time:2012.7.27*language:C*题目大意:求有多少个不相连的区域代码中的解释很多了,别的不说了*/#include<stdio.h>#include<string.h>#defineN101charmap[N][N];intn,m,sum;voiddfs(inti,intj){//如果map[......
  • 北大ACM poj 1001
    网上搜来的借鉴一下#include<stdio.h>main(){doublef;intn,i,j;inttop,bottom;intshow;for(;~scanf("%lf%d",&f,&n);){intp[300]={1},tmp=0;f*=1e6;for(i=0;i++<n;)......
  • 杭电ACM HDU 2816 I Love You Too
    ILoveYouTooTimeLimit:2000/1000MS(Java/Others)   MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1258   AcceptedSubmission(s):759ProblemDescriptionThisisatruestory.Amanshowedhislovetoagirl,butthegirldi......
  • 杭电ACM HDU 3346 Lucky Number
    LuckyNumberTimeLimit:2000/1000MS(Java/Others)   MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1523   AcceptedSubmission(s):800ProblemDescriptionToChinesepeople,8isaluckynumber.Nowyourtaskistojudgeifanu......
  • 杭电ACM HDU 2560 Buildings
    BuildingsTimeLimit:2000/1000MS(Java/Others)   MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1828   AcceptedSubmission(s):1553ProblemDescriptionWedividetheHZNUCampusintoN*Mgrids.Asyoucanseefromthepicturebe......