## Next Prime

View as PDF##### Brute Force Practice 3

You love prime numbers. You own a number, but you suspect it might not be prime. You want a prime number, but it must be at least as large as the number you currently own. Find the smallest number that satisfies those conditions.

#### Input

The first line will have the integer ()

#### Output

Print the number you want.

#### Sample Input

```
4
```

#### Sample Output

```
5
```

## Comments

what does TLE mean?

It means your program has exceeded the per-testcase time limit (in this case, 2 seconds). You can hover over status codes, as their alt text provides more details on what they are.

Are there any pointers you could give me to solve this question? Should I use the Sieve or something? I'm stuck :(

The name of the problem might give a hint. Specifically, "Brute Force Practice 3".

Even though this is Brute Force Practice 3, you still need a little optimization -- for example, can you determine if a number is prime just by checking divisors up to and including the square root of a number?

Keep getting 90%, first test fails. What...

Partial output has been enabled. You can see what output your program produced (up to about 32 bytes for now) and try to debug your code.

Has the output been disabled?

Nevermind. It seems the output only displays if you have less than a certain number of mistakes.

Actually, there will not be an arrow if your program does not produce any output. That was what was really happening.

I can't seem to get the last test to work for my code...

Your code is incorrect. There is a corner case you missed.

what do you mean, "corner case?"

If I wrote it here, it wouldn't be a corner case anymore. Make sure your solution is valid for all possible inputs within the range specified.

Does it have to work for decimals?

Inputs are integer only.

Not fair how

`/^1?$|^(11+?)\1+$/`

fails.If only the memory limit was a few GB more and you had a few more days to run your program!