DMPG '19 B1 - Registration

View as PDF

Submit solution

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

Problem type
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

As the DMPG draws nearer, the organizers realize that they should check the school registration! They find that N schools have registered and the i^{\text{th}} school will send C_i competitors to the Gala. There's just one problem: due to safety restrictions, no more than 200 competitors can attend the Gala. Can you tell the organizers how many more competitors can register last minute?


1 \leq N \leq 3
1 \leq C_i \leq 200

Input Specification

The first line of input will contain a single integer, N.
The second and final line of input will contain N space separated integers, C_1, C_2, \ldots, C_N.

Output Specification

If there are already more than 200 competitors, output Over maximum capacity!.
Otherwise, output the number of empty spots left.

Sample Input 1

100 50

Sample Output 1


Sample Input 2

120 60 30

Sample Output 2

Over maximum capacity!

Sample Input 3

50 50 100

Sample Output 3



There are no comments at the moment.