CF1064B.Equations of Mathematical Magic

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Colossal! — exclaimed Hawk-nose. — A programmer! That's exactly what we are looking for.

Arkadi and Boris Strugatsky. Monday starts on Saturday

Reading the book "Equations of Mathematical Magic" Roman Oira-Oira and Cristobal Junta found an interesting equation: a(ax)x=0a - (a \oplus x) - x = 0 for some given aa , where \oplus stands for a bitwise exclusive or (XOR) of two integers (this operation is denoted as ^ or xor in many modern programming languages). Oira-Oira quickly found some xx , which is the solution of the equation, but Cristobal Junta decided that Oira-Oira's result is not interesting enough, so he asked his colleague how many non-negative solutions of this equation exist. This task turned out to be too difficult for Oira-Oira, so he asks you to help.

输入格式

Each test contains several possible values of aa and your task is to find the number of equation's solution for each of them. The first line contains an integer tt ( 1t10001 \le t \le 1000 ) — the number of these values.

The following tt lines contain the values of parameter aa , each value is an integer from 00 to 23012^{30} - 1 inclusive.

输出格式

For each value of aa print exactly one integer — the number of non-negative solutions of the equation for the given value of the parameter. Print answers in the same order as values of aa appear in the input.

One can show that the number of solutions is always finite.

输入输出样例

  • 输入#1

    3
    0
    2
    1073741823
    

    输出#1

    1
    2
    1073741824
    

说明/提示

Let's define the bitwise exclusive OR (XOR) operation. Given two integers xx and yy , consider their binary representations (possibly with leading zeroes): xkx2x1x0x_k \dots x_2 x_1 x_0 and yky2y1y0y_k \dots y_2 y_1 y_0 . Here, xix_i is the ii -th bit of the number xx and yiy_i is the ii -th bit of the number yy . Let r=xyr = x \oplus y be the result of the XOR operation of xx and yy . Then rr is defined as rkr2r1r0r_k \dots r_2 r_1 r_0 where:

$$ r_i = \left\{ \begin{aligned} 1, ~ \text{if} ~ x_i \ne y_i \\ 0, ~ \text{if} ~ x_i = y_i \end{aligned} \right. $$ </p><p>For the first value of the parameter, only $x = 0$ is a solution of the equation.</p><p>For the second value of the parameter, solutions are $x = 0$ and $x = 2$$$.
首页