poj 1298 史上最难的问题 -- 凯撒密码

标签：

Description

Input

Output

Sample Input

START
NS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJX
END
START
N BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJ
END
START
IFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJ
END
ENDOFINPUT

Sample Output

IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSES
I WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROME
DANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE

由于学过网络安全课程，这个题目以前做过实验，是一个凯撒密码的题，也就是字符前移5次，注意取模26

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char s[105];
char t[16];
int main(){
	int i,j;
	while(scanf("%s",t)){
		if(strcmp(t,"ENDOFINPUT")==0)
			break;
		getchar();
		gets(s);
		for(i=0;s[i]!='\0';i++){
			if(s[i]>='A'&&s[i]<='Z')
				s[i]=(s[i]-'A'+26-5)%26+'A';
		}
		scanf("%s",t);
		puts(s);
	}
	return 0;
}

poj 1298 史上最难的问题 -- 凯撒密码

标签：

原文地址：http://blog.csdn.net/qq_27717967/article/details/51365328