DISTRIBUTION OF TOFFEES
All submissions for this problem are available.
Teacher Suki loves her students very much. Now, she wants to distribute toffees among her students. She has a bag full of toffees. Since, she doesn't have time for counting, each time she randomly picks up some toffees from the bag and gives them to a student. Now, she doesn't want to be called a bad teacher, so she wants the toffees to be equally distributed as far as possible. She will be called a bad teacher if any student gets at least two toffees more than any other student. Otherwise, she will be called a good teacher.
Given the number of students and the number of toffees each student gets, can you say whether we should call her a bad teacher?
- First line contains t, the number of test cases. The first line of each test case contains n, the number of students. The next line consists of n space separated numbers xi (1 <= i <= n), denoting the number of toffees ith student gets.
- Print “GOOD” (without quotes), if Teacher Suki can be called a good teacher, print “BAD” (without quotes) otherwise. Print each answer in a new line.
- 1 <= t <= 100
- 1 <= n <= 10 5
- 1 <= xi <= 10 9
Input: 2 3 2 2 1 3 1 5 4 Output:
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions