2015 四川省赛 B Carries （脑洞题）

最新推荐文章于 2015-10-02 21:57:45 发布

TaoSama

最新推荐文章于 2015-10-02 21:57:45 发布

阅读量673

点赞数

分类专栏：思维 - 构造算法

本文链接：https://blog.csdn.net/lwt36/article/details/48861281

版权

思维 - 构造算法专栏收录该内容

6 篇文章 0 订阅

订阅专栏

题意:

$N<=10^5序列中, 两两个数的进位总和$

分析:

某一位要进位一定满足 $a[i] \% 10^k + a[j] \% 10^k >= 10^k$
情况不多一共 $10^1\thicksim10^9 \ 9$ 种情况
对于每一种只要排序余数然后二分查找计算就可以了

代码:

//
//  Created by TaoSama on 2015-10-01
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, a[N], b[N];

int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
//  freopen("out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d", &n) == 1) {
        for(int i = 0; i < n; ++i) scanf("%d", a + i);
        long long ans = 0;
        for(int k = 10; k <= 1e9; k *= 10) {
            for(int i = 0; i < n; ++i) b[i] = a[i] % k;
            sort(b, b + n);
            for(int i = 0; i < n; ++i) {
                int t = k - b[i];
                int p = lower_bound(b + i + 1, b + n, t) - b;
                ans += n - p;
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}