Valentine's Day '19 J1 - Rainbow Rating

View as PDF

Submit solution


Points: 3
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

The administrators of DMOJ have become bored with the current rating colours that they have. With the highest possible rating being the infamous Target, they have decided to add a new rating category that is a mixture of multiple colours, the Rainbow Rating. This special category is reserved for those who are able to obtain a rating greater than or equal to 4000. Now, the rating chart is as follows:

Ratings Chart
<1000Newbie
1000-1199Amateur
1200-1499Expert
1500-1799Candidate Master
1800-2199Master
2200-2999Grandmaster
3000-3999Target

Anything above or equal to 4000 will be considered Rainbow Rating, with the distinguished title of Rainbow Master.

You are given the rating of N users. For each user, can you output the category that each user belongs to?

Constraints

1 \le N \le 100

\left|x_i\right| \le 10^9, where x_i is the rating of the i^{th} user

Input Specification

The first line of input will contain N.

The next N lines of input will contain x_i, the rating of the i^{th} user.

Output Specification

According to the rating given, output the rating category the user belongs to.

Sample Input 1

9
3
1001
1309
1567
2000
2999
3502
9999
-1231224

Sample Output 1

Newbie
Amateur
Expert
Candidate Master
Master
Grandmaster
Target
Rainbow Master
Newbie

Comments


  • 7
    Henry_Z  commented on June 9, 2020, 7:06 p.m.

    I like this!