Give me some tests please

#include <stdio.h>
#include <stdlib.h>

struct Team
  {
  int id;
  int m;
  };

int main()
  {
  int n;
  struct Team * res;

  scanf ("%d", &n);
  res = (struct Team*)malloc( n * sizeof(struct Team) );

  for (int i = 0; i < n; i++)
    scanf ("%d %d", &res[i].id, &res[i].m);

  struct Team tmp;

  for (int i = 0; i < n-1; i++)
    for (int j = 0; j < n-1; j++)
      if (res[j].m < res[ j+1 ].m)
        {
          tmp = res[j];
          res[j] = res[ j+1 ];
          res[ j+1 ] = tmp;
        }

  for (int i = 0; i < n; i++)
    printf ("%d %d\n", res[i].id, res[i].m);

  return 0;
  }

Simple test for programs with verdict WA #14:

Sample input:
0
2
1
1

Sample output
1 2

Your program outputs "-1"? Find your simple stupid mistake!!!

Edited by author 05.11.2005 18:58

How to prevent TLE? I use LinkedList (can AddFirst and AddLast) and use max size of set = n.

#define EPS 0.000001

you can use to check "YES" that simple DSU algorithm.
because DSU algorithm gives us all cycle, knot, multigraph ... so on

ошибка на тесте №2

Можете отправить работающую программу,если не сложно.Долго уже пытаюсь,не получается:(

Вот код:
#include <iostream>
using namespace std;

int main()
{
int k, n;
cin >> k >> n;

int a;
int sum = 0;
 for( int i = 0; i < n; i++ )
 {
   cin >> a;
   sum += a;
 }

if( ( sum - n * k ) < 0 )
cout << 0;
else
cout << sum - n * k;

return 0;
}
на тесте 6 загибается в чом проблемма?

I tested it offline,and I got WA 90.
But when I submited it.I got Crash(Access Violation).
There's another question.
For this input:
98 146
1 2 1
2 3 300
3 4 1
4 5 300
5 6 1
6 7 300
7 8 1
8 9 300
9 10 1
10 11 300
11 12 1
12 13 300
13 14 1
14 15 300
15 16 1
16 17 300
17 18 1
18 19 300
19 20 1
20 21 300
21 22 1
22 23 300
23 24 1
24 25 300
25 26 1
26 27 300
27 28 1
28 29 300
29 30 1
30 31 300
31 32 1
32 33 300
33 34 1
34 35 300
35 36 1
36 37 300
37 38 1
38 39 300
39 40 1
40 41 300
41 42 1
42 43 300
43 44 1
44 45 300
45 46 1
46 47 300
47 48 1
48 49 300
50 51 300
51 52 1
52 53 300
53 54 1
54 55 300
55 56 1
56 57 300
57 58 1
58 59 300
59 60 1
60 61 300
61 62 1
62 63 300
63 64 1
64 65 300
65 66 1
66 67 300
67 68 1
68 69 300
69 70 1
70 71 300
71 72 1
72 73 300
73 74 1
74 75 300
75 76 1
76 77 300
77 78 1
78 79 300
79 80 1
80 81 300
81 82 1
82 83 300
83 84 1
84 85 300
85 86 1
86 87 300
87 88 1
88 89 300
89 90 1
90 91 300
91 92 1
92 93 300
93 94 1
94 95 300
95 96 1
96 97 300
97 98 1
1 50 5
2 51 5
3 52 5
4 53 5
5 54 5
6 55 5
7 56 5
8 57 5
9 58 5
10 59 5
11 60 5
12 61 5
13 62 5
14 63 5
15 64 5
16 65 5
17 66 5
18 67 5
19 68 5
20 69 5
21 70 5
22 71 5
23 72 5
24 73 5
25 74 5
26 75 5
27 76 5
28 77 5
29 78 5
30 79 5
31 80 5
32 81 5
33 82 5
34 83 5
35 84 5
36 85 5
37 86 5
38 87 5
39 88 5
40 89 5
41 90 5
42 91 5
43 92 5
44 93 5
45 94 5
46 95 5
47 96 5
48 97 5
49 98 5
50 49 3
-1

My answer is:49 98 97
And I think it was quit correct.
But the output is:

49 50 1 2 51 52 3 4 53 54 5 6 55 56 7 8 57 58 9 10 59 60 11 12 61 62 13 14 63 64 15 16 65 66 17 18 67 68 19 20 69 70 21 22 71 72 23 24 73 74 25 26 75 76 27 28 77 78 29 30 79 80 31 32 81 82 33 34 83 84 35 36 85 86 37 38 87 88 39 40 89 90 41 42 91 92 43 44 93 94 45 46 95 96 47 48 97 98

Can anybody tell me how to solve these questions.

Thank you very much

Same code get stuck at test #18 due to TLE, then at #17, but got accepted when I submit it again. What magic is this :)

Why this code gets Wrong answer #1 (OK) http://acm.timus.ru/getsubmit.aspx/5960728.cpp
and this code gets Runtime error (access violation) #1 (strange) http://acm.timus.ru/getsubmit.aspx/5960730.cpp ?

Please provide some test cases.
Thanks

Test 3:
1
1 1

I tried solve this problem 6 times and 3 of their are WA15,
This WA is expects when uses binsearch, when I replaced type of numbers from long to BigInteger in java, I got AC, in this 15' test intermediate(промежуточные) numbers bigger than 2000000000 or lower than -2000000000, that is why we have wrong answers ))
Good luck!

Edited by author 27.01.2009 21:59

40 минут я сабмитил код который точно проходит первый тест (проверял на трех компиляторах на CF) После, я просто добавил еще одно условие которое я изначально не рассмотрел, это когда в строке ничего менять не надо, или эта строка из нулей и надо добавить 0 или убрать. И ПОЧЕМУ-ТО Я СРАЗУ ПОЛУЧИЛ AC!!! Как это понимать, если эти случаи никак не влияют на ответ на первом тесте ????

1) Let's imagine, that there are n boxes and 1 another box with extra balles, which you didn't place in the first n. So, in fact you have n+1 boxes.
2) We can count the ways of putting red balles separatelly from blue ones. And blue ones separatelly from red. Than just multiply these answers.

A brand new equipment has been installed in meat store recently - the electronic seller. Now the customer can simply come and press the button, and the seller will select the meat piece automatically. The pieces are stored in a special container inside the seller. Different pieces have different weights (all weights are distinct). There are N pieces of meat in the container. The seller works the following way. There is a special register X in seller circuit, with initial value set to 0. In order to satisfy the customer the seller does the following:
All pieces are numbered from 0 to N-1 in order of weight increase.
The piece with number equal to register X value is selected.
The seller retrieves the selected piece from the container and hands it to the customer.
A request for a new piece is sent to a special warehouse. There are M pieces of meat at the warehouse initially (all weights are distinct). When a request comes, a piece with maximal weight is selected and sent to the container. Thus, the total number of pieces in container remains the same, and the warehouse gets empty after serving M requests.
A new value XAB is written into register X which is calculated like this:
XAB = (X · A + B) mod N
Suppose, that the customer requires K pieces. You must write a program that will calculate the sequence of pieces given out by the seller.

Input
The first line contains 5 integer numbers N, M, A, B, K (2 ≤ N, M ≤ 2^16; 1 ≤ K ≤ M; 0 < A < N; 0 ≤ B < N). The second line contains N integers - weights of pieces in the container. The third line contains M integers - weights of pieces in the warehouse. All weights are distinct. All weights are between 1 and 231-1 inclusively.
Output
Output K numbers separated by spaces - weights of pieces in order of giving out.

Input 1    Output 1
3 2 1 1 2
5 1 3
4 2
1 4
Input 2    Output 2
3 3 2 1 3
5 2 3
1 4 6
2 5 3

//Already I compiled programm but n=65536 time limited
This is meat store`s code in c++
#include <iostream.h>
#include <conio.h>
#include <algorithm>
using namespace std;
void qs(int* y, int first, int last)
{
    int i = first, j = last, x = y[(first + last) / 2],xx;

    do {
        while (y[i] < x) i++;
        while (y[j] > x) j--;

        if(i <= j) {
            if (y[i] > y[j]) {xx=y[i];y[i]=y[j];y[j]=xx;}
            i++;
            j--;
        }
    } while (i <= j);

    if (i < last)
        qs(y, i, last);
    if (first < j)
        qs(y, first, j);
}
int main()
{
int n,m,k,a,b;
cin>>n>>m>>a>>b>>k;
int *y,*z,xx;
y=new int[n+1];
z=new int[m+1];
for(int i=0;i<n;i++)
cin>>y[i];
for(int j=0;j<m;j++)
cin>>z[j];
qs(y,0,n-1);
qs(z,0,m-1);
int x=0;
cout<<y[0]<<" ";
int pp;
for(int t=1;t<k;t++)
{
       pp=z[m-t];
        y[x]=y[n/2];
        y[n/2]=pp;
        qs(y,0,n-1);
        x=(x*a+b) % n;
        cout<<y[x]<<" ";

}
//getch();

       // return 0;
}

Edited by author 03.11.2014 22:16

Edited by author 03.11.2014 22:21