Free loop！ 爱上编程！

转自http://blog.youkuaiyun.com/huangkuizuiniu/article/details/50614777#include#include#includeusing namespace std;double x[1001],y[1001],a[1001][1001],d[1001],p[1001],ans[10001],asd[10001];int main(){

#include #include #include struct node{ int c,s,t; struct node *l,*r; node(){ c=1; l=NULL;r=NULL; } };int a[50];v

转自http://blog.youkuaiyun.com/huangkuizuiniu/article/details/50619698#include#include#include #define ull unsigned long longusing namespace std;const ull B=1e8+5,C=1e8+7;const int maxn=100001; ch

初次写这题，写得不是很完美，请大家不要吐槽~~~~~~#include #include const int inf=2147483647;int minv[21],ri[21],hi[21],n,m ;int ans ;int dfs (int n,int v,int s,int maxr,int maxh){ int res; int i,tr,th,ts;

#include #include using namespace std;int l,i,j,k,m,n,maxx,a[30],vis[30];int dfs(int line,int num,int len){ if(line==3) return 1; for(i=num-1;i>=1;i--){ if(vis[i]==0){ vis[i]=1;

#include #include int f[101][101],a[101][101],flag[4][2]={{-1,0},{0,-1},{0,1},{1,0}},i,j,k,m,n,sum;int max(int x,int y){ return x>y?x:y;}int dfs(int x,int y){ if(f[x][y]!=-1) return f[x][y];

#include #include using namespace std;int a[100],big,sum,n,cas,v[100],flag;int cmp(int a,int b){ return a>b;}int dfs(int k,int id,int res){ if(k==3) return 1; for(int i=id;i<=n;i++)