B. Carries
Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main
Submit Status
frog has n integers a1,a2,…,an, and she wants to add them pairwise.
Unfortunately, frog is somehow afraid of carries (进位). She defines \emph{hardness} h(x,y) for adding x and y the number of carries involved in the calculation. For example, h(1,9)=1,h(1,99)=2.
Find the total hardness adding n integers pairwise. In another word, find
∑1≤i<j≤nh(ai,aj)
.
Input
The input consists of multiple tests. For each test:
The first line contains 1 integer n (2≤n≤105). The second line contains n integers a1,a2,…,an. (0≤ai≤109).
Output
For each test, write 1 integer which denotes the total hardness.
Sample Input
2
5 5
10
0 1 2 3 4 5 6 7 8 9
Sample Output
1
20
解析:直接暴力会TLE,假设会在2^k上产生进位,枚举k,然后二分算出在第10^k上产生进位的数的个数
AC代码:
#include <bits/stdc++.h>
using namespace std;
int a[100002], b[100002];
int main(){
#ifdef sxk
freopen("in.txt", "r", stdin);
#endif // sxk
int n;
long long ans, s;
while(scanf("%d", &n) == 1){
for(int i=0; i<n; i++) scanf("%lld", &a[i]);
ans = 0, s = 10;
for(int k=0; k<10; k++, s*=10){
for(int i=0; i<n; i++) b[i] = a[i] % s;
sort(b, b+n);
for(int i=0; i<n; i++){
long long t = s - b[i];
if(b[n-1] >= t){
int cnt = lower_bound(b, b+n, t) - b;
if(cnt > i) ans += n - cnt;
else ans += n - (i + 1);
}
}
}
printf("%lld\n", ans);
}
return 0;
}