Scribd Logo
Upload

Welcome to Scribd!

  • Untitled

    Uploaded by

    kushagra31dec
    21 views1 page
    Given an array of positive integers, the document describes how to calculate the number of subarrays whose XOR (exclusive or) is less than a given value K. A subarray is a contiguous sequence of elements from the original array. The XOR of a subarray is the XOR of all elements in the subarray. The problem is to count the number of subarrays with XOR values less than K for each test case, where test cases contain the array size N, value K, and the array of N integers.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Given an array of positive integers, the document describes how to calculate the number of subarrays whose XOR (exclusive or) is less than a given value K. A subarray is a contiguous sequence of elements from the original array. The XOR of a subarray is the XOR of all elements in the subarray. The problem is to count the number of subarrays with XOR values less than K for each test case, where test cases contain the array size N, value K, and the array of N integers.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    21 views1 page

    Untitled

    Uploaded by

    kushagra31dec
    Given an array of positive integers, the document describes how to calculate the number of subarrays whose XOR (exclusive or) is less than a given value K. A subarray is a contiguous sequence of elements from the original array. The XOR of a subarray is the XOR of all elements in the subarray. The problem is to count the number of subarrays with XOR values less than K for each test case, where test cases contain the array size N, value K, and the array of N integers.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    SUBXOR

    Send Feedback
    A straightforward question. Given an array of positive integers you have to print
    the number of subarrays whose XOR is less than K. Subarrays are defined as a
    sequence of continuous elements Ai, Ai+1, ..., Aj . XOR of a subarray is defined as
    Ai ^ Ai+1 ^ ... ^ Aj. Symbol ^ is Exclusive Or.
    Input Format
    First line contains T, the number of test cases.
    Each of the test case consists of N and K in one line, followed by N space
    separated integers in next line.
    Output Format
    For each test case, print the required answer.
    Constraints:
    1 ≤ T ≤ 5
    1 ≤ N ≤ 10^5
    1 ≤ A[i] ≤ 10^5
    1 ≤ K ≤ 10^6
    Sample Input
    1
    5 2
    4 1 3 2 7
    Sample Output
    3

    You might also like