제출 #24614

#제출 시각아이디문제언어결과실행 시간메모리
24614jiangzhi캥거루 (CEOI16_kangaroo)C++11
6 / 100
2000 ms1124 KiB
#include <cstdio>
#include <algorithm>

using namespace std;



const int N = 2010;

int vec[N];

int main(){
	//freopen("kangaroo.in","r",stdin);
	//freopen("kangaroo.out","w",stdout);
	int n,s,e;
	scanf("%d%d%d", &n,&s,&e);
	for(int i = 0; i < n ;i++){
		vec[i]=i+1;
	}
	int ans = 0;
	do{
		if(s!=vec[0] || e != vec[n-1])continue;
		int ok = 1;
		for(int i = 0; i < n-2; i++){
			if((vec[i] - vec[i+1] > 0) == (vec[i+1] - vec[i+2] > 0))ok=0;
		}
		if(ok)ans++;

	}while(next_permutation(vec,vec+n));
	printf("%d\n",ans);
}

컴파일 시 표준 에러 (stderr) 메시지

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:16:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n,&s,&e);
                           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...