Digit Count

最新推荐文章于 2022-01-02 17:52:51 发布

郭晋龙

最新推荐文章于 2022-01-02 17:52:51 发布

阅读量1.2k

点赞数 1

分类专栏： codeforce 算法入门

本文链接：https://blog.csdn.net/m0_57006708/article/details/119891272

版权

codeforce 同时被 2 个专栏收录

168 篇文章 1 订阅

订阅专栏

算法入门

99 篇文章 1 订阅

订阅专栏

Digit Count

时间限制：C/C++ 5秒，其他语言10秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

Dr. Orooji’s children have played Tetris but are not willing to help Dr. O with a related problem.
Dr. O’s children don’t realize that Dr. O is lucky to have access to 100+ great problem solvers and
great programmers today!

Given a range (in the form of two integers) and a digit (0-9), you are to count how many

occurrences of the digit there are in the given range.

输入描述:

There is only one input line; it provides the range and the digit. Each integer for the range will be
between 1000 and 9999 (inclusive) and the digit will be between 0 and 9 (inclusive). Assume the
first integer for the range is not greater than the second integer for the range.

输出描述:

Print the number of occurrences of the digit in the given range.

示例1

输入

复制

1000 1000 0

输出

复制

示例2

输入

复制

1000 1001 0

输出

复制

示例3

输入

复制

8996 9004 5

输出

复制

示例4

输入

复制

9800 9900 5

输出

复制

#include<iostream>
#include<set>
#include<cstring>
int  solve(int x,int k){
    int sum=0;
    int a,b,c,d;
    a=x/1000;
    if(a==k) sum++;
    b=(x-a*1000)/100;
    if(b==k) sum++;
    d=x%10;
    if(d==k) sum++;
    c=(x%100-d)/10;
    if(c==k) sum++;
    return sum;
}
using namespace std;
int main(){
    int a,b;
    int k;
    cin>>a>>b>>k;
    int res=0;
    for(int i=a;i<=b;i++){
        res+=solve(i, k);
    }
    cout<<res;
}