【CodeForces】[621A]Wet Shark and Odd and Even
来源:互联网 发布:矩阵分解svd 视频 编辑:程序博客网 时间:2024/05/22 15:59
求使数组数字之和为奇数的最大值
只需要看最终的和是否为奇数
如果是奇数减去最小的一个奇数即可
否则直接输出
#include<stdio.h>int a[100200];int main() { int n; while(scanf("%d",&n)!=EOF) { for(int i=0; i<n; i++) scanf("%d",&a[i]); __int64 sum=0,min=9999999999; for(int i=0; i<n; i++) { if(a[i]&1&&a[i]<min) min=a[i]; sum+=(__int64)a[i]; } printf("%I64d\n",sum&1?sum-min:sum); } return 0;}
题目地址:【CodeForces】[621A]Wet Shark and Odd and Even
0 0
- 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
- CodeForces 621 A Wet Shark and Odd and Even
- 【CodeForces】[621A]Wet Shark and Odd and Even
- codeforces 621A Wet Shark and Odd and Even
- CodeForces A. Wet Shark and Odd and Even
- A. Wet Shark and Odd and Even
- CF 621A Wet Shark and Odd and Even
- CodeForces--621A--Wet Shark and Odd and Even(数学水题)
- CodeForces 621 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)A Wet Shark and Odd and Even
- CF621A - Wet Shark and Odd and Even
- Java synchronized详解
- PAT乙级—1046. 划拳(15)-native
- hdu2614 Beat(简单dfs)
- ACM_最短路
- CentOS 6.7下yum安装五笔输入法
- 【CodeForces】[621A]Wet Shark and Odd and Even
- IOS内存管理机制
- Spark RDD使用原则
- Linux中 vim 编辑器的使用
- linux下java获取本机IP地址
- Linux 常用命令总结
- Table表格刷新内容后
- oracle-循环内部,异常处理
- Qt 5.5.0-成功移植到TQ210