sequence1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 48 Accepted Submission(s): 42
Problem Description
a with length n, could you tell me how many pairs (i,j) ( i < j ) for abs(ai−aj) mod b=c.
Input
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
3 3 2
1 2 3
3 3 1
1 2 3
Sample Output
1 2
#include<stdio.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[110];
int p[10010];
int main()
{
int n,b,c;
int i,j;
while(scanf("%d%d%d",&n,&b,&c)!=EOF)
{
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
int k=0;
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
p[k++]=abs(a[i]-a[j]);
}
}
int m=0;
for(i=0;i<k;i++)
{
if(p[i]%b==c)
m++;
}
printf("%d\n",m);
}
return 0;
}