zoukankan      html  css  js  c++  java
  • HDU 2152

    生成函数简单题

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #define N 110
    using namespace std;
    
    struct Fruit{
    	int a,b;
    };
    Fruit num[N];
    int c1[N],c2[N];
    
    int main(){
    	int n,m;
    	while(scanf("%d%d",&n,&m)!=EOF){
    		for(int i=1;i<=n;i++)
    		scanf("%d%d",&num[i].a,&num[i].b);
    		memset(c1,0,sizeof(c1));
    		memset(c2,0,sizeof(c2));
    		for(int i=num[1].a;i<=num[1].b;i++)
    		c1[i]=1;
    		for(int i=2;i<=n;i++){
    			for(int j=0;j<N;j++){
    				for(int k=num[i].a;k<=num[i].b&&k+j<N;k++)
    				c2[k+j]+=c1[j];
    			}
    			for(int j=0;j<N;j++)
    			c1[j]=c2[j],c2[j]=0;
    		}
    		printf("%d
    ",c1[m]);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    HDU 4608 I-number
    hdu 4607 ( Park Visit )
    ZROI十一集训Day2
    CodeForces1230
    模拟退火
    ZROI#1007
    ZROI#1006
    ZROI#1005
    ZROI#1004
    ZROI#962
  • 原文地址:https://www.cnblogs.com/jie-dcai/p/4007006.html
Copyright © 2011-2022 走看看