A. Working With Locks

Codeforces

IDCF10253A

Time3000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

It's the first day of summer vacation and school hasn't come along yet to end it! This time, Dr. Doofenshmirtz is up to something again, and it's up to Perry the Platypus to stop him. To get to the mad doctor's lair, Agent P needs to unlock a door that's keeping him captive. The good news is that Agent P managed to make an imprint of a key and duplicate it. The bad news is that he doesn't know if the key he has matches the lock that's on the door. The Flynn-Fletcher household has a total of five different locks and five different keys. The keys are numbered #1 to #5. The locks are numbered #1 to #5. In particular: Perry has a copy of key $k$, and the door is locked by lock $L$. Output _"GOOD LUCK AGENT P"_ if Perry can open the lock. Otherwise, output _"CURSE YOU"_ if he can't open the lock. Each test case contains two lines. The first line contains the integer $k$, while the second line contains the integer $L$. *Constraints* $1 <= k <= 5$ $1 <= L <= 5$ *Note:* In general, the constraints for each problem are _guaranteed_. You don't have to check them yourself; you may assume that they are always true. Output a single line containing one of the following strings: ## Input Each test case contains two lines. The first line contains the integer $k$, while the second line contains the integer $L$.*Constraints*$1 <= k <= 5$$1 <= L <= 5$*Note:* In general, the constraints for each problem are _guaranteed_. You don't have to check them yourself; you may assume that they are always true. ## Output Output a single line containing one of the following strings: "_GOOD LUCK AGENT P_" (without quotes) if Perry can open the lock. "_CURSE YOU_" (without quotes) otherwise. [samples]

**Definitions** Let $ t \in \mathbb{Z} $ be the number of test cases. For each test case $ k \in \{1, \dots, t\} $: - Let $ s_k \in \Sigma^* $ be the entered password. - Let $ t_k \in \Sigma^* $ be the correct password, where $ \Sigma $ is the set of all printable ASCII characters (including spaces and case-sensitive letters). **Objective** For each test case $ k $, compute the Levenshtein distance: $$ d_k = \text{lev}(s_k, t_k) $$ where $ \text{lev}(s_k, t_k) $ is the minimum number of single-character insertions, deletions, or substitutions required to transform $ s_k $ into $ t_k $.

API Response (JSON)

{
  "problem": {
    "name": "A. Working With Locks",
    "description": {
      "content": "It's the first day of summer vacation and school hasn't come along yet to end it! This time, Dr. Doofenshmirtz is up to something again, and it's up to Perry the Platypus to stop him. To get to the ma",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 3000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10253A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "It's the first day of summer vacation and school hasn't come along yet to end it! This time, Dr. Doofenshmirtz is up to something again, and it's up to Perry the Platypus to stop him. To get to the ma...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ t \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case $ k \\in \\{1, \\dots, t\\} $:  \n- Let $ s_k \\in \\Sigma^* $ be the entered password.  \n- Let $ t_k \\in \\Sigma^*...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments