TopCoder Statistics - Problem Statement

Problem Statement

Brus and Gogo came to the zoo today. It's the season when deer shed their antlers. There are N deer in the zoo. Initially, each deer had exactly two antlers, but since then some deer may have lost one or both antlers. (Now there may be some deer with two antlers, some with one, and some with no antlers at all.)

Brus and Gogo went through the deer enclosure and they collected all the antlers already lost by the deer. The deer have lost exactly K antlers in total. Brus and Gogo are now trying to calculate how many deer have not lost any antlers yet.

Return a int[] with exactly two elements {x,y}, where x is the smallest possible number of deer that still have two antlers, and y is the largest possible number of those deer.

Definition

Class:: DeerInZooDivTwo
Method:: getminmax
Parameters:: int, int
Returns:: int[]
Method signature:: int[] getminmax(int N, int K)
(be sure your method is public)

Constraints

N will be between 1 and 1000, inclusive.
K will be between 0 and 2N, inclusive.

Examples

1

0

Returns: {1, 1 }
1

1

Returns: {0, 0 }
1

2

Returns: {0, 0 }
2

0

Returns: {2, 2 }
2

1

Returns: {1, 1 }
2

2

Returns: {0, 1 }
2

3

Returns: {0, 0 }
2

4

Returns: {0, 0 }
3

0

Returns: {3, 3 }
3

1

Returns: {2, 2 }
3

2

Returns: {1, 2 }

There are two possibilities: Either the K=2 antlers come from two different deer, or they come from the same deer. In the first case, there is 1 deer with two antlers (and two other with one antler each), in the second case there are 2 deer with two antlers each (and one deer with none).
3

3

Returns: {0, 1 }
3

4

Returns: {0, 1 }
3

5

Returns: {0, 0 }
3

6

Returns: {0, 0 }
10

0

Returns: {10, 10 }

All deer still have 2 horns.
519

345

Returns: {174, 346 }
942

1427

Returns: {0, 228 }
958

1267

Returns: {0, 324 }
975

49

Returns: {926, 950 }
267

271

Returns: {0, 131 }
337

325

Returns: {12, 174 }
796

1589

Returns: {0, 1 }
683

250

Returns: {433, 558 }
566

403

Returns: {163, 364 }
172

91

Returns: {81, 126 }
370

393

Returns: {0, 173 }
915

1104

Returns: {0, 363 }
912

1711

Returns: {0, 56 }
68

77

Returns: {0, 29 }
778

697

Returns: {81, 429 }
106

76

Returns: {30, 68 }
142

160

Returns: {0, 62 }
301

275

Returns: {26, 163 }
364

12

Returns: {352, 358 }
306

339

Returns: {0, 136 }
363

156

Returns: {207, 285 }
126

39

Returns: {87, 106 }
970

58

Returns: {912, 941 }
655

1289

Returns: {0, 10 }
227

177

Returns: {50, 138 }
984

139

Returns: {845, 914 }
977

433

Returns: {544, 760 }
649

533

Returns: {116, 382 }
780

1290

Returns: {0, 135 }
883

412

Returns: {471, 677 }
937

1434

Returns: {0, 220 }
80

93

Returns: {0, 33 }
348

378

Returns: {0, 159 }
603

729

Returns: {0, 238 }
402

597

Returns: {0, 103 }
161

292

Returns: {0, 15 }
887

1153

Returns: {0, 310 }
654

321

Returns: {333, 493 }
435

355

Returns: {80, 257 }
275

340

Returns: {0, 105 }
14

19

Returns: {0, 4 }
206

350

Returns: {0, 31 }
113

49

Returns: {64, 88 }
287

82

Returns: {205, 246 }
614

1015

Returns: {0, 106 }
965

609

Returns: {356, 660 }
969

517

Returns: {452, 710 }
882

1091

Returns: {0, 336 }
434

107

Returns: {327, 380 }
100

193

Returns: {0, 3 }
100

100

Returns: {0, 50 }
100

0

Returns: {100, 100 }
5

2

Returns: {3, 4 }
650

350

Returns: {300, 475 }
5

10

Returns: {0, 0 }
10

5

Returns: {5, 7 }
7

3

Returns: {4, 5 }

Statistics

Problem Statement for "DeerInZooDivTwo"

Problem Statement

Definition

Constraints

Examples