A. Even Subset Sum Problem

滴答滴答---题目链接 

A. Even Subset Sum Problem time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output You are given an array aa consisting of nn positive integers. Find a non-empty subset of its elements such that their sum is even (i.e. divisible by 22) or determine that there is no such subset. Both the given array and required subset may contain equal values. Input The first line contains a single integer tt (1≤t≤1001≤t≤100), number of test cases to solve. Descriptions of tt test cases follow. A description of each test case consists of two lines. The first line contains a single integer nn (1≤n≤1001≤n≤100), length of array aa. The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1001≤ai≤100), elements of aa. The given array aa can contain equal values (duplicates). Output For each test case output −1−1 if there is no such subset of elements. Otherwise output positive integer kk, number of elements in the required subset. Then output kk distinct integers (1≤pi≤n1≤pi≤n), indexes of the chosen elements. If there are multiple solutions output any of them. Example input Copy 3 3 1 4 3 1 15 2 3 5 output Copy 1 2 -1 2 1 2 Note There are three test cases in the example. In the first test case, you can choose the subset consisting of only the second element. Its sum is 44 and it is even. In the second test case, there is only one non-empty subset of elements consisting of the first element, however sum in it is odd, so there is no solution. In the third test case, the subset consisting of all array's elements has even sum.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int temp=0;
        for(int i=1; i<=n; i++)
        {
            int x;
            cin>>x;
            if(x%2==0)
                temp=i;
        }
        if(temp!=0)
        {
            cout<<1<<endl;
            cout<<temp<<endl;
            continue;
        }
        if(n==1)
            printf("-1\n");
        else
        {
            cout<<2<<endl;
            cout<<1<<" "<<2<<endl;
        }
    }
    return 0;
}