-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQ2-encropy.cpp
More file actions
40 lines (39 loc) · 840 Bytes
/
Q2-encropy.cpp
File metadata and controls
40 lines (39 loc) · 840 Bytes
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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
string A,M;
int n;
cin>>A>>M>>n;
int divider=A.size();
for (int i=0; i<M.size(); i++) {
for (int j=0; j<divider; j++) {
if(M[i]==A[j]){
cout<<A[(j+n)%divider];
continue;
}
}
}
return 0;
}