Submission #31962141


Source Code Expand

use proconio::input;

fn main() {
    input! {
        t: usize,
        case: [(usize, usize); t],
    };
    let f = |x: usize| (x * 10).min(10_usize.pow(x.to_string().len() as u32) + x);
    for (l, r) in case {
        let ans = if f(l) > r {
            r - l + 1
        } else {
            let mut ok = r;
            let mut ng = l;
            while ok - ng > 1 {
                let x = ng + (ok - ng) / 2;
                if f(x) > r {
                    ok = x;
                } else {
                    ng = x;
                }
            }
            r - ok + 1
        };
        println!("{}", ans);
    }
}

Submission Info

Submission Time
Task A - Antichain of Integer Strings
User bouzuya
Language Rust (1.42.0)
Score 400
Code Size 632 Byte
Status AC
Exec Time 47 ms
Memory 2408 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 1
AC × 42
Set Name Test Cases
Sample 01_sample_01.txt
All 01_sample_01.txt, 02_small_01.txt, 02_small_02.txt, 02_small_03.txt, 02_small_04.txt, 02_small_05.txt, 02_small_06.txt, 02_small_07.txt, 02_small_08.txt, 02_small_09.txt, 02_small_10.txt, 02_small_11.txt, 02_small_12.txt, 02_small_13.txt, 02_small_14.txt, 02_small_15.txt, 02_small_16.txt, 02_small_17.txt, 02_small_18.txt, 02_small_19.txt, 02_small_20.txt, 02_small_21.txt, 02_small_22.txt, 02_small_23.txt, 02_small_24.txt, 03_rand_01.txt, 03_rand_02.txt, 03_rand_03.txt, 03_rand_04.txt, 03_rand_05.txt, 04_near_1_01.txt, 04_near_1_02.txt, 04_near_1_03.txt, 04_near_1_04.txt, 04_near_1_05.txt, 04_near_1_06.txt, 04_near_1_07.txt, 04_near_1_08.txt, 04_near_1_09.txt, 04_near_1_10.txt, 05_near_2_01.txt, 05_near_2_02.txt
Case Name Status Exec Time Memory
01_sample_01.txt AC 6 ms 2044 KiB
02_small_01.txt AC 29 ms 2200 KiB
02_small_02.txt AC 33 ms 2196 KiB
02_small_03.txt AC 32 ms 2236 KiB
02_small_04.txt AC 34 ms 2116 KiB
02_small_05.txt AC 33 ms 2060 KiB
02_small_06.txt AC 33 ms 2124 KiB
02_small_07.txt AC 32 ms 2232 KiB
02_small_08.txt AC 29 ms 2112 KiB
02_small_09.txt AC 32 ms 2336 KiB
02_small_10.txt AC 33 ms 2336 KiB
02_small_11.txt AC 30 ms 2236 KiB
02_small_12.txt AC 34 ms 2220 KiB
02_small_13.txt AC 30 ms 2240 KiB
02_small_14.txt AC 31 ms 2276 KiB
02_small_15.txt AC 28 ms 2176 KiB
02_small_16.txt AC 33 ms 2200 KiB
02_small_17.txt AC 34 ms 2296 KiB
02_small_18.txt AC 30 ms 2228 KiB
02_small_19.txt AC 30 ms 2204 KiB
02_small_20.txt AC 35 ms 2264 KiB
02_small_21.txt AC 35 ms 2188 KiB
02_small_22.txt AC 34 ms 2200 KiB
02_small_23.txt AC 33 ms 2224 KiB
02_small_24.txt AC 31 ms 2204 KiB
03_rand_01.txt AC 35 ms 2364 KiB
03_rand_02.txt AC 36 ms 2200 KiB
03_rand_03.txt AC 36 ms 2284 KiB
03_rand_04.txt AC 33 ms 2280 KiB
03_rand_05.txt AC 33 ms 2288 KiB
04_near_1_01.txt AC 46 ms 2316 KiB
04_near_1_02.txt AC 42 ms 2308 KiB
04_near_1_03.txt AC 42 ms 2380 KiB
04_near_1_04.txt AC 39 ms 2172 KiB
04_near_1_05.txt AC 42 ms 2188 KiB
04_near_1_06.txt AC 43 ms 2256 KiB
04_near_1_07.txt AC 47 ms 2296 KiB
04_near_1_08.txt AC 39 ms 2272 KiB
04_near_1_09.txt AC 42 ms 2264 KiB
04_near_1_10.txt AC 43 ms 2408 KiB
05_near_2_01.txt AC 31 ms 2156 KiB
05_near_2_02.txt AC 32 ms 2292 KiB