My code for Enumerate Palindromes passes all the cases.
But it has a fatal bug and should tle.
What is it?
What it should be?
Generator for failing case
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
My code for Enumerate Palindromes passes all the cases.
But it has a fatal bug and should tle.
r = i + res[i];
b = i;
if (i + res[i] > r) {
r = i + res[i];
b = i;
}
ll n = 1e5;
string s = "";
for (ll i = 0; i < n; i++) {
s += 'j';
s += 'k';
}
cout << s <<"\n";
Название |
---|
Auto comment: topic has been updated by Misa-Misa (previous revision, new revision, compare).