Valentine's Day '18 J1 - The Cactus Number

View as PDF

Submit solution


Points: 3 (partial)
Time limit: 1.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

Being a cuteness connoisseur, Carol has devised a system of measuring cuteness called "Carol Numbers", where one Carol number represents her own cuteness in a natural state.

Cactus numbers are said to represent ten times the cuteness as a Carol number. Some say that Cactus numbers do not exist, as a Carol number should be the highest conceivable value of cuteness. You will receive N Carol numbers, given in insignificant units as there are rarely Carol numbers above 1. One insignificant Carol is 1/1000 of a Carol. Is the Carol number truly the highest possible cuteness?

Constraints

1 \le N, K_i \le 10^6

Input Specification

The first line will contain N, the number of values.

Each of the following N lines will contain an integer K_i, representing the ith Carol number, represented as cuteness in insignificant Carols.

Output Specification

If any Carol number above 10 exists, output Something is wrong with these cuteness values.

If any Carol number above 1 exists, but no Carol number above 10 exists, output Cuteness by definition is similarity to Cactus.

If no Carol numbers above 1 exist, output Cuteness by definition is similarity to Carol.

Sample Input

3
500
800
1000

Sample Output

Cuteness by definition is similarity to Carol

Sample Input

5
34
7564
345
654
2

Sample Output

Cuteness by definition is similarity to Cactus

Comments


  • 1
    Julien  commented on Jan. 9, 2020, 4:20 p.m.

    Does anyone know how I can get past a TLE?


    • 3
      Dingledooper  commented on Jan. 9, 2020, 6:46 p.m.

      Put these two lines at the beginning of your code. The input will be faster.

      import sys
      input = sys.stdin.readline