Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

各位神人帮帮看看,可能的测试都用了,VC上结果对的,但是交上去就错了~~哭

Posted by 20091845 at 2010-03-24 22:29:04
#include<stdio.h>
#include<string.h>
void main()
{
	char a[201],b[201];int i,j,flag=0,count,k=0,l=0,m,p,a1[201],b1[201];
   gets(a);
   gets(b);
   for (i = 0; i < strlen(a); i++)  /*统计a数组的各类字母个数*/
    {
        count = 0;
        for (j = 0; j< i; j++)
        {
            flag = 0;
            if(a[j] == a[i])
            {
                flag = 1;
                break;
            }
        }

        if (flag == 1)
            continue;

        for (j = i; j < strlen(a); j++)
        {
            if(a[j] == a[i])
            {
                count++;
            }
        }
        a1[k]=count;
		k++;
    }
   flag=0;
   for (i = 0; i<strlen(b); i++)       /*统计b数组的各类字母个数*/
    {
        count = 0;
        for (j = 0; j< i; j++)
        {
            flag = 0;
            if(b[j] == b[i])
            {
                flag = 1;
                break;
            }
        }

        if (flag == 1)
            continue;

        for (j = i; j < strlen(b); j++)
        {
            if(b[j] == b[i])
            {
                count++;
            }
        }
        b1[l]=count;
		l++;
    }
   for(i=0;i<k-1;i++)    /*选择法对数组a排序*/
   {
	   p=i;
	   for(j=i+1;j<k;j++)
		   if(a1[i]>a1[j]) p=j;
	   if(p!=i)
	   {
		   m=a1[p];
		   a1[p]=a1[i];
		   a1[i]=m;
	   }
   }
   for(i=0;i<l-1;i++)   /*选择法对数组b排序*/
   {
	   p=i;
	   for(j=i+1;j<l;j++)
		   if(b1[i]>b1[j]) p=j;
	   if(p!=i)
	   {
		   m=b1[p];
		   b1[p]=b1[i];
		   b1[i]=m;
	   }
   }
     for(i=0;i<k;i++)
	    if(a1[i]!=b1[i]) break;
	 if(i==k) printf("YES\n");
	 else printf("NO\n");
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator