zoukankan      html  css  js  c++  java
  • Kattis之旅——Divisible Subsequences

    Given a sequence of positive integers, count all contiguous subsequences (sometimes called substrings, in contrast to subsequences, which may leave out elements) the sum of which is divisible by a given number. These subsequences may overlap. For example, the sequence (see sample input)
    2, 1, 2, 1, 1, 2, 1, 2

    contains six contiguous subsequences the sum of which is divisible by four: the first to eighth number, the second to fourth number, the second to seventh number, the third to fifth number, the fourth to sixth number, and the fifth to seventh number.

    Input

    The first line of the input consists of an integer c (1 <= c <= 200), the number of test cases. Then follow two lines per test case.
    Each test case starts with a line consisting of two integers d (1 <= d <= 1 000 000) and n (1 <= n <= 50 000), the divisor of the sum of the subsequences and the length of the sequence, respectively. The second line of a test case contains the elements of the sequence, which are integers between 1 and 1 000 000 000, inclusively.

    Output

    For each test case, print a single line consisting of a single integer, the number of contiguous subsequences the sum of which is divisible by d.
    Sample Input 1 Sample Output 1
    2
    7 3
    1 2 3
    4 8
    2 1 2 1 1 2 1 2
    
    0
    6
    

    错到心态爆炸,谁能告诉我WA的代码错在哪。。

    WA代码:

    //Asimple
    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int maxn = 1000010;
    ll n, m, s, res, ans, len, T, k, num;int Hash[maxn];
    void input() {
        scanf("%lld", &T);
        while( T -- ) {
            scanf("%lld%lld", &m, &n);
            memset(Hash, 0, sizeof(Hash));
            Hash[0] = 1;
            ll sum = 0;
            for(int i=0; i<n; i++) {
                scanf("%lld", &num);
                sum += num;
                sum %= m;
                Hash[sum]++;
            }
            ans = 0;
            for(int i=0; i<m; i++) {
                if( Hash[i]>0 )
                    ans += Hash[i]*(Hash[i]-1)/2;
            }
            printf("%lld
    ", ans);
        }
    }
    
    int main(){
        input();
        return 0;
    }

    AC代码:

     //Asimple
    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int maxn = 1000010;
    ll n, m, s, res, ans, len, T, k, num;
    ll Hash[maxn];
    int a[maxn];void input() {
        scanf("%lld", &T);
        while( T -- ) {
            scanf("%lld%lld", &m, &n);
            memset(Hash, 0, sizeof(Hash));
            Hash[0] = 1;
            a[0] = 0;
            for(int i=1; i<=n; i++) {
                scanf("%lld", &num);
                a[i] = a[i-1]+num;
                a[i] %= m;
                Hash[a[i]]++;
            }
            ans = 0;
            for(int i=0; i<m; i++) {
                if( Hash[i]>0 )
                    ans += Hash[i]*(Hash[i]-1)/2;
            }
            printf("%lld
    ", ans);
        }
    }
    
    int main(){
        input();
        return 0;
    }

    谢谢大佬的AC代码:http://blog.csdn.net/luckyxiaoqiang/article/details/7900284

  • 相关阅读:
    封装函数通过输入(元素,属性,目标值)改变div样式
    unicode键盘编码表
    js中的索引值
    JavaScript的三大组成部分
    阿望教你用vue写扫雷(超详细哦)
    关于换行以及换行属性
    html中的a标签详解
    利用GitHub Pages + jekyll快速搭建个人博客
    本博客文章转载,请注明出处
    git clone克隆项目太慢,或者直接导致克不下来的解决办法(转载请注明出处)
  • 原文地址:https://www.cnblogs.com/Asimple/p/6769778.html
Copyright © 2011-2022 走看看