暮雨今夕的博客

慕雨渐阑珊,芳影依依。相携不言归,愿永今夕

TOJ 1310.Do the Untwist

题目链接:http://acm.tju.edu.cn/toj/showp1310.html


1310.   Do the Untwist
Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 2031   Accepted Runs: 860



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 decryptionTwisting 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 inplaincode 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 ciphercodeaccording 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


Source: Mid-Central USA 1998
Submit   List    Runs   Forum   Statistics

加密解密,字符串处理,水题上代码:

#include <stdio.h>
#include <string.h>
using namespace std;
int pc[71],cc[71];
char pt[71],ct[71];
int main(){
	int k;
	while(scanf("%d",&k),k){
		scanf("%s",ct);
		int len=strlen(ct);
		for(int i=0;i<len;i++){
			if(ct[i]=='_')
				cc[i]=0;
			else if(ct[i]=='.')
				cc[i]=27;
			else
				cc[i]=ct[i]-'a'+1;
		}
		for(int i=0;i<len;i++){
			pc[(k*i)%len]=(cc[i]+i)%28;
		}
		for(int i=0;i<len;i++){
			if(pc[i]==0)
				pt[i]='_';
			else if(pc[i]==27)
				pt[i]='.';
			else
				pt[i]=pc[i]+'a'-1;
		}
		pt[len]='\0';
		printf("%s\n",pt);
	}
} 


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/muyujinxi/article/details/52346533
文章标签: toj 水题
个人分类: Toj水题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

TOJ 1310.Do the Untwist

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭