-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEven numbers.cpp
85 lines (41 loc) · 957 Bytes
/
Even numbers.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
///Status : AC
///Remark :
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#include<bits/stdc++.h>
#define nl ("\n")
using namespace std;
inline void FAST_IO(){ios_base::sync_with_stdio(false);}
int main()
{
FAST_IO();
#ifndef ONLINE_JUDGE
ifstream cin("/home/aditya/Documents/ip");
#endif
//ofstream cout("/home/aditya/Documents/op");
int t; cin>>t;while(t--){
ll n;
cin>>n;
if(n&1){ cout<<n<<nl; continue;}
bitset<64> bset(n);
int bits = floor(log2(n))+1;
//for(int i=0;i<bits;i++) cout<<bset[i]<<" ";
/*
string s="";
for(int i=0;i<bits;i++) s+= ( (bset[i])?'1':'0');
cout<<s<<nl;
*/
// reverse(whole(s));
// bitset<64> revset(s);
// cout<<revset.to_ulong();
// cout<<nl<<" bits= "<<bits<<nl;
bitset<64> rev;
for(int i=0;i<bits;i++)
{
rev[i]= bset[bits-i-1];
}
// for(int i=0;i<bits;i++) cout<<rev[i]<<" ";
cout<<rev.to_ulong()<<nl;
}
}