2001-Singapore problem 1 Encryption

原创 2004年09月29日 10:00:00

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<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" />

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;

HDOJ, 杭电1032, The 3n+1 problem. POJ, 北大OJ,1207....数学题。。又一发

一个英文题。。。 Uva的第一道题目。HDOJ的1032题,POJ的1207题、、、 坑爹的POJ居然不识别 _int64,不过还好,他没要求大于int型的数字。。。所以,用int,AC险过了。。。 ...
  • hu1020935219
  • hu1020935219
  • 2013年09月21日 13:58
  • 1466


http://source.android.com/devices/tech/security/encryption/ Encryption IN THIS D...
  • thinkinwm
  • thinkinwm
  • 2015年02月18日 14:50
  • 2029


B - The 3n + 1 problem Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit...
  • a716121
  • a716121
  • 2015年08月19日 17:32
  • 651


如何连接: http://vocore.io/wiki/index/id:12  ssid:vocore  无线密码为空 用户名:root 密码:vocore 登陆方式:ssh IP:192.16...
  • qq_22863011
  • qq_22863011
  • 2015年05月07日 16:15
  • 1103

创建存储过程中运用了 with encryption 语句加了密,如何解密存储过程

这近在玩存储过程,用了with encryption进行加密 ,加入此语句后,在sql server 2000里连自己都不能看到原存储过程,一打听,呵!解密的工具还真不少。如:sql explorer...
  • liqiangjun
  • liqiangjun
  • 2004年10月26日 14:10
  • 1854


这道题,其实说难也难,说简单也简单,关键在其测试数据。如果测试数据很苛刻,就很难了(参看博客UVa Problem 100 The 3n+1 problem (3n+1 问题))。 这里,我要写两点想...
  • cylj102908
  • cylj102908
  • 2016年04月30日 22:49
  • 264

阶乘位数—Big Number

Big Number In many applications very large integers numbers are required. Some of these applicatio...
  • fores_t
  • fores_t
  • 2017年07月17日 21:15
  • 127

android 多次重启后出现Encryption unsuccessful , need to factory reset或死机

  • fanciman
  • fanciman
  • 2014年09月23日 16:46
  • 1665

用源码编的4.3,烧到机器后,启动后报Encryption Unsuccessful的解决

 用源码编的4.3,烧到机器后,启动后报Encryption Unsuccessful解决办法 可以先把加密去掉 system/core/init/builtins.c  C/C++ c...
  • zhenwenxian
  • zhenwenxian
  • 2013年11月23日 12:29
  • 3799

Android 性能优化之(1)-MAT使用教程

Android 性能优化之——MAT使用教程官方地址参考地址 1.Eclipse安装Allocation tracker插件 MAT是一个Eclipse插件,同时也有单独的RCP...
  • u010350809
  • u010350809
  • 2015年12月16日 23:11
  • 4665
您举报文章:2001-Singapore problem 1 Encryption