Public submissions
Source code of every submission to this problem in this contest will be visible for everyone since 2013-12-13 17:14:04.

SMPSEQ3 - Fun with Sequences

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 the ascending order all such si that does not belong 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:
0 4

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:04

hide comments
2020-01-03 05:35:33
I am not able to submit solution for this problem. When I submit solution, it says- Error wrong problem.
2016-05-11 22:00:09
shows me wrong answer! What if sequence entered is not of n integers? My code exits in such condition. I can't think of any other place where my code can go wrong.
2015-04-29 09:06:32
For scala the compile time itself is 5 secs.....
2015-01-28 06:51:56 kartheek polavaram
Hi Ɓukasz Kuszner, These tutorials are helping me a lot thanks
2014-08-13 16:48:59 RAHUL
can you please give me an example where my programme will fail
2014-08-04 15:08:24 Bahaa


Last edit: 2014-02-17 09:29:47
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.