|Submit||All submissions||Best solutions||Back to list|
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.
Input: 5 -2 -1 0 1 4 6 -3 -2 -1 1 2 3 Output: 0 4
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|
|Public source code since:||2013-12-13 17:14:04|
I am not able to submit solution for this problem. When I submit solution, it says- Error wrong problem.
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.
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