hdu 5567

最新推荐文章于 2016-07-12 19:06:23 发布

真的好难

最新推荐文章于 2016-07-12 19:06:23 发布

阅读量455

点赞数

分类专栏：水题 acm

本文链接：https://blog.csdn.net/a73265/article/details/50060157

版权

acm 同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

水题

18 篇文章 0 订阅

订阅专栏

sequence1

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 292 Accepted Submission(s): 218

Problem Description

Given an array

a with length

n , could you tell me how many pairs

(i,j) ( i < j ) for

abs(ai−aj) mod b=c .

Input

Several test cases(about

5 )

For each cases, first come 3 integers,

n,b,c(1≤n≤100,0≤c<b≤109)

Then follows

n integers

ai(0≤ai≤109)

Output

For each cases, please output an integer in a line as the answer.

Sample Input

Sample Output

1
2

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <map>
#include <queue>
#include <iostream>
using namespace std;
const int maxn=200;
int a[maxn];
int main()
{
    int n,b,c;
    while(~scanf("%d%d%d",&n,&b,&c))
    {
        int cnt=0;
        for(int i=0;i<n;i++)
            scanf("%d",a+i);
        for(int i=0;i<n;i++)
        {
            for(int k=i+1;k<n;k++)
            {
                if(abs(a[k]-a[i])%b==c)
                    cnt++;
            }
        }
        printf("%d\n",cnt);
    }


    return 0;
}