【codeforces】-#621-AWet Shark and Odd and Even(n个数最大偶数和)
2016-05-25 20:00
447 查看
A. Wet Shark and Odd and Even
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
by 2) sum. Please, calculate this value for Wet Shark.
Note, that if Wet Shark uses no integers from the n 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 contains n space separated integers given to Wet Shark. Each of these integers is in range from 1 to 109,
inclusive.
Output
Print the maximum possible even sum that can be obtained if we use some of the given integers.
Examples
input
output
input
output
Note
In the first sample, we can simply take all three integers for a total sum of 6.
In the second sample Wet Shark should take any four out of five integers 999 999 999.
输出n个数最大的偶数和
#include<cstdio>
int main()
{
int n;
scanf("%d",&n);
int t;
__int64 y=0;
int z=1e9+1;
for(int i=1;i<=n;i++)
{
scanf("%d",&t);
if(t&1)
{
if(t<z)
z=t;
}
y=y+t;
}
if(y&1)
y=y-z;
printf("%I64d\n",y);
return 0;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
by 2) sum. Please, calculate this value for Wet Shark.
Note, that if Wet Shark uses no integers from the n 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 contains n space separated integers given to Wet Shark. Each of these integers is in range from 1 to 109,
inclusive.
Output
Print the maximum possible even sum that can be obtained if we use some of the given integers.
Examples
input
3 1 2 3
output
6
input
5 999999999 999999999 999999999 999999999 999999999
output
3999999996
Note
In the first sample, we can simply take all three integers for a total sum of 6.
In the second sample Wet Shark should take any four out of five integers 999 999 999.
输出n个数最大的偶数和
#include<cstdio>
int main()
{
int n;
scanf("%d",&n);
int t;
__int64 y=0;
int z=1e9+1;
for(int i=1;i<=n;i++)
{
scanf("%d",&t);
if(t&1)
{
if(t<z)
z=t;
}
y=y+t;
}
if(y&1)
y=y-z;
printf("%I64d\n",y);
return 0;
}
相关文章推荐
- web前端细节性问题(面试时可能遇到的问题)——div+css(2)
- Handler
- 前端页面卡顿?或是DOM操作惹的祸,需优化代码
- 漂亮的代码1:计算器
- Interface的两种使用方式
- HTML5第十次作业
- java 内存映射处理大文件
- 【Halcon】Blob分析的形态学算子应用(count_pellets.hdev)
- Dapper-开源小型ORM
- 【博客美化】04.自定义地址栏logo
- 构建之法
- python之时间函数
- Intel MKL FATAL ERROR: Cannot load libmkl_avx2.so or libmkl_def.so
- Android自定义view之ProgressBar的实现
- nginx配置文件
- PullToRefreshListView
- delphi工作笔记利用indy10发送邮件
- Android自动化测试-从入门到入门(3)Espresso入门
- 【CodeForces】#621A - Wet Shark and Odd and Even(水)
- [JZOJ3401]【GDOI2014模拟】Pty爬山