when it may be «It is a lie!».

Just output n random numbers.
After that,  output m random numbers.
All random numbers are in range [1;1e9].
AC first attempt.

there are n * m possible sums. to find a solution, we can try to create such vectors such that all n * m sums are different.
Suppose the 1st vector is 1 2 3 ... n

Then the first element of next vector is taken to be n + 1(we require all unique).
Now we need to find the next element while making all n*p sums different, where p is the size of the 2nd vector.

n+1
1 2 3 ... n

initially all sums(n+2 to 2n+1) are distinct. Now we need to add new element such that
smallest possible new sum is greater than the previous sum
i.e. if new element is p
p+1>2n+1
or p >= 2n + 1
in general p+1>prev+n
p>=prev+n

Very easy:)
just print numbers 1,2,...,n
then n+1,2*n+1,...,m*n+1

input:
2 3
Output:
1 2
3 5 7

Why this result failed 1 test?

var m,n:word; i:word;
begin
  readln(m,n);
  for i:=1 to n do
  begin
    write(i,' ');
  end;
  writeln;
  for i:=1 to m do
  begin
    write(i*n+1,' ');
  end;
end.

What test is wrong with it?

Edited by author 07.07.2016 17:05

Why this answer for test 1 gets WA

2 3
1 2
3 4 5

?????????

algorithm is just
print on
1 ... n
then n+1 ... n+m

what's wroung with this???????????????

1...n print(i)
(n+1)...n+m print(i*n)

The tests are a little bit incorrect.
If we have, let's say, 10 boxes of the first variety and 10 boxes of the second variety we can come up with:
1  2  3  4  5  6  7  8  9  10
10 20 30 40 50 60 70 80 90 100
(1 line: from 1 to n; 2 line: from n to m*n with step of n)
In this case we never allocate boxes of even weight. If we take box number 10 from the first line and box number 3 from the second, we get 10+30=40. The best solution would be the box number 1 from the first line and the box number 4 from the second one: 1+40=41. But 40!=41
The system gives me WA on the very first test.

1, 2, 3, ..., n
1, n+1, 2n+1, ..., (m-1)*n+1

I have even written a testing program to verify this and it reports that there is no mistake. I checked this on a few inputs like (2, 3), (1, 50), (50, 1), (50, 50) and it always seems to be correct. Can anybody give me a hint on where my mistake is?

UPD:
Got AC after changing to this:
1, 2, 3, ..., n
n+1, 2n+1, ..., m*n+1

The question remains. WTF?

UPD2:
Read the statement again and figured this out. All number should be different. In my solution, 1 was repeated twice.

Edited by author 26.11.2011 22:13