Can you Find number of operations to form a Palindrome?

Question

To do this, you have to follows two rules:

1. You can reduce the value of a letter, e.g. you can change d to c, but you cannot change c to d.
2. In order to form a palindrome, if you have to repeatedly reduce the value of a letter, you can do it until the letter becomes a. Once a letter has been changed to a, it can no longer be changed.

for example: for string abc
abc->abb->aba
total 2 number of operations needed to make it a palindrome.

Answer 1

/*assuming c->b is one operation and b->a as second operation and assuming ahaeder files stdio.h ,string.h and stdlib.h (for abs() function)

int main()
{
    char str[80];
    int count=0,i,l,j;
    gets(str);
    l=strlen(str);
    for(i=0,j=l-1;i<j;i++,j--)
    {
        count+=abs(str[i]-str[j]);
    }
    printf("%d",count);
return 0;
}