Elavenil likes strings a lot but she likes palindromic strings even more. Today she found an old string 's' in his garage. The string is so old that some of its characters have faded and are unidentifiable now. Faded characters in the string are represented by '.' whereas other characters are lower case Latin alphabets i.e ['a'-'z'].Elavenil being the palindrome lover decided to construct the lexicographically smallest palindrome by filling each of the faded character ('.') with a lower case Latin alphabet. Can you please help her complete the task?

 #include<stdio.h>
#include<string.h>
int main()
{
int t;
char pali[500];
scanf("%d",&t);
while(t>0)
{
    int c=0;
    int i,j;
    scanf("%s", pali);
    for (i=0,j=strlen(pali);i<=strlen(pali)/2;i++,j--)   
    {
        if(pali[i]=='.' && pali[j-1]=='.')
        {
            pali[i] ='a';
            pali[j-1] ='a';
        }
        else if(pali[i]=='.')
        pali[i]=pali [j-1];
        else if(i==strlen(pali)/2 && pali[i]=='.')
        pali[i]='1';
        else if(pali[i]!=pali[j-1] && pali[i]!='.' && pali[j-1]!='.')
        {
            c++;
            printf("-1");
            break;
        }
        else
        pali[j-1]=pali[i];
    }
    if(c==0)
    printf("%s",pali);
    printf("\n");
    t--;
 }
   return 0;
}

Comments

Post a Comment

Popular posts from this blog

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more

The Matriculation school have arranged an Annual Day Function.Volunteers have decorated a floor on various places of the school using Rose and Tulip flowers. But one of the coordinators requested the volunteers to rearrange the decoration like a triangular size.Coordinator also told them that tulips flowers need to be positioned at the middle of the roses

 #include <stdio.h> int main() {int rows; scanf("%d",&rows); for(int i=1;i<=rows;i++){     for(int j=1;j<=i;j++){         if(i==rows||i==j||j==1) printf("1 ");         else printf("0 ");     }printf("\n"); } return 0; }
Read more

Mukesh and Salima was looking to buy Organic Apples in the nearest fruits shop.But Shop Owner mixed the Hybrid apples in that Apple box. After sometimes Mukesh checking the box, he was confused among organic and hybrid apple. He started to count the hybrid apples. Please help to Mukesh Count the total number of hybrid apples in the box.

 #include <stdio.h> #include<string.h> int main() {int numofapples ,x,i,c=0; scanf("%d",&numofapples); int arr[100]={0}; for(i=0;i<numofapples;++i){     scanf("%d",&x);     arr[x]++; } for(i=0;i<100;++i){     if(arr[i]>1)c+=(arr[i]-1);     } printf("%d",c); return 0; }
Read more