首页 > 其他 > 详细

hdu 5142 NPY and FFT

时间:2015-06-08 19:25:40      阅读:374      评论:0      收藏:0      [点我收藏+]

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=5142

NPY and FFT

Description

A boy named NPY is learning FFT algorithm now.In that algorithm,he needs to do an operation called "reverse".
For example,if the given number is 10.Its binary representaion is 1010.After reversing,the binary number will be 0101.And then we should ignore the leading zero.Then the number we get will be 5,whose binary representaion is 101.
NPY is very interested in this operation.For every given number,he want to know what number he will get after reversing.Can you help him?

Input

The first line contains a integer T — the number of queries $(1 \leq T \leq 100).$
The next T lines,each contains a integer $\begin{align*}X(0 \leq X \leq 2^{31}-1)\end{align*}$,the given number.

Output

For each query,print the reversed number in a separate line.

Sample Input

3
6
8
1

Sample Output

3
1
1

想用位运算写,结果写不来只好用笨办法写了。。

技术分享
 1 #include<cstring>
 2 #include<cstdio>
 3 #include<cmath>
 4 int buf[40];
 5 void go(int n) {
 6     int i, j = 0, res = 0;
 7     memset(buf, 0, sizeof(buf));
 8     do buf[j++] = n % 2; while (n /= 2);
 9     for (i = j - 1; ~i; i--) res += buf[i] * (int)pow(2, j - i - 1);
10     printf("%d\n", res);
11 }
12 int main() {
13     int t, n;
14     scanf("%d", &t);
15     while (t--) scanf("%d", &n), go(n);
16     return 0;
17 }
View Code

 

hdu 5142 NPY and FFT

原文:http://www.cnblogs.com/GadyPu/p/4561594.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!