| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229358 | papaulo | 나머지들의 합 (NOI12_modsum) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
int f(int x) {
int sq=x*x;
return (sq*sq+2*sq)%5+1;
}
int main() {
int dp[5];
memset(dp, 0, sizeof(dp));
dp[0]=1;
int n;
cin >> n;
while(n--) {
int cur[5];
memcpy(cur, dp, sizeof(dp));
memset(dp, 0, sizeof(dp));
int v, w;
cin >> v >> w;
for(;v<=w;v++) {
for(int i=0;i<5;i++) dp[(v+i)%5]+=cur[i];
}
}
int ans=0;
for(int i=0;i<5;i++) ans+=dp[i]*f(i);
cout << ans << endl;
return 0;
}| # | 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... | ||||
