SGU 140

AC了！！哈哈，我就知道是int64越界了，所以每次模一个p就可以了~

拓展欧几里德

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);

i64 gcd(i64 _a, i64 _b)
{
    if (!_a || !_b)
    {
        return max(_a, _b);
    }
    i64 _t;
    while (_t = _a % _b)
    {
        _a = _b;
        _b = _t;
    }
    return _b;
};

i64 ext_gcd (i64 _a, i64 _b, i64 &_x, i64 &_y)
{
    if (!_b)
    {
        _x = 1;
        _y = 0;
        return _a;
    }
    i64 _d = ext_gcd (_b, _a % _b, _x, _y);
    i64 _t = _x;
    _x = _y;
    _y = _t - _a / _b * _y;
    return _d;
}

i64 invmod (i64 _a, i64 _p)
{
    i64 _ans, _y;
    ext_gcd (_a, _p, _ans, _y);
    _ans < 0 ? _ans += _p : 0;
    return _ans;
}
const int maxn = 111;

i64 ea[maxn];
i64 a[maxn];
i64 x[maxn];
i64 n,b,p;

int main()
{
    cin>>n>>p>>b;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        ea[i] = a[i];
    }
    if(b==0)
    {
        cout<<"YES"<<endl;
        for(int i=1;i<n;i++)
        {
            cout<<"0 ";
        }
        cout<<"0"<<endl;
        return 0;
    }
    MM(x,0);
    x[1] =1;
    i64 gan = a[1];
    for(int i=2;i<=n;i++)
    {
        gan = gcd(gan,a[i]);
    }
    gan = gcd(gan,p);
    i64 t1,t2;
    i64 now = a[1];
    i64 gx;
    if(b%gan==0)
    {
        for(int i=2;i<=n;i++)
        {
            if(a[i])
            {
                gx = gcd(now,a[i]);
                now/=gx;
                a[i]/=gx;
                t1 = invmod(now,a[i]);
                t2 = (1-t1*now)/a[i];
                now = gx;
                i64 as=0;
                x[i] = t2;
                for(int u=1;u<i;u++)
                {
                    while(x[u]<0)
                    {
                        x[u]+=p;
                    }
                    x[u]%=p;
                    x[u]*=t1;
                    x[u]%=p;
                    as = x[u]/ea[i];
                    x[u] -= as*ea[i];
                    x[i] += as*ea[u];
                    x[i]%=p;
                    x[u]%=p;
                    while(x[u]<0)
                    {
                        x[u] += ea[i];
                        x[i] -= ea[u];
                    }
                }
            }
            if(gx==1)
            {
                for(int u=1;u<=i;u++)
                {
                    while(x[u]<0)
                    {
                        x[u] += p;
                    }
                    x[u]%=p;
                    x[u]*=b;
                    x[u]%=p;
                }
                cout<<"YES"<<endl;
                for(int i=1;i<=n-1;i++)
                {
                    cout<<x[i]<<" ";
                }
                cout<<x[n]<<endl;
                return 0;
            }
        }
        gx = gcd(now,p);
        now /= gx;
        b /= gx;
        p /= gx;
        t1 = invmod(now,p);
        for(int i=1;i<=n;i++)
        {
            while(x<0)
            {
                x[i] += p;
            }
            x[i]%=p;
            x[i]*=b;
            x[i]%=p;
            x[i]*=t1;
            x[i]%=p;
        }

        cout<<"YES"<<endl;
        for(int i=1;i<=n-1;i++)
        {
            cout<<x[i]<<" ";
        }
        cout<<x[n]<<endl;
        return 0;
    }
    else
    {
        cout<<"NO"<<endl;
    }
    return 0;
}