1213C Book Reading (codeforce)

Book Reading

Polycarp is reading a book consisting of n pages numbered from 1 to n. Every time he finishes the page with the number divisible by m, he writes down the last digit of this page number. For example, if n=15 and m=5, pages divisible by m are 5,10,15. Their last digits are 5,0,5 correspondingly, their sum is 10.

Your task is to calculate the sum of all digits Polycarp has written down.

You have to answer q independent queries.

Input

The first line of the input contains one integer q (1≤q≤1000) — the number of queries.

The following q lines contain queries, one per line. Each query is given as two integers n and m (1≤n,m≤1016) — the number of pages in the book and required divisor, respectively.

Output

For each query print the answer for it — the sum of digits written down by Polycarp.

解题思路
试验几次不难看出，m在一定次数时取余会开始循环，假设他们都为10次循环，只需要算出多余次数的和。加上前面部分10次的和。

AC代码

#include<bits/stdc++.h>
#define LL long long
using namespace std;
int main(void) {
    LL q;
    cin>>q;
    while(q--) {
        LL n, m;
        scanf("%lld %lld", &n, &m);
        LL sum = 0;
        for(LL i = 0;i < 10;i++)
            sum += (m * i % 10);
        LL cnt = n / m / 10;
        LL r = n / m % 10;
        LL num = sum * cnt;
        for(LL i = 1;i <= r;i++)
            num += (m * i % 10);
        printf("%lld\n", num);
    }
    return 0;
}