#include <stdio.h> #include <memory.h> #include <math.h> int main(){ int count; int a[3000]; bool isJ[3000]; while(true) { if(feof(stdin)) break; scanf("%d", &count); if(feof(stdin)) break; for(int i=0; i<count; i++){ scanf("%d", &a[i]); } memset(isJ, false, 3000); if(count == 1) goto JOLLY; for(int i=1; i<count; i++){ int index = abs(a[i]-a[i-1]); if(isJ[index]) { goto NOT_JOLLY; break; } isJ[index] = true; } for(int i=1; i<count-1; i++){ if(isJ[i]==true); else { goto NOT_JOLLY; } if(i==count-2) goto JOLLY; } if(count==2&&isJ[1]) goto JOLLY; NOT_JOLLY: printf("Not jolly\n"); continue; JOLLY: printf("jolly\n"); continue; } return 0; }
---
#include <stdio.h> #include <memory.h> #include <math.h> int main(){ int count; int a[3000]; bool isJ[3000] = {false}; while(true) { if(feof(stdin)) break; scanf("%d", &count); if(feof(stdin)) break; for(int i=0; i<count; i++){ scanf("%d", &a[i]); } bool F=1; for(int i=1; i<count; i++){ int index = abs(a[i]-a[i-1]); if(isJ[index]) { F=0; break; } isJ[index] = true; } for(int i=1; i<count; i++){ if(isJ[i]) continue; else { F=0; break; } } puts(F?"Jolly":"Not jolly"); memset(isJ, false, 3000); } return 0; }