Problem:
Score : 600 points

Problem Statement

Let us define the oddness of a permutation p = {p_1,\ p_2,\ ...,\ p_n} of {1,\ 2,\ ...,\ n} as \sum_{i = 1}^n |i - p_i|.

Find the number of permutations of {1,\ 2,\ ...,\ n} of oddness k, modulo 10^9+7.

Constraints

All values in input are integers.

1 \leq n \leq 50

0 \leq k \leq n^2

Input

Input is given from Standard Input in the following format:

n k

Output

Print the number of permutations of {1,\ 2,\ ...,\ n} of oddness k, modulo 10^9+7.

Sample Input 1

3 2

Sample Output 1

2

There are six permutations of {1,\ 2,\ 3}. Among them, two have oddness of 2: {2,\ 1,\ 3} and {1,\ 3,\ 2}.

Sample Input 2

39 14

Sample Output 2

74764168

Solution in Rust (1.42.0) (judge verdict: Runtime Error)

// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 1_000_000_007;
    }

    #[allow(dead_code)]
    pub struct RuntimeMod;
    static mut RUNTIME_MOD: u32 = 0;
    impl Modulo for RuntimeMod {
        fn modulo() -> u32 {
            unsafe { RUNTIME_MOD }
        }
    }

    #[allow(dead_code)]
    impl RuntimeMod {
        pub fn set_modulo(p: u32) {
            unsafe {
                RUNTIME_MOD = p;
            }
        }
    }

    use std::marker::*;
    use std::ops::*;

    pub trait Modulo {
        fn modulo() -> u32;
    }

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

    pub struct ModularInteger<T>(pub u32, PhantomData<T>);

    impl<T> Clone for ModularInteger<T> {
        fn clone(&self) -> Self {
            ModularInteger::new_unchecked(self.0)
        }
    }

    impl<T> Copy for ModularInteger<T> {}

    impl<T: Modulo> Add for ModularInteger<T> {
        type Output = ModularInteger<T>;
        fn add(self, rhs: Self) -> Self::Output {
            let mut d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModularInteger::new_unchecked(d)
        }
    }

    impl<T: Modulo> AddAssign for ModularInteger<T> {
        fn add_assign(&mut self, rhs: Self) {
            *self = *self + rhs;
        }
    }

    impl<T: Modulo> Sub for ModularInteger<T> {
        type Output = ModularInteger<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            let mut d = T::modulo() + self.0 - rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModularInteger::new_unchecked(d)
        }
    }

    impl<T: Modulo> SubAssign for ModularInteger<T> {
        fn sub_assign(&mut self, rhs: Self) {
            *self = *self - rhs;
        }
    }

    impl<T: Modulo> Mul for ModularInteger<T> {
        type Output = ModularInteger<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
            ModularInteger::new_unchecked(v as u32)
        }
    }

    impl<T: Modulo> MulAssign for ModularInteger<T> {
        fn mul_assign(&mut self, rhs: Self) {
            *self = *self * rhs;
        }
    }

    impl<T: Modulo> Neg for ModularInteger<T> {
        type Output = ModularInteger<T>;
        fn neg(self) -> Self::Output {
            if self.0 == 0 {
                Self::zero()
            } else {
                Self::new_unchecked(T::modulo() - self.0)
            }
        }
    }

    impl<T> std::fmt::Display for ModularInteger<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T: Modulo> std::str::FromStr for ModularInteger<T> {
        type Err = std::num::ParseIntError;
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            let val = s.parse::<u32>()?;
            Ok(ModularInteger::new(val))
        }
    }

    impl<T: Modulo> From<usize> for ModularInteger<T> {
        fn from(val: usize) -> ModularInteger<T> {
            ModularInteger::new_unchecked((val % T::modulo() as usize) as u32)
        }
    }

    impl<T: Modulo> From<i64> for ModularInteger<T> {
        fn from(val: i64) -> ModularInteger<T> {
            let m = T::modulo() as i64;
            ModularInteger::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModularInteger<T> {
        fn new_unchecked(d: u32) -> Self {
            ModularInteger(d, PhantomData)
        }
        pub fn zero() -> Self {
            ModularInteger::new_unchecked(0)
        }
        pub fn one() -> Self {
            ModularInteger::new_unchecked(1)
        }
        pub fn is_zero(&self) -> bool {
            self.0 == 0
        }
    }

    #[allow(dead_code)]
    impl<T: Modulo> ModularInteger<T> {
        pub fn new(d: u32) -> Self {
            ModularInteger::new_unchecked(d % T::modulo())
        }
        pub fn pow(&self, mut n: u32) -> Self {
            let mut t = Self::one();
            let mut s = *self;
            while n > 0 {
                if n & 1 == 1 {
                    t *= s;
                }
                s *= s;
                n >>= 1;
            }
            t
        }
        pub fn inv(&self) -> Self {
            assert!(self.0 != 0);
            self.pow(T::modulo() - 2)
        }
    }

    // ---------- begin Precalc ----------
    #[allow(dead_code)]
    pub struct Precalc<T> {
        inv: Vec<ModularInteger<T>>,
        fact: Vec<ModularInteger<T>>,
        ifact: Vec<ModularInteger<T>>,
    }

    #[allow(dead_code)]
    impl<T: Modulo> Precalc<T> {
        pub fn new(n: usize) -> Precalc<T> {
            let mut inv = vec![ModularInteger::one(); n + 1];
            let mut fact = vec![ModularInteger::one(); n + 1];
            let mut ifact = vec![ModularInteger::one(); n + 1];
            for i in 2..(n + 1) {
                fact[i] = fact[i - 1] * ModularInteger::new_unchecked(i as u32);
            }
            ifact[n] = fact[n].inv();
            if n > 0 {
                inv[n] = ifact[n] * fact[n - 1];
            }
            for i in (1..n).rev() {
                ifact[i] = ifact[i + 1] * ModularInteger::new_unchecked((i + 1) as u32);
                inv[i] = ifact[i] * fact[i - 1];
            }
            Precalc {
                inv: inv,
                fact: fact,
                ifact: ifact,
            }
        }
        pub fn inv(&self, n: usize) -> ModularInteger<T> {
            assert!(n > 0);
            self.inv[n]
        }
        pub fn fact(&self, n: usize) -> ModularInteger<T> {
            self.fact[n]
        }
        pub fn ifact(&self, n: usize) -> ModularInteger<T> {
            self.ifact[n]
        }
        pub fn perm(&self, n: usize, k: usize) -> ModularInteger<T> {
            if k > n {
                ModularInteger::zero()
            } else {
                self.fact[n] * self.ifact[n - k]
            }
        }
        pub fn comb(&self, n: usize, k: usize) -> ModularInteger<T> {
            if k > n {
                return ModularInteger::zero();
            }
            self.fact[n] * self.ifact[k] * self.ifact[n - k]
        }
    }
    // ---------- end Precalc ----------
}
// ---------- end ModInt ----------

use modint::*;
type ModInt = ModularInteger<Mod>;

fn run() {
    proconio::input! {
        n: usize,
        k: usize,
    }
    if k % 2 == 1 {
        println!("0");
        return;
    }
    let mut dp = vec![vec![ModInt::one(); 1]; 1];
    for k in 0..n {
        let mut next = vec![vec![ModInt::zero(); dp[0].len() + dp.len()]; dp.len() + 1];
        for (i, dp) in dp.iter().enumerate() {
            for (j, &v) in dp.iter().enumerate().filter(|p| !p.1.is_zero()) {
                next[i + 1][j + i + 1] += v;
                next[i][j + i] += ModInt::from(2 * i + 1) * v;
                if i > 0 {
                    next[i - 1][j + i - 1] += ModInt::from(i * i) * v;
                }
            }
        }
        dp = next;
        dp.truncate(n - k);
    }
    let ans = dp[0][k / 2];
    println!("{}", ans);
}

fn main() {
    run();
}