Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <string>
- #include <vector>
- using namespace std;
- int mod(int a, int b)
- {
- if (a % b >= 0)
- return a % b;
- else
- return b + a % b;
- }
- int main()
- {
- string alphabet = "abcdefghijklmnopqrstuvwxyz";
- string x;
- vector<int> nums;
- cin >> x;
- vector<int> arr(x.size());
- for (int i = 0; i < x.size(); i++)
- {
- nums.push_back(alphabet.find(x[i]));
- }
- if (x.size() != 1)
- {
- for (int i = 1; i < x.size(); i++)
- {
- arr[i] = mod(nums[i] - nums[i - 1], 26);
- }
- arr[0] = mod(nums[0] - 5, 26);
- for (int i = 0; i < arr.size(); i++)
- cout << alphabet[arr[i]];
- }
- else
- {
- cout << alphabet[mod(nums[0] - 5, 26)] << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement