A. k-rounding

Codeforces

IDCF858A

Time1000ms

Memory256MB

Difficulty—

brute forcemathnumber theory

For a given positive integer _n_ denote its _k_\-rounding as the minimum positive integer _x_, such that _x_ ends with _k_ or more zeros in base 10 and is divisible by _n_. For example, 4\-rounding of 375 is 375·80 = 30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375. Write a program that will perform the _k_\-rounding of _n_. ## Input The only line contains two integers _n_ and _k_ (1 ≤ _n_ ≤ 109, 0 ≤ _k_ ≤ 8). ## Output Print the _k_\-rounding of _n_. [samples]

Samples

Input #1

375 4

Output #1

Input #2

10000 1

Output #2

Input #3

38101 0

Output #3

Input #4

123456789 8

Output #4

12345678900000000

API Response (JSON)

{
  "problem": {
    "name": "A. k-rounding",
    "description": {
      "content": "For a given positive integer _n_ denote its _k_\\-rounding as the minimum positive integer _x_, such that _x_ ends with _k_ or more zeros in base 10 and is divisible by _n_. For example, 4\\-rounding o",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF858A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "For a given positive integer _n_ denote its _k_\\-rounding as the minimum positive integer _x_, such that _x_ ends with _k_ or more zeros in base 10 and is divisible by _n_.\n\nFor example, 4\\-rounding o...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments