#614817 (Rust) No.1383 Numbers of Product

• 問題: No.1383 Numbers of Product
• ユーザー: akakimidori
• 提出日時: 2021-02-07 21:15:31
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 338 ms / 2,000 ms
• コード長: 2,914 bytes
• コンパイル時間: 12,831 ms
• コンパイル使用メモリ: 379,384 KB
• 実行使用メモリ: 38,016 KB
• 最終ジャッジ日時: 2024-11-22 23:15:28
• 合計ジャッジ時間: 22,614 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 51

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
fn run() {
    input! {
        up: u64,
        k: u64,
        target: u64,
    }
    let mut map = std::collections::BTreeMap::new();
    for b in 2u64..50 {
        for a in 1u64.. {
            let mut val = 1u64;
            for i in 0u64..=b {
                val = val.saturating_mul(a.saturating_add(i.saturating_mul(k)));
            }
            if val > up {
                break;
            }
            *map.entry(val).or_insert(0) += 1;
        }
    }
    let f = |a: u64| a.saturating_mul(a.saturating_add(k));
    let mut ans = 0;
    let mut hit = 0;
    for (val, mut cnt) in map {
        let mut ok = 1;
        let mut ng = 2;
        while f(ng) <= val {
            ok = ng;
            ng *= 2;
        }
        while ng - ok > 1 {
            let mid = (ok + ng) / 2;
            if f(mid) <= val {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        if f(ok) == val {
            cnt += 1;
            hit += 1;
        }
        if cnt == target {
            ans += 1;
        }
    }
    if target == 1 {
        let mut ok = 0;
        let mut ng = 1;
        while f(ng) <= up {
            ok = ng;
            ng *= 2;
        }
        while ng - ok > 1 {
            let mid = (ok + ng) / 2;
            if f(mid) <= up {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        ans += ok - hit;
    }
    println!("{}", ans);
}
fn main() {
    run();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX