Submit solution

Points:
7

Time limit:
1.0s

Memory limit:
512M

Author:

Problem types

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

If there is anything that

likes, it is prime numbers. He likes them so much, he decided to throw his friend a prime party.In order to make a prime themed birthday party, dollars to spend on various goods. He also has a list of objects that he needs to buy that each cost dollars.

hasHe needs to buy the objects such that:

He buys each object at least twice.

The amount of each object is a prime number.

He spends a prime amount of money.

#### Input Specification

The first line contains the integer , the amount of money that he can spend.

The second line contains the integer , the number of objects he has to buy.

The next lines contains , the price of each object. Each price is unique.

#### Output Specification

If it is possible to achieve the above goals, output `its primetime`

. Otherwise output `not primetime`

.

#### Sample Input

```
31
2
3
5
```

#### Sample Output

`its primetime`

#### Explanation of Output

objects worth dollars and objects worth dollars for a total of dollars.

can buy#### Sample Input

```
2
1
97
```

#### Sample Output

`not primetime`

is too poor to buy anything, so the party can't go on.

## Comments

15 points to 7 points that’s a tough soak.

Edit: Fixed

Grammatical Error"amount" should be changed to "number".

Misread the question because of this.

I didn't quite mean to but I think I cheesed the problem. Was my solution intended to work?

No.

Sample input 2, one of the prices seems to be outside of the given range of numbers.

Statement has been fixed. In addition, is actually in the range . This change has been reflected in the problem statement.

For sample 1, user can also buy 3 objects worth 3 dollars, and 2 objects worth 5 dollars, spending in total 19 dollars. Is it acceptable solution? Or user should spend directly N dollars?

you have to buy each object at least twice but in sample input 1 this doesn’t happen :)

How did my submission pass?

What exactly is the problem?

Check this out: https://dmoj.ca/src/230106 Problemsetters can view submissions during the contest, right?

I see the problem now. As the contest is going on right now I cant change anything. Once the contest is over I will a few more hand made test cases to make sure only the correct solutions pass. For now, enjoy your temporary points ;)

Just so you know, the test cases are still sub par and AC incorrect answers. If you have the time you should write some more up.

I'm not sure about moladan123 so I've sent him the code via fb.

I'll ask the problemsetter.

One of the conditions stated is that "(2<mi<100)" even tho the first input has the value m1 = 2 which is not stricly greater than 2.