Community Dashboard

Sherlock and XOR

Practice

3.8 (63 votes)

Approved

Basic programming

Easy

Math

Open

Problem

84% Success 31378 Attempts 20 Points 2s Time Limit 256MB Memory 1024 KB Max Code

You are given an array A 1,A 2 ...A N . You have to tell how many pairs (i, j) exist such that 1 \leq i < j \leq N and A i XOR A j is odd . Input and Output First line T, the number of testcases. Each testcase: first line N, followed by N integers in next line. For each testcase, print the required answer in one line. Constraints 1 \leq T \leq 10 1 \leq N \leq 10 5 0 \leq A i \leq 10 9

You need to be logged in to access the code editor

Please wait while we load the editor

Results

Custom Input

Run your code to see the output

Submissions

Please login to view your submissions