Public submissions
Source code of every submission to this problem in this contest
will be visible for everyone since 2013-12-13 17:14:56.
Submit | All submissions | Best solutions | Back to list |
SMPSEQ4 - Fun with Sequences (Act 2) |
You are given a sorted sequence of n integers S = s1, s2 ... sn and a sorted sequence of m integers Q = q1, q2 ... qm.
Please print in ascending order all such si that belongs to Q.
Input data specification
In the first line you are given one integer 2 <= n <= 100,
and in the following line n integers:
-100 <= si <= 100, si <= si+1.
In the third line you are given one integer 2 <= m <= 100,
and in the following line m integers:
-100 <= qi <= 100, qi <= qi+1.
Output data specification
The sequence of requested integers separated by spaces.
Example
Input: 5 -2 -1 0 1 4 6 -3 -2 -1 1 2 3 Output: -2 -1 1
Added by: | kuszi |
Date: | 2013-11-14 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Public source code since: | 2013-12-13 17:14:56 |