Count of submasks of array[i] present in array

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:13:11
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

Detailed →

Count of submasks of array[i] present in array

Revision en2, by plag-reporter, 2023-01-11 06:13:43

How do I find count of j's such that array[i] | array[j] = array[i] ? Here, '|' is bitwise OR operator.I was thinking of this while solving today's(round 843) problem B. |array| <= 1e5 , max(array) <= 1e18

bitmasks, bitwise operators, codeforces round 843

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		plag-reporter	2023-01-11 06:13:43	9
	en1		plag-reporter	2023-01-10 19:58:30	253	Initial revision (published)