Free loop！ 爱上编程！

#include const int size=200010; int a[size]; struct node{ int s,l,r; }; struct node tree[size*10]; int max(int x,int y){ return x>y?x:y; } int create_tree(int h,int p,int q){ tree[h].l=p; tree[h].

转自http://blog.youkuaiyun.com/cnyali/article/details/48199251 #include #include #include #include using namespace std; const int maxn=110,maxm=110; int a[maxn][maxn],f[maxm]; int main(){ int i,j,k,m,n; w

转自：http://blog.youkuaiyun.com/cnyali/article/details/50663663 [cpp] view plain copy #include    #include   #include   #include   const int maxn = 101;   const int INF = (1 in

#include #include #include const int MAXN=2005; int w[MAXN]; bool dp[MAXN]; int main(){ int i,j,t,n,q,k; scanf("%d",&t); while(t--){ scanf("%d",&n); for(i=0;i<n;i++)

#include #include #include const int INF=0x3fffffff; typedef long long ll; const int mod=5201314; const int maxn=505; int n,dp[2][maxn][maxn]; char val[maxn][maxn]; void add(int &x, int y){

#include #include int a,b,c; int p[20000],cnt1,k[20000],cnt2; bool f(){ int i,j; cnt1=cnt2=0; int sqrt1=(int)sqrt(a); for(i=1;i<=sqrt1;++i){ if(a%i==0){ p[cnt1++]=i;