Nearest All-Odd Number (APCS 2018-06 Advanced Similar)

2.0s 256M

A positive integer is all-odd if every decimal digit is odd. For each \(N\), find the fewest increments or decrements by one needed to reach an all-odd number. Leading zeros are not used.

Input

Read one \(N\) per line until EOF. Each file contains \(1\) to \(1000\) queries.

Constraints

\(1\le N<10^{18}\).

Output

Print the minimum operations for each query.

Scoring

Each scored test independently awards 5 points, totaling 100. Samples award no points.

  • 1: 10% — \(N<100\)
  • 2: 20% — \(N<10^6\)
  • 3: 30% — No additional restrictions.
  • 4: 40% — No additional restrictions.

Sample Input

135
13256
35001
1001

Sample Output

0
55
110
2

Source

e294 · 2018-06 APCS. APCS-style variant, not an official original; this package specifies a query-count bound.

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test and sample test share the sandbox; about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test and sample test both have a 15 second wall-clock cap (the official judge still uses the problem time limit)
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.