| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1234815 | jundi | Fancy Fence (CEOI20_fancyfence) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define lint long long int
int mod=1e9+7;
int main(){
int n;
cin>>n;
lint sum1=0;
lint sum2=0;
lint a;
for(int i=0;i<n;i++){
cin>>a;
sum1=a;
}
for(int i=0;i<n;i++){
cin>>a;
sum2+=a;
}
lint sum3=(((1+sum1)%mod)*(sum1%mod)/2);
lint sum4=(((1+sum2)%mod)*(sum2%mod)/2);
//cout<<sum1<<" "<<sum2<<" "<<sum3<<" "<<sum4<<endl;
lint ans=(sum3%mod)*(sum4%mod);
cout<<ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
