zoukankan      html  css  js  c++  java
  • CF474D. Flowers

    D. Flowers
    time limit per test
    1.5 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. Therefore a dinner can be represented as a sequence of several flowers, some of them white and some of them red.

    But, for a dinner to be tasty, there is a rule: Marmot wants to eat white flowers only in groups of size k.

    Now Marmot wonders in how many ways he can eat between a and b flowers. As the number of ways could be very large, print it modulo1000000007 (109 + 7).

    Input

    Input contains several test cases.

    The first line contains two integers t and k (1 ≤ t, k ≤ 105), where t represents the number of test cases.

    The next t lines contain two integers ai and bi (1 ≤ ai ≤ bi ≤ 105), describing the i-th test.

    Output

    Print t lines to the standard output. The i-th line should contain the number of ways in which Marmot can eat between ai and bi flowers at dinner modulo 1000000007 (109 + 7).

     
    大水,话说这比noip还简单些吧,果然做cf要按x率来做么?(f[i]=f[i-1]+f[i-k])
    #include <cstdio>
    #include <cstring>
    
    const int maxn = 1e5 + 100;
    const int mod = 1e9 + 7;
    
    int f[maxn], sum[maxn];
    
    int main() {
        int t, k;
        scanf("%d%d", &t, &k);
        for(int i = 0; i < k; ++i) {
            f[i] = 1;
        }
        for(int i = k; i <= 100000; ++i) {
            f[i] = f[i - 1] + f[i - k];
            if(mod <= f[i]) f[i] -= mod;
        }
        for(int i = 1; i <= 100000; ++i) {
            sum[i] = sum[i - 1] + f[i];
            if(mod <= sum[i]) sum[i] -= mod;
        }
        while(t--) {
            int a, b;
            scanf("%d%d", &a, &b);
            printf("%d
    ", (sum[b] - sum[a - 1] + mod) % mod);
        }
    
        return 0;
    }

  • 相关阅读:
    兼容利器之X-UA-Compatible
    SQL Server之游标的基础知识
    SQL 按特定字段值排序
    NodeJS 开篇 牛刀小试
    临时表之IF-ELSE
    css中如何设置字体
    怎么做到不加班?
    C# .net中cookie值为中文时的乱码解决方法
    HTML5商城开发一 楼层滚动加载数据
    QQ浏览器X5内核问题汇总
  • 原文地址:https://www.cnblogs.com/hzf-sbit/p/4017223.html
Copyright © 2011-2022 走看看