| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
跪求AC者看看我的代码#include <iostream>
#include <cstring>
#include <string>
using namespace std;
int main()
{
char a[100][51],b[100][51];
int n,m,i,count[100];
memset(count,0,sizeof(count));
memset(b,0,sizeof(b));
cin>>n>>m;
for(i=0;i<m;i++)
cin>>a[i];
for(i=0;i<m;i++)
for(int j=0;j<n;j++)
for(int k=j+1;k<n;k++)
if(a[i][j]>a[i][k]) ++count[i];
for(i=0;i<m;i++)
for(int j=i+1;j<m;j++)
if(count[i]>count[j])
{
strcpy(b[i],a[i]);strcpy(a[i],a[j]);strcpy(a[j],b[i]);
}
for(i=0;i<m;i++)
cout<<a[i]<<endl;
return 0;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator