4th IIUC Inter-University Programming Contest, 2005 | |
A | Children’s Game |
Input: standard input | |
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 | 9056124123 |
题意:给出N个整数,问怎么样把他们接在一起能使这个数最大。
思路:设计好排序就行了。。
WA:1
AC:1
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
using namespace std;
const int maxn=100;
char S1[maxn*2];
char S2[maxn*2];
struct Val
{
char digit[maxn];
int len;
bool operator<(const Val&val) const
{
strcpy(S1,digit);
strcpy(S1+len,val.digit);
strcpy(S2,val.digit);
strcpy(S2+val.len,digit);
return strcmp(S1,S2)>0;
// int sz=min(len,val.len);
// for(int i=0;i<sz;++i)
// if(digit[i]<val.digit[i]) return false;
// else if (digit[i]>val.digit[i]) return true;
// if(len<val.len)
// {
//
// }
}
void read()
{
scanf("%s",digit);
len=strlen(digit);
}
}in[52];
int n;
char out[maxn*52];
void input()
{
for(int i=0;i<n;++i) in[i].read();
}
void solve()
{
sort(in,in+n);
int Index=0;
for(int i=0;i<n;++i)
{
strcpy(out+Index,in[i].digit);
Index+=in[i].len;
}
out[Index]='\0';
printf("%s\n",out);
}
int main()
{
while(scanf("%d",&n)&&n)
{
input();
solve();
}
}