| KTU Programming Camp (Day 3) |
|---|
| Finished |
| # | Name | ||
|---|---|---|---|
| A |
standard input/output
2.25 s, 256 MB
|
|
|
| B |
standard input/output
0.25 s, 64 MB
|
|
|
| C |
standard input/output
0.25 s, 64 MB
|
|
|
| D |
standard input/output
2.5 s, 64 MB
|
|
|
| E |
standard input/output
1 s, 64 MB
|
|
|
| F |
standard input/output
0.25 s, 64 MB
|
|
|
| G |
standard input/output
1.25 s, 64 MB
|
|
|
| H |
standard input/output
0.5 s, 256 MB
|
|
|
| I |
standard input/output
2 s, 64 MB
|
|
|
| J |
standard input/output
0.25 s, 64 MB
|
|
|
| K |
standard input/output
0.75 s, 64 MB
|
|
|
| L |
standard input/output
0.25 s, 64 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2015-08-22 13:48:44
|
You need to find a subsequence, not a substring.
|
|
|
2015-08-22 10:36:22
|
It's always possible.
|
|
|
2015-08-22 10:17:01
|
No
|
|
|
2015-08-22 09:27:34
|
0
|
|
|
2015-08-22 09:24:40
|
The array is described in one line (n numbers). The p and q are switched (as some of you have noticed). Firstly q is given, then p.
|
| Name |
|---|


