A. Help Far Away Kingdom

Codeforces

IDCF99A

Time2000ms

Memory256MB

Difficulty—

strings

English · Original

Chinese · Translation

Formal · Original

In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there. Most damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Kingdom healers had already had three appointments with the merchants who were asked to sell, say, exactly 0.273549107 beer barrels. To deal with the problem somehow, the King issued an order obliging rounding up all numbers to the closest integer to simplify calculations. Specifically, the order went like this: * If a number's integer part does not end with digit 9 and its fractional part is strictly less than 0.5, then the rounded up number coincides with the number’s integer part. * If a number's integer part does not end with digit 9 and its fractional part is not less than 0.5, the rounded up number is obtained if we add 1 to the last digit of the number’s integer part. * If the number’s integer part ends with digit 9, to round up the numbers one should go to Vasilisa the Wise. In the whole Kingdom she is the only one who can perform the tricky operation of carrying into the next position. Merchants found the algorithm very sophisticated and they asked you (the ACMers) to help them. Can you write a program that would perform the rounding according to the King’s order? ## Input The first line contains a single number to round up — the integer part (a non-empty set of decimal digits that do not start with 0 — with the exception of a case when the set consists of a single digit — in this case 0 can go first), then follows character «_._» (a dot), and then follows the fractional part (any non-empty set of decimal digits). The number's length does not exceed 1000 characters, including the dot. There are no other characters in the input data. ## Output If the last number of the integer part is not equal to 9, print the rounded-up number without leading zeroes. Otherwise, print the message "_GOTO Vasilisa._" (without the quotes). [samples]

[{"iden":"statement","content":"在遥远的王国里，住着国王、王子、鞋匠、裁缝以及其他众多臣民。他们一直幸福地生活着，直到一群ACMer来到了王国。\n\n这些奇怪的生物给王国带来的最大麻烦是，他们热爱高精度数字。结果，王国的药师已经三次约见商人，要求他们出售恰好 #cf_span[0.273549107] 桶啤酒。为了 somehow 解决这个问题，国王颁布了一项命令，要求将所有数字四舍五入到最接近的整数，以简化计算。具体命令如下：\n\n商人发现这个算法非常复杂，于是向你（ACMer）寻求帮助。你能编写一个程序，按照国王的命令进行四舍五入吗？\n\n第一行包含一个待四舍五入的数字——整数部分（一个非空的十进制数字集合，不以 #cf_span[0] 开头，除非该集合仅包含一个数字——此时允许以 0 开头），接着是字符 «_._»（点号），然后是小数部分（任意非空的十进制数字集合）。该数字的长度不超过 #cf_span[1000] 个字符（包括点号）。输入数据中不含其他字符。\n\n如果整数部分的最后一个数字不等于 #cf_span[9]，请输出四舍五入后的数字，且不带前导零；否则，请输出消息 \"_GOTO Vasilisa._\"（不含引号）。"},{"iden":"input","content":"第一行包含一个待四舍五入的数字——整数部分（一个非空的十进制数字集合，不以 #cf_span[0] 开头，除非该集合仅包含一个数字——此时允许以 0 开头），接着是字符 «_._»（点号），然后是小数部分（任意非空的十进制数字集合）。该数字的长度不超过 #cf_span[1000] 个字符（包括点号）。输入数据中不含其他字符。"},{"iden":"output","content":"如果整数部分的最后一个数字不等于 #cf_span[9]，请输出四舍五入后的数字，且不带前导零；否则，请输出消息 \"_GOTO Vasilisa._\"（不含引号）。"},{"iden":"examples","content":"输入0.0输出0输入1.49输出1输入1.50输出2输入2.71828182845904523536输出3输入3.14159265358979323846输出3输入12345678901234567890.1输出12345678901234567890输入123456789123456789.999输出GOTO Vasilisa."}] ]

**Definitions** Let $ N $ be a string representing a non-negative real number in decimal form: $ N = I \cdot d \cdot F $, where: - $ I \in \{0\} \cup \{1,2,\dots,9\}^+ $ is the integer part (non-empty, no leading zeros except for "0"), - $ d = '.' $ is the decimal point, - $ F \in \{0,1,\dots,9\}^+ $ is the fractional part (non-empty). **Constraints** - $ |N| \leq 1000 $ - $ I $ does not start with '0' unless $ I = "0" $ - $ F $ is non-empty **Objective** Let $ d_{\text{last}} $ be the last digit of $ I $. - If $ d_{\text{last}} \neq 9 $, output the integer $ \lceil N \rceil = \text{int}(I) + 1 $, without leading zeros. - If $ d_{\text{last}} = 9 $, output the string `"GOTO Vasilisa."`

Samples

Input #1

0.0

Output #1

Input #2

1.49

Output #2

Input #3

1.50

Output #3

Input #4

2.71828182845904523536

Output #4

Input #5

3.14159265358979323846

Output #5

Input #6

12345678901234567890.1

Output #6

12345678901234567890

Input #7

123456789123456789.999

Output #7

GOTO Vasilisa.

API Response (JSON)

{
  "problem": {
    "name": "A. Help Far Away Kingdom",
    "description": {
      "content": "In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there. Most d",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF99A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there.\n\nMost d...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "[{\"iden\":\"statement\",\"content\":\"在遥远的王国里，住着国王、王子、鞋匠、裁缝以及其他众多臣民。他们一直幸福地生活着，直到一群ACMer来到了王国。\\n\\n这些奇怪的生物给王国带来的最大麻烦是，他们热爱高精度数字。结果，王国的药师已经三次约见商人，要求他们出售恰好 #cf_span[0.273549107] 桶啤酒。为了 somehow 解决这个问题，国王颁布了一项命令...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ N $ be a string representing a non-negative real number in decimal form: $ N = I \\cdot d \\cdot F $, where:  \n- $ I \\in \\{0\\} \\cup \\{1,2,\\dots,9\\}^+ $ is the integer part (non-e...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments