UVA 11278 - One-Handed Typist Shipu Ahamed - 01 Sep 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define sc scanf #define pf printf #define ll long long #define pi 2*acos(0.0) #define ff first #define se second #define inf (1<<30) //infinity value #define pb push_back #define mod 1000000007 #define ST(v) sort(v.begin(),v.end()) #define cover(a,d) memset(a,d,sizeof(a)) #define input freopen("in.txt","r",stdin) #define output freopen("out.txt","w",stdout) #define maxall(v) *max_element(v.begin(),v.end()) #define minall(v) *min_element(v.begin(),v.end()) #define un(v) ST(v), v.erase(unique(v.begin(),v.end()),v.end()) using namespace std; ll gcd(ll a, ll b) { if (b==0) return a; return gcd(b, a%b); } ll lcm(ll a, ll b) { return a/gcd(a, b)*b; } bool cmp(ll a,ll b) { return a > b; } int main() { string a="`1234567890-=qwertyuiop[]\\asdfghjkl;'zxcvbnm,./"; string ares="`123qjlmfp/[]456.orsuyb;=\\789aehtdck-0zx,inwvg'"; string b="~!@#$%^&*()_+QWERTYUIOP{}|ASDFGHJKL:\"ZXCVBNM<>?"; string bres="~!@#QJLMFP?{}$%^>ORSUYB:+|&*(AEHTDCK_)ZXhttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11278/11278.cpp