Submission #6896149

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
ll modpow(ll a, ll n, int mod) {
	ll r = 1; a %= mod;
	while (n) r = r * ((n % 2) ? a : 1) % mod, a = a * a % mod, n >>= 1;
	return r;
}
vector<ll> LagrangePolynomialGetCoefficient(vector<pair<int, int>> points, int mod) {
	int N = points.size();
	vector<ll> polynomial(N + 1);
	polynomial[0] = 1;
	fore(p, points) {
		vector<ll> tmp(N + 1);
		rep(i, 0, N) tmp[i + 1] = polynomial[i];
		rep(i, 0, N) tmp[i] = (tmp[i] - ((polynomial[i] * p.first) % mod) + mod) % mod;
		swap(polynomial, tmp);
	}

	vector<ll> res(N);

	rep(i, 0, N) if (points[i].second) {
		ll Q = 1;
		rep(j, 0, N) if (j != i) Q = Q * (points[i].first - points[j].first) % mod;
		Q = modpow((Q % mod + mod) % mod, mod - 2, mod);

		vector<ll> tmp(N + 1);
		rep(j, 0, N + 1) tmp[j] = polynomial[j];
		rrep(j, N, 1) {
			Q %= mod;
			res[j - 1] = (res[j - 1] + ((tmp[j] * Q) % mod) * points[i].second) % mod;
			tmp[j - 1] = (tmp[j - 1] + tmp[j] * points[i].first) % mod;
		}
	}

	rep(i, 0, N) res[i] %= mod;
	return res;
}
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/













int P, A[3030];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> P;
	rep(i, 0, P) cin >> A[i];

	vector<pair<int, int>> ps;
	rep(i, 0, P) ps.push_back({ i, A[i] });

	auto ans = LagrangePolynomialGetCoefficient(ps, P);

	rep(i, 0, P) {
		if (i) printf(" ");
		printf("%lld", ans[i]);
	}
	printf("\n");
}

Submission Info

Judge Result