Sort by

recency

|

561 Discussions

|

  • + 0 comments

    It's close to the hardware, which makes it perfect for system-level programming. Once you understand pointers and memory management, everything else becomes much clearer—even in higher-level languages. 11xplay com create account

  • + 0 comments

    n this challenge, you will use logical bitwise operators. All data is stored in its binary representation. The logical operators, and C language, use to represent true and to represent false. The logical operators compare bits in two numbers and return true or false, or , for each bit compared.

    Bitwise AND operator & The output of bitwise AND is 1 if the corresponding bits of two operands is 1. If either bit of an operand is 0, the result of corresponding bit is evaluated to 0. It is denoted by &.

    Bitwise OR operator | The output of bitwise OR is 1 if at least one corresponding bit of two operands is 1. It is denoted by |.

    Bitwise XOR (exclusive OR) operator ^ The result of bitwise XOR operator is 1 if the corresponding bits of two operands are opposite. It is denoted by .

    For example, for integers 3 and 5,

    3 = 00000011 (In Binary) 5 = 00000101 (In Binary)

    AND operation OR operation XOR operation 00000011 00000011 00000011 & 00000101 | 00000101 ^ 00000101 ____ ____ ____ 00000001 = 1 00000111 = 7 00000110 = 6 You will be given an integer , and a threshold, i1nnik$. Print the results of the and, or and exclusive or comparisons on separate lines, in that order.

    Example

    The results of the comparisons are below:

    a b and or xor 1 2 0 3 3 1 3 1 3 2 2 3 2 3 1 For the and comparison, the maximum is . For the or comparison, none of the values is less than , so the maximum is . For the xor comparison, the maximum value less than is . The function should print:

    2 0 2 Function Description

    Complete the calculate_the_maximum function in the editor below.

    calculate_the_maximum has the following parameters:

    int n: the highest number to consider int k: the result of a comparison must be lower than this number to be considered Prints

    Print the maximum values for the and, or and xor comparisons, each on a separate line.

    Input Format

    The only line contains space-separated integers, and .

  • + 0 comments

    include

    include

    include

    include

    int main() { int n, k, t=0; scanf("%d %d", &n, &k); int p=n; while (p>1) { p=p-1; t+=p; }int m =0,am=0,om=0,xm=0; int a[t],o[t],x[t]; for (int i=1;i<=n-1;i++) { for (int j=i+1;j<=n;j++) { a[m]=i&j; if(a[m]

        }
    }
    printf("%d\n%d\n%d\n",am,om,xm);
    

    } my code is giving me correct answer for all answer but it is give error for test 10 and test 12 botj are hidden test bu when i am trying to test run myself it is giving correct answer

  • + 0 comments

    include

    include

    include

    include

    int main() { int n, k, t=0; scanf("%d %d", &n, &k); int p=n; while (p>1) { p=p-1; t+=p; }int m =0,am=0,om=0,xm=0; int a[t],o[t],x[t]; for (int i=1;i<=n-1;i++) { for (int j=i+1;j<=n;j++) { a[m]=i&j; if(a[m]

        }
    }
    printf("%d\n%d\n%d\n",am,om,xm);
    

    } my code is giving me correct answer for all answer but it is give error for test 10 and test 12 botj are hidden test bu when i am trying to test run myself it is giving correct answer

  • + 0 comments

    include

    include

    include

    include

    int main() { int n, k, t=0; scanf("%d %d", &n, &k); int p=n; while (p>1) { p=p-1; t+=p; }int m =0,am=0,om=0,xm=0; int a[t],o[t],x[t]; for (int i=1;i<=n-1;i++) { for (int j=i+1;j<=n;j++) { a[m]=i&j; if(a[m]

        }
    }
    printf("%d\n%d\n%d\n",am,om,xm);
    

    } my code is giving me correct answer for all answer but it is give error for test 10 and test 12 botj are hidden test bu when i am trying to test run myself it is giving correct answer