scu4437(二分)

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<iostream>
 5 #define ll long long
 6 using namespace std;
 7 const int maxn=1e5+10;
 8 int n;
 9 int B[maxn];
10 int num[maxn];
11 int main()
12 {
13     while(scanf("%d",&n)!=EOF)
14     {
15         for(int i=0;i<n;i++)
16             scanf("%d",&num[i]);
17         int m=1;
18         ll ans=0;
19         for(int i=1;i<10;i++)
20         {
21             m*=10;
22             for(int i=0;i<n;i++)
23                 B[i]=num[i]%m;
24             sort(B,B+n);
25             for(int i=0;i<n;i++)
26             {
27                 int pos=lower_bound(B+i+1,B+n,m-B[i])-B;
28                 ans=ans+(n-pos);
29             }
30         }
31         printf("%lld\n",ans);
32     }
33 
34 }