分享
 
 
 

浙大在线评测 1006 Do the Untwist

王朝other·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

Question:

Cryptography deals with methods of secret communication that transform a message (the plaintext) into a disguised form (the ciphertext) so that no one seeing the ciphertext will be able to figure out the plaintext except the intended recipient. Transforming the plaintext to the ciphertext is encryption; transforming the ciphertext to the plaintext is decryption. Twisting is a simple encryption method that requires that the sender and recipient both agree on a secret key k, which is a positive integer.

The twisting method uses four arrays: plaintext and ciphertext are arrays of characters, and plaincode and ciphercode are arrays of integers. All arrays are of length n, where n is the length of the message to be encrypted. Arrays are origin zero, so the elements are numbered from 0 to n - 1. For this problem all messages will contain only lowercase letters, the period, and the underscore (representing a space).

The message to be encrypted is stored in plaintext. Given a key k, the encryption method works as follows. First convert the letters in plaintext to integer codes in plaincode according to the following rule: '_' = 0, 'a' = 1, 'b' = 2, ..., 'z' = 26, and '.' = 27. Next, convert each code in plaincode to an encrypted code in ciphercode according to the following formula: for all i from 0 to n - 1, ciphercode[i] = (plaincode[ki mod n] - i) mod 28.

Here x mod y is the positive remainder when x is divided by y. For example, 3 mod 7 = 3, 22 mod 8 = 6, and -1 mod 28 = 27. You can use the C '%' operator or Pascal 'mod' operator to compute this as long as you add y if the result is negative.) Finally, convert the codes in ciphercode back to letters in ciphertext according to the rule listed above. The final twisted message is in ciphertext. Twisting the message cat using the key 5 yields the following:

Array 0 1 2

plaintext 'c' 'a' 't'

plaincode 3 1 20

ciphercode 3 19 27

ciphertext 'c' 's' '.'

Your task is to write a program that can untwist messages, i.e., convert the ciphertext back to the original plaintext given the key k. For example, given the key 5 and ciphertext 'cs.', your program must output the plaintext 'cat'.

The input file contains one or more test cases, followed by a line containing only the number 0 that signals the end of the file. Each test case is on a line by itself and consists of the key k, a space, and then a twisted message containing at least one and at most 70 characters. The key k will be a positive integer not greater than 300. For each test case, output the untwisted message on a line by itself.

Note: you can assume that untwisting a message always yields a unique result. (For those of you with some knowledge of basic number theory or abstract algebra, this will be the case provided that the greatest common divisor of the key k and length n is 1, which it will be for all test cases.)

Example input:

5 cs.

101 thqqxw.lui.qswer

3 b_ylxmhzjsys.virpbkr

0

Example output:

cat

this_is_a_secret

beware._dogs_barking

Solution:

// 声明:本代码仅供学习之用,请不要作为个人的成绩提交。

// http://blog.csdn.net/mskia

// email: skianet@yahoo.com.cn

#include <iostream>

#include <string>

using namespace std;

void Find( char *c1 , char *c2 , int *c3 ) {

int i = 0;

for( int j = 0 ; j < strlen(c2); ++j ) {

for( i = 0 ; i < strlen(c1); ++i ) {

if( c2[ j ] == c1[ i ] ) {

c3[ j ] = i;

}

}

}

}

void change(int *c1 , int *c2 , int k , int n) {

int temp , i = 0;

int flag;

if( i == 0 ) {

c2[ 0 ] = c1[ 0 ];

}

for(i = 1 ; i < n ; i++) {

temp = ( k * i ) % n;

if ( i < 28 && temp != 0 ) {

if( c1[ i ] + i >= 28 ) {

flag = c1[ i ] - 28;

} else {

flag = c1[ i ];

}

c2[ temp ] = flag + i ;

} else {

for( int j = -3; j < 1; ++j ) {

if( ( j * 28 + c1[ i ] + i >= 0 ) && ( j * 28 + c1[ i ] + i <= 27 ) ) {

if( temp != 0 ) {

c2[ temp ] = j * 28 + c1[ i ] + i;

}

}

}

}

}

}

void shift( int *c1 , char *c2 , char *c3 , int n ) {

for( int i = 0 ; i < n; ++i ) {

int temp = c1[ i ];

c2[ i ] = c3[ temp ];

}

for( int i = 0 ; i < n; ++i ) {

cout << c2[ i ] << endl;

}

}

int main( void ) {

char rule[ 28 ] = {'_' , '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' , '.' };

int key;

while( cin >> key && key != 0) {

char *ciphertext = new char[ 70 ];

cin >> ciphertext;

int n = strlen( ciphertext );

int *ciphercode = new int[ strlen( ciphertext ) + 1 ];

int *plaincode = new int[ strlen( ciphertext ) + 1 ];

char *plaintext = new char[ strlen(ciphertext) + 1 ];

Find( rule , ciphertext , ciphercode );

change( ciphercode , plaincode , key , n );

shift( plaincode , plaintext , rule , n );

delete [] ciphertext;

delete [] ciphercode;

delete [] plaincode;

delete [] plaintext;

}

return 0;

}

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
2023年上半年GDP全球前十五强
 百态   2023-10-24
美众议院议长启动对拜登的弹劾调查
 百态   2023-09-13
上海、济南、武汉等多地出现不明坠落物
 探索   2023-09-06
印度或要将国名改为“巴拉特”
 百态   2023-09-06
男子为女友送行,买票不登机被捕
 百态   2023-08-20
手机地震预警功能怎么开?
 干货   2023-08-06
女子4年卖2套房花700多万做美容:不但没变美脸,面部还出现变形
 百态   2023-08-04
住户一楼被水淹 还冲来8头猪
 百态   2023-07-31
女子体内爬出大量瓜子状活虫
 百态   2023-07-25
地球连续35年收到神秘规律性信号,网友:不要回答!
 探索   2023-07-21
全球镓价格本周大涨27%
 探索   2023-07-09
钱都流向了那些不缺钱的人,苦都留给了能吃苦的人
 探索   2023-07-02
倩女手游刀客魅者强控制(强混乱强眩晕强睡眠)和对应控制抗性的关系
 百态   2020-08-20
美国5月9日最新疫情:美国确诊人数突破131万
 百态   2020-05-09
荷兰政府宣布将集体辞职
 干货   2020-04-30
倩女幽魂手游师徒任务情义春秋猜成语答案逍遥观:鹏程万里
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案神机营:射石饮羽
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案昆仑山:拔刀相助
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案天工阁:鬼斧神工
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案丝路古道:单枪匹马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:与虎谋皮
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:李代桃僵
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:指鹿为马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:小鸟依人
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:千金买邻
 干货   2019-11-12
 
推荐阅读
 
 
 
>>返回首頁<<
 
靜靜地坐在廢墟上,四周的荒凉一望無際,忽然覺得,淒涼也很美
© 2005- 王朝網路 版權所有