Codeforces 1607A. Linear Keyboard Solution

  ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    1. #include <bits/stdc++.h>
    2. using namespace std;
    3. int main()
    4. {
    5. int t,i,sz,ans;
    6. cin>>t;
    7. while(t--)
    8. {
    9. ans=0;
    10. string s,t;
    11. map<char,int>mp;
    12. cin>>s;
    13. for(i=0; i<26; i++)
    14. {
    15. mp[s[i]]=i;
    16. }
    17. cin>>t;
    18. for(i=1; i<t.size(); i++)
    19. {
    20. ans+=abs(mp[t[i]]-mp[t[i-1]]);
    21. }
    22. cout<<ans<<endl;
    23. }
    24. }

    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.