Find the b-th bit for the number n on it's 64 bit representation with sign











up vote
3
down vote

favorite













Let n an integer and 0<=b<=63, b natural number. Find the b-th bit for the number n on it's 64 bit representation with sign.




and T be the number of test cases.



This is my attempt:



#include <iostream>
#define f cin
#define g cout
using namespace std;

int T;
long long n;
int b;

int main()
{
f >> T;
for(int i = 1; i <= T; ++i)
{
f >> n >> b;
int ans = 0;
bool ok = true;
while(n)
{
if(b == ans)
{
g << n % 2;
ok = false;
break;
}
n /= 2;
++ans;
}
if(ok) g << 0;
}
return 0;
}


but it does not work on all test cases... also is there another way to do this? or is there another way to store the bits? is there some special libraries? can you do this more efficiently with other tools? can you give me some information to read about bitmasks? and where and when you should use them and how are they usefull?










share|improve this question






















  • What do you mean by sign? 2's complement representation?
    – Mukul Gupta
    Nov 11 at 20:25















up vote
3
down vote

favorite













Let n an integer and 0<=b<=63, b natural number. Find the b-th bit for the number n on it's 64 bit representation with sign.




and T be the number of test cases.



This is my attempt:



#include <iostream>
#define f cin
#define g cout
using namespace std;

int T;
long long n;
int b;

int main()
{
f >> T;
for(int i = 1; i <= T; ++i)
{
f >> n >> b;
int ans = 0;
bool ok = true;
while(n)
{
if(b == ans)
{
g << n % 2;
ok = false;
break;
}
n /= 2;
++ans;
}
if(ok) g << 0;
}
return 0;
}


but it does not work on all test cases... also is there another way to do this? or is there another way to store the bits? is there some special libraries? can you do this more efficiently with other tools? can you give me some information to read about bitmasks? and where and when you should use them and how are they usefull?










share|improve this question






















  • What do you mean by sign? 2's complement representation?
    – Mukul Gupta
    Nov 11 at 20:25













up vote
3
down vote

favorite









up vote
3
down vote

favorite












Let n an integer and 0<=b<=63, b natural number. Find the b-th bit for the number n on it's 64 bit representation with sign.




and T be the number of test cases.



This is my attempt:



#include <iostream>
#define f cin
#define g cout
using namespace std;

int T;
long long n;
int b;

int main()
{
f >> T;
for(int i = 1; i <= T; ++i)
{
f >> n >> b;
int ans = 0;
bool ok = true;
while(n)
{
if(b == ans)
{
g << n % 2;
ok = false;
break;
}
n /= 2;
++ans;
}
if(ok) g << 0;
}
return 0;
}


but it does not work on all test cases... also is there another way to do this? or is there another way to store the bits? is there some special libraries? can you do this more efficiently with other tools? can you give me some information to read about bitmasks? and where and when you should use them and how are they usefull?










share|improve this question














Let n an integer and 0<=b<=63, b natural number. Find the b-th bit for the number n on it's 64 bit representation with sign.




and T be the number of test cases.



This is my attempt:



#include <iostream>
#define f cin
#define g cout
using namespace std;

int T;
long long n;
int b;

int main()
{
f >> T;
for(int i = 1; i <= T; ++i)
{
f >> n >> b;
int ans = 0;
bool ok = true;
while(n)
{
if(b == ans)
{
g << n % 2;
ok = false;
break;
}
n /= 2;
++ans;
}
if(ok) g << 0;
}
return 0;
}


but it does not work on all test cases... also is there another way to do this? or is there another way to store the bits? is there some special libraries? can you do this more efficiently with other tools? can you give me some information to read about bitmasks? and where and when you should use them and how are they usefull?







c++ bitmap bit-manipulation 64bit bit






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Nov 11 at 18:02









C. Cristi

213116




213116












  • What do you mean by sign? 2's complement representation?
    – Mukul Gupta
    Nov 11 at 20:25


















  • What do you mean by sign? 2's complement representation?
    – Mukul Gupta
    Nov 11 at 20:25
















What do you mean by sign? 2's complement representation?
– Mukul Gupta
Nov 11 at 20:25




What do you mean by sign? 2's complement representation?
– Mukul Gupta
Nov 11 at 20:25












1 Answer
1






active

oldest

votes

















up vote
1
down vote













Computers already store the integers in its bitwise representation. All you need are bitwise operators to know a particular bit.



int bthbit(long long n, int b) {
if (n & (1ULL << b)) return 1;
return 0;
}


The solution uses bitwise & operator after left-shifting 1 by b bits. You may want to read about bitwise operators and bitmasks .






share|improve this answer





















  • A working example is ideone.com/v3ZWI1
    – Mukul Gupta
    Nov 11 at 20:42











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53251613%2ffind-the-b-th-bit-for-the-number-n-on-its-64-bit-representation-with-sign%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
1
down vote













Computers already store the integers in its bitwise representation. All you need are bitwise operators to know a particular bit.



int bthbit(long long n, int b) {
if (n & (1ULL << b)) return 1;
return 0;
}


The solution uses bitwise & operator after left-shifting 1 by b bits. You may want to read about bitwise operators and bitmasks .






share|improve this answer





















  • A working example is ideone.com/v3ZWI1
    – Mukul Gupta
    Nov 11 at 20:42















up vote
1
down vote













Computers already store the integers in its bitwise representation. All you need are bitwise operators to know a particular bit.



int bthbit(long long n, int b) {
if (n & (1ULL << b)) return 1;
return 0;
}


The solution uses bitwise & operator after left-shifting 1 by b bits. You may want to read about bitwise operators and bitmasks .






share|improve this answer





















  • A working example is ideone.com/v3ZWI1
    – Mukul Gupta
    Nov 11 at 20:42













up vote
1
down vote










up vote
1
down vote









Computers already store the integers in its bitwise representation. All you need are bitwise operators to know a particular bit.



int bthbit(long long n, int b) {
if (n & (1ULL << b)) return 1;
return 0;
}


The solution uses bitwise & operator after left-shifting 1 by b bits. You may want to read about bitwise operators and bitmasks .






share|improve this answer












Computers already store the integers in its bitwise representation. All you need are bitwise operators to know a particular bit.



int bthbit(long long n, int b) {
if (n & (1ULL << b)) return 1;
return 0;
}


The solution uses bitwise & operator after left-shifting 1 by b bits. You may want to read about bitwise operators and bitmasks .







share|improve this answer












share|improve this answer



share|improve this answer










answered Nov 11 at 20:39









Mukul Gupta

1,01711230




1,01711230












  • A working example is ideone.com/v3ZWI1
    – Mukul Gupta
    Nov 11 at 20:42


















  • A working example is ideone.com/v3ZWI1
    – Mukul Gupta
    Nov 11 at 20:42
















A working example is ideone.com/v3ZWI1
– Mukul Gupta
Nov 11 at 20:42




A working example is ideone.com/v3ZWI1
– Mukul Gupta
Nov 11 at 20:42


















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53251613%2ffind-the-b-th-bit-for-the-number-n-on-its-64-bit-representation-with-sign%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Bressuire

Vorschmack

Quarantine