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 unixhunter at 2004-03-05 21:53:31 on Problem 1317
我觉得这道题里没有什么陷阱啊
#include <stdio.h>
#include <string.h>

int main()
{
	const int N=75;
	const int m=28;
	char ct[N],s;
	int cc[N],pc[N],k,n,i,j;
	scanf("%d",&k);
	while(k!=0)
	{
		for(i=0;i<=N;i++)
		{
			ct[i]='\0';
			cc[i]=pc[i]='\0';
		}
		scanf("%s",ct);
		n=strlen(ct);
		for(i=0;i<n;i++)
		{
			if(ct[i]>='a' && ct[i]<='z')
				cc[i]=ct[i]-'a'+1;
			else if(ct[i]=='_') cc[i]=0;
			else if(ct[i]=='.') cc[i]=27;
		}
		for(i=0;i<n;i++)
		{
			s=cc[i]+i;
			if(s>=m) s=s-m;
			j=(k*i)%n;
			pc[j]=s;
		}
		for(i=0;i<n;i++)
		{
			if(pc[i]==0) ct[i]='_';
			else if(pc[i]==27) ct[i]='.';
			else ct[i]='a'+pc[i]-1;
		}
		printf("%s\n",ct);
		scanf("%d",&k);
	}
	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