764E Timofey and remoduling[数学]

E. Timofey and remoduling

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Timofey likes integers a lot. Unfortunately, he is very young and can't work with very big integers, so he does all the operations modulo his favorite prime m. Also, Timofey likes to look for arithmetical progressions everywhere.

One of his birthday presents was a sequence of distinct integers a1, a2, ..., an. Timofey wants to know whether he can rearrange the elements of the sequence so that is will be an arithmetical progression modulo m, or not.

Arithmetical progression modulo m of length n with first element x and difference d is sequence of integers x, x + d, x + 2d, ..., x + (n - 1)·d, each taken modulo m.

Input

The first line contains two integers m and n (2 ≤ m ≤ 109 + 7, 1 ≤ n ≤ 105, m is prime) — Timofey's favorite prime module and the length of the sequence.

The second line contains n distinct integers a1, a2, ..., an (0 ≤ ai < m) — the elements of the sequence.

Output

Print -1 if it is not possible to rearrange the elements of the sequence so that is will be an arithmetical progression modulo m.

Otherwise, print two integers — the first element of the obtained progression x (0 ≤ x < m) and its difference d (0 ≤ d < m).

If there are multiple answers, print any of them.

Examples

input

17 5
0 2 4 13 15

output

13 2

input

17 5
0 2 4 13 14

output

-1

input

5 3
1 2 3

output

3 4

题意： 给出m，n 然后给出ai 到 an n个数字的序列，问是否存在一个原序列，使得原序列每一个数字mod m以后得到的序列是a序列

思路： 参考自http://blog.csdn.net/qq_33183401/article/details/54884972

首先给出两个数学公式

1:a1=(sn-n*(n-1)/2*d)/n 
2:每一项的平方和=n(a1)^2+n(n-1)(2n-1)d^2/6+n(n-1)*d*a1 

其中第二个公式的推导：http://www.zybang.com/question/e7bd3f48f233e37d191b004d77c91ebf.html

采用第二个式子验证，枚举a1和d，得到合适的a1和d以后仿照题意验证是否mod以后和a序列相等。

其中 /n mod m这里用到了逆元的计算，由于m是质数，采用费马小定理，1/n的mod m逆元为 n^(m-2) 通过快速幂模运算求得。

代码：（参考自johsnows）

#include <bits/stdc++.h>  
using namespace std;  
const int maxn=1e5+5;  
int a[maxn];  
int b[maxn];  
int fp(int a, int n,int  m)  
{  
    int res=1;  
    int tem=a;  
    while(n)  
    {  
      if(n&1)res=1LL*res*tem%m;  
      tem=1LL*tem*tem%m;  
      n>>=1;  
    }  
    return res;  
}  
int main()  
{  
  int n, m;  
  cin>>m>>n;  
    
  int i;  
  int s[2];  
  s[0]=s[1]=0;  
  for(i=0; i<n; i++)  
  {  
     scanf("%d", &a[i]);  
     s[0]=(a[i]+s[0])%m;  
     s[1]=(s[1]+1LL*a[i]*a[i]%m)%m;  
  }  
  if(n==1)return 0*printf("%d 0\n", a[0]);  
  if(n==m)return 0*printf("0 1");  
  sort(a, a+n);  
  for(int i=1; i<n; i++)  
  {  
    int d=(a[i]-a[0]);  
    int x=(s[0]-1LL*n*(n-1)/2%m*d%m+m)*fp(n,m-2,m)%m;  
    int tem=1LL*n*x%m*x%m;  
    tem=(tem+1LL*n*(n-1)%m*d%m*x%m)%m;  
    tem=(tem+1LL*n*(n-1)*(2*n-1)/6%m*d%m*d%m)%m;  
  
           int tmp=1LL*n*x%m*x%m;  
        tmp=(tmp+1LL*n*(n-1)%m*d%m*x%m)%m;  
        tmp=(tmp+1LL*n*(n-1)*(2*n-1)/6%m*d%m*d%m)%m;  
    if(s[1]==tem)  
    {  
    b[0]=x;  
    for(int i=1; i<n; i++)  
    {  
       b[i]=(b[i-1]+d)%m;  
    }  
    sort(b, b+n);   
    bool isok=true;  
    for(int i=0; i<n; i++)isok&=(a[i]==b[i]);  
    if(isok)return 0*printf("%d %d\n", x, d);  
    }  
  }  
  printf("-1\n");  
  return 0;  
}