hdu 5055 Bob and math problem(模拟)
2016-07-07 14:59
387 查看
Bob and math problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1481 Accepted Submission(s): 552
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:
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 digit a1,a2,a3,⋯,an.(0≤ai≤9).
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
3
0 1 3
3
5 4 2
3
2 4 6
Sample Output
301
425
-1
题意:给你n个0~9的数字,问你这些数字组合成的数中满足1:为奇数 2:没有前导零的最大数
思路:直接模拟即可。 最后一位取最小的奇数,第一位取最大的非零数,中间的数就从大到小取了。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 110
int a
,b
;
bool cmp(int c,int d)
{
return c>d;
}
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
int odd=111,v;
for(int i=0; i<n; i++)
if(a[i]&1&&a[i]<odd)
{
odd=a[i];
v=i;
}
if(odd==111) printf("-1\n");
else
{
b[n-1]=odd;
a[v]=-1;
int maxn=-1;
for(int i=0; i<n; i++)
if(a[i]>0&&a[i]>maxn)
{
maxn=a[i];
v=i;
}
if(maxn==-1&&n>1)
{
printf("-1\n");
continue;
}
if(n>1)
{
b[0]=maxn;
a[v]=-1;
sort(a,a+n,cmp);
int cnt=1;
for(int i=0; i<n; i++)
{
if(a[i]==-1) continue;
b[cnt++]=a[i];
}
}
for(int i=0;i<n;i++)
printf("%d",b[i]);
printf("\n");
}
}
return 0;
}
相关文章推荐
- pthread条件变量condition(配合mutex锁使用),经典,有图
- 内存泄漏之TextLine.recycle
- java中ajax使用--传回一个对象列表
- mysql去除严格模式/插入数据库遇到重复保证唯一
- 事务码VF04开具发票所触发的行为
- 5.6 在线DDL (online DDL)详解
- Java synchronized的原理解析
- oozie安装步骤
- UIView剖析之Draw、Size、Layout方法
- RandomAccessFile
- 高质量技术文章
- android developer tiny share-20160706
- android developer tiny share-20160706
- R12 adbldxml.pl AutoConfig Tool to Generate the Context File
- Android仿微信多图片选择,拍照等,适合快速导入到自己项目中
- ios UITableview头部图片弹簧效果
- 自己编写了Oracle EBS程序自动移植脚本
- 常用的正则表达式大全(收集)
- Linux系统结构
- H-Index