
Untitled
By: a guest on
Jun 27th, 2012 | syntax:
None | size: 0.46 KB | hits: 9 | expires: Never
input, output and \n's
string test;
string original;
while (getline(fin,test))
original += test;
int len = answer.length();
answer = cleanUp(answer);
while (len > 0){
string s3 = answer.substr(0,80);
answer.erase(0,80);
fout << s3 << endl;
len -= 80;
}
for (int i=1; i<total_chars; i++)
for (n=1; n<min(i, total_chars-i); n++)
if (array[i+n] != array[i-n])
// Candidate palindrome is from array[i-n+1] to array[i+n-1]