UVA 10905 - Children's Game
来源:互联网 发布:什么叫淘宝流量 编辑:程序博客网 时间:2024/05/01 22:53
------------------------------------------------------------------------
4thIIUCInter-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 givenN 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 areN positive integers. Input is terminated byN = 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 theN integers.
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
-------------------------------------------------------------------------
很有意思,很巧妙,排序
//uva 10905 Children's Game#include <cstdio>#include <iostream>#include <vector>#include <algorithm>#include <string>#include <cstring>#include <map>#include <cmath>#include <string>#include <queue>#include <set>using namespace std;#ifdef WINtypedef __int64 LL;#define iform "%I64d"#define oform "%I64d\n"#elsetypedef long long LL;#define iform "%lld"#define oform "%lld\n"#endif#define S64I(a) scanf(iform, &a)#define P64I(a) printf(oform, a)const int INF = 0x3f3f3f3f;const double eps = 10e-9;const int maxn = 50 + 10;string ss[maxn];bool cmp(string a, string b) { return a+b > b+a;}int main() { int n; while(scanf("%d", &n) != EOF && n) { for(int i=0; i<n; i++) cin>>ss[i]; sort(ss, ss+n, cmp); for(int i=0; i<n; i++) cout<<ss[i]; cout<<endl; } return 0;}
- 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
- uva 10905 Children's Game
- JAVA单例(懒汉模式)线程安全
- Hibernate —— HQL与QBC的区别
- Red hat免费使用CentOS源
- 精通Android3学习笔记(一)基础知识
- 拥有 RDBMS 特性的 NoSQL 数据存储
- UVA 10905 - Children's Game
- oracle 查询语句大全
- 使用MPI编译Linux平台下使用的并行SuperLU静态链接库
- 《Android攻略》客户端和Service交互
- 工作环境迁移:Ubuntu 12.04 使用笔记(一)
- 10359 - Tiling (递推,类斐波那契)
- spoj694之后缀数组
- loadrunner场景设置的方法
- Codeforces Round #189 (Div. 1)