1 unstable release

0.1.0 Jun 27, 2019

#2755 in Data structures

Download history 84/week @ 2024-11-16 138/week @ 2024-11-23 136/week @ 2024-11-30 247/week @ 2024-12-07 351/week @ 2024-12-14 239/week @ 2024-12-21 438/week @ 2024-12-28 336/week @ 2025-01-04 579/week @ 2025-01-11 296/week @ 2025-01-18 205/week @ 2025-01-25 350/week @ 2025-02-01 472/week @ 2025-02-08 297/week @ 2025-02-15 458/week @ 2025-02-22 212/week @ 2025-03-01

1,525 downloads per month
Used in 3 crates

MIT license

13KB
378 lines

bitset-fixed

Bitset for DP.

Example

Example for AGC20-C

use bitset_fixed::BitSet;
use rand::prelude::*;

fn main() {
    let mut rng = StdRng::seed_from_u64(114514);

    let n: Vec<usize> = (0..25).map(|_| rng.next_u32() as usize % 2000).collect();
    let sum = n.iter().sum::<usize>();

    let mut bitset = BitSet::new(sum + 1);
    bitset.set(0, true);

    for &x in &n {
        bitset |= &(&bitset << x);
    }

    let ans = ((sum + 1) / 2..).find(|&i| bitset[i]).unwrap();

    println!("N = {:?}\nAnswer = {}", n, ans);
}

No runtime deps