10098 - Generating Fast暴力题 没啥可说的
2013-04-05 19:59
357 查看
水题。。。。
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
char a[11],b[11];
int len;
int cmp(const void *p,const void *q)
{
return strcmp((char *)p,(char *)q);
}
int sort(int n)
{
int i,j;
char temp;
memset(b,0,sizeof(b));
for(i=n; i<len; i++)
{
if(a[n-1]>=a[i])
break;
}
temp=a[i-1];
a[i-1]=a[n-1];
a[n-1]=temp;
for(j=n; j<len; j++)
b[j-n]=a[j];
b[j-n]='\0';
a
='\0';
qsort(b,strlen(b),sizeof(b[0]),cmp);
strcat(a,b);
puts(a);
}
int main()
{
int n,i,j,flag;
scanf("%d",&n);
getchar();
while(n--)
{
gets(a);
qsort(a,strlen(a),sizeof(a[0]),cmp);
len=strlen(a);
puts(a);
for(i=len-1; i>0; i--)
{
if(a[i]>a[i-1])
{
sort(i);
i=len;
}
}
puts("");
}
return 0;
}
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
char a[11],b[11];
int len;
int cmp(const void *p,const void *q)
{
return strcmp((char *)p,(char *)q);
}
int sort(int n)
{
int i,j;
char temp;
memset(b,0,sizeof(b));
for(i=n; i<len; i++)
{
if(a[n-1]>=a[i])
break;
}
temp=a[i-1];
a[i-1]=a[n-1];
a[n-1]=temp;
for(j=n; j<len; j++)
b[j-n]=a[j];
b[j-n]='\0';
a
='\0';
qsort(b,strlen(b),sizeof(b[0]),cmp);
strcat(a,b);
puts(a);
}
int main()
{
int n,i,j,flag;
scanf("%d",&n);
getchar();
while(n--)
{
gets(a);
qsort(a,strlen(a),sizeof(a[0]),cmp);
len=strlen(a);
puts(a);
for(i=len-1; i>0; i--)
{
if(a[i]>a[i-1])
{
sort(i);
i=len;
}
}
puts("");
}
return 0;
}
相关文章推荐
- UVA 10098 Generating Fast 解题报告
- UVA 10098 - Generating Fast 解题报告 (全排列)
- UVA 10098 Generating Fast, Sorted Permutation(全排列)
- (组合数学3.1.1.2)UVA 10098 Generating Fast(使用字典序思想产生所有序列)
- 浙工大姗姗杯round1 E - Generating Fast UVA - 10098
- uva 10098 Generating Fast, Sorted Permutation
- uva GeneratingFastSortedPermutation 10098
- (组合数学3.1.1.2)UVA 10098 Generating Fast(使用字典序思想产生所有序列)
- uva-10098-Generating Fast-全排列典例
- uva 10098 - Generating Fast(全排列)
- UVA - 10098 - Generating Fast(全排列)
- UVa 10098 Generating Fast (全排列生成)
- uva--10098--Generating Fast, Sorted Permutation
- UvaOJ 10098 Generating Fast, Sorted Permutation
- UVA 10098 Generating Fast, Sorted Permutation
- uva 10098 Generating Fast(全排列)
- UVa 10098 - Generating Fast STL 排序+排列
- uva 10098 Generating Fast(全排列)
- UVA - 10098 Generating Fast (全排列)
- uva10098 Generating Fast, Sorted Permutation