String Finding - Hacking - DMOJ: Modern Online Judge

String Finding - Hacking

Points: 10

Time limit: 2.0s

Memory limit: 64M

Author:

Problem type

To celebrate people complaining that bf4 should have a higher point value, we have created this problem.

You are to print two newline-separated strings $S$ ~S~ and $T$ ~T~ of lowercase English characters, such that $|S|, |T| \le 10^6$ ~|S|, |T| \le 10^6~, and such that calling S.find(T) in Python 2 times out in 10 seconds.

Input Specification

There is no input.

Output Specification

Two newline-separated strings $S$ ~S~ and $T$ ~T~ of lowercase English characters, such that $|S|, |T| \le 10^6$ ~|S|, |T| \le 10^6~, and such that calling S.find(T) in Python 2 times out in 10 seconds.

Note

It is not recommended to submit in Text (the submission size limit is likely too small).

Comments

3

Kirito commented on Jan. 5, 2023, 9:26 p.m.

I changed the checker to use Python 2 instead of Python 3 and rejudged.

-5

Kirito commented on Oct. 15, 2021, 4:53 a.m.

I have increased the difficulty of the problem by requiring S.find(T) to time out in 10 seconds (previously it was 2).

All submissions have been rejudged.

This comment is hidden due to too much negative feedback. Show it anyway.