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

实在找不出哪儿有问题,大家帮忙看一下啊!总是WA

Posted by clj511878301 at 2008-05-21 14:14:35 on Problem 2159 and last updated at 2008-05-24 20:42:00
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int compare(char *arr,int len,int n,int *a)
{
        char s[101];
        int a1[26];
        memset(a1,0,sizeof(int)*26);
        int i;
        for(i=0;i<len;i++)
            {s[i]=arr[i]+n;
             if(s[i]>'Z') s[i]-=26;
            }
        for(i=0;i<len;i++)
            a1[s[i]-'A']++;
        for(i=0;i<26;i++)
         if(a1[i]!=a[i]) return 1;
        return 0;
}

int main()
{
    char s1[101],s2[101];
    scanf("%s %s",s1,s2);
    int a2[26];
    memset(a2,0,sizeof(a2));
    int len1,len2,i,j;
    len1=strlen(s1);
    len2=strlen(s2);
    if(len1!=len2) {printf("No\n");exit(0);}
    for(i=0;i<len2;i++)
     a2[s2[i]-'A']++;
    for(j=0;j<=25;j++)
        if(compare(s1,len1,j,a2)==0) {printf("Yes\n");break;}
    if(j>25) printf("No\n");
    return 0;
}

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