Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- #include <algorithm>
- using namespace std;
- int _42;
- char s[1010]; int l;
- int change;
- int mvs;
- int minMoves(int idx) {
- int notA;
- for (notA=idx+1; s[notA]!='\0'; notA++)
- if (s[notA]!='A')
- break;
- return 2*min(idx,l-notA)+max(idx,l-notA);
- }
- int main() {
- scanf("%d", &_42);
- while (_42--) {
- scanf(" %s", s);
- change=0;
- for (l=0; s[l]!='\0'; l++)
- change+=min(s[l]-'A', 26-s[l]+'A');
- mvs=200000;
- for (int i=0; s[i]!='\0'; i++)
- mvs=min(mvs,minMoves(i));
- printf("%d\n", change+mvs);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement