Linked Questions

I have a bitboard and I want to check in C if there is ONLY one bit set to 1. #include <stdint.h> typedef uint64_t bboard; bboard b = 0x0000000000000010; if (only_one_bit_set_to_one (b)) // in ...

Possible Duplicate: How to check if a number is a power of 2 I made the following code, but it's not working. The compiler gives an error that for a missing ) and expression syntax error. What is ...

Possible Duplicate: How to check if a number is a power of 2 I want to determine if a number is in 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 ... I tried this: public static void ...

Possible Duplicate: How to check if a number is a power of 2 This question has been asked in an interview. How to check if a number is in 2^n format {1, 2, 4, 8, 16, 32, ....} without using *, ...

Possible Duplicate: How to check if a number is a power of 2 How could I write a method that would return true if passed in the value 2, 4, 8, 32, 64, and so on?

Possible Duplicates: Query about working out whether number is a power of 2 How to check if a number is a power of 2 I require a function body for this prototype: bool isPOT(int x); So it ...

Possible Duplicate: How to check if a number is a power of 2 fastest way to find a given number 'n' can be expressed as 2^m ex: 16= 2^4 naive solution: divide given number by 2 until the ...

I know this method and it is not efficient enough (a/2)%2==0;

Note, this is not a dupe of this question: Testing if a bitmask has one and only one flag I need to validate whether or not a bitmask consists of multiple flags. I've come up with this method, but ...

What is the most efficient (in terms of speed and space) way to check if a decimal number only has a single '1' in its binary representation without using special functions (math, numpy, etc.)? e.g. ...

public class test{ public static void main(String[] args) { int a=536870912; System.out.print((Math.log(a)/Math.log(2))); } } 536870912 is a number that is power of two, but the result is ...

Sorry if this is a stupid question but I just want to know whats the actual meaning of the if statement below. int rank, numprocs; MPI_Status status; MPI_Init(&argc,&argv); MPI_Comm_size( ...

I want to test whether any single bit is set in a C int. I don't care which bit it is. Equivalent to if (1 == count_bits (n)) I'm curious if there is a non-looping algorithm for this which does not ...

What is the fastest (in asymptotic worst-case time complexity) algorithm for determining if a sum of arbitrary positive integers is a power of two?

This question is from job interview...Use this template to write a C++ function that checks if a positive integer is a power of two. bool p(int n) { return ********; } You have to replace the 8 '*...