[5055]Bob and math problem(hdu)
来源:互联网 发布:软件测试师考试 编辑:程序博客网 时间:2024/05/17 04:07
Bob and math problem
Problem Description
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 digit $a_1, a_2, a_3, \cdots, a_n. ( 0 \leq a_i \leq 9)$.
Each case starts with a line containing an integer N ( 1 <= N <= 100 ).
The second line contains N Digits which indicate the digit $a_1, a_2, a_3, \cdots, a_n. ( 0 \leq a_i \leq 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
30 1 335 4 232 4 6
Sample Output
301425-1
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <math.h>int main(){ int a[110]; int n,i,j,k,m,t; int flag; while(~scanf("%d",&n)) { flag=0; for(i=0; i<n; i++) scanf("%d",&a[i]); for(i=0; i<n-1; i++) for(j=0; j<n-i-1; j++) if(a[j]<a[j+1]) { t=a[j]; a[j]=a[j+1]; a[j+1]=t; } for(i=n-1; i>=0; i--) { if(a[i]%2!=0) { k=i; m=a[i]; flag=1; break; } } if(flag==0) puts("-1"); else { for(i=k; i<n-1; i++) { a[i]=a[i+1]; } a[n-1]=m; if(a[0]==0)//前导是0则输出“-1” { puts("-1"); } else { for(i=0; i<n; i++) printf("%d",a[i]); printf("\n"); } } } return 0;}
0 0
- [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 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)
- POJ 1384 Piggy-Bank(完全背包)
- [ffmpeg 扩展第三方库编译系列] frei0r mingw32 下编译问题
- 《数据结构》第三章 栈和队列 知识总结导图
- Less学习总结
- IOS传值-代理传值
- [5055]Bob and math problem(hdu)
- OpenGL游戏编程第三章 glut实现
- MySQL RPM包安装和相关操作
- [Unity3d][NGUI]自写循环UIScrollView组件. 使用少量Item循环使用.
- iOS8的UIPresentationController
- java的wait和notifyAll用法
- Jedis学习使用(java操作redis)
- 老毛桃
- Yii Framework2.0开发教程(1)配置环境及第一个应用HelloWorld