1943122_ac_0ms_84k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 32 行

# include <stdio.h>
# include <math.h>
# include <string.h>

int main()
{
	int n, i, a[3001], mark, f[3001];

	while(scanf("%d",&n)==1)
	{
		mark = 0;
		for(i = 0; i < n; i++)
			scanf("%d",&a[i]);
		memset(f,0,sizeof(f));
			for(i = 1; i < n; i++)
				if(fabs(a[i-1]-a[i])>n-1||f[(int)fabs(a[i-1]-a[i])])
				{
					mark = 1;
					break;
				}
				else
					f[(int)fabs(a[i-1]-a[i])] = 1;
				if(n==1)
					mark = 0;
				if(mark == 0)
					printf("Jolly\n");
				else
					printf("Not jolly\n");
	}
	return 1;
}