Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include <bits/stdc++.h>
using namespace std;
string s1, s2, t;
int main() {
cin >> s1 >> s2 >> t;
for(char c : t) putchar(c < 58 ? c : s2[s1.find(c < 91 ? c + 32 : c)] – (c < 91 ? 32 : 0));
return 0;
}
📦 Looking for Codeforces Round 424 Div Based Vk? Check the best deals on Amazon.
🛒 Shop Codeforces Round 424 Div Based Vk on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include <bits/stdc++.h>
using namespace std;
string s1, s2, t;
int main() {
cin >> s1 >> s2 >> t;
for(char c : t) putchar(c < 58 ? c : s2[s1.find(c < 91 ? c + 32 : c)] – (c < 91 ? 32 : 0));
return 0;
}
📦 Looking for Codeforces Round 424 Div Based Vk? Check the best deals on Amazon.
🛒 Shop Codeforces Round 424 Div Based Vk on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.