C. INTERCALC

Codeforces

IDCF784C

Time2000ms

Memory64MB

Difficulty—

implementation

English · Original

Chinese · Translation

Formal · Original

_DO YOU EXPECT ME TO FIND THIS OUT?_ _WHAT BASE AND/XOR LANGUAGE INCLUDES string?_ _DON'T BYTE OF MORE THAN YOU CAN CHEW_ _YOU CAN ONLY DISTORT THE LARGEST OF MATHEMATICS SO FAR_ _SAYING "ABRACADABRA" WITHOUT A MAGIC AND WON'T DO YOU ANY GOOD_ _THE LAST STACK RUPTURES. ALL DIE. OH, THE EMBARRASSMENT!_ _I HAVE NO ARRAY AND I MUST SCREAM_ _ELEMENTS MAY NOT BE STORED IN WEST HYPERSPACE_ ## Input The first line of input data contains a single integer _n_ (1 ≤ _n_ ≤ 10). The second line of input data contains _n_ space-separated integers _a__i_ (1 ≤ _a__i_ ≤ 11). ## Output Output a single integer. [samples]

_DO YOU EXPECT ME TO FIND THIS OUT?_ _WHAT BASE AND/XOR LANGUAGE INCLUDES string?_ _DON'T BYTE OF MORE THAN YOU CAN CHEW_ _YOU CAN ONLY DISTORT THE LARGEST OF MATHEMATICS SO FAR_ _SAYING "ABRACADABRA" WITHOUT A MAGIC AND WON'T DO YOU ANY GOOD_ _THE LAST STACK RUPTURES. ALL DIE. OH, THE EMBARRASSMENT!_ _I HAVE NO ARRAY AND I MUST SCREAM_ _ELEMENTS MAY NOT BE STORED IN WEST HYPERSPACE_ 输入数据的第一行包含一个整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 10]）。输入数据的第二行包含 #cf_span[n] 个用空格分隔的整数 #cf_span[ai]（#cf_span[1 ≤ ai ≤ 11]）。请输出一个整数。 ## Input 输入数据的第一行包含一个整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 10]）。输入数据的第二行包含 #cf_span[n] 个用空格分隔的整数 #cf_span[ai]（#cf_span[1 ≤ ai ≤ 11]）。 ## Output 请输出一个整数。 [samples]

Let $ n \in \mathbb{N} $, $ 1 \leq n \leq 10 $. Let $ a = (a_1, a_2, \dots, a_n) $, where each $ a_i \in \mathbb{N} $, $ 1 \leq a_i \leq 11 $. Output: $ \bigoplus_{i=1}^n a_i $, the bitwise XOR of all elements in $ a $.

Samples

Input #1

4
2 5 3 1

Output #1

API Response (JSON)

{
  "problem": {
    "name": "C. INTERCALC",
    "description": {
      "content": "_DO YOU EXPECT ME TO FIND THIS OUT?_ _WHAT BASE AND/XOR LANGUAGE INCLUDES string?_ _DON'T BYTE OF MORE THAN YOU CAN CHEW_ _YOU CAN ONLY DISTORT THE LARGEST OF MATHEMATICS SO FAR_ _SAYING \"ABRACADA",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 65536
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF784C"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "_DO YOU EXPECT ME TO FIND THIS OUT?_\n\n_WHAT BASE AND/XOR LANGUAGE INCLUDES string?_\n\n_DON'T BYTE OF MORE THAN YOU CAN CHEW_\n\n_YOU CAN ONLY DISTORT THE LARGEST OF MATHEMATICS SO FAR_\n\n_SAYING \"ABRACADA...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "_DO YOU EXPECT ME TO FIND THIS OUT?_\n\n_WHAT BASE AND/XOR LANGUAGE INCLUDES string?_\n\n_DON'T BYTE OF MORE THAN YOU CAN CHEW_\n\n_YOU CAN ONLY DISTORT THE LARGEST OF MATHEMATICS SO FAR_\n\n_SAYING \"ABRACADA...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "Let $ n \\in \\mathbb{N} $, $ 1 \\leq n \\leq 10 $.\n\nLet $ a = (a_1, a_2, \\dots, a_n) $, where each $ a_i \\in \\mathbb{N} $, $ 1 \\leq a_i \\leq 11 $.\n\nOutput: $ \\bigoplus_{i=1}^n a_i $, the bitwise XOR of a...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments