URAL 1404. Easy to Hack! (模拟)
2015-10-14 13:50
871 查看
1404. Easy to Hack!
Time limit: 1.0 secondMemory limit: 64 MB
When Vito Maretti writes an important letter he encrypts it. His method is not very reliable but it’s enough to make any detective understand nothing in that letter. Sheriff doesn’t like such state of affairs. He wants to hack
the cipher of Vito Maretti and he promises to forget about all of your faults if you do that for him. Detectives will tell you what this cipher looks like.
Each word is enciphered separately. Assume an example that consists only of the small Latin letters.
At first step every letter is replaced with the corresponding number:
a with 0, b with 1,
c with 2, ..., z with
25.Then 5 is added to the first number, the first number is added to the second one, the second number – to the third one and so on. After that if some number exceeds 25 it is replaced with the residue of division of this number by 26. And then those
numbers are replaced back with the letters.
Let’s encipher the word secret.
Step 0. s e c r e t Step 1. 18 4 2 17 4 19 Step 2. 23 27 29 46 50 69 Step 3. 23 1 3 20 24 17 Step 4. x b d u y r
We’ve got the word xbduyr.
Input
You are given an encrypted word of small Latin letters not longer than 100 characters.Output
the original word.Sample
input | output |
---|---|
xbduyr | secret |
Problem Source: The 12th High School Pupils Collegiate Programming Contest of the Sverdlovsk Region (October 15, 2005)
解析:直接按题意模拟就可以。
AC代码:
#include <bits/stdc++.h> using namespace std; int a[102]; int main(){ string s; while(cin>>s){ int n = s.size(); for(int i=0; i<n; i++) a[i] = s[i] - 'a'; if(a[0] < 5) a[0] += 26; for(int i=1; i<n; i++){ while(a[i] < a[i-1]) a[i] += 26; } for(int i=n-1; i>0; i--) a[i] -= a[i-1]; a[0] -= 5; for(int i=0; i<n; i++) printf("%c", a[i] + 'a'); puts(""); } return 0; }
相关文章推荐
- 数组类型转换失败:NSMutableArray和NSArray的相互转换
- ocp-391
- 第七周项目(6):停车场模拟
- 百度poi检索 查询POI数据
- make 工具
- spring框架学习(一)
- 关于犹太人培养小孩【转】
- poj Matrix 2155 (树状数组&&二维线段树) 好题
- 程序猿白话之——const的妙用
- 根据sessionid获取session的被Servlet2.1抛弃getsession方法的解决方案
- openssl的rsa加密解密在js的实现
- Publisher/Subscriber(发布/订阅者)消息模式开发流程
- 库
- opencv为图像画框并显示文字
- POJ3061 Subsequence 尺取法
- 一个测试工程师面试结束后想说的
- LogMiner配置使用手册
- 正则表达式匹配任意字符
- NodeJS和SpringBoot的SSL配置
- Spark Shuffle系列-----2. Spark Shuffle map端的原理和实现