zoukankan      html  css  js  c++  java
  • poj2282

    先算0~a的各位数,再算b的,相减得结果

    View Code
    #include <iostream>
    #include <cstdlib>
    #include <cstring>
    #include <cstdio>
    using namespace std;

    #define maxn 1005

    long long f[maxn], g[maxn];

    void cal(int a, long long *f)
    {
    if (a == 0)
    return;
    long long x = 10;
    while (x <= a * 10)
    {
    long long count = a / x * x;
    for (int i = 0; i < 10; i++)
    f[i] += count / 10;
    int digit = a / (x / 10) % 10;
    for (int i = 0; i < digit; i++)
    f[i] += x / 10;
    f[digit] += a % (x / 10) + 1;
    if (x <= a)
    f[0] -= x;
    x *= 10;
    }
    f[0]--;
    }

    int main()
    {
    //freopen("t.txt", "r", stdin);
    int a, b;
    while (scanf("%d%d", &a, &b), a | b)
    {
    memset(f, 0, sizeof(f));
    memset(g, 0, sizeof(g));
    if (a > b)
    swap(a, b);
    a--;
    cal(a, f);
    cal(b, g);
    printf("%lld", g[0] - f[0]);
    for (int i = 1; i < 10; i++)
    printf(" %lld", g[i] - f[i]);
    putchar('\n');
    }
    return 0;
    }

  • 相关阅读:
    BZOJ 2326 数学作业
    BZOJ 4448 情报传递
    BZOJ 4443 小凸玩矩阵
    BZOJ 1852 最长不下降序列
    BZOJ 4373 算术天才⑨与等差数列
    68285
    65656556
    D. Points in rectangle
    恐怖的怪物
    再战斐波那契
  • 原文地址:https://www.cnblogs.com/rainydays/p/2197951.html
Copyright © 2011-2022 走看看