## Boolean

View as PDF

Points: 3
Time limit: 0.1s
Memory limit: 64M

Author:
Problem type

A boolean value can be either True or False. Given a string with less than 1000 characters with a number of space-separated not directives terminated by a True or False value, evaluate the boolean expression.

#### Sample Input 1

not not True

#### Sample Output 1

True

#### Sample Input 2

not not not False

#### Sample Output 2

True

• commented on April 26, 2019, 3:21 p.m.

I think the test case is too much.

• commented on Jan. 1, 2019, 5:48 a.m.

I need a bit of help after I had 250 successful cases something went wrong and I can't figure out what.

• commented on Jan. 1, 2019, 7:37 a.m.

Try some cases, for example:

not not not False
• commented on Jan. 1, 2019, 8:03 p.m.

Thank you!

• commented on July 28, 2022, 12:11 p.m.

why would anyone make 250 succesful tries anyway

• commented on Dec. 18, 2018, 4:43 p.m.

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

• commented on Dec. 19, 2018, 2:53 p.m.

Congratulations on successfully convincing yourself that over 1000 people have solved this problem incorrectly.

Your program is what is incorrect, as you have not considered all cases. Specifically, there is a case where you output nothing.

• commented on Dec. 20, 2018, 6:52 p.m.

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

• commented on Oct. 20, 2018, 3:01 p.m.

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

• commented on Jan. 27, 2019, 5:20 p.m.

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

• commented on Oct. 26, 2018, 6:05 p.m.
• commented on June 19, 2022, 3:42 p.m.

didnt relize you got like 20 of the same XD

• commented on Dec. 28, 2018, 2:34 a.m. edited

franxia is actually the teacher of all these students including me and when he taught us this case we copied his code and that's why its all the same

• commented on March 23, 2019, 9:05 p.m. edited

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

• commented on June 20, 2022, 5:30 p.m.

Forget Bruce, Franxia all the way

• commented on Oct. 20, 2018, 4:28 p.m.

• commented on Aug. 7, 2018, 2:15 p.m.

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

• commented on April 1, 2020, 7:00 p.m. edited

Why are we booing him? The input is literally in python code format, which means that if you input into a python shell, it will actually run. That means that the problem is easily cheesed with python's eval that allows you to run python code in string form. Don't believe me? Look at all the top pypy3 submissions. It's literally one line of code.

• commented on Dec. 28, 2019, 1:14 a.m. edit 2

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

• commented on July 6, 2018, 1:00 a.m.

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

• commented on July 6, 2018, 5:04 p.m.

Yeah cus I math.random'd it and the dark lord didn't want me to ac

• commented on July 8, 2018, 12:56 a.m. edited

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

• commented on June 23, 2017, 12:40 a.m.

Never thought I'd ever see a problem where the assembly solution is shorter than C++.

• commented on Oct. 20, 2016, 11:52 p.m.

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

• commented on Oct. 20, 2016, 11:57 p.m.

The format the input is given in is not a coincidence.

• commented on March 6, 2016, 3:18 a.m.

This problem might be a bit easy in Python

• commented on March 6, 2016, 4:14 a.m.

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

• commented on March 6, 2016, 4:30 p.m.

You can still do it in one line on Python 3 :)

• commented on March 6, 2016, 7:15 p.m.

Right. Python's an interpreted language. Gotta remember that.

On an unrelated note, I wonder if I can get AHK to solve equations by highlighting them using the same idea? Would save me so much time.

• commented on March 6, 2016, 4:13 p.m.

Not if you know the right shortcut ;)