| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
8 s, 256 MB
|
|
|
| C |
standard input/output
1 s, 256 MB
|
|
|
| D |
standard input/output
1 s, 256 MB
|
|
|
| E |
standard input/output
3 s, 256 MB
|
|
|
| F |
standard input/output
6 s, 256 MB
|
|
|
| G |
standard input/output
1 s, 256 MB
|
|
|
| H |
standard input/output
1 s, 256 MB
|
|
|
| I |
standard input/output
1 s, 256 MB
|
|
|
| J |
standard input/output
1 s, 256 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2014-10-12 11:22:56
|
Yes
|
|
|
2014-10-12 10:53:44
|
Problem E. Binary Search Tree ***** Is the comparison strictly less? (For example, if a key of the left children is equal to the key of the vertex, is it a valid binary search tree?) |
Yes. Comparison is strictly less
|
|
2014-10-12 10:20:33
|
The formula should be: A(i) = (C1 * A(i-1) + C2) mod M
|
|
|
2014-10-12 10:04:41
|
No
|
|
|
2014-10-12 10:03:08
|
Problem statement in Vietnamese is available here: https://www.dropbox.com/s/g2mdv0tu8qvolpe/problem_vi.html?dl=0 Đề bài bằng tiếng Việt có thể xem ở đây: https://www.dropbox.com/s/g2mdv0tu8qvolpe/problem_vi.html?dl=0
|