TOJ 1310.Do the Untwist

原创 2016年08月28日 16:44:46


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

Example output:


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;
		int len=strlen(ct);
		for(int i=0;i<len;i++){
			else if(ct[i]=='.')
		for(int i=0;i<len;i++){
		for(int i=0;i<len;i++){
			else if(pc[i]==27)



最近,afy决定给TOJ印刷广告,广告牌是刷在城市的建筑物上的,城市里有紧靠着的N个建筑。 afy决定在上面找一块尽可能大的矩形放置广告牌。我们假设每个建筑物都有一个高度, 从左到右给出每个建筑物的高...
  • code_pang
  • code_pang
  • 2013年11月04日 12:09
  • 2550

NKOJ 2150 广告印刷 单调队列

【单调队列】广告印刷 Time Limit:10000MS  Memory Limit:65536K Total Submit:296 Accepted:108  Case Time Limit:10...
  • zp___waj
  • zp___waj
  • 2016年06月15日 06:56
  • 713

toj 3515堆的应用

#include #include #include using namespace std; #define N 110004 struct Heap{ int da[N],size; void...
  • NeQrhk
  • NeQrhk
  • 2016年07月19日 08:25
  • 220

toj 4316 报数游戏

toj 4316 报数游戏 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 总提交: 68 测试通过:35 描述n 个人站成...
  • q547550831
  • q547550831
  • 2016年08月17日 16:00
  • 438

TOJ 3533 - 黑白图像

小白书上的图的例题. LRJ介绍了两种方法, 一种是利用递归进行DFS
  • u014247806
  • u014247806
  • 2014年05月03日 19:05
  • 727

TOJ 4099 组队要和谐

组队要和谐 时间限制(普通/Java):1000MS/1000MS     运行内存限制:65536KByte 总提交: 19            测试通过: 4 描述 为了备战明年的省赛...
  • u011686226
  • u011686226
  • 2013年08月17日 19:42
  • 754

TOJ 2789.Monthly Expense(二分经典题目)

题目链接 : Farmer John is an astounding accounting wizard and...
  • muyujinxi
  • muyujinxi
  • 2016年07月21日 18:08
  • 359

toj 4596 一行盒子

toj 4596 一行盒子 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 总提交: 116 测试通过:11 描述你有一行盒...
  • q547550831
  • q547550831
  • 2016年08月20日 17:23
  • 747

toj 4601 好老师

toj 4601 好老师 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte 总提交: 73 测试通过:37 描述我想当一个好老...
  • q547550831
  • q547550831
  • 2016年08月20日 17:42
  • 651


发信人: RoBa (rerestart) TOJ题目分类+简析 (Demo版) 赞美ROBA 2006/12/30zz ..from bbs发信人: RoBa (rerestart), 信...
  • juanjuanguai
  • juanjuanguai
  • 2013年09月16日 01:16
  • 946
您举报文章:TOJ 1310.Do the Untwist