Coming Today

摘要： 题目：将1,2,3,4,5……n-1,n分成和相等的两个子集，有多少种分法#include<stdio.h>#include<math.h>#include<assert.h>int main(){ FILE *fin,*fout; fin=fopen("1.txt","r"); fout=fopen("2.txt","w"); assert(fin); assert(fout); int N,dp[40][800]={0}; fscanf(fin,"%d", 阅读全文