Wet Shark and Odd and Even
来源:互联网 发布:淘宝卖家取消订单投诉 编辑:程序博客网 时间:2024/05/01 21:48
Crawling in process...Crawling failedTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by2) sum. Please, calculate this value for Wet Shark.
Note, that if Wet Shark uses no integers from then integers, the sum is an even integer 0.
Input
The first line of the input contains one integer,n (1 ≤ n ≤ 100 000). The next line containsn space separated integers given to Wet Shark. Each of these integers is in range from1 to 109, inclusive.
Output
Print the maximum possible even sum that can be obtained if we use some of the given integers.
Sample Input
31 2 3
6
5999999999 999999999 999999999 999999999 999999999
3999999996
Sample Output
Hint
In the first sample, we can simply take all three integers for a total sum of6.
In the second sample Wet Shark should take any four out of five integers999 999 999.
思路:
用sort先从小到大排序,把所有的数加起来,先判断总和是不是偶数,若是偶数直接输出,若不是则减去经排序后的最小的奇数,减去第一个奇数时要用for循环先找到第一个奇数的位置。
其次注意数据类型为long long或者__int64。
代码:
#include<stdio.h>#include<algorithm>using namespace std;long long a[100005];int main(){int n;scanf("%d",&n);long long sum=0;for(int i=0;i<n;i++) {scanf("%lld",&a[i]);sum+=a[i];} sort(a,a+n);for(int i=0;i<n;i++){if(sum%2==0)break;else{if(a[i]%2!=0){sum-=a[i];} }} printf("%lld\n",sum);return 0;
- CF621A - Wet Shark and Odd and Even
- A. Wet Shark and Odd and Even
- Wet Shark and Odd and Even
- Wet Shark and Odd and Even
- CF 621A Wet Shark and Odd and Even
- Codeforces 621A Wet Shark and Odd and Even
- Codeforces 621A Wet Shark and Odd and Even 【水题】
- Codeforces 621A Wet Shark and Odd and Even
- CodeForces 621A-Wet Shark and Odd and Even
- Wet Shark and Odd and Even (水题)
- CodeForces 621 A Wet Shark and Odd and Even
- 【CodeForces】[621A]Wet Shark and Odd and Even
- CodeForces A. Wet Shark and Odd and Even
- codeforces 621A Wet Shark and Odd and Even
- Codeforces Round #341 (Div. 2) --A. Wet Shark and Odd and Even
- Codeforces Round #341 (Div. 2)-A. Wet Shark and Odd and Even(奇数+奇数为偶数)
- Codeforces Round #341 (Div. 2) A. Wet Shark and Odd and Even (水)
- Codeforces Round #341 (Div. 2) CF621A. Wet Shark and Odd and Even
- 背景建模--内核密度估计法
- linux内核研究(一)
- qt序列化 (二)
- java中正则表达式的使用(2)——列出百度搜索的前十项
- UIImageView的contentMode
- Wet Shark and Odd and Even
- Java中的接口
- iOS开发之遍历Model类的属性并赋值
- iOS AFNetworking 简单使用
- 导航栏透明渐变(iOS)
- jsp页面直接跳转编码方式
- qt序列化 (三)
- 操作字符串
- 使用COPY声明NSSTRING属性