Public submissions
Source code of every submission to this problem in this contest
will be visible for everyone since 20131213 17:14:04.
Submit  All submissions  Best solutions  Back to list 
SMPSEQ3  Fun with Sequences 
You are given a sorted sequence of n integers S = s_{1}, s_{2}, ..., s_{n} and a sorted sequence of m integers Q = q_{1}, q_{2}, ..., q_{m}. Please, print in the ascending order all such s_{i} 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 <= s_{i} <= 100, s_{i} <= s_{i+1}.
In the third line you are given one integer 2<=m<=100,
and in the following line m integers:
100 <= q_{i} <= 100, q_{i} <= q_{i+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:  20131114 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Public source code since:  20131213 17:14:04 
hide comments
20200103 05:35:33
I am not able to submit solution for this problem. When I submit solution, it says Error wrong problem. 

20160511 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. 

20150429 09:06:32
For scala the compile time itself is 5 secs..... 

20150128 06:51:56 kartheek polavaram
Hi Ćukasz Kuszner, These tutorials are helping me a lot thanks 

20140813 16:48:59 RAHUL
can you please give me an example where my programme will fail 

20140804 15:08:24 Bahaa
Last edit: 20140217 09:29:47 