LPS - Longest Palindromic Substring -- wrong input!

[wq_shadow]

In (LPS - Longest Palindromic Substring) problem I get wrong answer with many different implementations and in the end I after taking input i made N equal to string size and i got accepted

int n;
string s;
cin >> n >> s;
n = s.size();   // this line make the code accepted

[simes]

This has been mentioned several times in the comments for the problem, but it seems the problem setter doesn’t care to correct the test data. I think that’s poor, but there’s nothing I can do about it.