Submission #1220748

#TimeUsernameProblemLanguageResultExecution timeMemory
1220748s3yoonparkMultiplication (BOI24_multiplication)C++20
100 / 100
0 ms328 KiB
#include <bits/stdc++.h> #define ll long long #define ar array #define sz(x) (int)(x).size() using namespace std; const int MOD = 1E9 + 7; int mult(int a, int b) { return (long long)a * b % MOD; } void solve() { int n; cin >> n; vector<ll> a(n + 1, 0); int ans = 1; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] %= MOD; ans = mult(ans, a[i]); } cout << ans << '\n'; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int tests = 1; // cin >> tests; while (tests--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...