#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void)
{
char s[100][100];
char tmpn[80], tmps[100];
int i, j, n;
while (gets(tmpn))
{
n = atoi(tmpn);
for (i=0; i<n; i++)
{
gets(s[i]);
if (strcmp(s[i], "stop") == 0)
break;
}
n = i;
for (i=0; i<n-1; i++)
{
for (j=0; j<n-1-i; j++)
{
if (strlen(s[j]) > strlen(s[j+1]))
{
strcpy(tmps, s[j]);
strcpy(s[j], s[j+1]);
strcpy(s[j+1], tmps);
}
}
}
for (i=0; i<n; i++)
printf("%s\n", s[i]);
}
return 0;
}
/**************************************************************
Problem: 1135
User: cust123
Language: C++
Result: Accepted
Time:0 ms
Memory:1020 kb
****************************************************************/
题目1135:字符串排序
最新推荐文章于 2024-03-17 21:05:35 发布