// ---------- begin Scanner(require delimiter) ---------- mod scanner { pub struct Scanner { reader: R, buf: Vec, } #[allow(dead_code)] impl Scanner { pub fn new(reader: R) -> Self { Scanner { reader: reader, buf: Vec::with_capacity(1024), } } fn read(&mut self, del: u8) { self.buf.clear(); self.reader.read_until(del, &mut self.buf).ok(); assert!(self.buf.pop().unwrap() == del); } pub fn next(&mut self, del: u8) -> T { self.read(del); std::str::from_utf8(&self.buf) .unwrap() .trim() .parse::() .ok() .unwrap() } pub fn next_bytes(&mut self, del: u8) -> Vec { self.read(del); std::str::from_utf8(&self.buf) .unwrap() .trim() .bytes() .collect() } } } // ---------- end scanner(require delimiter) ---------- fn main() { let stdin = std::io::stdin(); let mut sc = scanner::Scanner::new(stdin.lock()); run(&mut sc); } fn run(sc: &mut scanner::Scanner) { let n: usize = sc.next(b'\n'); let mut a = vec![0u32; 32 << n]; let mut b = vec![0u32; 32 << n]; for a in a.chunks_exact_mut(32).chain(b.chunks_exact_mut(32)) { for (i, a) in a.iter_mut().enumerate() { let x = sc.next::(if i == 31 { b'\n' } else { b' ' }); *a = x; } } let mut c = vec![0u32; 63 << n]; rec(&mut c, &mut a, &mut b); use std::fmt::*; let mut s = String::new(); for c in c.chunks(63) { for i in 0..63 { let p = c[i] & 1; write!(&mut s, "{} ", p).ok(); } s.pop(); s.push('\n'); } print!("{}", s); } fn rec(c: &mut [u32], a: &mut [u32], b: &mut [u32]) { if a.len() == 32 { for (i, a) in a.iter().enumerate() { for (c, b) in c[i..].iter_mut().zip(b.iter()) { *c += *a * *b; } } return; } let x = c.len() / 2; let (cl, cr) = c.split_at_mut(x); let y = a.len() / 2; let (al, ar) = a.split_at_mut(y); let (bl, br) = b.split_at_mut(y); for (((al, ar), bl), br) in al .iter_mut() .zip(ar.iter_mut()) .zip(bl.iter_mut()) .zip(br.iter_mut()) { let x = *al + *ar; let y = *al - *ar; *al = x; *ar = y; let x = *bl + *br; let y = *bl - *br; *bl = x; *br = y; } rec(cl, al, bl); rec(cr, ar, br); for (a, b) in cl.iter_mut().zip(cr) { let x = (*a + *b) / 2; let y = (*a - *b) / 2; *a = x; *b = y; } }