結果
問題 | No.1084 積の積 |
ユーザー |
![]() |
提出日時 | 2020-06-20 13:17:02 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 3,593 bytes |
コンパイル時間 | 985 ms |
コンパイル使用メモリ | 102,548 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-03 17:14:03 |
合計ジャッジ時間 | 2,605 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 27 |
ソースコード
#include <iostream>#include <string>#include <algorithm>#include <vector>#include <iomanip>#include <math.h>#include <numeric>#include <complex>#include <queue>#include <deque>#include <stack>#include <map>#include <unordered_map>#include <set>#include <bitset>#include <functional>#include <assert.h>using ll=long long;#define int ll#define rng(i,a,b) for(int i=int(a);i<int(b);i++)#define rep(i,b) rng(i,0,b)#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)#define per(i,b) gnr(i,0,b)#define eb emplace_back#define all(x) x.begin(),x.end()#define SZ(x) ((int)x.size())#define fi first#define se secondconst int INF = 1e15;using namespace std;template<class T> using vc=vector<T>;template<class T> using vvc=vc<vc<T>>;using pi=pair<int,int>;using vi=vc<int>;template<class T>inline bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}template<class T>inline bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}const int MOD = 1000000007;template<int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr int getmod() { return MOD; }constexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {if (n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}};using mint = Fp<MOD>;int power(int x,int y,int p){int res=1;x=x%p;while(y){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}signed main() {cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);int N; cin >> N;int MAX=1000000000;int A[N];rep(i,N) {cin >> A[i];if(A[i]==0) {cout << 0 << endl;return 0;}}int mul=1;mint sum=1;mint ans=1;int r=0;rep(l,N) {while(mul*A[r]<MAX && r<N) {mul*=A[r++];sum*=mul;}ans*=sum;mul/=A[l];sum/=power(A[l],r-l,MOD);}cout << ans << endl;}