OJ 1284 counting problem

describe

Try to calculate in the interval 1 To n Of all integers , Numbers x（0≤x≤9） How many times have there been ？ for example , stay 1 To 11 in , That is to say 1、2、3、4、5、6、7、8、9、10、11 in , Numbers 1 There is 4 Time .

Input
Each group of input data has a total of 1 That's ok , contain 2 It's an integer n、x, Separated by a space .

Data scale ：

about 100% The data of ,1≤n≤1,000,000,0≤x≤9.

Output
Total output per group 1 That's ok , Contains an integer , Express x Number of occurrences .

sample input 1 

11 1
sample output 1

4

The question requires finding out the number of times the number appears , You can use loops , from 1 To n Check , adopt Remainder 10 And divided by 10 To get every bit , To determine whether it is x

#include <iostream>
#include <string>
using namespace std;

int main()
{
    long long x,n;
    while(cin>>x>>n)
    {
        int cont=0;
        for(int i=1;i<=x;i++)
        {
            int k=i;
            while(k)
            {
                if(k%10==n)
                    cont++;
                k/=10;
            }
        }
        cout<<cont<<endl;
    }
    return 0;
}