img iplinger

2001-Singapore problem 1 Encryption

发表于2004/9/29 10:00:00  685人阅读

分类: ACM

Problem 1


Input file: data1.txt

Say you are the founder and sole employee of your own e-business start-up. Hours before delivering an e-commerce solution to your very first client, you realize to your horror that you have forgotten to include encryption features for sensitive information.

Faced with a very tight deadline, you decide to incorporate a simple encryption routine and later sell a security upgrade to your client at a tidy sum. After looking through possible methods that you can implement quickly, you finally settle on the following scheme known as a Vigenere cipher.

First, you determine a small repeated key that is the length of your plaintext (unencrypted) message. Next, you align the plaintext message such that the first letter of the message is aligned to the first letter of the key. Finally, each key letter index is added to its corresponding plaintext letter index to produce the ciphertext (encrypted) letter index. These combined ciphertext letter indices will form the final encrypted message. Your task is to write such a program.


The input file consists of pairs of lines. The first line of each pair will contain the key while the second line will contain the plaintext message. Only letters of the alphabet (A-Z) plus a space will be used. These may be in upper- or lower-case and you will have to convert them into upper-case if necessary.


The output file consists of one line of upper-case text for each pair of lines in the input file. Each line will contain the encrypted message.

Sample Input


Attack at dawn


How are you

Sample Output



//Author IPLinger
//IDE VC++6.0

pragma hdrstop
# include <fstream>
# include <string>
# include <iostream>
using namespace std;

char key[1000];
char message[1000];
char result[1000];
string key_string; //the purpose is to caculate the length of key-array.

void Encrypt()
 int temp1;
 int temp2;
 char temp3;
 for(int i=0;i< key_string.length();i++)
  temp1= key[i]-64;
  temp2= message[i];
                temp2-= temp2==32 ? 32 : 64;
  temp3= temp1+temp2;
                temp3+= temp3>26 ? 64-26 : 64;
  cout << temp3;

void ReadFile()
 ifstream OpenFile("/mnt/hgfs/ACM/solution/2001-singapore/data1.txt");
        //打开文件,you should apply the path and name of the file that you want to open in linux;
        //eof()函数用来判断文件的结束,规定 # 为input的结束
                //method strupr() converts a string to uppercase.
  cout<< endl;

void main()
        //char a;
        //cin>> a;

0 0


取 消