2 字符替换与移位（2 character replacement and shift）.docVIP

下载本文档

5
0
约1.23万字
约 16页
2017-08-15 发布于河南
举报
版权申诉

2 字符替换与移位（2 character replacement and shift）.doc

1、本文档共16页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

2 字符替换与移位（2 character replacement and shift）

2 字符替换与移位（2 character replacement and shift） Title 8: please prepare the function encryptChar (), replace all characters in the array xx according to the given substitution, and still store the corresponding position of the array xx, Substitution: f (p) = p * 11 mod 256 (p is an ASCII value of the characters in the array, f (p) is calculated after the new characters of ASCII value), if f (p) after calculation value is less than or equal to or greater than 32, 130, the character is the same, otherwise will f (p) of the character to replace. Void encryptChar () {int I, j; For (I = 0; I maxline; i++) For (j = 0; j strlen (xx) [I]; j++) If (xx [I] [j] * 11% 256 = 32 | | xx [I] [j] * 11% 256 130) continue; Else xx [I] [j] xx [I] [j] * 11% = 256; } Topic 36 EncryptChar function (), the trade-off: f (p) = p * 11 mod 256 (p is an ASCII value of the characters in the array, f (p) is calculated after the new characters of ASCII value), if f (p) after calculation value is less than or equal to 32 or f (p) corresponding characters are Numbers 0 to 9, the character is the same, otherwise will f (p) of the character to replace. Void encryptChar () {int I, j; For (I = 0; I maxline; i++) For (j = 0; j strlen (xx) [I]; j++) If (xx [I] [j] * 11% 256 = 32 | | xx [I] [j] * 11% 256 = 0 xx [I] [j] * 11% 256 = 9) continue; Else xx [I] [j] xx [I] [j] * 11% = 256; } The title 56 EncryptChar (), the trade-off: f (p) = p * 11 mod 256 (p is an ASCII value of the characters in the array, f (p) is calculated after the new characters of ASCII value), if the calculated value of f (p) is less than or equal to 32 f (p) or the corresponding character is a lowercase letter, the character is the same, otherwise will f (p) of the character to replace. Void encryptChar () {int I, j; For (I = 0; I maxline; i++) For (j = 0; j strlen (xx) [I]; j++) If (xx [I] [j] * 11% 256 = 32 | | xx [I] [j] * 11% 256 = a xx [I] [j] * 11% 256 = z) continue; Else xx [I] [j] xx [I] [j] * 11% = 256; } Problem