字符串处理_密文解密

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int main()
{
	int i,j,len;
	char ch1[210];
	char ch2[26];
	//ch2[0]='A';
	//ch2={'A','B','C','D','E','F','G','H','I','J'
	//,'K','L','M','N','O','P','Q','R','S','T','U'
	//,'V','W','X','Y','Z'};
	strcpy(ch2,"ABCDEFHIJKLMNOPQRSTUVWXYZ");
	//cin>>ch;//star	
	//cout<<ch<<endl;
	//getline(cin,str);
	string str;
	cin>>str;
	len=str.length();
	char *ch=new char[len];
	strcpy(ch,str.c_str());
	while(str!="ENDOFINPUT"){
		cin>>ch;
		len=str.length();
		char *ch=new char[len];
		strcpy(ch,str.c_str());
		j=0;
		while(j<len){
			if( int(ch[j]) > 64 && int(ch[j]) <91 )
			{
				for(i=0;i<26;i++){
					if(ch[j]==ch2[i]){
						if(i-5<0){
							ch1[j]=ch2[26+(i-5-1)];
							break;
						}
						else {
							ch1[j]=ch2[i-5];
							break;
						}
					
					}
				}
			}
			else{
				ch1[j]=ch[j];
			}
			
			
			j++;
		}
		cout<<ch1<<endl;
		
		
		cin>>str;//end
		cin>>str;//star
	}
	
	return 0;
}