Once again Bitwise2 shooting 18-th task (per bit conjunction) VK's News Wire as of 09/04/2018

I still cannot realize the reason for hiding Bitwise2 technique from public.
Those ones who could understand Bitwise2 idea became automatically armed with suggested approach. The rest would  reproduce Informatic's "BU" logic
uncountable number of times ( each time for every case ).

Code bellow follows core ideas of A. V. Zdvizhkova
See http://kpolyakov.spb.ru/download/bitwise2.pdf
(page 6)

(¬Z(28)v¬Z(45)) => (Z(48) => ¬A) = 1
¬(Z(28)^Z(45))  => (¬Z(48)v¬ A)    = 1
Z(28)^Z(45) v ¬((Z(48)^A) = 1
Z(48)^A => Z(28)^Z(45)
Z(48)^A => Z(28 OR 45)
*********************************
Per bit disjunction 28 v 45 = 61
********************************
45 = 101101
v
28 = 011100
=================
61 = 111101
48 = 110000
=================
A = 001101  = 13 (decimal)

Solution suggested at VK News Wire for same task

https://vk.com/informatics_100?z=photo-40390768_456255272%2Falbum-40390768_251859617