ZOJ 题目分类 The beginner problem

The beginner problem

Postbykuuga on Sun, Jun 11, 2006 22:18

Vol I
1001 by keqxin
1037 by Vegetable Bird WA
1048 by keqxin
1049 by Vegetable Bird
1051 by Vegetable Bird
1067 by Vegetable Bird

Vol II
1115 by Vegetable Bird
1151 by Vegetable Bird

Vol III
1201 by Vegetable Bird
1205 by Vegetable Bird WA
1216 by Vegetable Bird
1240 by Vegetable Bird
1241 by Vegetable Bird
1242 by Vegetable Bird
1251 by Vegetable Bird
1292 by Vegetable Bird

Vol IV
1331 by Vegetable Bird
1334 by Vegetable Bird
1337 by Vegetable Bird
1338 by Vegetable Bird
1350 by Vegetable Bird
1365 by Vegetable Bird
1382 by Vegetable Bird
1383 by Vegetable Bird
1394 by Vegetable Bird

Vol V
1402 by Vegetable Bird
1405 by Vegetable Bird
1414 by Vegetable Bird
1494 by Vegetable Bird

Vol VI
1514 by Vegetable Bird

Vol VII
1622 by Vegetable Bird

Vol VIII
1715 by Vegetable Bird
1730 by Vegetable Bird WA
1755 by Vegetable Bird
1760 by Vegetable Bird
1763 by Vegetable Bird
1796 by Vegetable Bird WA

Vol IX
1813 by Vegetable Bird
1879 by Vegetable Bird
1889 by Vegetable Bird WA

Vol X
1904 by Vegetable Bird WA
1915 by Vegetable Bird
1949 by Vegetable Bird

Vol XI
2001 by Vegetable Bird
2022 by Vegetable Bird NO
2099 by Vegetable Bird

Vol XII
2104 by Vegetable Bird
2108 by Vegetable Bird NO
2172 by Vegetable Bird NO
2176 by Vegetable Bird NO

Vol XIII
2201 by keqxin NO
2208 by Vegetable Bird NO

Vol XIV
2321 by Vegetable Bird NO
2345 by Vegetable Bird NO
2351 by Vegetable Bird NO
2376 by Vegetable Bird NO
2388 by Vegetable Bird

Vol XV
2405 by Vegetable Bird NO
2417 by Vegetable Bird
2433 by Vegetable Bird NO
Vol XVIII
2781 by Vegetable Bird NO
2782 by Vegetable Bird NO
Vol XIX
2807 by Vegetable Bird NO
2812 by Vegetable Bird
2857 by Vegetable Bird
2851 by Vegetable Bird NO
2878 by caopeng NO
2883 by caopeng NO
2886 by Vegetable Bird
2892 by Vegetable Bird NO

Vol XX
2947 by Vegetable Bird
2954 by Vegetable Bird WA
2969 by Vegetable Bird NO
2970 by Vegetable Bird NO
2987 by Vegetable Bird NO
2988 by Vegetable Bird NO
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Antique Comedians of Malidinesia would like to play a new discovered comedy of Aristofanes. Putting it on a stage should be a big surprise for the audience so all the preparations must be kept absolutely secret. The ACM director suspects one of his competitors of reading his correspondece. To prevent other companies from revealing his secret, he decided to use a substitution cipher in all the letters mentioning the new play. Substitution cipher is defined by a substitution table assigning each character of the substitution alphabet another character of the same alphabet. The assignment is a bijection (to each character exactly one character is assigned -- not neccessary different). The director is afraid of disclosing the substitution table and therefore he changes it frequently. After each change he chooses a few words from a dictionary by random, encrypts them and sends them together with an encrypted message. The plain (i.e. non-encrypted) words are sent by a secure channel, not by mail. The recipient of the message can then compare plain and encrypted words and create a new substitution table. Unfortunately, one of the ACM cipher specialists have found that this system is sometimes insecure. Some messages can be decrypted by the rival company even without knowing the plain words. The reason is that when the director chooses the words from the dictionary and encrypts them, he never changes their order (the words in the dictionary are lexicographically sorted). String a1a2 ... ap is lexicografically smaller than b1b2 ... bq if there exists an integer i, i <= p, i <= q, such that aj=bj for each j, 1 <= j < i and ai < bi. The director is interested in which of his messages could be read by the rival company. You are to write a program to determine that. Input Output Sample Input 2 5 6 cebdbac cac ecd dca aba bac cedab 4 4 cca cad aac bca bdac Sample Output abcde Message cannot be decrypted.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值