Largest Palindrome

[ramakrishnadeepak]

HI Everybody,

I 've to submit a program on c.Can any one help me
plz.........The problem is like this::

Write a program which computes the largest palindrome substring of a
string.

Input:
The input is the string whose largest palindrome substring should be
found.

Output:
The output displays the largest palindrome substring.

Sample Input:
Enter the string: Habitat

Sample Output:
The longest palindrome substring of Habitat is: tat

[Richard Bos]

ra************* **@gmail.com wrote:

[ Snip whole homework assignment written by a teacher who is clearly
better at non-d00d English than his pupils. ]

And your work so far is? Surely you don't expect us to do your homework
for you?

Richard

[MQ]

Richard Bos wrote:

ra************* **@gmail.com wrote:

[ Snip whole homework assignment written by a teacher who is clearly
better at non-d00d English than his pupils. ]

And your work so far is? Surely you don't expect us to do your homework
for you?

Richard

This really annoys me. As if there isn't enough incompetent IT
professionals out there...

[osmium]

<ra************ ***@gmail.comwr ote:

I 've to submit a program on c.Can any one help me
plz.........The problem is like this::

Write a program which computes the largest palindrome substring of a
string.

Input:
The input is the string whose largest palindrome substring should be
found.

Output:
The output displays the largest palindrome substring.

Sample Input:
Enter the string: Habitat

Sample Output:
The longest palindrome substring of Habitat is: tat

Note that the first letter of a palindrome is the same as the last letter.
Proceed from there.

[Frederick Gotham]

HI Everybody,

>
I 've to submit a program on c.Can any one help me
plz.........The problem is like this::

Write a program which computes the largest palindrome substring of a
string.

Input:
The input is the string whose largest palindrome substring should be
found.

Output:
The output displays the largest palindrome substring.

Sample Input:
Enter the string: Habitat

Sample Output:
The longest palindrome substring of Habitat is: tat

I had this assignment a few years ago, got an A! Here's the exact code copy-
pasted. The code is perfect, fully-portable... just need to hand it in!

#include
"stdio.h"

#include
"string.h"

void main(int)
{
char[64] buffer;

scanf(STRING,bu ffer);

int * const p;

while
{
p = permute(buffer, buffer + len);
} do( p --p );
printf(p);
}
Hope that helps, always love to help out a fellow student : ) !
--

Frederick Gotham

[Andrew Poelstra]

On 2006-07-11, Frederick Gotham <fg*******@SPAM .comwrote:

I had this assignment a few years ago, got an A! Here's the exact code copy-
pasted. The code is perfect, fully-portable... just need to hand it in!

#include
"stdio.h"

#include
"string.h"

void main(int)
{
char[64] buffer;

scanf(STRING,bu ffer);

int * const p;

while
{
p = permute(buffer, buffer + len);
} do( p --p );

printf(p);
}

Hope that helps, always love to help out a fellow student : ) !

I laughed out loud at that one. :-)

--
Andrew Poelstra <http://www.wpsoftware. net/projects/>
To email me, use "apoelstra" at the above domain.
"You people hate mathematics." -- James Harris

[pete]

Andrew Poelstra wrote:

>
On 2006-07-11, Frederick Gotham <fg*******@SPAM .comwrote:

I had this assignment a few years ago, got an A!
Here's the exact code copy-
pasted. The code is perfect, fully-portable...
just need to hand it in!

#include
"stdio.h"

#include
"string.h"

void main(int)
{
char[64] buffer;

scanf(STRING,bu ffer);

int * const p;

while
{
p = permute(buffer, buffer + len);
} do( p --p );

printf(p);
}

Hope that helps, always love to help out a fellow student : ) !

I laughed out loud at that one. :-)

Nobody is entitled to make any serious decisions
based on "code tested" and "code not tested" labels
on posted code.

Which is why
I'm not a fan of "code tested" and "code not tested" labels.

No criticism of Frederick Gotham is intended here.

--
pete

[lovecreatesbeauty]

Andrew Poelstra wrote:

I laughed out loud at that one. :-)

I have written a function to identify a whole as palindromic or not. My
function knows this one is a palindrome:

A man, a plan, a canal - Panama!

To determine whether the following one is a palindrome will be more
difficult than the last one.

abcdefghijklmno pqrstuvwxyz0123 456789 A man, a plan, a canal - Panama!

(please do not laugh at the following function:), but comments are
welcome!)

/*palindrome.c*/

#include <stddef.h>
#include <string.h>
#include <ctype.h>

/*determine a sentence if it is a palindrome. s: the string to be
determined. return 1 for identifying a successful palindrome, 0 for
not. - jhl, Jul 2006*/

int palindrome(cons t char *s)
{
int pln = 1;
const char *left, *right;

if (s != NULL){
left = s;
right = s + strlen(s) - 1;
while (left < right){
if (!isalnum(*left )){
++left;
continue;
}
if (!isalnum(*righ t)){
--right;
continue;
}

if (toupper(*left) == *right || tolower(*left) == *right){
++left;
--right;
continue;
} else {
pln = 0; /*charaters occur mismatched, it is not palindrome*/
break;
}
}
}

return pln;
}

/* test */
#include <stdio.h>
int main()
{
printf("%d\n", palindrome("Mad am, I'm Adam!"));
printf("%d\n", palindrome("A man, a plan, a canal - Panama!"));
printf("%d\n", palindrome("Abl e was I, ere I saw Elba."));
printf("%d\n", palindrome("Ana voli Milovana"));
return 0;
}

$ cc -ansi -pedantic -Wall -W palindrome.c
$ ./a.out
1
1
1
1
$

lovecreatesbeau ty

[Richard Heathfield]

lovecreatesbeau ty said:

Andrew Poelstra wrote:

>I laughed out loud at that one. :-)

I have written a function to identify a whole as palindromic or not.

Is it that time already? Here we go, then:

#include <stdio.h>
#include <string.h>
#include <ctype.h>

#define p void
#define a sizeof
#define l char
#define i return
#define n int
#define d size_t
#define r if
#define o while
#define m else
#define e for
#define ob putchar
#define fu strlen
#define sc isalpha
#define at tolower
#define ed fgets
#define cp printf
#define ro strchr
#define gr main
#define am stdin
n c(l*s){n k=
0;r(s){d x
=fu (s)
;r(x>1)
{l*t=s,
*u=s+x-
1;k=1;o
(k&&t<u
){r(sc(
*t)){r(
sc(*u))

{r(at(
*t)!=at(
*u) ){k
=0; }m{
++t;--u;}}m{--
u;}}m{++t;}}}}
i k ;}n
gr( p){
l b [01
<<1 <<1

<<1
<<1
<<1
<<1
<<1
<<1
<<1
],*
z,*s=" adeil"
"mnoprst.\n ";

n f[]={00,01<<1
<<1,(1<<1<<1< <1
)|(
1<<
1)|
1},
v[]
={0
,(1<<1<<1)|(1<<
1)|1,1<<1<<1<<1
,(1 <<1
<<01 <<1
)|(01 <<1
<<1 )} ,q[
]={ (1 <<1
)&1 ,1 <<1

>>1 ,1 >>1

,(1 << 1<<
1<< 1) |1,
1<< 01<<1

>>1>>1,(1<<1

<<1 )|(
1<< 1>>
1), 1<<
1<< 1,(
1<< 1<<
1)| (01
<<1 )|1
,01 <<1
,(1<<1<<1<<1
)|(1<<01),1
<<1 <<1
<<1 ,(1
<<1 <<1
)|1 <<1
,(1 <<1
)|1,(1<<
1<< 1<<
1)| (01
<<1 <<1
)|1 ,(1
<<1 <<1
<<1)|(1<<
1<< 1)|
(01 <<1
)}; d y
;o( ed(
b,a (b)
,am )){
{z= ro(
b,1 *1*
'\n');}if(

z){ *z=
00;} {cp(
"%s", b);}e
(y=0;1 *y<a f
/a( 1[f ]); y++
)ob (y[f][ s])
;r( !c(b ))e
(y= 0; y<a
v/a 1[v
];y ++)
ob(01*y[v][s]);e
(y=0/1*1/1<<1<<1
<<1
;y<
a q
/a 1[q]
;y++)ob
(y[
q][
s])
;}i 0>>1<<0>>1<<
1*1/(1<<1<<01);}


--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at above domain (but drop the www, obviously)

[Richard Heathfield]

Richard Heathfield said:

Is it that time already? Here we go, then:

<snip>

Not sure what happened to the formatting there. The original, with proper
formatting, can be found here:

http://www.cpax.org.uk/prg/portable/...s/obfusc/pal.c

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at above domain (but drop the www, obviously)