| # | Name | ||
|---|---|---|---|
| A |
standard input/output
2 s, 64 MB
|
|
|
| B |
standard input/output
2 s, 64 MB
|
|
|
| C |
standard input/output
2 s, 64 MB
|
|
|
| D |
standard input/output
2 s, 256 MB
|
|
|
| E |
standard input/output
2 s, 64 MB
|
|
|
| F |
standard input/output
1.5 s, 128 MB
|
|
|
| G |
standard input/output
2 s, 64 MB
|
|
|
| H |
standard input/output
1 s, 64 MB
|
|
|
| I |
standard input/output
4 s, 256 MB
|
|
|
| J |
standard input/output
2 s, 64 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2015-08-16 22:14:32
|
Problem I. The Cool Monkeys ***** The monkeys will all start at the same height and end at the same height, or they will occupy the N highest at the start and N lowest at the end? |
They should start at the M highest branches in one tree and end at the M lowest ones in the other. One monkey per branch.
|
|
2015-08-16 21:59:21
|
Non-decreasing.
|
|
|
2015-08-16 21:24:08
|
Problem G. No Negations *****
|
Yes, [a*B] = (A+b)!!
|
|
2015-08-16 21:22:31
|
The events must be sorted by increasing time.
|
|
|
2015-08-16 21:01:32
|
Problem H. Designation in the Mafia ***** If i chosed to transform 'a' to 'e' every 'a' I have will be 'e', or it is just for that caracter? |
Just for that character.
|
|
2015-08-16 20:53:21
|
Problem I. The Cool Monkeys ***** 1.can several monkeys stand on the highest or the lowest branches of trees A and B? 2.what about the circumstances that some of the branches of the same tree has the same height? |
1. No. Only one monkey per branch.
2. It can happen that two branches share the same height. |
|
2015-08-16 20:07:09
|
The output is the area of the polygon
|
|
|
2015-08-16 20:02:40
|
Yes
|
|
|
2015-08-16 19:33:06
|
Good luck for everyone participating in this contest! This contest was prepared for individual contestants but if you want to participate in teams it's fine. :)
|