题库练习 Even More Odd Photos--Bronze
← 上一题 下一题 →

A852 | Even More Odd Photos--Bronze

来源USACO
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

Farmer John is yet again trying to take a photograph of his $N$ cows ($2 \leq
N \leq 1000$).
Each cow has an integer "breed ID" number in the range $1 \ldots 100$. Farmer
John has a very peculiar idea in mind for his photo: he wants to partition all
the cows into disjoint groups (in other words, place each cow in exactly one
group) and then line up the groups so the sum of the breed IDs of the cows in
the first group is even, the sum of the IDs in the second group is odd, and so
on, alternating between even and odd.
What is the maximum possible number of groups Farmer John can form?

输入格式

The first line of input contains $N$. The next line contains $N$ space-
separated integers giving the breed IDs of the $N$ cows.

输出格式

The maximum possible number of groups in Farmer John's photo. It can be shown
that at least one feasible grouping exists.

输入输出样例

输入 #1
7
1 3 5 7 9 11 13
输出 #1
3
C++ 编辑器
输入
输出