রবিবার, ২৮ আগস্ট, ২০১৬

UVA 401 - Palindromes

#include<stdio.h>
#include<string.h>
main()
{
char s[100000]={0};
while(scanf("%s",s)!=EOF)
{
char s1[19000]={0};
long int l,a,i,count=0;

l=strlen(s);
a=l;
for(i=0;i<l;i++)
{
if(s[i]==s[a-1])
{
count++;
}
a--;

}
long int k=0,j;
for(j=l-1;j>=0;j--)
{
if(s[j]=='A')s1[k]='A';
if(s[j]=='E')s1[k]='3';
if(s[j]=='3')s1[k]='E';
if(s[j]=='H')s1[k]='H';
if(s[j]=='I')s1[k]='I';
if(s[j]=='J')s1[k]='L';
if(s[j]=='L')s1[k]='J';
if(s[j]=='M')s1[k]='M';
if(s[j]=='S')s1[k]='2';
if(s[j]=='O')s1[k]='O';
if(s[j]=='T')s1[k]='T';
if(s[j]=='U')s1[k]='U';
if(s[j]=='V')s1[k]='V';
if(s[j]=='W')s1[k]='W';
if(s[j]=='X')s1[k]='X';
if(s[j]=='Y')s1[k]='Y';
if(s[j]=='Z')s1[k]='5';
if(s[j]=='1')s1[k]='1';
if(s[j]=='2')s1[k]='S';
if(s[j]=='5')s1[k]='Z';
if(s[j]=='8')s1[k]='8';
if(s[j]=='0')s1[k]='O';
k++;
}
if(count==l)
{

if(strcmp(s1,s)==0)
printf("%s -- is a mirrored palindrome.",s);
else
printf("%s -- is a regular palindrome.",s);
}
else
{
if(strcmp(s1,s)==0)
printf("%s -- is a mirrored string.",s);
else
printf("%s -- is not a palindrome.",s);
}
printf("\n\n");
}

}

কোন মন্তব্য নেই:

একটি মন্তব্য পোস্ট করুন

Factorization with prime Sieve

vector <int> prime; char sieve[1000009]; int N=1000009; void primeSieve ( ) { sieve[0] = sieve[1] = 1; prime.push_back(2); ...