hdu 5055 Bob and math problem
来源:互联网 发布:视频剪切软件绿色版 编辑:程序博客网 时间:2024/05/17 03:03
Bob and math problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1147 Accepted Submission(s): 430
Problem Description
Recently, Bob has been thinking about a math problem.
There are N Digits, each digit is between 0 and 9. You need to use this N Digits to constitute an Integer.
This Integer needs to satisfy the following conditions:
Example:
There are three Digits: 0, 1, 3. It can constitute six number of Integers. Only "301", "103" is legal, while "130", "310", "013", "031" is illegal. The biggest one of odd Integer is "301".
There are N Digits, each digit is between 0 and 9. You need to use this N Digits to constitute an Integer.
This Integer needs to satisfy the following conditions:
- 1. must be an odd Integer.
- 2. there is no leading zero.
- 3. find the biggest one which is satisfied 1, 2.
Example:
There are three Digits: 0, 1, 3. It can constitute six number of Integers. Only "301", "103" is legal, while "130", "310", "013", "031" is illegal. The biggest one of odd Integer is "301".
Input
There are multiple test cases. Please process till EOF.
Each case starts with a line containing an integer N ( 1 <= N <= 100 ).
The second line contains N Digits which indicate the digita1,a2,a3,⋯,an.(0≤ai≤9) .
Each case starts with a line containing an integer N ( 1 <= N <= 100 ).
The second line contains N Digits which indicate the digit
Output
The output of each test case of a line. If you can constitute an Integer which is satisfied above conditions, please output the biggest one. Otherwise, output "-1" instead.
Sample Input
30 1 335 4 232 4 6
Sample Output
301425-1
Source
BestCoder Round #11 (Div. 2)
题目大意: 求取给出数字组成的最大的奇数
题目分析:计数排序,找最小的奇数,然后从大到小将值顺次填充,特判一下只有一个奇数,剩下的全是0的情况就能过
题目分析:计数排序,找最小的奇数,然后从大到小将值顺次填充,特判一下只有一个奇数,剩下的全是0的情况就能过
#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>using namespace std;int n;int num[11];int a;int main ( ){ while ( ~scanf ( "%d" , &n ) ) { memset ( num , 0 , sizeof ( num ) ); int end = -1; for ( int i = 0 ; i < n ; i++ ) { scanf ( "%d" , &a ); num[a]++; } for ( int i = 0 ; i <= 9 ; i++ ) if ( (i&1)&& num[i] ) { num[i]--; end = i; break; } if ( num[0] ) { bool flag = true; for ( int i = 1 ; i <= 9 ; i++ ) if ( num[i] ) flag = false; if ( flag ) end = -1; } if ( end == -1 ) { puts ( "-1" ); continue; } for ( int i = 9 ; i >= 0 ; i-- ) while ( num[i] ) { printf ( "%d" , i ); num[i]--; } printf ( "%d\n" , end ); }}
0 0
- HDU 5055 Bob and math problem
- hdu 5055 Bob and math problem
- HDU 5055 Bob and math problem
- [5055]Bob and math problem(hdu)
- hdu--5055 Bob and math problem
- HDU 5055 Bob and math problem 数学题
- hdu 5055 Bob and math problem
- HDU 5055 Bob and math problem
- HDU 5055Bob and math problem(构造)
- HDU 5055 Bob and math problem
- HDU 5055 - Bob and math problem(贪心)
- HDU —— 5055 Bob and math problem
- HDU 5055 Bob and math problem(构造)
- HDU-#5055 Bob and math problem(模拟)
- hdu 5055 Bob and math problem(模拟)
- 【BestCoder】 HDOJ 5055 Bob and math problem
- HDOJ 5055 Bob and math problem
- HDU 5055 Bob and math problem(贪心)——BestCoder Round #11(div.2)
- hihoCoder36周 练一下lower_bound~
- HDOJ 4549 M斐波那契数列 费马小定理+矩阵快速幂
- AsyncQueryHandler
- 侧滑返回---UIScrollView
- Markdown基本语法
- hdu 5055 Bob and math problem
- POJ 2676 SuDoKu DFS
- Sicily 1629. Area of Polycubes
- 希尔排序
- 学习笔记3/13
- c#面向对象(二)----命名空间
- Sicily 1627. Text Messaging Improvement?
- requestWindowFeature()隐藏标题栏无效
- Sicily 1528. Spatial Concepts Test