-
Notifications
You must be signed in to change notification settings - Fork 0
/
Caesar Cipher Hackerrank.cpp
85 lines (65 loc) · 1.49 KB
/
Caesar Cipher Hackerrank.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'caesarCipher' function below.
*
* The function is expected to return a STRING.
* The function accepts following parameters:
* 1. STRING s
* 2. INTEGER k
*/
string caesarCipher(string s, int k) {
k=k%26;
for(int i=0;i<s.size();i++){
if((s[i]>='a' && s[i]<='z') || (s[i]>='A' && s[i]<='Z')){
char a,z;
if(s[i]>='A' && s[i]<='Z'){
a='A';
z='Z';
}else{
a='a';
z='z';
}
if(s[i]+k>z){
s[i]=a+((s[i]+k)%z)-1;
}else{
s[i]+=k;
}
}
}
return s;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
string s;
getline(cin, s);
string k_temp;
getline(cin, k_temp);
int k = stoi(ltrim(rtrim(k_temp)));
string result = caesarCipher(s, k);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}