More actions
imported>rabierre No edit summary |
imported>rabierre No edit summary |
||
| Line 1: | Line 1: | ||
#include < | #include <memory.h> | ||
#include <math.h> | #include <math.h> | ||
| Line 6: | Line 6: | ||
int a[3000]; | int a[3000]; | ||
bool isJ[3000] = {false}; | bool isJ[3000] = {false}; | ||
while(true) { | while(true) { | ||
if(feof(stdin)) break; | if(feof(stdin)) break; | ||
scanf("%d", &count); | scanf("%d", &count); | ||
if(feof(stdin)) break; | |||
for(int i=0; i<count; i++){ | for(int i=0; i<count; i++){ | ||
scanf("%d", &a[i]); | scanf("%d", &a[i]); | ||
| Line 18: | Line 19: | ||
if(isJ[index]) { | if(isJ[index]) { | ||
printf("Not jolly\n"); | printf("Not jolly\n"); | ||
break; | break; | ||
} | } | ||
isJ[index] = true; | isJ[index] = true; | ||
} | } | ||
for(int i=0; i<count; i++){ | |||
for(int i=0; i< | if(isJ[i]) continue; | ||
isJ[i]= | else { | ||
printf("Not jolly\n"); | |||
break; | |||
} | |||
if(i==count-1) printf("Jolly\n"); | |||
} | } | ||
memset(isJ, false, 3000); | |||
} | } | ||
return 0; | return 0; | ||
} | } | ||
Revision as of 06:35, 5 June 2011
#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]);
}
for(int i=1; i<count; i++){
int index = abs(a[i]-a[i-1]);
if(isJ[index]) {
printf("Not jolly\n");
break;
}
isJ[index] = true;
}
for(int i=0; i<count; i++){
if(isJ[i]) continue;
else {
printf("Not jolly\n");
break;
}
if(i==count-1) printf("Jolly\n");
}
memset(isJ, false, 3000);
}
return 0;
}