Search:

the code needs trivial modifications to reach the general purpose of the challenge(for an arbitrary length word)

now some explanations on the algorithm used wichis also trivial.
one can...

i forgot to brag about it,actually that it does the job for 9 letters pretty fast
on a 1.6ghz, that is...

spx2@asfasfadgf ~
$ time ./blah.exe abcdefgh > blah.txt

real 0m27.601s
user ...

the following works only for 9 digit words or less


#include <iostream>
#include <string>
using namespace std;
/* takes the j-th digit from ...

we shall leave that to other people(the optimization you talk about)

is there any better way to do it ?

well,im really good with algorithms...atleast i was
i'm retired now from contests and such.
if you like it thank you.

this took about 10minutes

i hope you like it



#include <stdio.h>
#include <string.h>
char s[] = "vroooom race";
int t=0;

is there any ideea in inverse(rac)=car and vroooom appearing in both ends ?