Digital step code language: c

ArticleDirectory

• Digital steps

Digital step time limit: 1000 ms memory limit: 10000 k total time limit: 3000 Ms

Description:

Starting from the point (0, 0) of the plane coordinate, we can write all non-negative integers 0, 1, 2 ,.......
For example, 1, 2, and 3 are written at (1, 1), (2, 0), and (3, 1) respectively. Then we can continue to write all the numbers in this format:

Now you need to writeProgramRead the coordinate points (x, y) to determine the number (if any) at this point. (x, y) are all numbers between 0 and 5000.

Input:

The first line is the number n (n <1000), indicating the number of test data. Next, there will be n with test data, and each row will have
The two numbers represent the coordinates of X and Y, respectively.

Output:

For the X and Y input in each row, the number of the vertex is output, with one row. If there is no number at this point, print no number.

Input example:

3
4 2
6 6
3 4

Output example:

6
12
No number

Tip:

 

Source:

2006 Northwestern University Program Design Competition finals E

 

Code:

2. # Include <stdio. h>
4. # Include <stdlib. h>
8. Int main ()
10. {
12. Int N;
14. Int I, J;
16. Scanf ("% d", & N );
18. Int **;
20. A = (INT **) malloc (N * sizeof (int *));
22. For (I = 0; I <n; I ++)
24. {
26. A [I] = (int *) malloc (2 * sizeof (INT ));
28. }
30. For (I = 0; I <n; I ++)
32. {
34. For (j = 0; j <2; j ++)
36. {
38. Scanf ("% d", & A [I] [J]);
40. }
42. }
44. For (I = 0; I <n; I ++)
46. {
48. If (A [I] [0] % 2 = 0 & A [I] [1] % 2 = 0)
50. Printf ("% d \ n", a [I] [0] + A [I] [1]);
52. Else if (a [I] [0] % 2! = 0 & A [I] [1] % 2! = 0)
54. Printf ("% d \ n", a [I] [0] + A [I] [1]-1 );
56. Else
58. Printf ("no number \ n ");
60. }
62. Return 0;
64. }
68.