Please Help Me

View as PDF

Submit solution

Points: 15
Time limit: 1.4s
Memory limit: 64M

Problem type

Derek loves to eat dim sum, but it is always a hassle to figure out how much he is going to pay. Given a list of the prices of dishes he ordered, help Derek figure out the sum of all the dim sum dishes!

Derek also loves giving you unreasonable constraints, so he asks that your solution cannot contain any alphanumeric characters or quotation marks.

Input Specification

The first line of input will contain one integer N, the number of dishes to follow.

The next N lines will each contain one integer P, the price of that dish.

Output Specification

Print out one integer S, the total sum of all the prices.


1 \le N \le 3000

0 \le P \le 100

Sample Input


Sample Output



  • 4
    Dingledooper  commented on Aug. 22, 2020, 12:53 a.m.

    It's possible to pass in Python by using Unicode characters.

    • 1
      c  commented on Aug. 22, 2020, 1:13 a.m.

      That was going to be a DMOJ CTF problem, but I can't use it anymore :/

  • 4
    GeeTransit  commented on Dec. 25, 2019, 2:14 a.m.

    Can confirm that brainfuck still lives to its name.

  • 15
    Riolku  commented on Aug. 26, 2019, 1:43 a.m.

    No one can help you, if you set this problem, you are beyond help.

  • -4
    Plasmatic  commented on Aug. 23, 2019, 9:48 p.m.

    Not allowing javascript, smart decision.

  • 5
    injust  commented on Aug. 23, 2019, 9:05 a.m. edited

    Thanks for the problem! This was cool.

    Ruby code golf is fun. Can somebody find a solution shorter than 247 characters?

  • 4
    hxxr  commented on Aug. 23, 2019, 1:44 a.m. edit 2

    Is this question possible to solve using an allowed language other than Ruby, BF or AWK?

    • 1
      c  commented on Aug. 23, 2019, 6:59 a.m.

      Normally I would have allowed all languages for this problem. However due to the existence of JSFuck, JavaScript based languages are disabled.

      The list of languages does not correlate to the solvability of the problem.

      Although this problem can definitely be solved in other allowed languages.

      Have fun exploring them.