JollyJumpers/서지혜 - Revision history

imported>rabierre at 07:46, 5 June 2011

2011-06-05T07:46:36Z

← Older revision		Revision as of 07:46, 5 June 2011
Line 1:		Line 1:
	* 왜 Accept가 안되나 했더니 검사하는 부분에서 count-1이어서.. ~~ㅠㅠㅠㅠ~~		* 왜 Accept가 안되나 했더니 검사하는 부분에서 count-1이어서......
	#include <memory.h>		#include <memory.h>
	#include <math.h>		#include <math.h>

imported>rabierre at 07:45, 5 June 2011

2011-06-05T07:45:46Z

← Older revision		Revision as of 07:45, 5 June 2011
Line 1:		Line 1:
			* 왜 Accept가 안되나 했더니 검사하는 부분에서 count-1이어서.. ㅠㅠㅠㅠ
	#include <memory.h>		#include <memory.h>
	#include <math.h>		#include <math.h>

imported>rabierre at 07:31, 5 June 2011

2011-06-05T07:31:57Z

← Older revision		Revision as of 07:31, 5 June 2011
Line 27:		Line 27:
	}		}

	for(int i=1; i<count-1; i++){		for(int i=1; i<count; i++){
	if(isJ[i]==true);		if(isJ[i]==true);
	else {		else {
	goto NOT_JOLLY;		goto NOT_JOLLY;
	}		}
	if(i==count-2) goto JOLLY;		if(i==count-1) goto JOLLY;
	}		}
	if(count==2&&isJ[1])		if(count==2&&isJ[1])

imported>joojis at 07:21, 5 June 2011

2011-06-05T07:21:13Z

@@ Line 43: / Line 43: @@
   			printf("jolly\n");
   			continue;
+  	}
   	return 0;
+  }

imported>rabierre at 06:59, 5 June 2011

2011-06-05T06:59:08Z

← Older revision		Revision as of 06:59, 5 June 2011
Line 5:		Line 5:
	int count;		int count;
	int a[3000];		int a[3000];
	bool isJ[3000] ~~= {false}~~;		bool isJ[3000];

	while(true) {		while(true) {
Line 14:		Line 14:
	scanf("%d", &a[i]);		scanf("%d", &a[i]);
	}		}

			memset(isJ, false, 3000);
			if(count == 1)
			goto JOLLY;
	for(int i=1; i<count; i++){		for(int i=1; i<count; i++){
	int index = abs(a[i]-a[i-1]);		int index = abs(a[i]-a[i-1]);
	if(isJ[index]) {		if(isJ[index]) {
	~~printf("Not jolly\n")~~;		goto NOT_JOLLY;
	break;		break;
	}		}
Line 24:		Line 27:
	}		}

	for(int i=0; i<count; i++){		for(int i=1; i<count-1; i++){
	if(isJ[i]) ~~continue~~;		if(isJ[i]==true);
	else {		else {
	~~printf("Not jolly\n");~~		goto NOT_JOLLY;
	~~break~~;
	}		}
	if(i==count-~~1) printf("Jolly\n"~~);		if(i==count-2) goto JOLLY;
	}		}
	~~memset~~(isJ~~, false, 3000~~);		if(count==2&&isJ[1])
			goto JOLLY;

			NOT_JOLLY:
			printf("Not jolly\n");
			continue;
			JOLLY:
			printf("jolly\n");
			continue;
	}		}
	return 0;		return 0;
	}		}

imported>rabierre at 06:35, 5 June 2011

2011-06-05T06:35:40Z

← Older revision		Revision as of 06:35, 5 June 2011
Line 1:		Line 1:
	#include <~~stdio~~.h>		#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};
	~~bool jollyFlag=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");
	~~jollyFlag=true;~~
	break;		break;
	}		}
	isJ[index] = true;		isJ[index] = true;
	}
	~~if(jollyFlag==false) {~~
	~~printf("Jolly\n");~~
	}		}

	~~jollyFlag = false;~~		for(int i=0; i<count; i++){
	for(int i=0; i<=count; i++){		if(isJ[i]) continue;
	isJ[i]=~~false~~;		else {
			printf("Not jolly\n");
			break;
			}
			if(i==count-1) printf("Jolly\n");
	}		}
			memset(isJ, false, 3000);
	}		}
	return 0;		return 0;
	}		}

imported>rabierre at 06:19, 5 June 2011

2011-06-05T06:19:41Z

New page

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

int main(){
int count;
int a[3000];
bool isJ[3000] = {false};
bool jollyFlag=false;
while(true) {
if(feof(stdin)) break;
scanf("%d", &count);
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");
jollyFlag=true;
break;
}
isJ[index] = true;
}
if(jollyFlag==false) {
printf("Jolly\n");
}

jollyFlag = false;
for(int i=0; i<=count; i++){
isJ[i]=false;
}
}
return 0;
}