USACO subset TLE code

最新推荐文章于 2014-07-27 01:31:20 发布

原创最新推荐文章于 2014-07-27 01:31:20 发布 · 738 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

ACM-ICPC 同时被 2 个专栏收录

161 篇文章

订阅专栏

USACO

37 篇文章

订阅专栏

/*BF
ID:kevin_s1
PROG:subset
LANG:C++
*/

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <list>
#include <cmath>

using namespace std;

//gobal variable====
int N;
int sum;
int result;
//==================


//function==========
void DFS(int i, int count){
	if(i > N)
		return;
	if(count == sum - count){
		result++;
		return;
	}
	DFS(i + 1, count);
	DFS(i + 1, count + i);
	return;
}

//==================

int main(){
	freopen("subset.in","r",stdin);
	freopen("subset.out","w",stdout);
	cin>>N;
	sum = N * (N + 1) / 2;
	if(sum % 2 == 1){
		cout<<"0"<<endl;
	}
	else if(sum % 4 != 0 && (sum + 1) % 4 != 0){
		cout<<"0"<<endl;
	}
	else{
		result = 0;
		DFS(1, 0);
		cout<<result<<endl;
	}
	return 0;
}