| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1304371 | dbekarys | Multiplication (BOI24_multiplication) | C++20 | 1 ms | 584 KiB |
#include <bits/stdc++.h>
#define int long long
#define pll pair<int,int>
#define endl '\n'
using namespace std;
const int MOD2=998244353;
const int MOD1=1e9+7;
const int N=3e5+7;
const int LOG=20;
const long long inf=8e18+7;
signed main()
{
ios_base::sync_with_stdio(0),
cin.tie(0);
int n;
cin>> n;
int a[n];
int c=1;
for(int i=0;i<n;i++){
cin>> a[i];
c=((c*a[i]%MOD1)+MOD1)%MOD1;
}
cout<< ((c%MOD1)+MOD1)%MOD1;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
