Codeforces Round #582 C. Book Reading（数学）

C. Book Reading
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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.
Example
Input
Copy

7
1 1
10 1
100 3
1024 14
998244353 1337
123 144
1234312817382646 13

Output
Copy

1
45
153
294
3359835
0
427262129093995

强烈的直觉让我这么做，可能是上帝让我A了这题，根本没想

#include <iostream>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <stdio.h>
#include<queue>
#include<math.h>
using namespace std;
#define ll unsigned long long
int a[150010];
int main()
{  
	int t;
	cin >> t;
	while (t--)
	{
		ll n, m;
		ll ans = 0;
		ll sum = 0;
		scanf("%I64d %I64d", &n, &m);
		for (int i = 1; i <= 10; i++)
		{
			a[i] = m * i % 10;
			sum += a[i];
		}
		ll t = n / (m*10);
		ll t2 = n % (m*10)/m;
		for (int i = 1; i <= t2; i++)
		{
			ans += a[i];
		}
		printf("%I64d\n", t * sum + ans);
	}
}