| ||||||||||
| 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 | |||||||||
Wrong Answer,Why?#include<stdio.h>
#define N 3000
int main()
{
char arr[N],temp[11];
int i,j,k,m,ci,t,dif,flag,num[N];
while( gets(arr) )
{
for(i=0;i<N;i++)
num[i]=0;
//printf("%s\n",arr);
//printf("%d\n",strlen(arr));
i=k=0;
bzero(temp,11);
while(i<strlen(arr))
{
m=0;
while(arr[i]!=' ' && arr[i]!='\0')
{temp[m++]=arr[i];i++;}
i++;
t=0;
if(temp[0]=='-')
{
ci=0;
for(j=m-1;j>0;j--)
t+=(temp[j]-'0')*pow(10,ci++);
t=0-t;
}
else
{
ci=0;
for(j=m-1;j>=0;j--)
t+=(temp[j]-'0')*pow(10,ci++);
}
num[k++]=t;
bzero(temp,11);
}
//for(j=0;j<k;j++)
//printf(" %d",num[j]);
//printf("\n");
if(k==1)
{
if( num[k-1] == 0 )
printf("Jolly\n");
else
printf("Not jolly\n");
}
else
{
flag=dif=0;
for(i=0;i+1<k;i++)
{ dif=abs(num[i+1]-num[i]);
if(dif>k-1)
{flag=1;break;}
}
if(flag==1)
printf("Not jolly\n");
else
printf("Jolly\n");
}
}
return 0;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator