$00$:$01$:$45$:$36$

Problem

$9.$ Submissions

Python $3$

Find Bits

Accuracy $25\mathrm{.}096$

Submisvions: $4$ t

Peints: $10$

You are given $2$ positive numbers $n$ and $x.$ Your task is to find out the number of i such that $0i<msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mtext></mtext></mrow></msup>$ and have bitwise$-$and with $x$ equal to $x$ itself given that $1x<msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup>$

Formally : Find out the number of i such that isx $=x$ given that $11,x<msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup>$

Example $1$:

Input:

$n=4$

$x=3$

Output : $4$

Explanation :

For the values of $.15$ bitwiscerand of i with $)=(3$ wall gowe x tselt

Example $2$:

$n=4$

$x=15$

Output: $1$