2575.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 32 行

Problem Id:2575  User Id:fzk 
Memory:36K  Time:0MS
Language:C++  Result:Accepted

Source 

#include"iostream.h"
void main()
{int a[5000],n,i;long x,y,t;
while(1)
{cin>>n;
if(cin.fail())break;
if(n<=0)break;

for(i=0;i<n;i++)a[i]=0;

cin>>x;
for(i=0;i<n-1;i++)
{cin>>y;
if(x>y&&x-y<=n-1)a[x-y-1]++;
if(y>x&&y-x<=n-1)a[y-x-1]++;
x=y;
}
t=1;
for(i=0;i<n-1;i++)if(a[i]==0){t=0;break;}
if(t==0)cout<<"Not jolly"<<endl;
else cout<<"Jolly"<<endl;
}

}