Children’s Game - UVa 10905 拼接最大数
来源:互联网 发布:网络半球摄像机 编辑:程序博客网 时间:2024/06/10 12:03
4th IIUC Inter-University Programming Contest, 2005
A
Children’s Game
Input: standard input
Output: standard output
Problemsetter: Md. Kamruzzaman
There are lots of number games for children. These games are pretty easy to play but not so easy to make. We will discuss about an interesting game here. Each player will be given N positive integer. (S)He can make a big integer by appending those integers after one another. Such as if there are 4 integers as 123, 124, 56, 90 then the following integers can be made – 1231245690, 1241235690, 5612312490, 9012312456, 9056124123 etc. In fact 24 such integers can be made. But one thing is sure that 9056124123 is the largest possible integer which can be made.
You may think that it’s very easy to find out the answer but will it be easy for a child who has just got the idea of number?
Input
Each input starts with a positive integer N (≤ 50). In next lines there are N positive integers. Input is terminated by N = 0, which should not be processed.
Output
For each input set, you have to print the largest possible integer which can be made by appending all the Nintegers.
Sample Input
Output for Sample Input
4
123 124 56 90
5
123 124 56 90 9
5
9 9 9 9 9
0
9056124123
99056124123
99999
题意:给你n个数,问你用其拼接的最大的数是多少。
思路:用s1+s2>s2+s1的比较方式来排序,然后按序输出。
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<iostream>using namespace std;string s[60];bool cmp(string s1,string s2){ return s1+s2>s2+s1;}int main(){ int n,i,j,k; while(~scanf("%d",&n) && n>0) { for(i=1;i<=n;i++) cin>>s[i]; sort(s+1,s+1+n,cmp); for(i=1;i<=n;i++) cout<<s[i]; printf("\n"); }}
- Children’s Game - UVa 10905 拼接最大数
- UVA 10905 Children's Game(数字组合求最大)
- UVa 10905 - Children's Game
- UVa 10905 - Children's Game
- uva 10905 - Children's Game
- uva 10905 - Children's Game
- UVA 10905 Children's Game
- UVa 10905 - Children's Game
- Uva-10905-Children’s Game
- UVa 10905 - Children's Game
- UVa 10905 - Children's Game
- uva 10905 - Children's Game
- UVa 10905 - Children's Game
- uva 10905-Children’s Game
- UVa 10905: Children's Game
- UVA 10905 - Children's Game
- UVA 10905 Children's Game
- UVA 10905 - Children’s Game
- C++第一遍思维导图
- ActionBar基础学习之头部返回菜单
- jsp静态导入和动态导入的区别
- BAT编程解释
- web 负载均衡
- Children’s Game - UVa 10905 拼接最大数
- 老程序员的十年感悟
- J2EE的十三种技术——JNDI
- HDU 2546 饭卡(01背包)
- backup 的路径
- Android中计算时间差的实现方法
- 使用DevExpress控件构造单文档多界面(标签页)
- 自说自话,Racket我来了
- poj 3126 Prime Path