Codeforces--1291A--Even But Not Even

题目描述：
Let’s define a number ebne (even but not even) if and only if its sum of digits is divisible by 2 but the number itself is not divisible by 2. For example, 13, 1227, 185217 are ebne numbers, while 12, 2, 177013, 265918 are not. If you’re still unsure what ebne numbers are, you can look at the sample notes for more clarification.

You are given a non-negative integer s, consisting of n digits. You can delete some digits (they are not necessary consecutive/successive) to make the given number ebne. You cannot change the order of the digits, that is, after deleting the digits the remaining digits collapse. The resulting number shouldn’t contain leading zeros. You can delete any number of digits between 0 (do not delete any digits at all) and n−1.

For example, if you are given s=222373204424185217171912 then one of possible ways to make it ebne is: 222373 20442 418521717191 2 → 2237344218521717191. The sum of digits of 2237344218521717191 is equal to 70 and is divisible by 2, but number itself is not divisible by 2: it means that the resulting number is ebne.

Find any resulting number that is ebne. If it’s impossible to create an ebne number from the given number report about it.
输入描述:
The input consists of multiple test cases. The first line contains a single integer t (1≤t≤1000) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer n (1≤n≤3000) — the number of digits in the original number.

The second line of each test case contains a non-negative integer number s, consisting of n digits.

It is guaranteed that s does not contain leading zeros and the sum of n over all test cases does not exceed 3000.
输出描述:
For each test case given in the input print the answer in the following format:

If it is impossible to create an ebne number, print “-1” (without quotes);
Otherwise, print the resulting number after deleting some, possibly zero, but not all digits. This number should be ebne. If there are multiple answers, you can print any of them. Note that answers with leading zeros or empty strings are not accepted. It’s not necessary to minimize or maximize the number of deleted digits.
输入：
4
4
1227
1
0
6
177013
24
222373204424185217171912
输出：
1227
-1
17703
2237344218521717191
题意：
定义各位相加为偶数的奇数为xx数 给一个数 删除某些位 使得这个数变成xx数
题解：
奇数个数大于等于2且最后一个数必须是奇数
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 5000 + 5;
char s[maxn];

int main(){
    int t,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        scanf("%s",s);
        int odd = 0;
        for(int i = 0; i < n; i ++){
            int t = s[i] - '0';
            if(t % 2 != 0) odd ++;
        }
        if(odd < 2){
            printf("-1\n");
        }
        else{
            int cnt = 0;
            for(int i = 0; i < n; i ++){
                int t = s[i] - '0';
                if(t % 2 != 0) cnt ++;
                printf("%c",s[i]);
                if(cnt == 2) break;
            }
            printf("\n");
        }
    }
}