String Finding - Hacking

View as PDF

Submit solution

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 and T of lowercase English characters, such that |S|, |T| \le 10^6, and such that calling S.find(T) in Python 3 times out in 10 seconds.

Input Specification

There is no input.

Output Specification

Two newline-separated strings S and T of lowercase English characters, such that |S|, |T| \le 10^6, and such that calling S.find(T) in Python 3 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 Oct. 15, 2021, 12: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.